binary_hash
stringlengths 64
64
| repo
stringlengths 6
62
| call_graph
sequencelengths 0
76
| unmatched_functions
sequencelengths 0
58
| matched_functions
listlengths 0
71
|
|---|---|---|---|---|
b4ca878814688fbbed613b25e0ec3149400ebd527ca5d4985600b3e79a658462 | norlanliu/data-structure | [
[
"enqueue",
"->"
],
[
"percolate_down",
"->",
"dequeue"
],
[
"dequeue",
"->",
"percolate_down"
],
[
"free_queue",
"->"
]
] | [] | [
{
"name": "percolate_down",
"canonical_name": "func1",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall percolate_down(__int64 a1, int a2)\n{\n__int64 result; // rax\nint v3; // [rsp+0h] [rbp-1Ch]\nint v4; // [rsp+10h] [rbp-Ch]\nunsigned int v5; // [rsp+14h] [rbp-8h]\nint v6; // [rsp+18h] [rbp-4h]\n\nv3 = a2;\nv5 = *(_DWORD *)(*(_QWORD *)a1 + 4LL * a2);\nv4 = *(_DWORD *)(a1 + 8) / 2;\nwhile ( v3 <= v4 )\n{\nv6 = 2 * v3;\nif ( *(_DWORD *)(*(_QWORD *)a1 + 8LL * v3) > *(_DWORD *)(*(_QWORD *)a1 + 4 * (2 * v3 + 1LL)) )\n++v6;\nif ( (signed int)v5 <= *(_DWORD *)(*(_QWORD *)a1 + 4LL * v6) )\nbreak;\n*(_DWORD *)(4LL * v3 + *(_QWORD *)a1) = *(_DWORD *)(*(_QWORD *)a1 + 4LL * v6);\nv3 = v6;\n}\nresult = v5;\n*(_DWORD *)(4LL * v3 + *(_QWORD *)a1) = v5;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1, int a2)\n{\n__int64 result; // rax\nint v3; // [rsp+0h] [rbp-1Ch]\nint v4; // [rsp+10h] [rbp-Ch]\nunsigned int v5; // [rsp+14h] [rbp-8h]\nint v6; // [rsp+18h] [rbp-4h]\n\nv3 = a2;\nv5 = *(_DWORD *)(*(_QWORD *)a1 + 4LL * a2);\nv4 = *(_DWORD *)(a1 + 8) / 2;\nwhile ( v3 <= v4 )\n{\nv6 = 2 * v3;\nif ( *(_DWORD *)(*(_QWORD *)a1 + 8LL * v3) > *(_DWORD *)(*(_QWORD *)a1 + 4 * (2 * v3 + 1LL)) )\n++v6;\nif ( (signed int)v5 <= *(_DWORD *)(*(_QWORD *)a1 + 4LL * v6) )\nbreak;\n*(_DWORD *)(4LL * v3 + *(_QWORD *)a1) = *(_DWORD *)(*(_QWORD *)a1 + 4LL * v6);\nv3 = v6;\n}\nresult = v5;\n*(_DWORD *)(4LL * v3 + *(_QWORD *)a1) = v5;\nreturn result;\n}",
"original_code": "static void percolate_down(priority_queue *queue, int hole)\n{\n item_type temp = queue->item[hole];\n int child;\n int length = queue->length / 2;\n for(; hole <= length; hole = child)\n {\n child = 2 * hole;\n if(queue->item[child] > queue->item[child+1])\n child++;\n if(queue->item[child] < temp)\n queue->item[hole] = queue->item[child];\n else\n break;\n }\n queue->item[hole] = temp;\n}",
"canonical_original_code": "static void percolate_down(struct priority_queue *queue, int hole)\n{\n int temp = queue->item[hole];\n int child;\n int length = queue->length / 2;\n for(; hole <= length; hole = child)\n {\n child = 2 * hole;\n if(queue->item[child] > queue->item[child+1])\n child++;\n if(queue->item[child] < temp)\n queue->item[hole] = queue->item[child];\n else\n break;\n }\n queue->item[hole] = temp;\n}",
"variable_types": [
[
"queue",
"struct priority_queue { int *item; int length; int capability; } *"
],
[
"hole",
"int"
],
[
"temp",
"int"
],
[
"child",
"int"
],
[
"length",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct priority_queue { int *item; int length; int capability; }"
],
"binary_hash": "b4ca878814688fbbed613b25e0ec3149400ebd527ca5d4985600b3e79a658462"
},
{
"name": "free_queue",
"canonical_name": "func3",
"repo": "norlanliu/data-structure",
"decompiled_code": "void __fastcall free_queue(void **a1)\n{\nfree(*a1);\nfree(a1);\n}\n",
"canonical_decompiled_code": "void __fastcall func3(void **a1)\n{\nfree(*a1);\nfree(a1);\n}",
"original_code": "void free_queue(priority_queue *queue)\n{\n free(queue->item);\n free(queue);\n queue = ((void *)0);\n}",
"canonical_original_code": "void free_queue(struct priority_queue *queue)\n{\n free(queue->item);\n free(queue);\n queue = ((void *)0);\n}",
"variable_types": [
[
"queue",
"struct priority_queue { int *item; int length; int capability; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct priority_queue { int *item; int length; int capability; }"
],
"binary_hash": "b4ca878814688fbbed613b25e0ec3149400ebd527ca5d4985600b3e79a658462"
},
{
"name": "enqueue",
"canonical_name": "func0",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall enqueue(__int64 a1, unsigned int a2)\n{\n__int64 result; // rax\nvoid *ptr; // [rsp+18h] [rbp-18h]\n_DWORD *v4; // [rsp+20h] [rbp-10h]\nint j; // [rsp+28h] [rbp-8h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nif ( (float)(*(float *)&threshold * (float)*(int *)(a1 + 12)) > (float)*(int *)(a1 + 8) )\n{\n*(_DWORD *)(a1 + 12) *= 2;\nv4 = malloc(4LL * *(int *)(a1 + 12));\nfor ( i = 1; i <= *(_DWORD *)(a1 + 8); ++i )\nv4[i] = *(_DWORD *)(*(_QWORD *)a1 + 4LL * i);\nptr = *(void **)a1;\n*(_QWORD *)a1 = v4;\nfree(ptr);\n}\nfor ( j = ++*(_DWORD *)(a1 + 8); j > 1 && (signed int)a2 < *(_DWORD *)(*(_QWORD *)a1 + 4LL * (j / 2)); j /= 2 )\n*(_DWORD *)(4LL * j + *(_QWORD *)a1) = *(_DWORD *)(*(_QWORD *)a1 + 4LL * (j / 2));\nresult = a2;\n*(_DWORD *)(4LL * j + *(_QWORD *)a1) = a2;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, unsigned int a2)\n{\n__int64 result; // rax\nvoid *ptr; // [rsp+18h] [rbp-18h]\n_DWORD *v4; // [rsp+20h] [rbp-10h]\nint j; // [rsp+28h] [rbp-8h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nif ( (float)(*(float *)&threshold * (float)*(int *)(a1 + 12)) > (float)*(int *)(a1 + 8) )\n{\n*(_DWORD *)(a1 + 12) *= 2;\nv4 = malloc(4LL * *(int *)(a1 + 12));\nfor ( i = 1; i <= *(_DWORD *)(a1 + 8); ++i )\nv4[i] = *(_DWORD *)(*(_QWORD *)a1 + 4LL * i);\nptr = *(void **)a1;\n*(_QWORD *)a1 = v4;\nfree(ptr);\n}\nfor ( j = ++*(_DWORD *)(a1 + 8); j > 1 && (signed int)a2 < *(_DWORD *)(*(_QWORD *)a1 + 4LL * (j / 2)); j /= 2 )\n*(_DWORD *)(4LL * j + *(_QWORD *)a1) = *(_DWORD *)(*(_QWORD *)a1 + 4LL * (j / 2));\nresult = a2;\n*(_DWORD *)(4LL * j + *(_QWORD *)a1) = a2;\nreturn result;\n}",
"original_code": "void enqueue(priority_queue *queue, item_type item)\n{\n if(queue->length < (queue->capability * threshold) )\n {\n queue->capability *= 2;\n item_type *new_item = (item_type *)malloc(queue->capability * sizeof(item_type));\n int i;\n for(i = 1; i <= queue->length; i++)\n new_item[i] = queue->item[i];\n item_type *temp = queue->item;\n queue->item = new_item;\n free(temp);\n temp = ((void *)0);\n new_item = ((void *)0);\n }\n queue->length += 1;\n int i = queue->length;\n for(; i > 1 && queue->item[i/2] > item; i = i/2)\n queue->item[i] = queue->item[i/2];\n queue->item[i] = item;\n}",
"canonical_original_code": "void enqueue(struct priority_queue *queue, int item)\n{\n if(queue->length < (queue->capability * threshold) )\n {\n queue->capability *= 2;\n int *new_item = (item_type *)malloc(queue->capability * sizeof(item_type));\n int i;\n for(i = 1; i <= queue->length; i++)\n new_item[i] = queue->item[i];\n int *temp = queue->item;\n queue->item = new_item;\n free(temp);\n temp = ((void *)0);\n new_item = ((void *)0);\n }\n queue->length += 1;\n int i = queue->length;\n for(; i > 1 && queue->item[i/2] > item; i = i/2)\n queue->item[i] = queue->item[i/2];\n queue->item[i] = item;\n}",
"variable_types": [
[
"queue",
"struct priority_queue { int *item; int length; int capability; } *"
],
[
"item",
"int"
],
[
"new_item",
"int *"
],
[
"i",
"int"
],
[
"temp",
"int *"
]
],
"return_type": "void",
"user_defined_types": [
"struct priority_queue { int *item; int length; int capability; }"
],
"binary_hash": "b4ca878814688fbbed613b25e0ec3149400ebd527ca5d4985600b3e79a658462"
},
{
"name": "dequeue",
"canonical_name": "func2",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall dequeue(_DWORD *a1)\n{\n__int64 v2; // rsi\nint v3; // eax\nunsigned int v4; // [rsp+14h] [rbp-4h]\n\nif ( !a1[2] )\nreturn 0xFFFFFFFFLL;\nv4 = *(_DWORD *)(*(_QWORD *)a1 + 4LL);\nv2 = *(_QWORD *)a1;\nv3 = a1[2];\na1[2] = v3 - 1;\n*(_DWORD *)(*(_QWORD *)a1 + 4LL) = *(_DWORD *)(v2 + 4LL * v3);\npercolate_down((__int64)a1, 1);\nreturn v4;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(_DWORD *a1)\n{\n__int64 v2; // rsi\nint v3; // eax\nunsigned int v4; // [rsp+14h] [rbp-4h]\n\nif ( !a1[2] )\nreturn 0xFFFFFFFFLL;\nv4 = *(_DWORD *)(*(_QWORD *)a1 + 4LL);\nv2 = *(_QWORD *)a1;\nv3 = a1[2];\na1[2] = v3 - 1;\n*(_DWORD *)(*(_QWORD *)a1 + 4LL) = *(_DWORD *)(v2 + 4LL * v3);\nfunc1((__int64)a1, 1);\nreturn v4;\n}",
"original_code": "item_type dequeue(priority_queue *queue)\n{\n if(queue->length == 0)\n return -1;\n int answer = queue->item[1];\n queue->item[1] = queue->item[queue->length--];\n percolate_down(queue, 1);\n return answer;\n}",
"canonical_original_code": "int dequeue(struct priority_queue *queue)\n{\n if(queue->length == 0)\n return -1;\n int answer = queue->item[1];\n queue->item[1] = queue->item[queue->length--];\n percolate_down(queue, 1);\n return answer;\n}",
"variable_types": [
[
"queue",
"struct priority_queue { int *item; int length; int capability; } *"
],
[
"answer",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct priority_queue { int *item; int length; int capability; }"
],
"binary_hash": "b4ca878814688fbbed613b25e0ec3149400ebd527ca5d4985600b3e79a658462"
}
] |
ccfd915e00f9fcde7e9c458386ae44125352fa942832a00b50f36a4994da774a | norlanliu/data-structure | [
[
"counterSorting",
"->"
],
[
"bucketSorting",
"->"
],
[
"radixSorting",
"->"
],
[
"bitSorting",
"->"
],
[
"PerDown",
"->",
"BuildHeap",
"HeapSorting"
],
[
"BuildHeap",
"->",
"PerDown",
"HeapSorting"
],
[
"HeapSorting",
"->",
"BuildHeap",
"PerDown"
]
] | [] | [
{
"name": "counterSorting",
"canonical_name": "func0",
"repo": "norlanliu/data-structure",
"decompiled_code": "void __fastcall counterSorting(__int64 a1, __int64 a2, int a3, int a4)\n{\nchar *v4; // rax\nchar *s; // [rsp+20h] [rbp-10h]\nint i; // [rsp+28h] [rbp-8h]\nint j; // [rsp+28h] [rbp-8h]\nint l; // [rsp+28h] [rbp-8h]\nint k; // [rsp+28h] [rbp-8h]\nint m; // [rsp+28h] [rbp-8h]\nunsigned int v13; // [rsp+2Ch] [rbp-4h]\nint v14; // [rsp+2Ch] [rbp-4h]\n\nif ( a1 && a3 )\n{\nv13 = 0;\nfor ( i = 0; i < a3; ++i )\n{\nif ( *(_DWORD *)(4LL * i + a1) > v13 )\nv13 = *(_DWORD *)(4LL * i + a1);\n}\nv14 = v13 + 1;\ns = (char *)malloc(4LL * v14);\nmemset(s, 0, 4LL * v14);\nfor ( j = 0; j < a3; ++j )\n{\nv4 = &s[4 * *(unsigned int *)(4LL * j + a1)];\n++*(_DWORD *)v4;\n}\nif ( a4 )\n{\nfor ( k = v14 - 2; k >= 0; --k )\n*(_DWORD *)&s[4 * k] += *(_DWORD *)&s[4 * k + 4];\n}\nelse\n{\nfor ( l = 1; l < v14; ++l )\n*(_DWORD *)&s[4 * l] += *(_DWORD *)&s[4 * l - 4];\n}\nfor ( m = a3 - 1; m >= 0; --m )\n*(_DWORD *)(4LL * (int)(*(_DWORD *)&s[4 * *(unsigned int *)(4LL * m + a1)])-- - 4 + a2) = *(_DWORD *)(4LL * m + a1);\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func0(__int64 a1, __int64 a2, int a3, int a4)\n{\nchar *v4; // rax\nchar *s; // [rsp+20h] [rbp-10h]\nint i; // [rsp+28h] [rbp-8h]\nint j; // [rsp+28h] [rbp-8h]\nint l; // [rsp+28h] [rbp-8h]\nint k; // [rsp+28h] [rbp-8h]\nint m; // [rsp+28h] [rbp-8h]\nunsigned int v13; // [rsp+2Ch] [rbp-4h]\nint v14; // [rsp+2Ch] [rbp-4h]\n\nif ( a1 && a3 )\n{\nv13 = 0;\nfor ( i = 0; i < a3; ++i )\n{\nif ( *(_DWORD *)(4LL * i + a1) > v13 )\nv13 = *(_DWORD *)(4LL * i + a1);\n}\nv14 = v13 + 1;\ns = (char *)malloc(4LL * v14);\nmemset(s, 0, 4LL * v14);\nfor ( j = 0; j < a3; ++j )\n{\nv4 = &s[4 * *(unsigned int *)(4LL * j + a1)];\n++*(_DWORD *)v4;\n}\nif ( a4 )\n{\nfor ( k = v14 - 2; k >= 0; --k )\n*(_DWORD *)&s[4 * k] += *(_DWORD *)&s[4 * k + 4];\n}\nelse\n{\nfor ( l = 1; l < v14; ++l )\n*(_DWORD *)&s[4 * l] += *(_DWORD *)&s[4 * l - 4];\n}\nfor ( m = a3 - 1; m >= 0; --m )\n*(_DWORD *)(4LL * (int)(*(_DWORD *)&s[4 * *(unsigned int *)(4LL * m + a1)])-- - 4 + a2) = *(_DWORD *)(4LL * m + a1);\n}\n}",
"original_code": "void counterSorting(unsigned *org, unsigned *des, int count, int order)\n{\n if(org == ((void *)0) || count == 0)\n return;\n int max = 0;\n int i;\n for(i = 0; i < count; i++)\n if(org[i] > max)\n max = org[i];\n max += 1;\n int *bucket = (int *)malloc(max * sizeof(int));\n memset(bucket, 0, sizeof(int)*max);\n for(i = 0; i < count; i++)\n bucket[org[i]]++;\n if(order == 0)\n for(i = 1; i < max; i++)\n bucket[i] += bucket[i-1];\n else\n for(i = max-2; i >= 0; i--)\n bucket[i] += bucket[i+1];\n for(i = count-1; i >= 0; i--)\n {\n des[bucket[org[i]]-1] = org[i];\n bucket[org[i]] -= 1;\n }\n}",
"canonical_original_code": "void counterSorting(unsigned int *org, unsigned int *des, int count, int order)\n{\n if(org == ((void *)0) || count == 0)\n return;\n int max = 0;\n int i;\n for(i = 0; i < count; i++)\n if(org[i] > max)\n max = org[i];\n max += 1;\n int *bucket = (int *)malloc(max * sizeof(int));\n memset(bucket, 0, sizeof(int)*max);\n for(i = 0; i < count; i++)\n bucket[org[i]]++;\n if(order == 0)\n for(i = 1; i < max; i++)\n bucket[i] += bucket[i-1];\n else\n for(i = max-2; i >= 0; i--)\n bucket[i] += bucket[i+1];\n for(i = count-1; i >= 0; i--)\n {\n des[bucket[org[i]]-1] = org[i];\n bucket[org[i]] -= 1;\n }\n}",
"variable_types": [
[
"org",
"unsigned int *"
],
[
"des",
"unsigned int *"
],
[
"count",
"int"
],
[
"order",
"int"
],
[
"max",
"int"
],
[
"i",
"int"
],
[
"bucket",
"int *"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "ccfd915e00f9fcde7e9c458386ae44125352fa942832a00b50f36a4994da774a"
},
{
"name": "bucketSorting",
"canonical_name": "func1",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall bucketSorting(__int64 a1, __int64 a2, signed int a3)\n{\n__int64 result; // rax\nint v4; // eax\nvoid *ptr; // [rsp+20h] [rbp-30h]\nvoid *s; // [rsp+28h] [rbp-28h]\nsigned int v8; // [rsp+34h] [rbp-1Ch]\n_QWORD *v9; // [rsp+38h] [rbp-18h]\n_QWORD *v10; // [rsp+38h] [rbp-18h]\nint v11; // [rsp+44h] [rbp-Ch]\nunsigned int i; // [rsp+48h] [rbp-8h]\nint j; // [rsp+48h] [rbp-8h]\nint k; // [rsp+48h] [rbp-8h]\nint v15; // [rsp+4Ch] [rbp-4h]\n\nv15 = 0;\nfor ( i = 0; ; ++i )\n{\nresult = i;\nif ( (int)i >= a3 )\nbreak;\nif ( *(_DWORD *)(4LL * (int)i + a1) > (unsigned int)v15 )\nv15 = *(_DWORD *)(4LL * (int)i + a1);\n}\nif ( v15 > 0 )\n{\ns = malloc(0x400uLL);\nmemset(s, 0, 0x400uLL);\nfor ( j = 0; j < a3; ++j )\n{\nv8 = *(_DWORD *)(4LL * j + a1) / (unsigned int)((v15 >> 7) + 1);\nv9 = malloc(0x10uLL);\n*(_DWORD *)v9 = *(_DWORD *)(4LL * j + a1);\nv9[1] = *((_QWORD *)s + v8);\n*((_QWORD *)s + v8) = v9;\n}\nv11 = 0;\nfor ( k = 0; k <= 127; ++k )\n{\nv10 = (_QWORD *)*((_QWORD *)s + k);\nwhile ( v10 )\n{\nv4 = v11++;\n*(_DWORD *)(4LL * v4 + a2) = *(_DWORD *)v10;\nptr = v10;\nv10 = (_QWORD *)v10[1];\nfree(ptr);\n}\n}\nfree(s);\nresult = insertSorting(a2, 0LL, (unsigned int)a3);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1, __int64 a2, signed int a3)\n{\n__int64 result; // rax\nint v4; // eax\nvoid *ptr; // [rsp+20h] [rbp-30h]\nvoid *s; // [rsp+28h] [rbp-28h]\nsigned int v8; // [rsp+34h] [rbp-1Ch]\n_QWORD *v9; // [rsp+38h] [rbp-18h]\n_QWORD *v10; // [rsp+38h] [rbp-18h]\nint v11; // [rsp+44h] [rbp-Ch]\nunsigned int i; // [rsp+48h] [rbp-8h]\nint j; // [rsp+48h] [rbp-8h]\nint k; // [rsp+48h] [rbp-8h]\nint v15; // [rsp+4Ch] [rbp-4h]\n\nv15 = 0;\nfor ( i = 0; ; ++i )\n{\nresult = i;\nif ( (int)i >= a3 )\nbreak;\nif ( *(_DWORD *)(4LL * (int)i + a1) > (unsigned int)v15 )\nv15 = *(_DWORD *)(4LL * (int)i + a1);\n}\nif ( v15 > 0 )\n{\ns = malloc(0x400uLL);\nmemset(s, 0, 0x400uLL);\nfor ( j = 0; j < a3; ++j )\n{\nv8 = *(_DWORD *)(4LL * j + a1) / (unsigned int)((v15 >> 7) + 1);\nv9 = malloc(0x10uLL);\n*(_DWORD *)v9 = *(_DWORD *)(4LL * j + a1);\nv9[1] = *((_QWORD *)s + v8);\n*((_QWORD *)s + v8) = v9;\n}\nv11 = 0;\nfor ( k = 0; k <= 127; ++k )\n{\nv10 = (_QWORD *)*((_QWORD *)s + k);\nwhile ( v10 )\n{\nv4 = v11++;\n*(_DWORD *)(4LL * v4 + a2) = *(_DWORD *)v10;\nptr = v10;\nv10 = (_QWORD *)v10[1];\nfree(ptr);\n}\n}\nfree(s);\nresult = insertSorting(a2, 0LL, (unsigned int)a3);\n}\nreturn result;\n}",
"original_code": "void bucketSorting(unsigned *org, unsigned *des, int length)\n{\n int max = 0;\n int i,j, k = 0;\n for(i = 0; i<length; i++)\n if(org[i] > max)\n max = org[i];\n if(max <= 0)\n return;\n unsigned m = max / 128 + 1;\n list_t **buckets = (list_t **)malloc(128 * sizeof(list_t *));\n memset(buckets, 0, 128*sizeof(list_t*));\n list_t *temp, *temp2;\n for(i = 0; i < length; i++)\n {\n k = org[i] / m;\n temp = (list_t *)malloc(sizeof(list_t));\n temp->item = org[i];\n temp->next = buckets[k];\n buckets[k] = temp;\n }\n for(i=j=0; i<128; i++)\n {\n temp = buckets[i];\n while(temp != ((void *)0))\n {\n des[j++] = temp->item;\n temp2 = temp;\n temp = temp->next;\n free(temp2);\n }\n }\n free(buckets);\n insertSorting(des, 0, length);\n}",
"canonical_original_code": "void bucketSorting(unsigned int *org, unsigned int *des, int length)\n{\n int max = 0;\n int i; int j; int k = 0;\n for(i = 0; i<length; i++)\n if(org[i] > max)\n max = org[i];\n if(max <= 0)\n return;\n unsigned int m = max / 128 + 1;\n struct _list **buckets = (list_t **)malloc(128 * sizeof(list_t *));\n memset(buckets, 0, 128*sizeof(struct _list *));\n struct _list *temp; struct _list *temp2;\n for(i = 0; i < length; i++)\n {\n k = org[i] / m;\n temp = (struct _list *)malloc(sizeof(list_t));\n temp->item = org[i];\n temp->next = buckets[k];\n buckets[k] = temp;\n }\n for(i=j=0; i<128; i++)\n {\n temp = buckets[i];\n while(temp != ((void *)0))\n {\n des[j++] = temp->item;\n temp2 = temp;\n temp = temp->next;\n free(temp2);\n }\n }\n free(buckets);\n insertSorting(des, 0, length);\n}",
"variable_types": [
[
"org",
"unsigned int *"
],
[
"des",
"unsigned int *"
],
[
"length",
"int"
],
[
"max",
"int"
],
[
"i",
"int"
],
[
"j",
"int"
],
[
"k",
"int"
],
[
"m",
"unsigned int"
],
[
"buckets",
"struct _list { int item; struct _list *next; } **"
],
[
"temp",
"struct _list { int item; struct _list *next; } *"
],
[
"temp2",
"struct _list { int item; struct _list *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _list { int item; struct _list *next; }"
],
"binary_hash": "ccfd915e00f9fcde7e9c458386ae44125352fa942832a00b50f36a4994da774a"
},
{
"name": "radixSorting",
"canonical_name": "func2",
"repo": "norlanliu/data-structure",
"decompiled_code": "void __fastcall radixSorting(__int64 a1, int a2)\n{\nvoid *ptr; // [rsp+18h] [rbp-38h]\nvoid *s; // [rsp+20h] [rbp-30h]\n_QWORD *v4; // [rsp+30h] [rbp-20h]\n__int64 v5; // [rsp+30h] [rbp-20h]\n_QWORD *v6; // [rsp+30h] [rbp-20h]\nint v7; // [rsp+3Ch] [rbp-14h]\nsigned int v8; // [rsp+40h] [rbp-10h]\nint v9; // [rsp+40h] [rbp-10h]\nint v10; // [rsp+44h] [rbp-Ch]\nint i; // [rsp+48h] [rbp-8h]\nint j; // [rsp+48h] [rbp-8h]\nint k; // [rsp+48h] [rbp-8h]\nint v14; // [rsp+4Ch] [rbp-4h]\n\nv14 = 0;\nv7 = 1;\nfor ( i = 0; i < a2; ++i )\n{\nif ( *(_DWORD *)(4LL * i + a1) > (unsigned int)v14 )\nv14 = *(_DWORD *)(4LL * i + a1);\n}\nif ( v14 > 0 )\n{\ns = malloc(0x50uLL);\nmemset(s, 0, 0x50uLL);\nwhile ( v14 / v7 )\n{\nfor ( j = 0; j < a2; ++j )\n{\nv8 = *(_DWORD *)(4LL * j + a1) / (unsigned int)v7 % 0xA;\nv4 = malloc(0x10uLL);\n*(_DWORD *)v4 = *(_DWORD *)(4LL * j + a1);\nv4[1] = *((_QWORD *)s + v8);\n*((_QWORD *)s + v8) = v4;\n}\nv10 = 0;\nfor ( k = 0; k < 10; ++k )\n{\nv5 = *((_QWORD *)s + k);\nwhile ( v5 )\n{\nv5 = *(_QWORD *)(v5 + 8);\n++v10;\n}\nv9 = 0;\nv6 = (_QWORD *)*((_QWORD *)s + k);\nwhile ( v6 )\n{\n*(_DWORD *)(4LL * (v10 - v9) - 4 + a1) = *(_DWORD *)v6;\nptr = v6;\nv6 = (_QWORD *)v6[1];\nfree(ptr);\n++v9;\n}\n*((_QWORD *)s + k) = 0LL;\n}\nv7 *= 10;\n}\nfree(s);\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func2(__int64 a1, int a2)\n{\nvoid *ptr; // [rsp+18h] [rbp-38h]\nvoid *s; // [rsp+20h] [rbp-30h]\n_QWORD *v4; // [rsp+30h] [rbp-20h]\n__int64 v5; // [rsp+30h] [rbp-20h]\n_QWORD *v6; // [rsp+30h] [rbp-20h]\nint v7; // [rsp+3Ch] [rbp-14h]\nsigned int v8; // [rsp+40h] [rbp-10h]\nint v9; // [rsp+40h] [rbp-10h]\nint v10; // [rsp+44h] [rbp-Ch]\nint i; // [rsp+48h] [rbp-8h]\nint j; // [rsp+48h] [rbp-8h]\nint k; // [rsp+48h] [rbp-8h]\nint v14; // [rsp+4Ch] [rbp-4h]\n\nv14 = 0;\nv7 = 1;\nfor ( i = 0; i < a2; ++i )\n{\nif ( *(_DWORD *)(4LL * i + a1) > (unsigned int)v14 )\nv14 = *(_DWORD *)(4LL * i + a1);\n}\nif ( v14 > 0 )\n{\ns = malloc(0x50uLL);\nmemset(s, 0, 0x50uLL);\nwhile ( v14 / v7 )\n{\nfor ( j = 0; j < a2; ++j )\n{\nv8 = *(_DWORD *)(4LL * j + a1) / (unsigned int)v7 % 0xA;\nv4 = malloc(0x10uLL);\n*(_DWORD *)v4 = *(_DWORD *)(4LL * j + a1);\nv4[1] = *((_QWORD *)s + v8);\n*((_QWORD *)s + v8) = v4;\n}\nv10 = 0;\nfor ( k = 0; k < 10; ++k )\n{\nv5 = *((_QWORD *)s + k);\nwhile ( v5 )\n{\nv5 = *(_QWORD *)(v5 + 8);\n++v10;\n}\nv9 = 0;\nv6 = (_QWORD *)*((_QWORD *)s + k);\nwhile ( v6 )\n{\n*(_DWORD *)(4LL * (v10 - v9) - 4 + a1) = *(_DWORD *)v6;\nptr = v6;\nv6 = (_QWORD *)v6[1];\nfree(ptr);\n++v9;\n}\n*((_QWORD *)s + k) = 0LL;\n}\nv7 *= 10;\n}\nfree(s);\n}\n}",
"original_code": "void radixSorting(unsigned *org, int length)\n{\n int max = 0;\n int i,j, k = 0, bucket_size = 10,exp = 1;\n for(i = 0; i<length; i++)\n if(org[i] > max)\n max = org[i];\n if(max <= 0)\n return;\n list_t **buckets = (list_t **)malloc(bucket_size * sizeof(list_t *));\n memset(buckets, 0, bucket_size* sizeof(list_t*));\n list_t *temp, *temp2;\n while(max / exp != 0)\n {\n for(i = 0; i < length; i++)\n {\n k = (org[i] / exp) % bucket_size;\n temp = (list_t *)malloc(sizeof(list_t));\n temp->item = org[i];\n temp->next = buckets[k];\n buckets[k] = temp;\n }\n for(i=j=0; i<bucket_size; i++)\n {\n temp = buckets[i];\n while(temp != ((void *)0))\n {\n temp = temp->next;\n j++;\n }\n k = 0;\n temp = buckets[i];\n while(temp != ((void *)0))\n {\n org[j-k-1] = temp->item;\n temp2 = temp;\n temp = temp->next;\n free(temp2);\n k++;\n }\n buckets[i] = ((void *)0);\n }\n exp *= 10;\n }\n free(buckets);\n}",
"canonical_original_code": "void radixSorting(unsigned int *org, int length)\n{\n int max = 0;\n int i; int j; int k = 0; int bucket_size = 10; int exp = 1;\n for(i = 0; i<length; i++)\n if(org[i] > max)\n max = org[i];\n if(max <= 0)\n return;\n struct _list **buckets = (list_t **)malloc(bucket_size * sizeof(list_t *));\n memset(buckets, 0, bucket_size* sizeof(struct _list *));\n struct _list *temp; struct _list *temp2;\n while(max / exp != 0)\n {\n for(i = 0; i < length; i++)\n {\n k = (org[i] / exp) % bucket_size;\n temp = (struct _list *)malloc(sizeof(list_t));\n temp->item = org[i];\n temp->next = buckets[k];\n buckets[k] = temp;\n }\n for(i=j=0; i<bucket_size; i++)\n {\n temp = buckets[i];\n while(temp != ((void *)0))\n {\n temp = temp->next;\n j++;\n }\n k = 0;\n temp = buckets[i];\n while(temp != ((void *)0))\n {\n org[j-k-1] = temp->item;\n temp2 = temp;\n temp = temp->next;\n free(temp2);\n k++;\n }\n buckets[i] = ((void *)0);\n }\n exp *= 10;\n }\n free(buckets);\n}",
"variable_types": [
[
"org",
"unsigned int *"
],
[
"length",
"int"
],
[
"max",
"int"
],
[
"i",
"int"
],
[
"j",
"int"
],
[
"k",
"int"
],
[
"bucket_size",
"int"
],
[
"exp",
"int"
],
[
"buckets",
"struct _list { int item; struct _list *next; } **"
],
[
"temp",
"struct _list { int item; struct _list *next; } *"
],
[
"temp2",
"struct _list { int item; struct _list *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _list { int item; struct _list *next; }"
],
"binary_hash": "ccfd915e00f9fcde7e9c458386ae44125352fa942832a00b50f36a4994da774a"
},
{
"name": "bitSorting",
"canonical_name": "func3",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall bitSorting(_DWORD *a1, int a2)\n{\n__int64 result; // rax\nint v3; // [rsp+14h] [rbp-28h]\nint v4; // [rsp+20h] [rbp-1Ch]\nint v5; // [rsp+28h] [rbp-14h]\nint v6; // [rsp+2Ch] [rbp-10h]\nint v7; // [rsp+30h] [rbp-Ch]\nint j; // [rsp+34h] [rbp-8h]\nint i; // [rsp+38h] [rbp-4h]\n\nfor ( i = 31; i > 0; --i )\n{\nv7 = *a1 >> i;\nv6 = 0;\nv5 = -1;\nfor ( j = 0; ; ++j )\n{\nresult = (unsigned int)j;\nif ( j >= a2 )\nbreak;\nif ( a1[j] >> i == v7 )\n{\nv4 = 1 << (i - 1);\nif ( v5 >= v6 )\n{\nif ( (a1[j] & v4) == 0 )\n{\nv3 = a1[j];\na1[j] = a1[v5];\na1[v5++] = v3;\n}\n}\nelse if ( (a1[j] & v4) != 0 )\n{\nv5 = j;\n}\n}\nelse\n{\nv6 = j;\nv5 = j - 1;\nv7 = a1[j--] >> i;\n}\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(_DWORD *a1, int a2)\n{\n__int64 result; // rax\nint v3; // [rsp+14h] [rbp-28h]\nint v4; // [rsp+20h] [rbp-1Ch]\nint v5; // [rsp+28h] [rbp-14h]\nint v6; // [rsp+2Ch] [rbp-10h]\nint v7; // [rsp+30h] [rbp-Ch]\nint j; // [rsp+34h] [rbp-8h]\nint i; // [rsp+38h] [rbp-4h]\n\nfor ( i = 31; i > 0; --i )\n{\nv7 = *a1 >> i;\nv6 = 0;\nv5 = -1;\nfor ( j = 0; ; ++j )\n{\nresult = (unsigned int)j;\nif ( j >= a2 )\nbreak;\nif ( a1[j] >> i == v7 )\n{\nv4 = 1 << (i - 1);\nif ( v5 >= v6 )\n{\nif ( (a1[j] & v4) == 0 )\n{\nv3 = a1[j];\na1[j] = a1[v5];\na1[v5++] = v3;\n}\n}\nelse if ( (a1[j] & v4) != 0 )\n{\nv5 = j;\n}\n}\nelse\n{\nv6 = j;\nv5 = j - 1;\nv7 = a1[j--] >> i;\n}\n}\n}\nreturn result;\n}",
"original_code": "void bitSorting(unsigned *org, int length)\n{\n int i,j;\n for(i = 31; i >= 1; i--)\n {\n int preCB = org[0] >> i;\n int theS = 0;\n int theI = theS - 1;\n int theBase = 1 << (i-1);\n int theAxBit = 0;\n for(j = 0; j < length; j++)\n {\n int temPreCB = org[j]>>i;\n if(temPreCB != preCB)\n {\n theS = j;\n theI = theS - 1;\n theAxBit = 0;\n preCB = temPreCB;\n j--;\n continue;\n }\n int theAJ = (org[j] & theBase) > 0 ? 1:0;\n if(theI < theS)\n {\n if(theAJ == 0)\n continue;\n theI = j;\n continue;\n }\n if(theAJ <= theAxBit)\n {\n int temp = org[j];\n org[j] = org[theI];\n org[theI]=temp;\n theI++;\n }\n }\n }\n}",
"canonical_original_code": "void bitSorting(unsigned int *org, int length)\n{\n int i; int j;\n for(i = 31; i >= 1; i--)\n {\n int preCB = org[0] >> i;\n int theS = 0;\n int theI = theS - 1;\n int theBase = 1 << (i-1);\n int theAxBit = 0;\n for(j = 0; j < length; j++)\n {\n int temPreCB = org[j]>>i;\n if(temPreCB != preCB)\n {\n theS = j;\n theI = theS - 1;\n theAxBit = 0;\n preCB = temPreCB;\n j--;\n continue;\n }\n int theAJ = (org[j] & theBase) > 0 ? 1:0;\n if(theI < theS)\n {\n if(theAJ == 0)\n continue;\n theI = j;\n continue;\n }\n if(theAJ <= theAxBit)\n {\n int temp = org[j];\n org[j] = org[theI];\n org[theI]=temp;\n theI++;\n }\n }\n }\n}",
"variable_types": [
[
"org",
"unsigned int *"
],
[
"length",
"int"
],
[
"i",
"int"
],
[
"j",
"int"
],
[
"preCB",
"int"
],
[
"theS",
"int"
],
[
"theI",
"int"
],
[
"theBase",
"int"
],
[
"theAxBit",
"int"
],
[
"temPreCB",
"int"
],
[
"theAJ",
"int"
],
[
"temp",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "ccfd915e00f9fcde7e9c458386ae44125352fa942832a00b50f36a4994da774a"
},
{
"name": "PerDown",
"canonical_name": "func4",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall PerDown(__int64 a1, int a2, int a3)\n{\n__int64 result; // rax\nint v4; // [rsp+0h] [rbp-20h]\nunsigned int v5; // [rsp+18h] [rbp-8h]\nint v6; // [rsp+1Ch] [rbp-4h]\n\nv4 = a3;\nv5 = *(_DWORD *)(4LL * a3 + a1);\nwhile ( a2 > 2 * v4 + 1 )\n{\nv6 = 2 * v4 + 1;\nif ( v6 != a2 - 1 && *(_DWORD *)(4LL * v6 + a1) < *(_DWORD *)(4 * (v6 + 1LL) + a1) )\nv6 = 2 * v4 + 2;\nif ( (signed int)v5 > *(_DWORD *)(4LL * v6 + a1) )\nbreak;\n*(_DWORD *)(4LL * v4 + a1) = *(_DWORD *)(4LL * v6 + a1);\nv4 = v6;\n}\nresult = v5;\n*(_DWORD *)(a1 + 4LL * v4) = v5;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1, int a2, int a3)\n{\n__int64 result; // rax\nint v4; // [rsp+0h] [rbp-20h]\nunsigned int v5; // [rsp+18h] [rbp-8h]\nint v6; // [rsp+1Ch] [rbp-4h]\n\nv4 = a3;\nv5 = *(_DWORD *)(4LL * a3 + a1);\nwhile ( a2 > 2 * v4 + 1 )\n{\nv6 = 2 * v4 + 1;\nif ( v6 != a2 - 1 && *(_DWORD *)(4LL * v6 + a1) < *(_DWORD *)(4 * (v6 + 1LL) + a1) )\nv6 = 2 * v4 + 2;\nif ( (signed int)v5 > *(_DWORD *)(4LL * v6 + a1) )\nbreak;\n*(_DWORD *)(4LL * v4 + a1) = *(_DWORD *)(4LL * v6 + a1);\nv4 = v6;\n}\nresult = v5;\n*(_DWORD *)(a1 + 4LL * v4) = v5;\nreturn result;\n}",
"original_code": "static void PerDown(int *array, int size, int hole)\n{\n int temp = array[hole];\n int child;\n for(; (2 * hole + 1) < size; hole = child)\n {\n child = 2 * hole + 1;\n if(child != size-1 && array[child] < array[child+1])\n ++child;\n if(array[child] < temp)\n break;\n else\n array[hole] = array[child];\n }\n array[hole] = temp;\n}",
"canonical_original_code": "static void PerDown(int *array, int size, int hole)\n{\n int temp = array[hole];\n int child;\n for(; (2 * hole + 1) < size; hole = child)\n {\n child = 2 * hole + 1;\n if(child != size-1 && array[child] < array[child+1])\n ++child;\n if(array[child] < temp)\n break;\n else\n array[hole] = array[child];\n }\n array[hole] = temp;\n}",
"variable_types": [
[
"array",
"int *"
],
[
"size",
"int"
],
[
"hole",
"int"
],
[
"temp",
"int"
],
[
"child",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "ccfd915e00f9fcde7e9c458386ae44125352fa942832a00b50f36a4994da774a"
},
{
"name": "BuildHeap",
"canonical_name": "func5",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall BuildHeap(__int64 a1, int a2)\n{\n__int64 result; // rax\nint i; // [rsp+1Ch] [rbp-4h]\n\nresult = (unsigned int)((a2 - 2) / 2);\nfor ( i = (a2 - 2) / 2; i >= 0; --i )\nresult = PerDown(a1, a2, i);\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1, int a2)\n{\n__int64 result; // rax\nint i; // [rsp+1Ch] [rbp-4h]\n\nresult = (unsigned int)((a2 - 2) / 2);\nfor ( i = (a2 - 2) / 2; i >= 0; --i )\nresult = func4(a1, a2, i);\nreturn result;\n}",
"original_code": "static void BuildHeap(int *array, int size)\n{\n int i = (size-2) / 2;\n for(; i >= 0; --i)\n PerDown(array, size, i);\n}",
"canonical_original_code": "static void BuildHeap(int *array, int size)\n{\n int i = (size-2) / 2;\n for(; i >= 0; --i)\n PerDown(array, size, i);\n}",
"variable_types": [
[
"array",
"int *"
],
[
"size",
"int"
],
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "ccfd915e00f9fcde7e9c458386ae44125352fa942832a00b50f36a4994da774a"
},
{
"name": "HeapSorting",
"canonical_name": "func6",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall HeapSorting(__int64 a1, int a2)\n{\n__int64 result; // rax\nint i; // [rsp+1Ch] [rbp-4h]\n\nBuildHeap(a1, a2);\nresult = (unsigned int)(a2 - 1);\nfor ( i = a2 - 1; i > 0; --i )\n{\nSwap(a1, a1 + 4LL * i);\nresult = PerDown(a1, i, 0);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func6(__int64 a1, int a2)\n{\n__int64 result; // rax\nint i; // [rsp+1Ch] [rbp-4h]\n\nfunc5(a1, a2);\nresult = (unsigned int)(a2 - 1);\nfor ( i = a2 - 1; i > 0; --i )\n{\nSwap(a1, a1 + 4LL * i);\nresult = func4(a1, i, 0);\n}\nreturn result;\n}",
"original_code": "void HeapSorting(int *org, int length)\n{\n BuildHeap(org, length);\n int i;\n for(i = length-1; i > 0; --i)\n {\n Swap(&org[0], &org[i]);\n PerDown(org, i, 0);\n }\n}",
"canonical_original_code": "void HeapSorting(int *org, int length)\n{\n BuildHeap(org, length);\n int i;\n for(i = length-1; i > 0; --i)\n {\n Swap(&org[0], &org[i]);\n PerDown(org, i, 0);\n }\n}",
"variable_types": [
[
"org",
"int *"
],
[
"length",
"int"
],
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "ccfd915e00f9fcde7e9c458386ae44125352fa942832a00b50f36a4994da774a"
}
] |
dcb66efe95bcdb506eb3241dd39aec7bd18dec6612d37060c77ac20b7af68f89 | norlanliu/data-structure | [
[
"sub_1020",
"->"
],
[
"_cxa_finalize",
"->",
"_do_global_dtors_aux"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"_cxa_finalize",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"getHashBase",
"->",
"hashmap_initialize",
"hashmap_initialize_default"
],
[
"hash",
"->",
"hashmap_put",
"hashmap_contains",
"hashmap_remove",
"hashmap_get"
],
[
"indexForTable",
"->",
"resize",
"hashmap_put",
"hashmap_contains",
"hashmap_remove",
"hashmap_get"
],
[
"resize",
"->",
"indexForTable",
"hashmap_put"
],
[
"hashmap_initialize",
"->",
"getHashBase"
],
[
"hashmap_initialize_default",
"->",
"getHashBase"
],
[
"hashmap_put",
"->",
"resize",
"hash",
"indexForTable"
],
[
"hashmap_contains",
"->",
"hash",
"indexForTable"
],
[
"hashmap_remove",
"->",
"hash",
"indexForTable"
],
[
"hashmap_get",
"->",
"hash",
"indexForTable"
],
[
"hashmap_free",
"->"
]
] | [
[
"sub_1020",
"void func0()\n{\nJUMPOUT(0LL);\n}"
],
[
"_cxa_finalize",
"int __fastcall func1(void *a1)\n{\nreturn __cxa_finalize(a1);\n}"
],
[
"deregister_tm_clones",
"char *func2()\n{\nreturn &completed_0;\n}"
],
[
"register_tm_clones",
"__int64 func3()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"char *func4()\n{\nchar *result; // rax\n\nif ( !completed_0 )\n{\nif ( &__cxa_finalize )\nfunc1(_dso_handle);\nresult = func2();\ncompleted_0 = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func5()\n{\nreturn func3();\n}"
]
] | [
{
"name": "getHashBase",
"canonical_name": "func6",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 getHashBase()\n{\nint v1[2]; // [rsp+Ch] [rbp-14h]\nint v2; // [rsp+14h] [rbp-Ch]\nint i; // [rsp+18h] [rbp-8h]\nint v4; // [rsp+1Ch] [rbp-4h]\n\nv2 = 17;\nv4 = 0;\nv1[0] = time(0LL);\nv1[1] = rand() >> 16;\nfor ( i = 0; i <= 1; ++i )\n{\nv1[i] *= -862048943;\nv1[i] = (v1[i] << v2) | (v1[i] >> 15);\nv1[i] *= 461845907;\nv4 ^= v1[i];\nv4 = (v4 >> 15) | (v4 << v2);\nv4 = 5 * v4 - 430675100;\n}\nreturn ((-1028477387 * (((-2048144789 * ((v4 >> 16) ^ v4)) >> 13) ^ (-2048144789 * ((v4 >> 16) ^ v4)))) >> 16) ^ (-1028477387 * (((-2048144789 * ((v4 >> 16) ^ v4)) >> 13) ^ (-2048144789 * ((v4 >> 16) ^ (unsigned int)v4))));\n}\n",
"canonical_decompiled_code": "__int64 func6()\n{\nint v1[2]; // [rsp+Ch] [rbp-14h]\nint v2; // [rsp+14h] [rbp-Ch]\nint i; // [rsp+18h] [rbp-8h]\nint v4; // [rsp+1Ch] [rbp-4h]\n\nv2 = 17;\nv4 = 0;\nv1[0] = time(0LL);\nv1[1] = rand() >> 16;\nfor ( i = 0; i <= 1; ++i )\n{\nv1[i] *= -862048943;\nv1[i] = (v1[i] << v2) | (v1[i] >> 15);\nv1[i] *= 461845907;\nv4 ^= v1[i];\nv4 = (v4 >> 15) | (v4 << v2);\nv4 = 5 * v4 - 430675100;\n}\nreturn ((-1028477387 * (((-2048144789 * ((v4 >> 16) ^ v4)) >> 13) ^ (-2048144789 * ((v4 >> 16) ^ v4)))) >> 16) ^ (-1028477387 * (((-2048144789 * ((v4 >> 16) ^ v4)) >> 13) ^ (-2048144789 * ((v4 >> 16) ^ (unsigned int)v4))));\n}",
"original_code": "static int getHashBase()\n{\n int distance = sizeof(int)*8-15;\n int hash_base = 0;\n int data[2] = {time(((void *)0)), rand() >> 16};\n int i;\n for(i = 0; i < 2; i++)\n {\n data[i] *= 0xcc9e2d51;\n data[i] = (data[i]>>15) | (data[i]<<distance);\n data[i] *= 0x1b873593;\n hash_base ^= data[i];\n hash_base = (hash_base >> 15) | (hash_base << distance);\n hash_base = hash_base * 5 + 0xe6546b64;\n }\n hash_base ^= hash_base >> 16;\n hash_base *= 0x85ebca6b;\n hash_base ^= hash_base >> 13;\n hash_base *= 0xc2b2ae35;\n hash_base ^= hash_base >> 16;\n return hash_base;\n}",
"canonical_original_code": "static int getHashBase()\n{\n int distance = sizeof(int)*8-15;\n int hash_base = 0;\n int data[2] = {time(((void *)0)), rand() >> 16};\n int i;\n for(i = 0; i < 2; i++)\n {\n data[i] *= 0xcc9e2d51;\n data[i] = (data[i]>>15) | (data[i]<<distance);\n data[i] *= 0x1b873593;\n hash_base ^= data[i];\n hash_base = (hash_base >> 15) | (hash_base << distance);\n hash_base = hash_base * 5 + 0xe6546b64;\n }\n hash_base ^= hash_base >> 16;\n hash_base *= 0x85ebca6b;\n hash_base ^= hash_base >> 13;\n hash_base *= 0xc2b2ae35;\n hash_base ^= hash_base >> 16;\n return hash_base;\n}",
"variable_types": [
[
"distance",
"int"
],
[
"hash_base",
"int"
],
[
"data",
"int [2]"
],
[
"i",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "dcb66efe95bcdb506eb3241dd39aec7bd18dec6612d37060c77ac20b7af68f89"
},
{
"name": "hash",
"canonical_name": "func7",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall hash(int a1, unsigned int a2)\n{\nreturn ((int)(((int)(a1 ^ a2) >> 20) ^ ((int)(a1 ^ a2) >> 12) ^ a1 ^ a2) >> 7) ^ ((int)(((int)(a1 ^ a2) >> 20) ^ ((int)(a1 ^ a2) >> 12) ^ a1 ^ a2) >> 4) ^ ((int)(a1 ^ a2) >> 20) ^ ((int)(a1 ^ a2) >> 12) ^ a1 ^ a2;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(int a1, unsigned int a2)\n{\nreturn ((int)(((int)(a1 ^ a2) >> 20) ^ ((int)(a1 ^ a2) >> 12) ^ a1 ^ a2) >> 7) ^ ((int)(((int)(a1 ^ a2) >> 20) ^ ((int)(a1 ^ a2) >> 12) ^ a1 ^ a2) >> 4) ^ ((int)(a1 ^ a2) >> 20) ^ ((int)(a1 ^ a2) >> 12) ^ a1 ^ a2;\n}",
"original_code": "static int hash(int hash_code, int hash_base)\n{\n int answer = hash_base;\n answer ^= hash_code;\n answer ^= (answer >> 20) ^ (answer >> 12);\n answer ^= (answer >> 7) ^ (answer >> 4);\n return answer;\n}",
"canonical_original_code": "static int hash(int hash_code, int hash_base)\n{\n int answer = hash_base;\n answer ^= hash_code;\n answer ^= (answer >> 20) ^ (answer >> 12);\n answer ^= (answer >> 7) ^ (answer >> 4);\n return answer;\n}",
"variable_types": [
[
"hash_code",
"int"
],
[
"hash_base",
"int"
],
[
"answer",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "dcb66efe95bcdb506eb3241dd39aec7bd18dec6612d37060c77ac20b7af68f89"
},
{
"name": "indexForTable",
"canonical_name": "func8",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall indexForTable(int a1, int a2)\n{\nreturn a1 & (unsigned int)(a2 - 1);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func8(int a1, int a2)\n{\nreturn a1 & (unsigned int)(a2 - 1);\n}",
"original_code": "static int indexForTable(int hash, int capability)\n{\n return hash & (capability-1);\n}",
"canonical_original_code": "static int indexForTable(int hash, int capability)\n{\n return hash & (capability-1);\n}",
"variable_types": [
[
"hash",
"int"
],
[
"capability",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "dcb66efe95bcdb506eb3241dd39aec7bd18dec6612d37060c77ac20b7af68f89"
},
{
"name": "resize",
"canonical_name": "func9",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall resize(__int64 a1, int a2)\n{\n__int64 result; // rax\nint v3; // [rsp+1Ch] [rbp-24h]\nvoid *s; // [rsp+20h] [rbp-20h]\n__int64 j; // [rsp+28h] [rbp-18h]\n__int64 v6; // [rsp+30h] [rbp-10h]\nint i; // [rsp+3Ch] [rbp-4h]\n\nif ( *(int *)(a1 + 12) >= 0x40000000 )\n*(_DWORD *)(a1 + 4) = *(_DWORD *)(a1 + 12);\ns = malloc(8LL * a2);\nmemset(s, 0, 8LL * a2);\nfor ( i = 0; i < *(_DWORD *)(a1 + 12); ++i )\n{\nv6 = *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * i);\nfor ( j = v6; j; v6 = j )\n{\nv3 = indexForTable(*(_DWORD *)v6, a2);\nj = *(_QWORD *)(v6 + 16);\n*(_QWORD *)(v6 + 16) = *((_QWORD *)s + v3);\n*((_QWORD *)s + v3) = v6;\n}\n}\nfree(*(void **)(a1 + 24));\n*(_QWORD *)(a1 + 24) = s;\n*(_DWORD *)(a1 + 12) = a2;\nresult = a1;\n*(_DWORD *)(a1 + 4) = (int)(float)(0.75 * (float)a2);\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func9(__int64 a1, int a2)\n{\n__int64 result; // rax\nint v3; // [rsp+1Ch] [rbp-24h]\nvoid *s; // [rsp+20h] [rbp-20h]\n__int64 j; // [rsp+28h] [rbp-18h]\n__int64 v6; // [rsp+30h] [rbp-10h]\nint i; // [rsp+3Ch] [rbp-4h]\n\nif ( *(int *)(a1 + 12) >= 0x40000000 )\n*(_DWORD *)(a1 + 4) = *(_DWORD *)(a1 + 12);\ns = malloc(8LL * a2);\nmemset(s, 0, 8LL * a2);\nfor ( i = 0; i < *(_DWORD *)(a1 + 12); ++i )\n{\nv6 = *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * i);\nfor ( j = v6; j; v6 = j )\n{\nv3 = func8(*(_DWORD *)v6, a2);\nj = *(_QWORD *)(v6 + 16);\n*(_QWORD *)(v6 + 16) = *((_QWORD *)s + v3);\n*((_QWORD *)s + v3) = v6;\n}\n}\nfree(*(void **)(a1 + 24));\n*(_QWORD *)(a1 + 24) = s;\n*(_DWORD *)(a1 + 12) = a2;\nresult = a1;\n*(_DWORD *)(a1 + 4) = (int)(float)(0.75 * (float)a2);\nreturn result;\n}",
"original_code": "static void resize(hashmap_t *map, int new_capability)\n{\n if(map->table_capability >= MAX_CAPABILITY)\n {\n map->threshold = map->table_capability;\n }\n hashmap_list_t **new_table = (hashmap_list_t **)malloc(sizeof(hashmap_list_t *) * new_capability);\n memset(new_table, 0, sizeof(hashmap_list_t *)*new_capability);\n int i, index;\n hashmap_list_t *temp, *temp_while;\n for(i = 0; i < map->table_capability; i++)\n {\n temp = map->table[i];\n temp_while = map->table[i];\n while(temp_while != ((void *)0))\n {\n index = indexForTable(temp->hash, new_capability);\n temp_while = temp->next;\n temp->next = new_table[index];\n new_table[index] = temp;\n temp = temp_while;\n }\n }\n temp = temp_while = ((void *)0);\n free(map->table);\n map->table = new_table;\n map->table_capability = new_capability;\n map->threshold = new_capability * DEFAULT_LOAD_FACTOR;\n}",
"canonical_original_code": "static void resize(struct _hashmap *map, int new_capability)\n{\n if(map->table_capability >= MAX_CAPABILITY)\n {\n map->threshold = map->table_capability;\n }\n struct _linked_list **new_table = (hashmap_list_t **)malloc(sizeof(hashmap_list_t *) * new_capability);\n memset(new_table, 0, sizeof(struct _linked_list *)*new_capability);\n int i; int index;\n struct _linked_list *temp; struct _linked_list *temp_while;\n for(i = 0; i < map->table_capability; i++)\n {\n temp = map->table[i];\n temp_while = map->table[i];\n while(temp_while != ((void *)0))\n {\n index = indexForTable(temp->hash, new_capability);\n temp_while = temp->next;\n temp->next = new_table[index];\n new_table[index] = temp;\n temp = temp_while;\n }\n }\n temp = temp_while = ((void *)0);\n free(map->table);\n map->table = new_table;\n map->table_capability = new_capability;\n map->threshold = new_capability * DEFAULT_LOAD_FACTOR;\n}",
"variable_types": [
[
"map",
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list { int hash; int key; int value; struct _linked_list *next; } **table; } *"
],
[
"new_capability",
"int"
],
[
"new_table",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; } **"
],
[
"i",
"int"
],
[
"index",
"int"
],
[
"temp",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; } *"
],
[
"temp_while",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list **table; }",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; }"
],
"binary_hash": "dcb66efe95bcdb506eb3241dd39aec7bd18dec6612d37060c77ac20b7af68f89"
},
{
"name": "hashmap_initialize",
"canonical_name": "func10",
"repo": "norlanliu/data-structure",
"decompiled_code": "void *__fastcall hashmap_initialize(int a1, __int64 a2)\n{\nvoid *v3; // [rsp+10h] [rbp-10h]\nint v4; // [rsp+1Ch] [rbp-4h]\n\nv4 = 1;\nif ( a1 < 0 )\nreturn 0LL;\nif ( a1 <= 0x40000000 )\n{\nwhile ( v4 < a1 )\nv4 *= 2;\n}\nelse\n{\nv4 = 0x40000000;\n}\nv3 = malloc(0x20uLL);\n*((_DWORD *)v3 + 2) = getHashBase();\n*((_QWORD *)v3 + 3) = malloc(8LL * v4);\nmemset(*((void **)v3 + 3), 0, 8LL * v4);\n*((_QWORD *)v3 + 2) = a2;\n*((_DWORD *)v3 + 3) = v4;\n*((_DWORD *)v3 + 1) = (int)(float)(0.75 * (float)v4);\n*(_DWORD *)v3 = 0;\nreturn v3;\n}\n",
"canonical_decompiled_code": "void *__fastcall func10(int a1, __int64 a2)\n{\nvoid *v3; // [rsp+10h] [rbp-10h]\nint v4; // [rsp+1Ch] [rbp-4h]\n\nv4 = 1;\nif ( a1 < 0 )\nreturn 0LL;\nif ( a1 <= 0x40000000 )\n{\nwhile ( v4 < a1 )\nv4 *= 2;\n}\nelse\n{\nv4 = 0x40000000;\n}\nv3 = malloc(0x20uLL);\n*((_DWORD *)v3 + 2) = func6();\n*((_QWORD *)v3 + 3) = malloc(8LL * v4);\nmemset(*((void **)v3 + 3), 0, 8LL * v4);\n*((_QWORD *)v3 + 2) = a2;\n*((_DWORD *)v3 + 3) = v4;\n*((_DWORD *)v3 + 1) = (int)(float)(0.75 * (float)v4);\n*(_DWORD *)v3 = 0;\nreturn v3;\n}",
"original_code": "hashmap_t *hashmap_initialize(int org_capability, int (*hashCode)(int))\n{\n int capability = 1;\n if(org_capability < 0)\n return ((void *)0);\n else if( org_capability > MAX_CAPABILITY)\n capability = MAX_CAPABILITY;\n else\n while(capability < org_capability )\n capability <<= 1;\n hashmap_t *answer = (hashmap_t *)malloc(sizeof(hashmap_t));\n answer->hash_base = getHashBase();\n answer->table = (hashmap_list_t **)malloc(sizeof(hashmap_list_t *) * capability);\n memset(answer->table, 0, sizeof(hashmap_list_t *) * capability);\n answer->hash_code = hashCode;\n answer->table_capability = capability;\n answer->threshold = (int)(capability * DEFAULT_LOAD_FACTOR);\n answer->size = 0;\n return answer;\n}",
"canonical_original_code": "struct _hashmap *hashmap_initialize(int org_capability, int (*hashCode)(int))\n{\n int capability = 1;\n if(org_capability < 0)\n return ((void *)0);\n else if( org_capability > MAX_CAPABILITY)\n capability = MAX_CAPABILITY;\n else\n while(capability < org_capability )\n capability <<= 1;\n struct _hashmap *answer = (hashmap_t *)malloc(sizeof(hashmap_t));\n answer->hash_base = getHashBase();\n answer->table = (struct _linked_list **)malloc(sizeof(struct _linked_list *) * capability);\n memset(answer->table, 0, sizeof(struct _linked_list *) * capability);\n answer->hash_code = hashCode;\n answer->table_capability = capability;\n answer->threshold = (int)(capability * DEFAULT_LOAD_FACTOR);\n answer->size = 0;\n return answer;\n}",
"variable_types": [
[
"org_capability",
"int"
],
[
"hashCode",
"int (*)(int)"
],
[
"capability",
"int"
],
[
"answer",
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list { int hash; int key; int value; struct _linked_list *next; } **table; } *"
]
],
"return_type": "struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list { int hash; int key; int value; struct _linked_list *next; } **table; } *",
"user_defined_types": [
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list **table; }",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; }"
],
"binary_hash": "dcb66efe95bcdb506eb3241dd39aec7bd18dec6612d37060c77ac20b7af68f89"
},
{
"name": "hashmap_initialize_default",
"canonical_name": "func11",
"repo": "norlanliu/data-structure",
"decompiled_code": "void *__fastcall hashmap_initialize_default(__int64 a1)\n{\nvoid *v2; // [rsp+18h] [rbp-8h]\n\nv2 = malloc(0x20uLL);\n*((_DWORD *)v2 + 2) = getHashBase();\n*((_QWORD *)v2 + 2) = a1;\n*((_DWORD *)v2 + 3) = 16;\n*((_DWORD *)v2 + 1) = (int)(float)(0.75 * (float)16);\n*((_QWORD *)v2 + 3) = malloc(0x80uLL);\nmemset(*((void **)v2 + 3), 0, 0x80uLL);\n*(_DWORD *)v2 = 0;\nreturn v2;\n}\n",
"canonical_decompiled_code": "void *__fastcall func11(__int64 a1)\n{\nvoid *v2; // [rsp+18h] [rbp-8h]\n\nv2 = malloc(0x20uLL);\n*((_DWORD *)v2 + 2) = func6();\n*((_QWORD *)v2 + 2) = a1;\n*((_DWORD *)v2 + 3) = 16;\n*((_DWORD *)v2 + 1) = (int)(float)(0.75 * (float)16);\n*((_QWORD *)v2 + 3) = malloc(0x80uLL);\nmemset(*((void **)v2 + 3), 0, 0x80uLL);\n*(_DWORD *)v2 = 0;\nreturn v2;\n}",
"original_code": "hashmap_t *hashmap_initialize_default(int (*hashCode)(int))\n{\n hashmap_t *answer = (hashmap_t *)malloc(sizeof(hashmap_t));\n answer->hash_base = getHashBase();\n answer->hash_code = hashCode;\n answer->table_capability = DEFAULT_TABLE_CAPABILITY;\n answer->threshold = (int)(DEFAULT_LOAD_FACTOR * DEFAULT_TABLE_CAPABILITY);\n answer->table = (hashmap_list_t **)malloc(sizeof(hashmap_list_t *) * DEFAULT_TABLE_CAPABILITY);\n memset(answer->table, 0, sizeof(hashmap_list_t *) * DEFAULT_TABLE_CAPABILITY);\n answer->size = 0;\n return answer;\n}",
"canonical_original_code": "struct _hashmap *hashmap_initialize_default(int (*hashCode)(int))\n{\n struct _hashmap *answer = (hashmap_t *)malloc(sizeof(hashmap_t));\n answer->hash_base = getHashBase();\n answer->hash_code = hashCode;\n answer->table_capability = DEFAULT_TABLE_CAPABILITY;\n answer->threshold = (int)(DEFAULT_LOAD_FACTOR * DEFAULT_TABLE_CAPABILITY);\n answer->table = (struct _linked_list **)malloc(sizeof(struct _linked_list *) * DEFAULT_TABLE_CAPABILITY);\n memset(answer->table, 0, sizeof(struct _linked_list *) * DEFAULT_TABLE_CAPABILITY);\n answer->size = 0;\n return answer;\n}",
"variable_types": [
[
"hashCode",
"int (*)(int)"
],
[
"answer",
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list { int hash; int key; int value; struct _linked_list *next; } **table; } *"
]
],
"return_type": "struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list { int hash; int key; int value; struct _linked_list *next; } **table; } *",
"user_defined_types": [
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list **table; }",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; }"
],
"binary_hash": "dcb66efe95bcdb506eb3241dd39aec7bd18dec6612d37060c77ac20b7af68f89"
},
{
"name": "hashmap_put",
"canonical_name": "func12",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall hashmap_put(__int64 a1, unsigned int a2, int a3)\n{\nunsigned int v4; // ebx\nint v5; // eax\n_DWORD *v6; // rax\nunsigned int v8; // [rsp+20h] [rbp-20h]\nint v9; // [rsp+24h] [rbp-1Ch]\n__int64 i; // [rsp+28h] [rbp-18h]\n\nif ( !a1 || !*(_QWORD *)(a1 + 24) )\nreturn 4294967294LL;\nif ( *(_DWORD *)a1 >= *(_DWORD *)(a1 + 4) - 1 )\nresize(a1, 2 * *(_DWORD *)(a1 + 12));\nv4 = *(_DWORD *)(a1 + 8);\nv5 = (*(__int64 (__fastcall **)(_QWORD))(a1 + 16))(a2);\nv9 = hash(v5, v4);\nv8 = indexForTable(v9, *(_DWORD *)(a1 + 12));\nprintf(\"key : %d, index : %d\\n\", a2, v8);\nif ( *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * (int)v8) )\n{\nfor ( i = *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * (int)v8); i; i = *(_QWORD *)(i + 16) )\n{\nif ( v9 == *(_DWORD *)i && a2 == *(_DWORD *)(i + 4) )\n{\n*(_DWORD *)(i + 8) = a3;\nreturn 0xFFFFFFFFLL;\n}\n}\n}\nv6 = malloc(0x18uLL);\n*v6 = v9;\nv6[1] = a2;\nv6[2] = a3;\n*((_QWORD *)v6 + 2) = *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * (int)v8);\n*(_QWORD *)(8LL * (int)v8 + *(_QWORD *)(a1 + 24)) = v6;\n++*(_DWORD *)a1;\nreturn v8;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func12(__int64 a1, unsigned int a2, int a3)\n{\nunsigned int v4; // ebx\nint v5; // eax\n_DWORD *v6; // rax\nunsigned int v8; // [rsp+20h] [rbp-20h]\nint v9; // [rsp+24h] [rbp-1Ch]\n__int64 i; // [rsp+28h] [rbp-18h]\n\nif ( !a1 || !*(_QWORD *)(a1 + 24) )\nreturn 4294967294LL;\nif ( *(_DWORD *)a1 >= *(_DWORD *)(a1 + 4) - 1 )\nfunc9(a1, 2 * *(_DWORD *)(a1 + 12));\nv4 = *(_DWORD *)(a1 + 8);\nv5 = (*(__int64 (__fastcall **)(_QWORD))(a1 + 16))(a2);\nv9 = func7(v5, v4);\nv8 = func8(v9, *(_DWORD *)(a1 + 12));\nprintf(\"key : %d, index : %d\\n\", a2, v8);\nif ( *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * (int)v8) )\n{\nfor ( i = *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * (int)v8); i; i = *(_QWORD *)(i + 16) )\n{\nif ( v9 == *(_DWORD *)i && a2 == *(_DWORD *)(i + 4) )\n{\n*(_DWORD *)(i + 8) = a3;\nreturn 0xFFFFFFFFLL;\n}\n}\n}\nv6 = malloc(0x18uLL);\n*v6 = v9;\nv6[1] = a2;\nv6[2] = a3;\n*((_QWORD *)v6 + 2) = *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * (int)v8);\n*(_QWORD *)(8LL * (int)v8 + *(_QWORD *)(a1 + 24)) = v6;\n++*(_DWORD *)a1;\nreturn v8;\n}",
"original_code": "int hashmap_put(hashmap_t *map, int key, int value)\n{\n if(map == ((void *)0) || map->table == ((void *)0))\n return -2;\n if(map->size >= (map->threshold-1))\n resize(map, 2*map->table_capability);\n int hash_num = hash((*(map->hash_code))(key), map->hash_base);\n int index = indexForTable(hash_num, map->table_capability);\n printf(\"key : %d, index : %d\\n\", key, index);\n if(map->table[index] != ((void *)0))\n {\n hashmap_list_t *temp;\n for(temp = map->table[index]; temp != ((void *)0); temp = temp->next)\n {\n if(temp->hash == hash_num && temp->key == key)\n {\n temp->value = value;\n return -1;\n }\n }\n }\n hashmap_list_t * newNode = (hashmap_list_t *)malloc(sizeof(hashmap_list_t));\n newNode->hash = hash_num;\n newNode->key = key;\n newNode->value = value;\n newNode->next = map->table[index];\n map->table[index] = newNode;\n map->size++;\n return index;\n}",
"canonical_original_code": "int hashmap_put(struct _hashmap *map, int key, int value)\n{\n if(map == ((void *)0) || map->table == ((void *)0))\n return -2;\n if(map->size >= (map->threshold-1))\n resize(map, 2*map->table_capability);\n int hash_num = hash((*(map->hash_code))(key), map->hash_base);\n int index = indexForTable(hash_num, map->table_capability);\n printf(\"key : %d, index : %d\\n\", key, index);\n if(map->table[index] != ((void *)0))\n {\n struct _linked_list *temp;\n for(temp = map->table[index]; temp != ((void *)0); temp = temp->next)\n {\n if(temp->hash == hash_num && temp->key == key)\n {\n temp->value = value;\n return -1;\n }\n }\n }\n struct _linked_list *newNode = (hashmap_list_t *)malloc(sizeof(hashmap_list_t));\n newNode->hash = hash_num;\n newNode->key = key;\n newNode->value = value;\n newNode->next = map->table[index];\n map->table[index] = newNode;\n map->size++;\n return index;\n}",
"variable_types": [
[
"map",
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list { int hash; int key; int value; struct _linked_list *next; } **table; } *"
],
[
"key",
"int"
],
[
"value",
"int"
],
[
"hash_num",
"int"
],
[
"index",
"int"
],
[
"temp",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; } *"
],
[
"newNode",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list **table; }",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; }"
],
"binary_hash": "dcb66efe95bcdb506eb3241dd39aec7bd18dec6612d37060c77ac20b7af68f89"
},
{
"name": "hashmap_contains",
"canonical_name": "func13",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall hashmap_contains(__int64 a1, unsigned int a2, int a3)\n{\nunsigned int v4; // ebx\nint v5; // eax\nint v7; // [rsp+14h] [rbp-1Ch]\n__int64 i; // [rsp+18h] [rbp-18h]\n\nif ( !a1 || !*(_QWORD *)(a1 + 24) )\nreturn 0xFFFFFFFFLL;\nv4 = *(_DWORD *)(a1 + 8);\nv5 = (*(__int64 (__fastcall **)(_QWORD))(a1 + 16))(a2);\nv7 = hash(v5, v4);\nfor ( i = *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * (int)indexForTable(v7, *(_DWORD *)(a1 + 12)));\ni;\ni = *(_QWORD *)(i + 16) )\n{\nif ( v7 == *(_DWORD *)i && a2 == *(_DWORD *)(i + 4) && a3 == *(_DWORD *)(i + 8) )\nreturn 0LL;\n}\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func13(__int64 a1, unsigned int a2, int a3)\n{\nunsigned int v4; // ebx\nint v5; // eax\nint v7; // [rsp+14h] [rbp-1Ch]\n__int64 i; // [rsp+18h] [rbp-18h]\n\nif ( !a1 || !*(_QWORD *)(a1 + 24) )\nreturn 0xFFFFFFFFLL;\nv4 = *(_DWORD *)(a1 + 8);\nv5 = (*(__int64 (__fastcall **)(_QWORD))(a1 + 16))(a2);\nv7 = func7(v5, v4);\nfor ( i = *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * (int)func8(v7, *(_DWORD *)(a1 + 12)));\ni;\ni = *(_QWORD *)(i + 16) )\n{\nif ( v7 == *(_DWORD *)i && a2 == *(_DWORD *)(i + 4) && a3 == *(_DWORD *)(i + 8) )\nreturn 0LL;\n}\nreturn 1LL;\n}",
"original_code": "int hashmap_contains(hashmap_t *map, int key, int value)\n{\n if(map == ((void *)0) || map->table == ((void *)0))\n return -1;\n int hash_num = hash((*(map->hash_code))(key), map->hash_base);\n int index = indexForTable(hash_num, map->table_capability);\n hashmap_list_t *temp;\n for(temp = map->table[index]; temp != ((void *)0); temp = temp->next)\n if(temp->hash == hash_num && temp->key == key && temp->value == value)\n return 0;\n return 1;\n}",
"canonical_original_code": "int hashmap_contains(struct _hashmap *map, int key, int value)\n{\n if(map == ((void *)0) || map->table == ((void *)0))\n return -1;\n int hash_num = hash((*(map->hash_code))(key), map->hash_base);\n int index = indexForTable(hash_num, map->table_capability);\n struct _linked_list *temp;\n for(temp = map->table[index]; temp != ((void *)0); temp = temp->next)\n if(temp->hash == hash_num && temp->key == key && temp->value == value)\n return 0;\n return 1;\n}",
"variable_types": [
[
"map",
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list { int hash; int key; int value; struct _linked_list *next; } **table; } *"
],
[
"key",
"int"
],
[
"value",
"int"
],
[
"hash_num",
"int"
],
[
"index",
"int"
],
[
"temp",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list **table; }",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; }"
],
"binary_hash": "dcb66efe95bcdb506eb3241dd39aec7bd18dec6612d37060c77ac20b7af68f89"
},
{
"name": "hashmap_remove",
"canonical_name": "func14",
"repo": "norlanliu/data-structure",
"decompiled_code": "void __fastcall hashmap_remove(__int64 a1, unsigned int a2)\n{\nunsigned int v2; // ebx\nint v3; // eax\nint v4; // [rsp+18h] [rbp-28h]\nint v5; // [rsp+1Ch] [rbp-24h]\n_DWORD *v6; // [rsp+20h] [rbp-20h]\n_DWORD *ptr; // [rsp+28h] [rbp-18h]\n_DWORD *ptra; // [rsp+28h] [rbp-18h]\n\nif ( a1 && *(_QWORD *)(a1 + 24) )\n{\nv2 = *(_DWORD *)(a1 + 8);\nv3 = (*(__int64 (__fastcall **)(_QWORD))(a1 + 16))(a2);\nv5 = hash(v3, v2);\nv4 = indexForTable(v5, *(_DWORD *)(a1 + 12));\nptr = *(_DWORD **)(*(_QWORD *)(a1 + 24) + 8LL * v4);\nv6 = ptr;\nif ( ptr && v5 == *ptr && a2 == ptr[1] )\n{\n*(_QWORD *)(8LL * v4 + *(_QWORD *)(a1 + 24)) = *((_QWORD *)ptr + 2);\nfree(ptr);\n}\nelse\n{\nfor ( ptra = *(_DWORD **)(*(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * v4) + 16LL);\nptra;\nptra = (_DWORD *)*((_QWORD *)ptra + 2) )\n{\nif ( v5 == *ptra && a2 == ptra[1] )\n{\n*((_QWORD *)v6 + 2) = *((_QWORD *)ptra + 2);\nfree(ptra);\nreturn;\n}\nv6 = (_DWORD *)*((_QWORD *)v6 + 2);\n}\n}\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func14(__int64 a1, unsigned int a2)\n{\nunsigned int v2; // ebx\nint v3; // eax\nint v4; // [rsp+18h] [rbp-28h]\nint v5; // [rsp+1Ch] [rbp-24h]\n_DWORD *v6; // [rsp+20h] [rbp-20h]\n_DWORD *ptr; // [rsp+28h] [rbp-18h]\n_DWORD *ptra; // [rsp+28h] [rbp-18h]\n\nif ( a1 && *(_QWORD *)(a1 + 24) )\n{\nv2 = *(_DWORD *)(a1 + 8);\nv3 = (*(__int64 (__fastcall **)(_QWORD))(a1 + 16))(a2);\nv5 = func7(v3, v2);\nv4 = func8(v5, *(_DWORD *)(a1 + 12));\nptr = *(_DWORD **)(*(_QWORD *)(a1 + 24) + 8LL * v4);\nv6 = ptr;\nif ( ptr && v5 == *ptr && a2 == ptr[1] )\n{\n*(_QWORD *)(8LL * v4 + *(_QWORD *)(a1 + 24)) = *((_QWORD *)ptr + 2);\nfree(ptr);\n}\nelse\n{\nfor ( ptra = *(_DWORD **)(*(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * v4) + 16LL);\nptra;\nptra = (_DWORD *)*((_QWORD *)ptra + 2) )\n{\nif ( v5 == *ptra && a2 == ptra[1] )\n{\n*((_QWORD *)v6 + 2) = *((_QWORD *)ptra + 2);\nfree(ptra);\nreturn;\n}\nv6 = (_DWORD *)*((_QWORD *)v6 + 2);\n}\n}\n}\n}",
"original_code": "void hashmap_remove(hashmap_t *map, int key)\n{\n if(map == ((void *)0) || map->table == ((void *)0))\n return;\n int hash_num = hash((*(map->hash_code))(key), map->hash_base);\n int index = indexForTable(hash_num, map->table_capability);\n hashmap_list_t *temp = map->table[index], *prev = map->table[index];\n if(temp != ((void *)0) && temp->hash == hash_num && temp->key == key)\n {\n map->table[index] = temp->next;\n free(temp);\n }\n else\n {\n for(temp = map->table[index]->next; temp != ((void *)0); temp = temp->next)\n {\n if(temp->hash == hash_num && temp->key == key)\n {\n prev->next = temp->next;\n free(temp);\n break;\n }\n prev = prev->next;\n }\n }\n}",
"canonical_original_code": "void hashmap_remove(struct _hashmap *map, int key)\n{\n if(map == ((void *)0) || map->table == ((void *)0))\n return;\n int hash_num = hash((*(map->hash_code))(key), map->hash_base);\n int index = indexForTable(hash_num, map->table_capability);\n struct _linked_list *temp = map->table[index]; struct _linked_list *prev = map->table[index];\n if(temp != ((void *)0) && temp->hash == hash_num && temp->key == key)\n {\n map->table[index] = temp->next;\n free(temp);\n }\n else\n {\n for(temp = map->table[index]->next; temp != ((void *)0); temp = temp->next)\n {\n if(temp->hash == hash_num && temp->key == key)\n {\n prev->next = temp->next;\n free(temp);\n break;\n }\n prev = prev->next;\n }\n }\n}",
"variable_types": [
[
"map",
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list { int hash; int key; int value; struct _linked_list *next; } **table; } *"
],
[
"key",
"int"
],
[
"hash_num",
"int"
],
[
"index",
"int"
],
[
"temp",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; } *"
],
[
"prev",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list **table; }",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; }"
],
"binary_hash": "dcb66efe95bcdb506eb3241dd39aec7bd18dec6612d37060c77ac20b7af68f89"
},
{
"name": "hashmap_get",
"canonical_name": "func15",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall hashmap_get(__int64 a1, unsigned int a2)\n{\nunsigned int v3; // ebx\nint v4; // eax\nint v5; // [rsp+10h] [rbp-20h]\nint v6; // [rsp+14h] [rbp-1Ch]\n__int64 i; // [rsp+18h] [rbp-18h]\n\nif ( !a1 || !*(_QWORD *)(a1 + 24) )\nreturn 0xFFFFFFFFLL;\nv3 = *(_DWORD *)(a1 + 8);\nv4 = (*(__int64 (__fastcall **)(_QWORD))(a1 + 16))(a2);\nv6 = hash(v4, v3);\nv5 = indexForTable(v6, *(_DWORD *)(a1 + 12));\nif ( *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * v5) )\n{\nfor ( i = *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * v5); i; i = *(_QWORD *)(i + 16) )\n{\nif ( v6 == *(_DWORD *)i && a2 == *(_DWORD *)(i + 4) )\nreturn *(unsigned int *)(i + 8);\n}\n}\nreturn 0xFFFFFFFFLL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func15(__int64 a1, unsigned int a2)\n{\nunsigned int v3; // ebx\nint v4; // eax\nint v5; // [rsp+10h] [rbp-20h]\nint v6; // [rsp+14h] [rbp-1Ch]\n__int64 i; // [rsp+18h] [rbp-18h]\n\nif ( !a1 || !*(_QWORD *)(a1 + 24) )\nreturn 0xFFFFFFFFLL;\nv3 = *(_DWORD *)(a1 + 8);\nv4 = (*(__int64 (__fastcall **)(_QWORD))(a1 + 16))(a2);\nv6 = func7(v4, v3);\nv5 = func8(v6, *(_DWORD *)(a1 + 12));\nif ( *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * v5) )\n{\nfor ( i = *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * v5); i; i = *(_QWORD *)(i + 16) )\n{\nif ( v6 == *(_DWORD *)i && a2 == *(_DWORD *)(i + 4) )\nreturn *(unsigned int *)(i + 8);\n}\n}\nreturn 0xFFFFFFFFLL;\n}",
"original_code": "int hashmap_get(hashmap_t *map, int key)\n{\n if(map == ((void *)0) || map->table == ((void *)0))\n return -1;\n int hash_num = hash((*(map->hash_code))(key), map->hash_base);\n int index = indexForTable(hash_num, map->table_capability);\n if(map->table[index] != ((void *)0))\n {\n hashmap_list_t *temp;\n for(temp = map->table[index]; temp != ((void *)0); temp = temp->next)\n if(temp->hash == hash_num && temp->key == key)\n return temp->value;\n }\n return -1;\n}",
"canonical_original_code": "int hashmap_get(struct _hashmap *map, int key)\n{\n if(map == ((void *)0) || map->table == ((void *)0))\n return -1;\n int hash_num = hash((*(map->hash_code))(key), map->hash_base);\n int index = indexForTable(hash_num, map->table_capability);\n if(map->table[index] != ((void *)0))\n {\n struct _linked_list *temp;\n for(temp = map->table[index]; temp != ((void *)0); temp = temp->next)\n if(temp->hash == hash_num && temp->key == key)\n return temp->value;\n }\n return -1;\n}",
"variable_types": [
[
"map",
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list { int hash; int key; int value; struct _linked_list *next; } **table; } *"
],
[
"key",
"int"
],
[
"hash_num",
"int"
],
[
"index",
"int"
],
[
"temp",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list **table; }",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; }"
],
"binary_hash": "dcb66efe95bcdb506eb3241dd39aec7bd18dec6612d37060c77ac20b7af68f89"
},
{
"name": "hashmap_free",
"canonical_name": "func16",
"repo": "norlanliu/data-structure",
"decompiled_code": "void __fastcall hashmap_free(__int64 a1)\n{\n_QWORD *j; // [rsp+18h] [rbp-18h]\n_QWORD *ptr; // [rsp+20h] [rbp-10h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nif ( a1 && *(_QWORD *)(a1 + 24) )\n{\nfor ( i = 0; i < *(_DWORD *)(a1 + 12); ++i )\n{\nptr = *(_QWORD **)(*(_QWORD *)(a1 + 24) + 8LL * i);\nfor ( j = ptr; j; ptr = j )\n{\nj = (_QWORD *)j[2];\nfree(ptr);\n}\n*(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * i) = 0LL;\n}\nfree((void *)a1);\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func16(__int64 a1)\n{\n_QWORD *j; // [rsp+18h] [rbp-18h]\n_QWORD *ptr; // [rsp+20h] [rbp-10h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nif ( a1 && *(_QWORD *)(a1 + 24) )\n{\nfor ( i = 0; i < *(_DWORD *)(a1 + 12); ++i )\n{\nptr = *(_QWORD **)(*(_QWORD *)(a1 + 24) + 8LL * i);\nfor ( j = ptr; j; ptr = j )\n{\nj = (_QWORD *)j[2];\nfree(ptr);\n}\n*(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * i) = 0LL;\n}\nfree((void *)a1);\n}\n}",
"original_code": "void hashmap_free(hashmap_t *map)\n{\n if(map == ((void *)0) || map->table == ((void *)0))\n return;\n int i;\n hashmap_list_t *temp1, *temp2;\n for(i = 0; i < map->table_capability; i++)\n {\n temp1 = map->table[i];\n temp2 = temp1;\n while(temp2 != ((void *)0))\n {\n temp2 = temp2->next;\n free(temp1);\n temp1 = temp2;\n }\n map->table[i] = ((void *)0);\n }\n free(map);\n map = ((void *)0);\n}",
"canonical_original_code": "void hashmap_free(struct _hashmap *map)\n{\n if(map == ((void *)0) || map->table == ((void *)0))\n return;\n int i;\n struct _linked_list *temp1; struct _linked_list *temp2;\n for(i = 0; i < map->table_capability; i++)\n {\n temp1 = map->table[i];\n temp2 = temp1;\n while(temp2 != ((void *)0))\n {\n temp2 = temp2->next;\n free(temp1);\n temp1 = temp2;\n }\n map->table[i] = ((void *)0);\n }\n free(map);\n map = ((void *)0);\n}",
"variable_types": [
[
"map",
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list { int hash; int key; int value; struct _linked_list *next; } **table; } *"
],
[
"i",
"int"
],
[
"temp1",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; } *"
],
[
"temp2",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list **table; }",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; }"
],
"binary_hash": "dcb66efe95bcdb506eb3241dd39aec7bd18dec6612d37060c77ac20b7af68f89"
}
] |
f0fbae09c9584d4d599b2f6361101e0df5d5fdcc1cc3ffcf1597bc6a65d31d3a | norlanliu/data-structure | [
[
"insert",
"->"
],
[
"findItem",
"->"
],
[
"findPredecessor",
"->",
"deleteItem"
],
[
"deleteItem",
"->",
"findPredecessor",
"remove_duplication"
],
[
"freeList",
"->"
],
[
"printList",
"->"
],
[
"reverseList",
"->"
],
[
"hashCode",
"->"
],
[
"remove_duplication",
"->",
"deleteItem"
]
] | [] | [
{
"name": "insert",
"canonical_name": "func0",
"repo": "norlanliu/data-structure",
"decompiled_code": "void __fastcall insert(__int64 a1, int a2)\n{\n_QWORD *v2; // [rsp+18h] [rbp-8h]\n\nif ( a1 )\n{\nv2 = malloc(0x10uLL);\n*(_DWORD *)v2 = a2;\nv2[1] = *(_QWORD *)(a1 + 8);\n*(_QWORD *)(a1 + 8) = v2;\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func0(__int64 a1, int a2)\n{\n_QWORD *v2; // [rsp+18h] [rbp-8h]\n\nif ( a1 )\n{\nv2 = malloc(0x10uLL);\n*(_DWORD *)v2 = a2;\nv2[1] = *(_QWORD *)(a1 + 8);\n*(_QWORD *)(a1 + 8) = v2;\n}\n}",
"original_code": "void insert(list *l, item_type item)\n{\n if(l == ((void *)0))\n return;\n list * newItem = (list *)malloc(sizeof(list));\n newItem->item = item;\n newItem->next = l->next;\n l->next = newItem;\n}",
"canonical_original_code": "void insert(struct _list *l, int item)\n{\n if(l == ((void *)0))\n return;\n struct _list *newItem = (list *)malloc(sizeof(list));\n newItem->item = item;\n newItem->next = l->next;\n l->next = newItem;\n}",
"variable_types": [
[
"l",
"struct _list { int item; struct _list *next; } *"
],
[
"item",
"int"
],
[
"newItem",
"struct _list { int item; struct _list *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _list { int item; struct _list *next; }"
],
"binary_hash": "f0fbae09c9584d4d599b2f6361101e0df5d5fdcc1cc3ffcf1597bc6a65d31d3a"
},
{
"name": "findItem",
"canonical_name": "func1",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall findItem(__int64 a1, int a2)\n{\n__int64 i; // [rsp+14h] [rbp-8h]\n\nif ( !a1 )\nreturn 0LL;\nfor ( i = a1; i; i = *(_QWORD *)(i + 8) )\n{\nif ( a2 == *(_DWORD *)i )\nreturn i;\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1, int a2)\n{\n__int64 i; // [rsp+14h] [rbp-8h]\n\nif ( !a1 )\nreturn 0LL;\nfor ( i = a1; i; i = *(_QWORD *)(i + 8) )\n{\nif ( a2 == *(_DWORD *)i )\nreturn i;\n}\nreturn 0LL;\n}",
"original_code": "list *findItem(list *l, item_type item)\n{\n if(l == ((void *)0))\n return ((void *)0);\n list *p = l;\n while(p != ((void *)0))\n {\n if(p->item == item)\n return p;\n else\n p = p->next;\n }\n return ((void *)0);\n}",
"canonical_original_code": "struct _list *findItem(struct _list *l, int item)\n{\n if(l == ((void *)0))\n return ((void *)0);\n struct _list *p = l;\n while(p != ((void *)0))\n {\n if(p->item == item)\n return p;\n else\n p = p->next;\n }\n return ((void *)0);\n}",
"variable_types": [
[
"l",
"struct _list *"
],
[
"item",
"int"
],
[
"p",
"struct _list { int item; struct _list *next; } *"
]
],
"return_type": "struct _list { int item; struct _list *next; } *",
"user_defined_types": [
"struct _list { int item; struct _list *next; }"
],
"binary_hash": "f0fbae09c9584d4d599b2f6361101e0df5d5fdcc1cc3ffcf1597bc6a65d31d3a"
},
{
"name": "findPredecessor",
"canonical_name": "func2",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall findPredecessor(__int64 a1, int a2)\n{\n__int64 i; // [rsp+14h] [rbp-8h]\n\nif ( !a1 )\nreturn 0LL;\nfor ( i = a1; *(_QWORD *)(i + 8); i = *(_QWORD *)(i + 8) )\n{\nif ( a2 == **(_DWORD **)(i + 8) )\nreturn i;\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, int a2)\n{\n__int64 i; // [rsp+14h] [rbp-8h]\n\nif ( !a1 )\nreturn 0LL;\nfor ( i = a1; *(_QWORD *)(i + 8); i = *(_QWORD *)(i + 8) )\n{\nif ( a2 == **(_DWORD **)(i + 8) )\nreturn i;\n}\nreturn 0LL;\n}",
"original_code": "list *findPredecessor(list *l, item_type x)\n{\n if(l == ((void *)0))\n return ((void *)0);\n list * p = l;\n while(p->next != ((void *)0))\n {\n if(p->next->item == x)\n return p;\n else\n p = p->next;\n }\n return ((void *)0);\n}",
"canonical_original_code": "struct _list *findPredecessor(struct _list *l, int x)\n{\n if(l == ((void *)0))\n return ((void *)0);\n struct _list *p = l;\n while(p->next != ((void *)0))\n {\n if(p->next->item == x)\n return p;\n else\n p = p->next;\n }\n return ((void *)0);\n}",
"variable_types": [
[
"l",
"struct _list *"
],
[
"x",
"int"
],
[
"p",
"struct _list { int item; struct _list *next; } *"
]
],
"return_type": "struct _list { int item; struct _list *next; } *",
"user_defined_types": [
"struct _list { int item; struct _list *next; }"
],
"binary_hash": "f0fbae09c9584d4d599b2f6361101e0df5d5fdcc1cc3ffcf1597bc6a65d31d3a"
},
{
"name": "deleteItem",
"canonical_name": "func3",
"repo": "norlanliu/data-structure",
"decompiled_code": "void __fastcall deleteItem(__int64 a1, int a2)\n{\n_QWORD *ptr; // [rsp+10h] [rbp-10h]\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nif ( a1 )\n{\nv3 = findPredecessor(a1, a2);\nif ( v3 )\n{\nptr = *(_QWORD **)(v3 + 8);\n*(_QWORD *)(v3 + 8) = ptr[1];\nfree(ptr);\n}\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func3(__int64 a1, int a2)\n{\n_QWORD *ptr; // [rsp+10h] [rbp-10h]\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nif ( a1 )\n{\nv3 = func2(a1, a2);\nif ( v3 )\n{\nptr = *(_QWORD **)(v3 + 8);\n*(_QWORD *)(v3 + 8) = ptr[1];\nfree(ptr);\n}\n}\n}",
"original_code": "void deleteItem(list *l, item_type x)\n{\n if(l == ((void *)0))\n return;\n list *p = findPredecessor(l,x);\n if(p != ((void *)0))\n {\n list *old = p->next;\n p->next = old->next;\n free(old);\n old = ((void *)0);\n }\n}",
"canonical_original_code": "void deleteItem(struct _list *l, int x)\n{\n if(l == ((void *)0))\n return;\n struct _list *p = findPredecessor(l,x);\n if(p != ((void *)0))\n {\n struct _list *old = p->next;\n p->next = old->next;\n free(old);\n old = ((void *)0);\n }\n}",
"variable_types": [
[
"l",
"struct _list { int item; struct _list *next; } *"
],
[
"x",
"int"
],
[
"p",
"struct _list { int item; struct _list *next; } *"
],
[
"old",
"struct _list { int item; struct _list *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _list { int item; struct _list *next; }"
],
"binary_hash": "f0fbae09c9584d4d599b2f6361101e0df5d5fdcc1cc3ffcf1597bc6a65d31d3a"
},
{
"name": "freeList",
"canonical_name": "func4",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall freeList(__int64 a1)\n{\n__int64 result; // rax\n_QWORD *ptr; // [rsp+18h] [rbp-8h]\n\nif ( a1 )\n{\nwhile ( 1 )\n{\nresult = *(_QWORD *)(a1 + 8);\nif ( !result )\nbreak;\nptr = *(_QWORD **)(a1 + 8);\n*(_QWORD *)(a1 + 8) = ptr[1];\nfree(ptr);\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1)\n{\n__int64 result; // rax\n_QWORD *ptr; // [rsp+18h] [rbp-8h]\n\nif ( a1 )\n{\nwhile ( 1 )\n{\nresult = *(_QWORD *)(a1 + 8);\nif ( !result )\nbreak;\nptr = *(_QWORD **)(a1 + 8);\n*(_QWORD *)(a1 + 8) = ptr[1];\nfree(ptr);\n}\n}\nreturn result;\n}",
"original_code": "void freeList(list *l)\n{\n if(l != ((void *)0))\n {\n list *temp = ((void *)0);\n while(l->next != ((void *)0))\n {\n temp = l->next;\n l->next = temp->next;\n free(temp);\n temp = ((void *)0);\n }\n }\n}",
"canonical_original_code": "void freeList(struct _list *l)\n{\n if(l != ((void *)0))\n {\n struct _list *temp = ((void *)0);\n while(l->next != ((void *)0))\n {\n temp = l->next;\n l->next = temp->next;\n free(temp);\n temp = ((void *)0);\n }\n }\n}",
"variable_types": [
[
"l",
"struct _list { int item; struct _list *next; } *"
],
[
"temp",
"struct _list { int item; struct _list *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _list { int item; struct _list *next; }"
],
"binary_hash": "f0fbae09c9584d4d599b2f6361101e0df5d5fdcc1cc3ffcf1597bc6a65d31d3a"
},
{
"name": "printList",
"canonical_name": "func5",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall printList(__int64 a1)\n{\n__int64 result; // rax\n\nif ( a1 )\n{\nresult = *(_QWORD *)(a1 + 8);\nif ( result )\n{\nprintf(\"%d\\n\", **(unsigned int **)(a1 + 8));\nresult = printList(*(_QWORD *)(a1 + 8));\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1)\n{\n__int64 result; // rax\n\nif ( a1 )\n{\nresult = *(_QWORD *)(a1 + 8);\nif ( result )\n{\nprintf(\"%d\\n\", **(unsigned int **)(a1 + 8));\nresult = func5(*(_QWORD *)(a1 + 8));\n}\n}\nreturn result;\n}",
"original_code": "void printList(list *l)\n{\n if(l == ((void *)0) || l->next == ((void *)0))\n return;\n printf(\"%d\\n\", l->next->item);\n printList(l->next);\n}",
"canonical_original_code": "void printList(struct _list *l)\n{\n if(l == ((void *)0) || l->next == ((void *)0))\n return;\n printf(\"%d\\n\", l->next->item);\n printList(l->next);\n}",
"variable_types": [
[
"l",
"struct _list { int item; struct _list *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _list { int item; struct _list *next; }"
],
"binary_hash": "f0fbae09c9584d4d599b2f6361101e0df5d5fdcc1cc3ffcf1597bc6a65d31d3a"
},
{
"name": "reverseList",
"canonical_name": "func6",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall reverseList(__int64 a1)\n{\n__int64 result; // rax\n__int64 i; // [rsp+10h] [rbp-18h]\n__int64 v3; // [rsp+18h] [rbp-10h]\n__int64 v4; // [rsp+20h] [rbp-8h]\n\nif ( a1 )\n{\nv4 = *(_QWORD *)(a1 + 8);\nv3 = *(_QWORD *)(v4 + 8);\n*(_QWORD *)(v4 + 8) = 0LL;\nfor ( i = v3; i; v3 = i )\n{\ni = *(_QWORD *)(v3 + 8);\n*(_QWORD *)(v3 + 8) = v4;\nv4 = v3;\n}\nresult = a1;\n*(_QWORD *)(a1 + 8) = v4;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func6(__int64 a1)\n{\n__int64 result; // rax\n__int64 i; // [rsp+10h] [rbp-18h]\n__int64 v3; // [rsp+18h] [rbp-10h]\n__int64 v4; // [rsp+20h] [rbp-8h]\n\nif ( a1 )\n{\nv4 = *(_QWORD *)(a1 + 8);\nv3 = *(_QWORD *)(v4 + 8);\n*(_QWORD *)(v4 + 8) = 0LL;\nfor ( i = v3; i; v3 = i )\n{\ni = *(_QWORD *)(v3 + 8);\n*(_QWORD *)(v3 + 8) = v4;\nv4 = v3;\n}\nresult = a1;\n*(_QWORD *)(a1 + 8) = v4;\n}\nreturn result;\n}",
"original_code": "void reverseList(list *l)\n{\n if(l == ((void *)0))\n return;\n list *p1 = l->next;\n list *p2 = p1->next;\n p1->next = ((void *)0);\n list *pTemp = p2;\n while(pTemp != ((void *)0))\n {\n pTemp = p2->next;\n p2->next = p1;\n p1 = p2;\n p2 = pTemp;\n }\n l->next = p1;\n}",
"canonical_original_code": "void reverseList(struct _list *l)\n{\n if(l == ((void *)0))\n return;\n struct _list *p1 = l->next;\n struct _list *p2 = p1->next;\n p1->next = ((void *)0);\n struct _list *pTemp = p2;\n while(pTemp != ((void *)0))\n {\n pTemp = p2->next;\n p2->next = p1;\n p1 = p2;\n p2 = pTemp;\n }\n l->next = p1;\n}",
"variable_types": [
[
"l",
"struct _list { int item; struct _list *next; } *"
],
[
"p1",
"struct _list { int item; struct _list *next; } *"
],
[
"p2",
"struct _list { int item; struct _list *next; } *"
],
[
"pTemp",
"struct _list { int item; struct _list *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _list { int item; struct _list *next; }"
],
"binary_hash": "f0fbae09c9584d4d599b2f6361101e0df5d5fdcc1cc3ffcf1597bc6a65d31d3a"
},
{
"name": "hashCode",
"canonical_name": "func7",
"repo": "norlanliu/data-structure",
"decompiled_code": "__int64 __fastcall hashCode(int a1)\n{\nreturn (unsigned int)(a1 + 31);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(int a1)\n{\nreturn (unsigned int)(a1 + 31);\n}",
"original_code": "static int hashCode(item_type item)\n{\n return 31 + item;\n}",
"canonical_original_code": "static int hashCode(int item)\n{\n return 31 + item;\n}",
"variable_types": [
[
"item",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "f0fbae09c9584d4d599b2f6361101e0df5d5fdcc1cc3ffcf1597bc6a65d31d3a"
},
{
"name": "remove_duplication",
"canonical_name": "func8",
"repo": "norlanliu/data-structure",
"decompiled_code": "int __fastcall remove_duplication(__int64 a1)\n{\nint v3; // [rsp+18h] [rbp-18h]\n__int64 v4; // [rsp+20h] [rbp-10h]\nint v5; // [rsp+28h] [rbp-8h]\n\nv5 = clock();\nv4 = hashmap_initialize(13LL, hashCode);\nwhile ( *(_QWORD *)(a1 + 8) )\n{\nif ( (int)hashmap_put(v4, **(unsigned int **)(a1 + 8), 0LL) >= 0 )\na1 = *(_QWORD *)(a1 + 8);\nelse\ndeleteItem(a1, **(_DWORD **)(a1 + 8));\n}\nv3 = clock();\nreturn printf(\"Total time taken by CPU is %f\\n\", (double)(v3 - v5) / 1000000.0);\n}\n",
"canonical_decompiled_code": "int __fastcall func8(__int64 a1)\n{\nint v3; // [rsp+18h] [rbp-18h]\n__int64 v4; // [rsp+20h] [rbp-10h]\nint v5; // [rsp+28h] [rbp-8h]\n\nv5 = clock();\nv4 = hashmap_initialize(13LL, hashCode);\nwhile ( *(_QWORD *)(a1 + 8) )\n{\nif ( (int)hashmap_put(v4, **(unsigned int **)(a1 + 8), 0LL) >= 0 )\na1 = *(_QWORD *)(a1 + 8);\nelse\nfunc3(a1, **(_DWORD **)(a1 + 8));\n}\nv3 = clock();\nreturn printf(\"Total time taken by CPU is %f\\n\", (double)(v3 - v5) / 1000000.0);\n}",
"original_code": "void remove_duplication(list *l)\n{\n clock_t start = clock();\n hashmap_t *map = hashmap_initialize(13, &hashCode);\n while(l->next != ((void *)0))\n {\n if(hashmap_put(map, l->next->item, 0) < 0 )\n deleteItem(l, l->next->item);\n else\n l = l->next;\n }\n clock_t end = clock();\n printf(\"Total time taken by CPU is %f\\n\", (double)(end-start)/((__clock_t) 1000000));\n}",
"canonical_original_code": "void remove_duplication(struct _list *l)\n{\n long start = clock();\n struct _hashmap *map = hashmap_initialize(13, &hashCode);\n while(l->next != ((void *)0))\n {\n if(hashmap_put(map, l->next->item, 0) < 0 )\n deleteItem(l, l->next->item);\n else\n l = l->next;\n }\n long end = clock();\n printf(\"Total time taken by CPU is %f\\n\", (double)(end-start)/((long) 1000000));\n}",
"variable_types": [
[
"l",
"struct _list { int item; struct _list *next; } *"
],
[
"start",
"long"
],
[
"map",
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list { int hash; int key; int value; struct _linked_list *next; } **table; } *"
],
[
"end",
"long"
]
],
"return_type": "void",
"user_defined_types": [
"struct _list { int item; struct _list *next; }",
"struct _hashmap { int size; int threshold; int hash_base; int table_capability; int (*hash_code)(int); struct _linked_list **table; }",
"struct _linked_list { int hash; int key; int value; struct _linked_list *next; }"
],
"binary_hash": "f0fbae09c9584d4d599b2f6361101e0df5d5fdcc1cc3ffcf1597bc6a65d31d3a"
}
] |
c7db6cbf1eb8f8eb2c6b52725eb05681200eaa0e9960b306bafe0f2a4cb6b4a1 | diekmann/C_MemoryManagementManager | [
[
"GenericMemoryManager_malloc_f",
"->"
],
[
"GenericMemoryManager_free_f",
"->"
],
[
"GenericMemoryManager_print_stats",
"->"
],
[
"GenericMemoryManager_delete",
"->"
]
] | [] | [
{
"name": "GenericMemoryManager_malloc_f",
"canonical_name": "func0",
"repo": "diekmann/C_MemoryManagementManager",
"decompiled_code": "void *__fastcall GenericMemoryManager_malloc_f(size_t *a1)\n{\n_DWORD *v2; // [rsp+18h] [rbp-28h]\nvoid *v3; // [rsp+20h] [rbp-20h]\nint v4; // [rsp+2Ch] [rbp-14h]\nsize_t v5; // [rsp+30h] [rbp-10h]\nsize_t v6; // [rsp+38h] [rbp-8h]\n\nv3 = malloc(*a1);\nprintf(\"[INFO] allocated %zu bytes of memory at %p\\n\", *a1, v3);\n++*((_DWORD *)a1 + 2);\nv6 = a1[2];\nv5 = v6;\nwhile ( v6 )\n{\nv5 = v6;\nv6 = *(_QWORD *)(v6 + 16);\n}\nv2 = malloc(0x18uLL);\nif ( v5 )\n{\n*(_QWORD *)(v5 + 16) = v2;\nv4 = *(_DWORD *)(v5 + 8) + 1;\n}\nelse\n{\na1[2] = (size_t)v2;\nv4 = 0;\n}\n*(_QWORD *)v2 = v3;\nv2[2] = v4;\nreturn v3;\n}\n",
"canonical_decompiled_code": "void *__fastcall func0(size_t *a1)\n{\n_DWORD *v2; // [rsp+18h] [rbp-28h]\nvoid *v3; // [rsp+20h] [rbp-20h]\nint v4; // [rsp+2Ch] [rbp-14h]\nsize_t v5; // [rsp+30h] [rbp-10h]\nsize_t v6; // [rsp+38h] [rbp-8h]\n\nv3 = malloc(*a1);\nprintf(\"[INFO] allocated %zu bytes of memory at %p\\n\", *a1, v3);\n++*((_DWORD *)a1 + 2);\nv6 = a1[2];\nv5 = v6;\nwhile ( v6 )\n{\nv5 = v6;\nv6 = *(_QWORD *)(v6 + 16);\n}\nv2 = malloc(0x18uLL);\nif ( v5 )\n{\n*(_QWORD *)(v5 + 16) = v2;\nv4 = *(_DWORD *)(v5 + 8) + 1;\n}\nelse\n{\na1[2] = (size_t)v2;\nv4 = 0;\n}\n*(_QWORD *)v2 = v3;\nv2[2] = v4;\nreturn v3;\n}",
"original_code": "void* GenericMemoryManager_malloc_f(struct GenericMemoryManager* this)\n{\n void *m = malloc(this->memsize);\n printf(\"[INFO] allocated %zu bytes of memory at %p\\n\", this->memsize, m);\n ++this->malloc_stats;\n {\n struct ManagedMemoryArea_list* current = this->mamanged_memory_chunks;\n struct ManagedMemoryArea_list* head = current;\n for(; current; current = current->next){\n head = current;\n }\n struct ManagedMemoryArea_list *new = malloc((sizeof(struct ManagedMemoryArea_list)));\n int id;\n if(head == ((void *)0)){\n this->mamanged_memory_chunks = new;\n id = 0;\n }else{\n head->next = new;\n id = head->elem.id + 1;\n }\n new->elem.start = m;\n new->elem.id = id;\n }\n return m;\n}",
"canonical_original_code": "void *GenericMemoryManager_malloc_f(struct GenericMemoryManager *this)\n{\n void *m = malloc(this->memsize);\n printf(\"[INFO] allocated %zu bytes of memory at %p\\n\", this->memsize, m);\n ++this->malloc_stats;\n {\n struct ManagedMemoryArea_list *current = this->mamanged_memory_chunks;\n struct ManagedMemoryArea_list *head = current;\n for(; current; current = current->next){\n head = current;\n }\n struct ManagedMemoryArea_list *new = malloc((sizeof(struct ManagedMemoryArea_list)));\n int id;\n if(head == ((void *)0)){\n this->mamanged_memory_chunks = new;\n id = 0;\n }else{\n head->next = new;\n id = head->elem.id + 1;\n }\n new->elem.start = m;\n new->elem.id = id;\n }\n return m;\n}",
"variable_types": [
[
"this",
"struct GenericMemoryManager { unsigned long memsize; unsigned int malloc_stats; unsigned int free_stats; struct ManagedMemoryArea_list { struct ManagedMemoryArea { void *start; unsigned int id; } elem; struct ManagedMemoryArea_list *next; } *mamanged_memory_chunks; } *"
],
[
"m",
"void *"
],
[
"current",
"struct ManagedMemoryArea_list { struct ManagedMemoryArea { void *start; unsigned int id; } elem; struct ManagedMemoryArea_list *next; } *"
],
[
"head",
"struct ManagedMemoryArea_list { struct ManagedMemoryArea { void *start; unsigned int id; } elem; struct ManagedMemoryArea_list *next; } *"
],
[
"new",
"struct ManagedMemoryArea_list { struct ManagedMemoryArea { void *start; unsigned int id; } elem; struct ManagedMemoryArea_list *next; } *"
],
[
"id",
"int"
]
],
"return_type": "void *",
"user_defined_types": [
"struct GenericMemoryManager { unsigned long memsize; unsigned int malloc_stats; unsigned int free_stats; struct ManagedMemoryArea_list *mamanged_memory_chunks; }",
"struct ManagedMemoryArea_list { struct ManagedMemoryArea elem; struct ManagedMemoryArea_list *next; }",
"struct ManagedMemoryArea { void *start; unsigned int id; }"
],
"binary_hash": "c7db6cbf1eb8f8eb2c6b52725eb05681200eaa0e9960b306bafe0f2a4cb6b4a1"
},
{
"name": "GenericMemoryManager_free_f",
"canonical_name": "func1",
"repo": "diekmann/C_MemoryManagementManager",
"decompiled_code": "size_t *__fastcall GenericMemoryManager_free_f(size_t *a1, void *a2)\n{\nsize_t *result; // rax\nint v3; // [rsp+1Ch] [rbp-14h]\n_QWORD *v4; // [rsp+20h] [rbp-10h]\n_QWORD *ptr; // [rsp+28h] [rbp-8h]\n\nprintf(\"[INFO] freeing %zu bytes of memory at %p\\n\", *a1, a2);\nbzero(a2, *a1);\nptr = (_QWORD *)a1[2];\nv4 = 0LL;\nv3 = 0;\nwhile ( ptr )\n{\nif ( a2 == (void *)*ptr )\n{\nprintf(\"[INFO] free: found memory with id %d\\n\", *((unsigned int *)ptr + 2));\nv3 = 1;\nbreak;\n}\nv4 = ptr;\nptr = (_QWORD *)ptr[2];\n}\nif ( v3 )\n{\nif ( v4 )\nv4[2] = ptr[2];\nelse\na1[2] = 0LL;\nfree(ptr);\n}\nelse\n{\nprintf(\"[ERROR] memory at %p not managed by this manager!\\n\", a2);\n}\nfree(a2);\nresult = a1;\n++*((_DWORD *)a1 + 3);\nreturn result;\n}\n",
"canonical_decompiled_code": "size_t *__fastcall func1(size_t *a1, void *a2)\n{\nsize_t *result; // rax\nint v3; // [rsp+1Ch] [rbp-14h]\n_QWORD *v4; // [rsp+20h] [rbp-10h]\n_QWORD *ptr; // [rsp+28h] [rbp-8h]\n\nprintf(\"[INFO] freeing %zu bytes of memory at %p\\n\", *a1, a2);\nbzero(a2, *a1);\nptr = (_QWORD *)a1[2];\nv4 = 0LL;\nv3 = 0;\nwhile ( ptr )\n{\nif ( a2 == (void *)*ptr )\n{\nprintf(\"[INFO] free: found memory with id %d\\n\", *((unsigned int *)ptr + 2));\nv3 = 1;\nbreak;\n}\nv4 = ptr;\nptr = (_QWORD *)ptr[2];\n}\nif ( v3 )\n{\nif ( v4 )\nv4[2] = ptr[2];\nelse\na1[2] = 0LL;\nfree(ptr);\n}\nelse\n{\nprintf(\"[ERROR] memory at %p not managed by this manager!\\n\", a2);\n}\nfree(a2);\nresult = a1;\n++*((_DWORD *)a1 + 3);\nreturn result;\n}",
"original_code": "void GenericMemoryManager_free_f(struct GenericMemoryManager* this, void* m)\n{\n printf(\"[INFO] freeing %zu bytes of memory at %p\\n\", this->memsize, m);\n bzero(m, this->memsize);\n {\n struct ManagedMemoryArea_list* current = this->mamanged_memory_chunks;\n struct ManagedMemoryArea_list* prev = ((void *)0);\n int found = 0;\n for(; current; current = current->next){\n if(current->elem.start == m){\n printf(\"[INFO] free: found memory with id %d\\n\", current->elem.id);\n found = 1;\n break;\n }\n prev = current;\n }\n if(found){\n if(prev){\n prev->next = current->next;\n }else{\n this->mamanged_memory_chunks = ((void *)0);\n }\n free(current);\n }else{\n printf(\"[ERROR] memory at %p not managed by this manager!\\n\", m);\n }\n }\n free(m);\n ++this->free_stats;\n}",
"canonical_original_code": "void GenericMemoryManager_free_f(struct GenericMemoryManager *this, void *m)\n{\n printf(\"[INFO] freeing %zu bytes of memory at %p\\n\", this->memsize, m);\n bzero(m, this->memsize);\n {\n struct ManagedMemoryArea_list *current = this->mamanged_memory_chunks;\n struct ManagedMemoryArea_list *prev = ((void *)0);\n int found = 0;\n for(; current; current = current->next){\n if(current->elem.start == m){\n printf(\"[INFO] free: found memory with id %d\\n\", current->elem.id);\n found = 1;\n break;\n }\n prev = current;\n }\n if(found){\n if(prev){\n prev->next = current->next;\n }else{\n this->mamanged_memory_chunks = ((void *)0);\n }\n free(current);\n }else{\n printf(\"[ERROR] memory at %p not managed by this manager!\\n\", m);\n }\n }\n free(m);\n ++this->free_stats;\n}",
"variable_types": [
[
"this",
"struct GenericMemoryManager { unsigned long memsize; unsigned int malloc_stats; unsigned int free_stats; struct ManagedMemoryArea_list { struct ManagedMemoryArea { void *start; unsigned int id; } elem; struct ManagedMemoryArea_list *next; } *mamanged_memory_chunks; } *"
],
[
"m",
"void *"
],
[
"current",
"struct ManagedMemoryArea_list { struct ManagedMemoryArea { void *start; unsigned int id; } elem; struct ManagedMemoryArea_list *next; } *"
],
[
"prev",
"struct ManagedMemoryArea_list { struct ManagedMemoryArea { void *start; unsigned int id; } elem; struct ManagedMemoryArea_list *next; } *"
],
[
"found",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct GenericMemoryManager { unsigned long memsize; unsigned int malloc_stats; unsigned int free_stats; struct ManagedMemoryArea_list *mamanged_memory_chunks; }",
"struct ManagedMemoryArea_list { struct ManagedMemoryArea elem; struct ManagedMemoryArea_list *next; }",
"struct ManagedMemoryArea { void *start; unsigned int id; }"
],
"binary_hash": "c7db6cbf1eb8f8eb2c6b52725eb05681200eaa0e9960b306bafe0f2a4cb6b4a1"
},
{
"name": "GenericMemoryManager_print_stats",
"canonical_name": "func2",
"repo": "diekmann/C_MemoryManagementManager",
"decompiled_code": "__int64 __fastcall GenericMemoryManager_print_stats(__int64 a1)\n{\n__int64 result; // rax\n__int64 i; // [rsp+18h] [rbp-8h]\n\nprintf(\"Num malloc: %u, Num free: %u \\n\", *(unsigned int *)(a1 + 8), *(unsigned int *)(a1 + 12));\nputs(\"Managed chunks:\");\nresult = *(_QWORD *)(a1 + 16);\nfor ( i = result; i; i = result )\n{\nprintf(\" id: %u\\n\", *(unsigned int *)(i + 8));\nresult = *(_QWORD *)(i + 16);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1)\n{\n__int64 result; // rax\n__int64 i; // [rsp+18h] [rbp-8h]\n\nprintf(\"Num malloc: %u, Num free: %u \\n\", *(unsigned int *)(a1 + 8), *(unsigned int *)(a1 + 12));\nputs(\"Managed chunks:\");\nresult = *(_QWORD *)(a1 + 16);\nfor ( i = result; i; i = result )\n{\nprintf(\" id: %u\\n\", *(unsigned int *)(i + 8));\nresult = *(_QWORD *)(i + 16);\n}\nreturn result;\n}",
"original_code": "void GenericMemoryManager_print_stats(struct GenericMemoryManager* this)\n{\n printf(\"Num malloc: %u, Num free: %u \\n\", this->malloc_stats, this->free_stats);\n printf(\"Managed chunks:\\n\");\n struct ManagedMemoryArea_list* current = this->mamanged_memory_chunks;\n for(; current; current = current->next){\n printf(\" id: %u\\n\", current->elem.id);\n }\n}",
"canonical_original_code": "void GenericMemoryManager_print_stats(struct GenericMemoryManager *this)\n{\n printf(\"Num malloc: %u, Num free: %u \\n\", this->malloc_stats, this->free_stats);\n printf(\"Managed chunks:\\n\");\n struct ManagedMemoryArea_list *current = this->mamanged_memory_chunks;\n for(; current; current = current->next){\n printf(\" id: %u\\n\", current->elem.id);\n }\n}",
"variable_types": [
[
"this",
"struct GenericMemoryManager { unsigned long memsize; unsigned int malloc_stats; unsigned int free_stats; struct ManagedMemoryArea_list { struct ManagedMemoryArea { void *start; unsigned int id; } elem; struct ManagedMemoryArea_list *next; } *mamanged_memory_chunks; } *"
],
[
"current",
"struct ManagedMemoryArea_list { struct ManagedMemoryArea { void *start; unsigned int id; } elem; struct ManagedMemoryArea_list *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct GenericMemoryManager { unsigned long memsize; unsigned int malloc_stats; unsigned int free_stats; struct ManagedMemoryArea_list *mamanged_memory_chunks; }",
"struct ManagedMemoryArea_list { struct ManagedMemoryArea elem; struct ManagedMemoryArea_list *next; }",
"struct ManagedMemoryArea { void *start; unsigned int id; }"
],
"binary_hash": "c7db6cbf1eb8f8eb2c6b52725eb05681200eaa0e9960b306bafe0f2a4cb6b4a1"
},
{
"name": "GenericMemoryManager_delete",
"canonical_name": "func3",
"repo": "diekmann/C_MemoryManagementManager",
"decompiled_code": "void __fastcall GenericMemoryManager_delete(_QWORD *a1)\n{\nprintf(\"[INFO] Deleting GenericMemoryManager at %p for memory of size %zu\\n\", a1, *a1);\nif ( a1[2] )\n{\nputs(\"[ERROR] Memory Mamanager still has managed memory chunks, cannot delete\");\n}\nelse\n{\nif ( *((_DWORD *)a1 + 2) != *((_DWORD *)a1 + 3) )\nputs(\"[ERROR] numer of frees neq number of mallocs\");\nfree(a1);\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func3(_QWORD *a1)\n{\nprintf(\"[INFO] Deleting GenericMemoryManager at %p for memory of size %zu\\n\", a1, *a1);\nif ( a1[2] )\n{\nputs(\"[ERROR] Memory Mamanager still has managed memory chunks, cannot delete\");\n}\nelse\n{\nif ( *((_DWORD *)a1 + 2) != *((_DWORD *)a1 + 3) )\nputs(\"[ERROR] numer of frees neq number of mallocs\");\nfree(a1);\n}\n}",
"original_code": "void GenericMemoryManager_delete(struct GenericMemoryManager *this)\n{\n printf(\"[INFO] Deleting GenericMemoryManager at %p for memory of size\"\n \" %zu\\n\", this, this->memsize);\n if(this->mamanged_memory_chunks != ((void *)0)){\n printf(\"[ERROR] Memory Mamanager still has managed memory chunks, cannot delete\\n\");\n }else{\n if(this->malloc_stats != this->free_stats){\n printf(\"[ERROR] numer of frees neq number of mallocs\\n\");\n }\n free(this);\n }\n}",
"canonical_original_code": "void GenericMemoryManager_delete(struct GenericMemoryManager *this)\n{\n printf(\"[INFO] Deleting GenericMemoryManager at %p for memory of size\"\n \" %zu\\n\", this, this->memsize);\n if(this->mamanged_memory_chunks != ((void *)0)){\n printf(\"[ERROR] Memory Mamanager still has managed memory chunks, cannot delete\\n\");\n }else{\n if(this->malloc_stats != this->free_stats){\n printf(\"[ERROR] numer of frees neq number of mallocs\\n\");\n }\n free(this);\n }\n}",
"variable_types": [
[
"this",
"struct GenericMemoryManager { unsigned long memsize; unsigned int malloc_stats; unsigned int free_stats; struct ManagedMemoryArea_list { struct ManagedMemoryArea { void *start; unsigned int id; } elem; struct ManagedMemoryArea_list *next; } *mamanged_memory_chunks; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct GenericMemoryManager { unsigned long memsize; unsigned int malloc_stats; unsigned int free_stats; struct ManagedMemoryArea_list *mamanged_memory_chunks; }",
"struct ManagedMemoryArea_list { struct ManagedMemoryArea elem; struct ManagedMemoryArea_list *next; }",
"struct ManagedMemoryArea { void *start; unsigned int id; }"
],
"binary_hash": "c7db6cbf1eb8f8eb2c6b52725eb05681200eaa0e9960b306bafe0f2a4cb6b4a1"
}
] |
98ec3f6c182230eedda72a9be094cdf12fd375d454c714a43536c8f80ee4ad3a | NKI-GCF/b6 | [
[
"bit_count",
"->",
"tr_x32b2"
],
[
"uo_atox32b2",
"->"
],
[
"uo_x32b2toa",
"->"
],
[
"atox32b2",
"->",
"main"
],
[
"x32b2toa",
"->",
"tr_x32b2"
],
[
"test_b6",
"->",
"main"
],
[
"tr_x32b2",
"->",
"x32b2toa",
"bit_count",
"main"
],
[
"main",
"->",
"test_b6",
"atox32b2",
"tr_x32b2"
]
] | [] | [
{
"name": "bit_count",
"canonical_name": "func0",
"repo": "NKI-GCF/b6",
"decompiled_code": "unsigned __int64 __fastcall bit_count(unsigned __int64 a1)\n{\nunsigned __int64 v2; // [rsp+0h] [rbp-8h]\n\nv2 = (((a1 - ((a1 >> 1) & 0x5555555555555555LL)) >> 2) & 0x3333333333333333LL)\n+ ((a1 - ((a1 >> 1) & 0x5555555555555555LL)) & 0x3333333333333333LL);\nreturn (0x101010101010101LL * ((v2 + (v2 >> 4)) & 0xF0F0F0F0F0F0F0FLL)) >> 56;\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func0(unsigned __int64 a1)\n{\nunsigned __int64 v2; // [rsp+0h] [rbp-8h]\n\nv2 = (((a1 - ((a1 >> 1) & 0x5555555555555555LL)) >> 2) & 0x3333333333333333LL)\n+ ((a1 - ((a1 >> 1) & 0x5555555555555555LL)) & 0x3333333333333333LL);\nreturn (0x101010101010101LL * ((v2 + (v2 >> 4)) & 0xF0F0F0F0F0F0F0FLL)) >> 56;\n}",
"original_code": "static inline ulong bit_count(ulong x)\n{\n x -= (x>>1) & 0x5555555555555555UL;\n x = ((x>>2) & 0x3333333333333333UL) + (x & 0x3333333333333333UL);\n x = ((x>>4) + x) & 0x0f0f0f0f0f0f0f0fUL;\n x *= 0x0101010101010101UL;\n return x>>56;\n}",
"canonical_original_code": "static inline unsigned long bit_count(unsigned long x)\n{\n x -= (x>>1) & 0x5555555555555555UL;\n x = ((x>>2) & 0x3333333333333333UL) + (x & 0x3333333333333333UL);\n x = ((x>>4) + x) & 0x0f0f0f0f0f0f0f0fUL;\n x *= 0x0101010101010101UL;\n return x>>56;\n}",
"variable_types": [
[
"x",
"unsigned long"
]
],
"return_type": "unsigned long",
"user_defined_types": [],
"binary_hash": "98ec3f6c182230eedda72a9be094cdf12fd375d454c714a43536c8f80ee4ad3a"
},
{
"name": "uo_atox32b2",
"canonical_name": "func1",
"repo": "NKI-GCF/b6",
"decompiled_code": "__int64 __fastcall uo_atox32b2(unsigned int a1, int a2, unsigned __int64 *a3)\n{\nunsigned __int64 v4; // [rsp+10h] [rbp-20h]\n__int64 v5; // [rsp+10h] [rbp-20h]\n__int64 v6; // [rsp+10h] [rbp-20h]\nunsigned __int64 v7; // [rsp+18h] [rbp-18h]\nunsigned __int64 v8; // [rsp+18h] [rbp-18h]\nunsigned __int64 v9; // [rsp+18h] [rbp-18h]\nunsigned __int64 v10; // [rsp+18h] [rbp-18h]\nunsigned __int64 v11; // [rsp+18h] [rbp-18h]\n__int64 v12; // [rsp+18h] [rbp-18h]\nunsigned __int64 v13; // [rsp+18h] [rbp-18h]\nunsigned __int64 v14; // [rsp+18h] [rbp-18h]\n__int64 v15; // [rsp+18h] [rbp-18h]\nunsigned __int64 v16; // [rsp+18h] [rbp-18h]\nunsigned __int64 v17; // [rsp+18h] [rbp-18h]\n__int64 v18; // [rsp+18h] [rbp-18h]\n__int64 v19; // [rsp+20h] [rbp-10h]\n\nv19 = 0x101010101010101LL * a1;\nv7 = (((*a3 | 0x3131313131313131LL) ^ 0x7575757575757575LL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (*a3 | 0x3131313131313131LL) ^ 0x7575757575757575LL;\nv8 = ~((((v7 >> 2) & 0x303030303030303LL | v7) >> 1) & 0x101010101010101LL | (v7 >> 2) & 0x303030303030303LL | v7) & 0x101010101010101LL;\nv9 = v19 ^ *a3 ^ ((a2 == 17 ? v8 : 0) | (16 * v8));\n*a3 = v9 & 0xF9F9F9F9F9F9F9F9LL;\nv4 = v9 >> 1;\nv10 = (((a3[1] | 0x3131313131313131LL) ^ 0x7575757575757575LL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (a3[1] | 0x3131313131313131LL) ^ 0x7575757575757575LL;\nv11 = ~((((v10 >> 2) & 0x303030303030303LL | v10) >> 1) & 0x101010101010101LL | (v10 >> 2) & 0x303030303030303LL | v10) & 0x101010101010101LL;\nv12 = v19 ^ a3[1] ^ ((a2 == 17 ? v11 : 0) | (16 * v11));\na3[1] = v12 & 0xF9F9F9F9F9F9F9F9LL;\nv5 = (2 * v12) | v4;\nv13 = (((a3[2] | 0x3131313131313131LL) ^ 0x7575757575757575LL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (a3[2] | 0x3131313131313131LL) ^ 0x7575757575757575LL;\nv14 = ~((((v13 >> 2) & 0x303030303030303LL | v13) >> 1) & 0x101010101010101LL | (v13 >> 2) & 0x303030303030303LL | v13) & 0x101010101010101LL;\nv15 = v19 ^ a3[2] ^ ((a2 == 17 ? v14 : 0) | (16 * v14));\na3[2] = v15 & 0xF9F9F9F9F9F9F9F9LL;\nv6 = (8 * v15) | v5;\nv16 = (((a3[3] | 0x3131313131313131LL) ^ 0x7575757575757575LL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (a3[3] | 0x3131313131313131LL) ^ 0x7575757575757575LL;\nv17 = ~((((v16 >> 2) & 0x303030303030303LL | v16) >> 1) & 0x101010101010101LL | (v16 >> 2) & 0x303030303030303LL | v16) & 0x101010101010101LL;\nv18 = v19 ^ a3[3] ^ ((a2 == 17 ? v17 : 0) | (16 * v17));\na3[3] = v18 & 0xF9F9F9F9F9F9F9F9LL;\nreturn (32 * v18) | v6;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(unsigned int a1, int a2, unsigned __int64 *a3)\n{\nunsigned __int64 v4; // [rsp+10h] [rbp-20h]\n__int64 v5; // [rsp+10h] [rbp-20h]\n__int64 v6; // [rsp+10h] [rbp-20h]\nunsigned __int64 v7; // [rsp+18h] [rbp-18h]\nunsigned __int64 v8; // [rsp+18h] [rbp-18h]\nunsigned __int64 v9; // [rsp+18h] [rbp-18h]\nunsigned __int64 v10; // [rsp+18h] [rbp-18h]\nunsigned __int64 v11; // [rsp+18h] [rbp-18h]\n__int64 v12; // [rsp+18h] [rbp-18h]\nunsigned __int64 v13; // [rsp+18h] [rbp-18h]\nunsigned __int64 v14; // [rsp+18h] [rbp-18h]\n__int64 v15; // [rsp+18h] [rbp-18h]\nunsigned __int64 v16; // [rsp+18h] [rbp-18h]\nunsigned __int64 v17; // [rsp+18h] [rbp-18h]\n__int64 v18; // [rsp+18h] [rbp-18h]\n__int64 v19; // [rsp+20h] [rbp-10h]\n\nv19 = 0x101010101010101LL * a1;\nv7 = (((*a3 | 0x3131313131313131LL) ^ 0x7575757575757575LL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (*a3 | 0x3131313131313131LL) ^ 0x7575757575757575LL;\nv8 = ~((((v7 >> 2) & 0x303030303030303LL | v7) >> 1) & 0x101010101010101LL | (v7 >> 2) & 0x303030303030303LL | v7) & 0x101010101010101LL;\nv9 = v19 ^ *a3 ^ ((a2 == 17 ? v8 : 0) | (16 * v8));\n*a3 = v9 & 0xF9F9F9F9F9F9F9F9LL;\nv4 = v9 >> 1;\nv10 = (((a3[1] | 0x3131313131313131LL) ^ 0x7575757575757575LL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (a3[1] | 0x3131313131313131LL) ^ 0x7575757575757575LL;\nv11 = ~((((v10 >> 2) & 0x303030303030303LL | v10) >> 1) & 0x101010101010101LL | (v10 >> 2) & 0x303030303030303LL | v10) & 0x101010101010101LL;\nv12 = v19 ^ a3[1] ^ ((a2 == 17 ? v11 : 0) | (16 * v11));\na3[1] = v12 & 0xF9F9F9F9F9F9F9F9LL;\nv5 = (2 * v12) | v4;\nv13 = (((a3[2] | 0x3131313131313131LL) ^ 0x7575757575757575LL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (a3[2] | 0x3131313131313131LL) ^ 0x7575757575757575LL;\nv14 = ~((((v13 >> 2) & 0x303030303030303LL | v13) >> 1) & 0x101010101010101LL | (v13 >> 2) & 0x303030303030303LL | v13) & 0x101010101010101LL;\nv15 = v19 ^ a3[2] ^ ((a2 == 17 ? v14 : 0) | (16 * v14));\na3[2] = v15 & 0xF9F9F9F9F9F9F9F9LL;\nv6 = (8 * v15) | v5;\nv16 = (((a3[3] | 0x3131313131313131LL) ^ 0x7575757575757575LL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (a3[3] | 0x3131313131313131LL) ^ 0x7575757575757575LL;\nv17 = ~((((v16 >> 2) & 0x303030303030303LL | v16) >> 1) & 0x101010101010101LL | (v16 >> 2) & 0x303030303030303LL | v16) & 0x101010101010101LL;\nv18 = v19 ^ a3[3] ^ ((a2 == 17 ? v17 : 0) | (16 * v17));\na3[3] = v18 & 0xF9F9F9F9F9F9F9F9LL;\nreturn (32 * v18) | v6;\n}",
"original_code": "uint64_t\nuo_atox32b2(const na_case cs, const na_ribose r, uint64_t s[4])\n{\n uint64_t q, ret, a_to_x32b2 = atob2 * 0x0101010101010101;\n uint64_t x32cs = cs * 0x0101010101010101;\n q = x32cs ^ ({ q = a_to_x32b2 ^ (*s | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; *s ^ ((-(r == deoxy) & q) | (q << 4)); });\n *s = q & ~0x0606060606060606;\n ret = q >> 1;\n q = x32cs ^ ({ q = a_to_x32b2 ^ (s[1] | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; s[1] ^ ((-(r == deoxy) & q) | (q << 4)); });\n s[1] = q & ~0x0606060606060606;\n ret |= q << 1;\n q = x32cs ^ ({ q = a_to_x32b2 ^ (s[2] | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; s[2] ^ ((-(r == deoxy) & q) | (q << 4)); });\n s[2] = q & ~0x0606060606060606;\n ret |= q << 3;\n q = x32cs ^ ({ q = a_to_x32b2 ^ (s[3] | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; s[3] ^ ((-(r == deoxy) & q) | (q << 4)); });\n s[3] = q & ~0x0606060606060606;\n ret |= q << 5;\n return ret;\n}",
"canonical_original_code": "unsigned long uo_atox32b2(enum na_case cs, enum na_ribose r, unsigned long s[4])\n{\n unsigned long q; unsigned long ret; unsigned long a_to_x32b2 = atob2 * 0x0101010101010101;\n unsigned long x32cs = cs * 0x0101010101010101;\n q = x32cs ^ ({ q = a_to_x32b2 ^ (*s | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; *s ^ ((-(r == deoxy) & q) | (q << 4)); });\n *s = q & ~0x0606060606060606;\n ret = q >> 1;\n q = x32cs ^ ({ q = a_to_x32b2 ^ (s[1] | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; s[1] ^ ((-(r == deoxy) & q) | (q << 4)); });\n s[1] = q & ~0x0606060606060606;\n ret |= q << 1;\n q = x32cs ^ ({ q = a_to_x32b2 ^ (s[2] | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; s[2] ^ ((-(r == deoxy) & q) | (q << 4)); });\n s[2] = q & ~0x0606060606060606;\n ret |= q << 3;\n q = x32cs ^ ({ q = a_to_x32b2 ^ (s[3] | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; s[3] ^ ((-(r == deoxy) & q) | (q << 4)); });\n s[3] = q & ~0x0606060606060606;\n ret |= q << 5;\n return ret;\n}",
"variable_types": [
[
"cs",
"enum na_case { alt_case=32, uc=65, lc=97 }"
],
[
"r",
"enum na_ribose { alt_ribose=1, deoxy=17, oxy=16 }"
],
[
"s",
"unsigned long [4]"
],
[
"q",
"unsigned long"
],
[
"ret",
"unsigned long"
],
[
"a_to_x32b2",
"unsigned long"
],
[
"x32cs",
"unsigned long"
]
],
"return_type": "unsigned long",
"user_defined_types": [
"enum na_case { alt_case=32, uc=65, lc=97 }",
"enum na_ribose { alt_ribose=1, deoxy=17, oxy=16 }"
],
"binary_hash": "98ec3f6c182230eedda72a9be094cdf12fd375d454c714a43536c8f80ee4ad3a"
},
{
"name": "uo_x32b2toa",
"canonical_name": "func2",
"repo": "NKI-GCF/b6",
"decompiled_code": "__int64 __fastcall uo_x32b2toa(unsigned int a1, int a2, unsigned __int64 *a3)\n{\n__int64 result; // rax\nunsigned __int64 v4; // [rsp+18h] [rbp-28h]\nunsigned __int64 v5; // [rsp+18h] [rbp-28h]\nunsigned __int64 v6; // [rsp+18h] [rbp-28h]\nunsigned __int64 v7; // [rsp+18h] [rbp-28h]\nunsigned __int64 v8; // [rsp+18h] [rbp-28h]\nunsigned __int64 v9; // [rsp+18h] [rbp-28h]\nunsigned __int64 v10; // [rsp+18h] [rbp-28h]\nunsigned __int64 v11; // [rsp+18h] [rbp-28h]\n__int64 v12; // [rsp+20h] [rbp-20h]\n__int64 v13; // [rsp+20h] [rbp-20h]\n__int64 v14; // [rsp+20h] [rbp-20h]\n__int64 v15; // [rsp+20h] [rbp-20h]\n__int64 v16; // [rsp+28h] [rbp-18h]\nunsigned __int64 v17; // [rsp+38h] [rbp-8h]\n\nv17 = *a3;\nv16 = 0x101010101010101LL * a1;\nv12 = (2 * *a3) & 0x606060606060606LL;\nv4 = (((v12 | 0x3131313131313131LL) ^ 0x3535353535353535uLL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (v12 | 0x3131313131313131LL) ^ 0x3535353535353535LL;\nv5 = ~((((v4 >> 2) & 0x303030303030303LL | v4) >> 1) & 0x101010101010101LL | (v4 >> 2) & 0x303030303030303LL | v4) & 0x101010101010101LL;\n*a3 = v16 ^ v12 ^ ((a2 == 17 ? v5 : 0) | (16 * v5));\nv13 = (v17 >> 1) & 0x606060606060606LL;\nv6 = (((v13 | 0x3131313131313131LL) ^ 0x3535353535353535uLL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (v13 | 0x3131313131313131LL) ^ 0x3535353535353535LL;\nv7 = ~((((v6 >> 2) & 0x303030303030303LL | v6) >> 1) & 0x101010101010101LL | (v6 >> 2) & 0x303030303030303LL | v6) & 0x101010101010101LL;\na3[1] = v16 ^ v13 ^ ((a2 == 17 ? v7 : 0) | (16 * v7));\nv14 = (v17 >> 3) & 0x606060606060606LL;\nv8 = (((v14 | 0x3131313131313131LL) ^ 0x3535353535353535uLL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (v14 | 0x3131313131313131LL) ^ 0x3535353535353535LL;\nv9 = ~((((v8 >> 2) & 0x303030303030303LL | v8) >> 1) & 0x101010101010101LL | (v8 >> 2) & 0x303030303030303LL | v8) & 0x101010101010101LL;\na3[2] = v16 ^ v14 ^ ((a2 == 17 ? v9 : 0) | (16 * v9));\nv15 = (v17 >> 5) & 0x606060606060606LL;\nv10 = (((v15 | 0x3131313131313131LL) ^ 0x3535353535353535uLL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (v15 | 0x3131313131313131LL) ^ 0x3535353535353535LL;\nv11 = ~((((v10 >> 2) & 0x303030303030303LL | v10) >> 1) & 0x101010101010101LL | (v10 >> 2) & 0x303030303030303LL | v10) & 0x101010101010101LL;\nresult = v16 ^ v15 ^ ((a2 == 17 ? v11 : 0) | (16 * v11));\na3[3] = result;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(unsigned int a1, int a2, unsigned __int64 *a3)\n{\n__int64 result; // rax\nunsigned __int64 v4; // [rsp+18h] [rbp-28h]\nunsigned __int64 v5; // [rsp+18h] [rbp-28h]\nunsigned __int64 v6; // [rsp+18h] [rbp-28h]\nunsigned __int64 v7; // [rsp+18h] [rbp-28h]\nunsigned __int64 v8; // [rsp+18h] [rbp-28h]\nunsigned __int64 v9; // [rsp+18h] [rbp-28h]\nunsigned __int64 v10; // [rsp+18h] [rbp-28h]\nunsigned __int64 v11; // [rsp+18h] [rbp-28h]\n__int64 v12; // [rsp+20h] [rbp-20h]\n__int64 v13; // [rsp+20h] [rbp-20h]\n__int64 v14; // [rsp+20h] [rbp-20h]\n__int64 v15; // [rsp+20h] [rbp-20h]\n__int64 v16; // [rsp+28h] [rbp-18h]\nunsigned __int64 v17; // [rsp+38h] [rbp-8h]\n\nv17 = *a3;\nv16 = 0x101010101010101LL * a1;\nv12 = (2 * *a3) & 0x606060606060606LL;\nv4 = (((v12 | 0x3131313131313131LL) ^ 0x3535353535353535uLL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (v12 | 0x3131313131313131LL) ^ 0x3535353535353535LL;\nv5 = ~((((v4 >> 2) & 0x303030303030303LL | v4) >> 1) & 0x101010101010101LL | (v4 >> 2) & 0x303030303030303LL | v4) & 0x101010101010101LL;\n*a3 = v16 ^ v12 ^ ((a2 == 17 ? v5 : 0) | (16 * v5));\nv13 = (v17 >> 1) & 0x606060606060606LL;\nv6 = (((v13 | 0x3131313131313131LL) ^ 0x3535353535353535uLL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (v13 | 0x3131313131313131LL) ^ 0x3535353535353535LL;\nv7 = ~((((v6 >> 2) & 0x303030303030303LL | v6) >> 1) & 0x101010101010101LL | (v6 >> 2) & 0x303030303030303LL | v6) & 0x101010101010101LL;\na3[1] = v16 ^ v13 ^ ((a2 == 17 ? v7 : 0) | (16 * v7));\nv14 = (v17 >> 3) & 0x606060606060606LL;\nv8 = (((v14 | 0x3131313131313131LL) ^ 0x3535353535353535uLL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (v14 | 0x3131313131313131LL) ^ 0x3535353535353535LL;\nv9 = ~((((v8 >> 2) & 0x303030303030303LL | v8) >> 1) & 0x101010101010101LL | (v8 >> 2) & 0x303030303030303LL | v8) & 0x101010101010101LL;\na3[2] = v16 ^ v14 ^ ((a2 == 17 ? v9 : 0) | (16 * v9));\nv15 = (v17 >> 5) & 0x606060606060606LL;\nv10 = (((v15 | 0x3131313131313131LL) ^ 0x3535353535353535uLL) >> 4) & 0xF0F0F0F0F0F0F0FLL | (v15 | 0x3131313131313131LL) ^ 0x3535353535353535LL;\nv11 = ~((((v10 >> 2) & 0x303030303030303LL | v10) >> 1) & 0x101010101010101LL | (v10 >> 2) & 0x303030303030303LL | v10) & 0x101010101010101LL;\nresult = v16 ^ v15 ^ ((a2 == 17 ? v11 : 0) | (16 * v11));\na3[3] = result;\nreturn result;\n}",
"original_code": "void\nuo_x32b2toa(const na_case cs, const na_ribose r, uint64_t s[4])\n{\n uint64_t t, q, orig = *s, x32b2_to_a = b2toa * 0x0101010101010101;\n uint64_t x32cs = cs * 0x0101010101010101;\n t = (orig & 0x0303030303030303) << 1;\n *s = x32cs ^ ({ q = x32b2_to_a ^ (t | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; t ^ ((-(r == deoxy) & q) | (q << 4)); });\n t = (orig >> 1) & 0x0606060606060606;\n s[1] = x32cs ^ ({ q = x32b2_to_a ^ (t | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; t ^ ((-(r == deoxy) & q) | (q << 4)); });\n t = (orig >> 3) & 0x0606060606060606;\n s[2] = x32cs ^ ({ q = x32b2_to_a ^ (t | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; t ^ ((-(r == deoxy) & q) | (q << 4)); });\n t = (orig >> 5) & 0x0606060606060606;\n s[3] = x32cs ^ ({ q = x32b2_to_a ^ (t | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; t ^ ((-(r == deoxy) & q) | (q << 4)); });\n}",
"canonical_original_code": "void uo_x32b2toa(enum na_case cs, enum na_ribose r, unsigned long s[4])\n{\n unsigned long t; unsigned long q; unsigned long orig = *s; unsigned long x32b2_to_a = b2toa * 0x0101010101010101;\n unsigned long x32cs = cs * 0x0101010101010101;\n t = (orig & 0x0303030303030303) << 1;\n *s = x32cs ^ ({ q = x32b2_to_a ^ (t | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; t ^ ((-(r == deoxy) & q) | (q << 4)); });\n t = (orig >> 1) & 0x0606060606060606;\n s[1] = x32cs ^ ({ q = x32b2_to_a ^ (t | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; t ^ ((-(r == deoxy) & q) | (q << 4)); });\n t = (orig >> 3) & 0x0606060606060606;\n s[2] = x32cs ^ ({ q = x32b2_to_a ^ (t | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; t ^ ((-(r == deoxy) & q) | (q << 4)); });\n t = (orig >> 5) & 0x0606060606060606;\n s[3] = x32cs ^ ({ q = x32b2_to_a ^ (t | 0x3131313131313131); q |= (q & 0xf0f0f0f0f0f0f0f0) >> 4; q |= (q & 0x0c0c0c0c0c0c0c0c) >> 2; q |= (q & 0x0202020202020202) >> 1; q = (q & 0x0101010101010101) ^ 0x0101010101010101; t ^ ((-(r == deoxy) & q) | (q << 4)); });\n}",
"variable_types": [
[
"cs",
"enum na_case { alt_case=32, uc=65, lc=97 }"
],
[
"r",
"enum na_ribose { alt_ribose=1, deoxy=17, oxy=16 }"
],
[
"s",
"unsigned long [4]"
],
[
"t",
"unsigned long"
],
[
"q",
"unsigned long"
],
[
"orig",
"unsigned long"
],
[
"x32b2_to_a",
"unsigned long"
],
[
"x32cs",
"unsigned long"
]
],
"return_type": "void",
"user_defined_types": [
"enum na_case { alt_case=32, uc=65, lc=97 }",
"enum na_ribose { alt_ribose=1, deoxy=17, oxy=16 }"
],
"binary_hash": "98ec3f6c182230eedda72a9be094cdf12fd375d454c714a43536c8f80ee4ad3a"
},
{
"name": "atox32b2",
"canonical_name": "func3",
"repo": "NKI-GCF/b6",
"decompiled_code": "__int64 __fastcall atox32b2(unsigned int a1, unsigned int a2, _QWORD *a3)\n{\nunsigned int v5; // [rsp+1Ch] [rbp-14h]\nunsigned int v6; // [rsp+20h] [rbp-10h]\nunsigned int i; // [rsp+24h] [rbp-Ch]\n__int64 v8; // [rsp+28h] [rbp-8h]\n\nv8 = 0LL;\nv6 = 0;\nfor ( i = 0; i != 32; ++i )\n{\nv5 = b6(a1, a2, 117LL, (unsigned __int8)a3[i >> 3]);\nv8 |= (unsigned __int64)((v5 >> 1) & 3) << (2 * (unsigned __int8)i);\na3[i >> 3] >>= 8;\nv6 |= ((unsigned int)isb6(v5) == 0) << i;\n}\na3[3] = v6;\na3[2] = a3[3];\na3[1] = a3[2];\n*a3 = a3[1];\nreturn v8;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(unsigned int a1, unsigned int a2, _QWORD *a3)\n{\nunsigned int v5; // [rsp+1Ch] [rbp-14h]\nunsigned int v6; // [rsp+20h] [rbp-10h]\nunsigned int i; // [rsp+24h] [rbp-Ch]\n__int64 v8; // [rsp+28h] [rbp-8h]\n\nv8 = 0LL;\nv6 = 0;\nfor ( i = 0; i != 32; ++i )\n{\nv5 = b6(a1, a2, 117LL, (unsigned __int8)a3[i >> 3]);\nv8 |= (unsigned __int64)((v5 >> 1) & 3) << (2 * (unsigned __int8)i);\na3[i >> 3] >>= 8;\nv6 |= ((unsigned int)isb6(v5) == 0) << i;\n}\na3[3] = v6;\na3[2] = a3[3];\na3[1] = a3[2];\n*a3 = a3[1];\nreturn v8;\n}",
"original_code": "uint64_t\natox32b2(const na_case cs, const na_ribose r, uint64_t s[4])\n{\n uint64_t ret = 0ul;\n unsigned i, c, gotN = 0;\n for (i = 0; i != 32; ++i) {\n c = b6(cs, r, atob2, s[i >> 3] & 0xff);\n ret |= (uint64_t)((c & 6) >> 1) << (i << 1);\n s[i >> 3] >>= 8;\n gotN |= !isb6(c) << i;\n }\n s[0] = s[1] = s[2] = s[3] = gotN;\n return ret;\n}",
"canonical_original_code": "unsigned long atox32b2(enum na_case cs, enum na_ribose r, unsigned long s[4])\n{\n unsigned long ret = 0ul;\n unsigned int i; unsigned int c; unsigned int gotN = 0;\n for (i = 0; i != 32; ++i) {\n c = b6(cs, r, atob2, s[i >> 3] & 0xff);\n ret |= (unsigned long)((c & 6) >> 1) << (i << 1);\n s[i >> 3] >>= 8;\n gotN |= !isb6(c) << i;\n }\n s[0] = s[1] = s[2] = s[3] = gotN;\n return ret;\n}",
"variable_types": [
[
"cs",
"enum na_case { alt_case=32, uc=65, lc=97 }"
],
[
"r",
"enum na_ribose { alt_ribose=1, deoxy=17, oxy=16 }"
],
[
"s",
"unsigned long [4]"
],
[
"ret",
"unsigned long"
],
[
"i",
"unsigned int"
],
[
"c",
"unsigned int"
],
[
"gotN",
"unsigned int"
]
],
"return_type": "unsigned long",
"user_defined_types": [
"enum na_case { alt_case=32, uc=65, lc=97 }",
"enum na_ribose { alt_ribose=1, deoxy=17, oxy=16 }"
],
"binary_hash": "98ec3f6c182230eedda72a9be094cdf12fd375d454c714a43536c8f80ee4ad3a"
},
{
"name": "x32b2toa",
"canonical_name": "func4",
"repo": "NKI-GCF/b6",
"decompiled_code": "unsigned __int64 *__fastcall x32b2toa(unsigned int a1, unsigned int a2, unsigned __int64 *a3)\n{\nunsigned __int64 *v3; // rax\nunsigned __int64 *v4; // rdx\nunsigned __int64 *result; // rax\nunsigned __int64 v6; // rdx\nunsigned __int64 v8; // [rsp+20h] [rbp-10h]\nunsigned int i; // [rsp+2Ch] [rbp-4h]\n\nv8 = *a3;\nv3 = a3 + 3;\na3[3] = 0LL;\nv4 = a3 + 2;\n*v4 = *v3;\na3[1] = *v4;\nresult = a3;\n*a3 = a3[1];\nfor ( i = 0; i != 32; ++i )\n{\nv6 = (unsigned __int64)(unsigned int)b6(a1, a2, 53LL, (2 * (unsigned __int8)(v8 >> (2 * (unsigned __int8)i))) & 6) << ((8 * i) & 0x38);\nresult = &a3[i >> 3];\n*result |= v6;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "unsigned __int64 *__fastcall func4(unsigned int a1, unsigned int a2, unsigned __int64 *a3)\n{\nunsigned __int64 *v3; // rax\nunsigned __int64 *v4; // rdx\nunsigned __int64 *result; // rax\nunsigned __int64 v6; // rdx\nunsigned __int64 v8; // [rsp+20h] [rbp-10h]\nunsigned int i; // [rsp+2Ch] [rbp-4h]\n\nv8 = *a3;\nv3 = a3 + 3;\na3[3] = 0LL;\nv4 = a3 + 2;\n*v4 = *v3;\na3[1] = *v4;\nresult = a3;\n*a3 = a3[1];\nfor ( i = 0; i != 32; ++i )\n{\nv6 = (unsigned __int64)(unsigned int)b6(a1, a2, 53LL, (2 * (unsigned __int8)(v8 >> (2 * (unsigned __int8)i))) & 6) << ((8 * i) & 0x38);\nresult = &a3[i >> 3];\n*result |= v6;\n}\nreturn result;\n}",
"original_code": "void\nx32b2toa(const na_case cs, const na_ribose r, uint64_t s[4])\n{\n uint64_t orig = *s;\n unsigned i, c;\n s[0] = s[1] = s[2] = s[3] = 0;\n for (i = 0; i != 32; ++i) {\n c = b6(cs, r, b2toa, ((orig >> (i << 1)) << 1) & 0x6);\n s[i >> 3] |= (uint64_t)c << ((i & 7) << 3);\n }\n}",
"canonical_original_code": "void x32b2toa(enum na_case cs, enum na_ribose r, unsigned long s[4])\n{\n unsigned long orig = *s;\n unsigned int i; unsigned int c;\n s[0] = s[1] = s[2] = s[3] = 0;\n for (i = 0; i != 32; ++i) {\n c = b6(cs, r, b2toa, ((orig >> (i << 1)) << 1) & 0x6);\n s[i >> 3] |= (unsigned long)c << ((i & 7) << 3);\n }\n}",
"variable_types": [
[
"cs",
"enum na_case { alt_case=32, uc=65, lc=97 }"
],
[
"r",
"enum na_ribose { alt_ribose=1, deoxy=17, oxy=16 }"
],
[
"s",
"unsigned long [4]"
],
[
"orig",
"unsigned long"
],
[
"i",
"unsigned int"
],
[
"c",
"unsigned int"
]
],
"return_type": "void",
"user_defined_types": [
"enum na_case { alt_case=32, uc=65, lc=97 }",
"enum na_ribose { alt_ribose=1, deoxy=17, oxy=16 }"
],
"binary_hash": "98ec3f6c182230eedda72a9be094cdf12fd375d454c714a43536c8f80ee4ad3a"
},
{
"name": "test_b6",
"canonical_name": "func5",
"repo": "NKI-GCF/b6",
"decompiled_code": "int test_b6()\n{\nunsigned int v0; // eax\nunsigned int v1; // eax\nunsigned int v3; // [rsp+4h] [rbp-Ch]\nunsigned int v4; // [rsp+4h] [rbp-Ch]\nunsigned int v5; // [rsp+8h] [rbp-8h]\nunsigned int i; // [rsp+Ch] [rbp-4h]\n\nfor ( i = 0; i <= 6; i += 2 )\n{\nv5 = b6(65LL, 17LL, 53LL, i);\nv3 = b6(65LL, 17LL, 117LL, v5);\nv0 = isb6(v3);\nprintf(\"%u: %c(0x%x) :%u, isb6:%u\\n\", i, (unsigned int)(char)v5, v5, v3, v0);\n}\nv4 = b6(65LL, 17LL, 117LL, 78LL);\nv1 = isb6(v4);\nreturn printf(\"rev: %c(0x%x) => 0x%x, isb6:%u\\n\", 78LL, 78LL, v4, v1);\n}\n",
"canonical_decompiled_code": "int func5()\n{\nunsigned int v0; // eax\nunsigned int v1; // eax\nunsigned int v3; // [rsp+4h] [rbp-Ch]\nunsigned int v4; // [rsp+4h] [rbp-Ch]\nunsigned int v5; // [rsp+8h] [rbp-8h]\nunsigned int i; // [rsp+Ch] [rbp-4h]\n\nfor ( i = 0; i <= 6; i += 2 )\n{\nv5 = b6(65LL, 17LL, 53LL, i);\nv3 = b6(65LL, 17LL, 117LL, v5);\nv0 = isb6(v3);\nprintf(\"%u: %c(0x%x) :%u, isb6:%u\\n\", i, (unsigned int)(char)v5, v5, v3, v0);\n}\nv4 = b6(65LL, 17LL, 117LL, 78LL);\nv1 = isb6(v4);\nreturn printf(\"rev: %c(0x%x) => 0x%x, isb6:%u\\n\", 78LL, 78LL, v4, v1);\n}",
"original_code": "void\ntest_b6()\n{\n unsigned t, i, c;\n for (i = 0; i <= 6; i += 2) {\n c = b6(uc, deoxy, b2toa, i);\n t = b6(uc, deoxy, atob2, c);\n printf(\"%u: %c(0x%x) :%u, isb6:%u\\n\", i, (char) c, c, t, isb6(t));\n }\n c = 'N';\n t = b6(uc, deoxy, atob2, c);\n printf(\"rev: %c(0x%x) => 0x%x, isb6:%u\\n\", (char) c, c, t, isb6(t));\n}",
"canonical_original_code": "void test_b6()\n{\n unsigned int t; unsigned int i; unsigned int c;\n for (i = 0; i <= 6; i += 2) {\n c = b6(uc, deoxy, b2toa, i);\n t = b6(uc, deoxy, atob2, c);\n printf(\"%u: %c(0x%x) :%u, isb6:%u\\n\", i, (char) c, c, t, isb6(t));\n }\n c = 'N';\n t = b6(uc, deoxy, atob2, c);\n printf(\"rev: %c(0x%x) => 0x%x, isb6:%u\\n\", (char) c, c, t, isb6(t));\n}",
"variable_types": [
[
"t",
"unsigned int"
],
[
"i",
"unsigned int"
],
[
"c",
"unsigned int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "98ec3f6c182230eedda72a9be094cdf12fd375d454c714a43536c8f80ee4ad3a"
},
{
"name": "tr_x32b2",
"canonical_name": "func6",
"repo": "NKI-GCF/b6",
"decompiled_code": "int __fastcall tr_x32b2(unsigned __int64 a1, __int64 a2, const char *a3, __int64 a4, const char *a5)\n{\nunsigned __int64 v5; // rax\nunsigned __int64 v10[5]; // [rsp+30h] [rbp-30h] BYREF\nint i; // [rsp+58h] [rbp-8h]\nint j; // [rsp+5Ch] [rbp-4h]\n\nv10[1] = 0LL;\nv10[2] = 0LL;\nv10[3] = 0LL;\nv10[0] = a1;\nx32b2toa(0x41u, 0x11u, v10);\nv5 = bit_count(a2 ^ a1);\nfprintf(stderr, \"b2:%lx\\t%s:\\t%lu\\n\", a1, a5, v5);\nfor ( i = 0; i != 4; ++i )\n{\nfor ( j = 0; j != 8; ++j )\n*(_BYTE *)((unsigned int)(8 * i + j) + a4) = v10[i] >> (8 * (unsigned __int8)j);\n}\n*(_BYTE *)(a4 + 32) = 0;\nfprintf(stderr, \"%s\\n\", a3);\nreturn fprintf(stderr, \"%s\\n\\n\", (const char *)a4);\n}\n",
"canonical_decompiled_code": "int __fastcall func6(unsigned __int64 a1, __int64 a2, const char *a3, __int64 a4, const char *a5)\n{\nunsigned __int64 v5; // rax\nunsigned __int64 v10[5]; // [rsp+30h] [rbp-30h] BYREF\nint i; // [rsp+58h] [rbp-8h]\nint j; // [rsp+5Ch] [rbp-4h]\n\nv10[1] = 0LL;\nv10[2] = 0LL;\nv10[3] = 0LL;\nv10[0] = a1;\nfunc4(0x41u, 0x11u, v10);\nv5 = func0(a2 ^ a1);\nfprintf(stderr, \"b2:%lx\\t%s:\\t%lu\\n\", a1, a5, v5);\nfor ( i = 0; i != 4; ++i )\n{\nfor ( j = 0; j != 8; ++j )\n*(_BYTE *)((unsigned int)(8 * i + j) + a4) = v10[i] >> (8 * (unsigned __int8)j);\n}\n*(_BYTE *)(a4 + 32) = 0;\nfprintf(stderr, \"%s\\n\", a3);\nreturn fprintf(stderr, \"%s\\n\\n\", (const char *)a4);\n}",
"original_code": "void\ntr_x32b2(uint64_t b2, uint64_t o, const char *s, char q[33], const char *msg)\n{\n uint64_t t[4] = { 0, 0, 0, 0 };\n t[0] = b2;\n x32b2toa(uc, deoxy, &t[0]);\n fprintf(stderr, \"b2:%lx\\t%s:\\t%lu\\n\", b2, msg, bit_count(b2 ^ o));\n unsigned i, j;\n for (j = 0; j != 4; ++j) {\n for (i = 0; i != 8; ++i) {\n q[i+j*8] = (char)(t[j] >> (i*8));\n }\n }\n q[32] = '\\0';\n fprintf(stderr, \"%s\\n\", s);\n fprintf(stderr, \"%s\\n\\n\", q);\n}",
"canonical_original_code": "void tr_x32b2(unsigned long b2, unsigned long o, char *s, char q[33], char *msg)\n{\n unsigned long t[4] = { 0, 0, 0, 0 };\n t[0] = b2;\n x32b2toa(uc, deoxy, &t[0]);\n fprintf(stderr, \"b2:%lx\\t%s:\\t%lu\\n\", b2, msg, bit_count(b2 ^ o));\n unsigned int i; unsigned int j;\n for (j = 0; j != 4; ++j) {\n for (i = 0; i != 8; ++i) {\n q[i+j*8] = (char)(t[j] >> (i*8));\n }\n }\n q[32] = '\\0';\n fprintf(stderr, \"%s\\n\", s);\n fprintf(stderr, \"%s\\n\\n\", q);\n}",
"variable_types": [
[
"b2",
"unsigned long"
],
[
"o",
"unsigned long"
],
[
"s",
"char *"
],
[
"q",
"char [33]"
],
[
"msg",
"char *"
],
[
"t",
"unsigned long [4]"
],
[
"i",
"unsigned int"
],
[
"j",
"unsigned int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "98ec3f6c182230eedda72a9be094cdf12fd375d454c714a43536c8f80ee4ad3a"
},
{
"name": "main",
"canonical_name": "main",
"repo": "NKI-GCF/b6",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nunsigned __int64 v4; // rax\nunsigned __int64 v5; // rax\n__int64 v6; // [rsp+0h] [rbp-70h] BYREF\n__int64 v7; // [rsp+8h] [rbp-68h]\n__int64 v8; // [rsp+10h] [rbp-60h]\n__int64 v9; // [rsp+18h] [rbp-58h]\nchar v10[40]; // [rsp+20h] [rbp-50h] BYREF\n__int64 v11; // [rsp+48h] [rbp-28h]\n__int64 v12; // [rsp+50h] [rbp-20h]\n__int64 v13; // [rsp+58h] [rbp-18h]\nconst char *v14; // [rsp+60h] [rbp-10h]\nunsigned int i; // [rsp+68h] [rbp-8h]\nint j; // [rsp+6Ch] [rbp-4h]\n\nfwrite(\"\\nSingle character conversion:\\n\", 1uLL, 0x1EuLL, stderr);\ntest_b6();\nv14 = \"ACTGGTGCCTGCTCCAAGTTGACCATGTCACA\";\nfwrite(\"\\n32 character conversion:\\n\", 1uLL, 0x1AuLL, stderr);\nfprintf(stderr, \"%s\\n\", \"ACTGGTGCCTGCTCCAAGTTGACCATGTCACA\");\nv6 = 0LL;\nv7 = 0LL;\nv8 = 0LL;\nv9 = 0LL;\nfor ( i = 0; i != 4; ++i )\n{\nfor ( j = 0; j != 8; ++j )\n*(&v6 + i) |= (__int64)v14[8 * i + j] << (8 * (unsigned __int8)j);\n}\nv13 = atox32b2(0x41u, 0x11u, &v6);\nif ( v8 | v7 | v6 | v9 )\n{\nputs(\"Got strange characters in nucleotides\");\n}\nelse\n{\ntr_x32b2(v13, v13, v14, (__int64)v10, \"Converted back\");\nv12 = x32b2_rcpx(v13);\nfprintf(stderr, \"\\thalf template rcpx:\\t%lx\\n\", v12);\nv12 = x32b2_rcpx2(v13);\nfprintf(stderr, \"\\ttest template rcpx:\\t%lx\\n\", v12);\nv4 = x32b2_rev_rcpx2(v12);\ntr_x32b2(v4, v13, v14, (__int64)v10, \"Template, converted back from rcpx\");\nv11 = x32b2_rc(v13);\ntr_x32b2(v11, v11, v14, (__int64)v10, \"Reverse complement\");\nv12 = x32b2_rcpx(v11);\nfprintf(stderr, \"\\thalf revcomp rcpx:\\t%lx\\n\", v12);\nv12 = x32b2_rcpx2(v11);\nfprintf(stderr, \"\\ttest revcomp rcpx:\\t%lx\\n\", v12);\nv5 = x32b2_rev_rcpx2(v12);\ntr_x32b2(v5, v11, v14, (__int64)v10, \"Reverse complement, converted back from rcpx\");\nv13 ^= 0x1000uLL;\nv12 = x32b2_rcpx2(v13);\nfprintf(stderr, \"\\t[AC] <=> [TG] substtitution, rcpx:\\t%lx\\n\", v12);\nv13 ^= 0x1000uLL;\nv13 ^= 0x200000uLL;\nv12 = x32b2_rcpx2(v13);\nfprintf(stderr, \"\\t[AT] <=> [CG] substtitution, rcpx:\\t%lx\\n\", v12);\nv13 ^= 0x200000uLL;\nv13 ^= 0x30000000uLL;\nv12 = x32b2_rcpx2(v13);\nfprintf(stderr, \"\\ty/ACGT/GTAC/ substtitution, rcpx:\\t%lx\\n\", v12);\nv13 ^= 0x30000000uLL;\n}\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nunsigned __int64 v4; // rax\nunsigned __int64 v5; // rax\n__int64 v6; // [rsp+0h] [rbp-70h] BYREF\n__int64 v7; // [rsp+8h] [rbp-68h]\n__int64 v8; // [rsp+10h] [rbp-60h]\n__int64 v9; // [rsp+18h] [rbp-58h]\nchar v10[40]; // [rsp+20h] [rbp-50h] BYREF\n__int64 v11; // [rsp+48h] [rbp-28h]\n__int64 v12; // [rsp+50h] [rbp-20h]\n__int64 v13; // [rsp+58h] [rbp-18h]\nconst char *v14; // [rsp+60h] [rbp-10h]\nunsigned int i; // [rsp+68h] [rbp-8h]\nint j; // [rsp+6Ch] [rbp-4h]\n\nfwrite(\"\\nSingle character conversion:\\n\", 1uLL, 0x1EuLL, stderr);\nfunc5();\nv14 = \"ACTGGTGCCTGCTCCAAGTTGACCATGTCACA\";\nfwrite(\"\\n32 character conversion:\\n\", 1uLL, 0x1AuLL, stderr);\nfprintf(stderr, \"%s\\n\", \"ACTGGTGCCTGCTCCAAGTTGACCATGTCACA\");\nv6 = 0LL;\nv7 = 0LL;\nv8 = 0LL;\nv9 = 0LL;\nfor ( i = 0; i != 4; ++i )\n{\nfor ( j = 0; j != 8; ++j )\n*(&v6 + i) |= (__int64)v14[8 * i + j] << (8 * (unsigned __int8)j);\n}\nv13 = func3(0x41u, 0x11u, &v6);\nif ( v8 | v7 | v6 | v9 )\n{\nputs(\"Got strange characters in nucleotides\");\n}\nelse\n{\nfunc6(v13, v13, v14, (__int64)v10, \"Converted back\");\nv12 = x32b2_rcpx(v13);\nfprintf(stderr, \"\\thalf template rcpx:\\t%lx\\n\", v12);\nv12 = x32b2_rcpx2(v13);\nfprintf(stderr, \"\\ttest template rcpx:\\t%lx\\n\", v12);\nv4 = x32b2_rev_rcpx2(v12);\nfunc6(v4, v13, v14, (__int64)v10, \"Template, converted back from rcpx\");\nv11 = x32b2_rc(v13);\nfunc6(v11, v11, v14, (__int64)v10, \"Reverse complement\");\nv12 = x32b2_rcpx(v11);\nfprintf(stderr, \"\\thalf revcomp rcpx:\\t%lx\\n\", v12);\nv12 = x32b2_rcpx2(v11);\nfprintf(stderr, \"\\ttest revcomp rcpx:\\t%lx\\n\", v12);\nv5 = x32b2_rev_rcpx2(v12);\nfunc6(v5, v11, v14, (__int64)v10, \"Reverse complement, converted back from rcpx\");\nv13 ^= 0x1000uLL;\nv12 = x32b2_rcpx2(v13);\nfprintf(stderr, \"\\t[AC] <=> [TG] substtitution, rcpx:\\t%lx\\n\", v12);\nv13 ^= 0x1000uLL;\nv13 ^= 0x200000uLL;\nv12 = x32b2_rcpx2(v13);\nfprintf(stderr, \"\\t[AT] <=> [CG] substtitution, rcpx:\\t%lx\\n\", v12);\nv13 ^= 0x200000uLL;\nv13 ^= 0x30000000uLL;\nv12 = x32b2_rcpx2(v13);\nfprintf(stderr, \"\\ty/ACGT/GTAC/ substtitution, rcpx:\\t%lx\\n\", v12);\nv13 ^= 0x30000000uLL;\n}\nreturn 0;\n}",
"original_code": "int\nmain()\n{\n fprintf(stderr, \"\\nSingle character conversion:\\n\");\n test_b6();\n unsigned i, j;\n const char *s = \"ACTGGTGCCTGCTCCAAGTTGACCATGTCACA\";\n fprintf(stderr, \"\\n32 character conversion:\\n\");\n fprintf(stderr, \"%s\\n\", s);\n char q[33];\n uint64_t t[4] = { 0, 0, 0, 0 };\n for (j = 0; j != 4; ++j) {\n for (i = 0; i != 8; ++i) {\n t[j] |= (uint64_t) s[i + (j * 8)] << (i * 8);\n }\n }\n uint64_t ret = atox32b2(uc, deoxy, &t[0]);\n if (t[0] | t[1] | t[2] | t[3]) {\n printf(\"Got strange characters in nucleotides\\n\");\n return 0;\n }\n tr_x32b2(ret, ret, s, q, \"Converted back\");\n uint64_t rcpx;\n rcpx = x32b2_rcpx(ret);\n fprintf(stderr, \"\\thalf template rcpx:\\t%lx\\n\", rcpx);\n rcpx = x32b2_rcpx2(ret);\n fprintf(stderr, \"\\ttest template rcpx:\\t%lx\\n\", rcpx);\n tr_x32b2(x32b2_rev_rcpx2(rcpx), ret, s, q,\n \"Template, converted back from rcpx\");\n uint64_t rc = x32b2_rc(ret);\n tr_x32b2(rc, rc, s, q, \"Reverse complement\");\n rcpx = x32b2_rcpx(rc);\n fprintf(stderr, \"\\thalf revcomp rcpx:\\t%lx\\n\", rcpx);\n rcpx = x32b2_rcpx2(rc);\n fprintf(stderr, \"\\ttest revcomp rcpx:\\t%lx\\n\", rcpx);\n tr_x32b2(x32b2_rev_rcpx2(rcpx), rc, s, q,\n \"Reverse complement, converted back from rcpx\");\n ret ^= 0x1000;\n rcpx = x32b2_rcpx2(ret);\n fprintf(stderr, \"\\t[AC] <=> [TG] substtitution, rcpx:\\t%lx\\n\", rcpx);\n ret ^= 0x1000;\n ret ^= 0x200000;\n rcpx = x32b2_rcpx2(ret);\n fprintf(stderr, \"\\t[AT] <=> [CG] substtitution, rcpx:\\t%lx\\n\", rcpx);\n ret ^= 0x200000;\n ret ^= 0x30000000;\n rcpx = x32b2_rcpx2(ret);\n fprintf(stderr, \"\\ty/ACGT/GTAC/ substtitution, rcpx:\\t%lx\\n\", rcpx);\n ret ^= 0x30000000;\n return 0;\n}",
"canonical_original_code": "int main()\n{\n fprintf(stderr, \"\\nSingle character conversion:\\n\");\n test_b6();\n unsigned int i; unsigned int j;\n char *s = \"ACTGGTGCCTGCTCCAAGTTGACCATGTCACA\";\n fprintf(stderr, \"\\n32 character conversion:\\n\");\n fprintf(stderr, \"%s\\n\", s);\n char q[33];\n unsigned long t[4] = { 0, 0, 0, 0 };\n for (j = 0; j != 4; ++j) {\n for (i = 0; i != 8; ++i) {\n t[j] |= (unsigned long) s[i + (j * 8)] << (i * 8);\n }\n }\n unsigned long ret = atox32b2(uc, deoxy, &t[0]);\n if (t[0] | t[1] | t[2] | t[3]) {\n printf(\"Got strange characters in nucleotides\\n\");\n return 0;\n }\n tr_x32b2(ret, ret, s, q, \"Converted back\");\n unsigned long rcpx;\n rcpx = x32b2_rcpx(ret);\n fprintf(stderr, \"\\thalf template rcpx:\\t%lx\\n\", rcpx);\n rcpx = x32b2_rcpx2(ret);\n fprintf(stderr, \"\\ttest template rcpx:\\t%lx\\n\", rcpx);\n tr_x32b2(x32b2_rev_rcpx2(rcpx), ret, s, q,\n \"Template, converted back from rcpx\");\n unsigned long rc = x32b2_rc(ret);\n tr_x32b2(rc, rc, s, q, \"Reverse complement\");\n rcpx = x32b2_rcpx(rc);\n fprintf(stderr, \"\\thalf revcomp rcpx:\\t%lx\\n\", rcpx);\n rcpx = x32b2_rcpx2(rc);\n fprintf(stderr, \"\\ttest revcomp rcpx:\\t%lx\\n\", rcpx);\n tr_x32b2(x32b2_rev_rcpx2(rcpx), rc, s, q,\n \"Reverse complement, converted back from rcpx\");\n ret ^= 0x1000;\n rcpx = x32b2_rcpx2(ret);\n fprintf(stderr, \"\\t[AC] <=> [TG] substtitution, rcpx:\\t%lx\\n\", rcpx);\n ret ^= 0x1000;\n ret ^= 0x200000;\n rcpx = x32b2_rcpx2(ret);\n fprintf(stderr, \"\\t[AT] <=> [CG] substtitution, rcpx:\\t%lx\\n\", rcpx);\n ret ^= 0x200000;\n ret ^= 0x30000000;\n rcpx = x32b2_rcpx2(ret);\n fprintf(stderr, \"\\ty/ACGT/GTAC/ substtitution, rcpx:\\t%lx\\n\", rcpx);\n ret ^= 0x30000000;\n return 0;\n}",
"variable_types": [
[
"i",
"unsigned int"
],
[
"j",
"unsigned int"
],
[
"s",
"char *"
],
[
"q",
"char [33]"
],
[
"t",
"unsigned long [4]"
],
[
"ret",
"unsigned long"
],
[
"rcpx",
"unsigned long"
],
[
"rc",
"unsigned long"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "98ec3f6c182230eedda72a9be094cdf12fd375d454c714a43536c8f80ee4ad3a"
}
] |
48fbefd2be9773c4dedf9a96d79662bd7496508c78afb60651b51fa39b565473 | ivartj/platformer | [
[
"rgba",
"->"
],
[
"rgb",
"->"
],
[
"getrgb",
"->"
]
] | [] | [
{
"name": "rgba",
"canonical_name": "func0",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall rgba(double a1, double a2, double a3, double a4)\n{\nreturn (unsigned __int8)(int)(255.0 * a3) | (((unsigned __int8)(int)(255.0 * a2) | (((unsigned __int8)(int)(255.0 * a1) | ((unsigned __int8)(int)(255.0 * a4) << 8)) << 8)) << 8);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(double a1, double a2, double a3, double a4)\n{\nreturn (unsigned __int8)(int)(255.0 * a3) | (((unsigned __int8)(int)(255.0 * a2) | (((unsigned __int8)(int)(255.0 * a1) | ((unsigned __int8)(int)(255.0 * a4) << 8)) << 8)) << 8);\n}",
"original_code": "color rgba(double r, double g, double b, double a)\n{\n color c;\n c = 0;\n c |= (uint8_t)(a * 255.0); c <<= 8;\n c |= (uint8_t)(r * 255.0); c <<= 8;\n c |= (uint8_t)(g * 255.0); c <<= 8;\n c |= (uint8_t)(b * 255.0);\n return c;\n}",
"canonical_original_code": "unsigned int rgba(double r, double g, double b, double a)\n{\n unsigned int c;\n c = 0;\n c |= (unsigned char)(a * 255.0); c <<= 8;\n c |= (unsigned char)(r * 255.0); c <<= 8;\n c |= (unsigned char)(g * 255.0); c <<= 8;\n c |= (unsigned char)(b * 255.0);\n return c;\n}",
"variable_types": [
[
"r",
"double"
],
[
"g",
"double"
],
[
"b",
"double"
],
[
"a",
"double"
],
[
"c",
"unsigned int"
]
],
"return_type": "unsigned int",
"user_defined_types": [],
"binary_hash": "48fbefd2be9773c4dedf9a96d79662bd7496508c78afb60651b51fa39b565473"
},
{
"name": "rgb",
"canonical_name": "func1",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall rgb(double a1, double a2, double a3)\n{\nreturn (unsigned __int8)(int)(255.0 * a3) | (((unsigned __int8)(int)(255.0 * a2) | (((unsigned __int8)(int)(255.0 * a1) | ((unsigned __int8)(int)(255.0 * 1.0) << 8)) << 8)) << 8);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(double a1, double a2, double a3)\n{\nreturn (unsigned __int8)(int)(255.0 * a3) | (((unsigned __int8)(int)(255.0 * a2) | (((unsigned __int8)(int)(255.0 * a1) | ((unsigned __int8)(int)(255.0 * 1.0) << 8)) << 8)) << 8);\n}",
"original_code": "color rgb(double r, double g, double b)\n{\n color c;\n double a;\n a = 1.0;\n c = 0;\n c |= (uint8_t)(a * 255.0); c <<= 8;\n c |= (uint8_t)(r * 255.0); c <<= 8;\n c |= (uint8_t)(g * 255.0); c <<= 8;\n c |= (uint8_t)(b * 255.0);\n return c;\n}",
"canonical_original_code": "unsigned int rgb(double r, double g, double b)\n{\n unsigned int c;\n double a;\n a = 1.0;\n c = 0;\n c |= (unsigned char)(a * 255.0); c <<= 8;\n c |= (unsigned char)(r * 255.0); c <<= 8;\n c |= (unsigned char)(g * 255.0); c <<= 8;\n c |= (unsigned char)(b * 255.0);\n return c;\n}",
"variable_types": [
[
"r",
"double"
],
[
"g",
"double"
],
[
"b",
"double"
],
[
"c",
"unsigned int"
],
[
"a",
"double"
]
],
"return_type": "unsigned int",
"user_defined_types": [],
"binary_hash": "48fbefd2be9773c4dedf9a96d79662bd7496508c78afb60651b51fa39b565473"
},
{
"name": "getrgb",
"canonical_name": "func2",
"repo": "ivartj/platformer",
"decompiled_code": "double *__fastcall getrgb(int a1, double *a2, double *a3, double *a4)\n{\ndouble *result; // rax\n\n*a2 = (double)BYTE2(a1) / 255.0;\n*a3 = (double)BYTE1(a1) / 255.0;\nresult = a4;\n*a4 = (double)(unsigned __int8)a1 / 255.0;\nreturn result;\n}\n",
"canonical_decompiled_code": "double *__fastcall func2(int a1, double *a2, double *a3, double *a4)\n{\ndouble *result; // rax\n\n*a2 = (double)BYTE2(a1) / 255.0;\n*a3 = (double)BYTE1(a1) / 255.0;\nresult = a4;\n*a4 = (double)(unsigned __int8)a1 / 255.0;\nreturn result;\n}",
"original_code": "void getrgb(color c, double *r, double *g, double *b)\n{\n *r = (double)((0x00FF0000 & c) >> 16) / 255.0;\n *g = (double)((0x0000FF00 & c) >> 8) / 255.0;\n *b = (double)((0x000000FF & c) >> 0) / 255.0;\n}",
"canonical_original_code": "void getrgb(unsigned int c, double *r, double *g, double *b)\n{\n *r = (double)((0x00FF0000 & c) >> 16) / 255.0;\n *g = (double)((0x0000FF00 & c) >> 8) / 255.0;\n *b = (double)((0x000000FF & c) >> 0) / 255.0;\n}",
"variable_types": [
[
"c",
"unsigned int"
],
[
"r",
"double *"
],
[
"g",
"double *"
],
[
"b",
"double *"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "48fbefd2be9773c4dedf9a96d79662bd7496508c78afb60651b51fa39b565473"
}
] |
5ed7817edadffaf9b03e5a84ee7402de95b8fa2eb2a1ee4dcd3d1c515d0655fa | ivartj/platformer | [
[
"hash_create",
"->"
]
] | [] | [
{
"name": "hash_create",
"canonical_name": "func0",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall hash_create(__int64 a1, unsigned __int64 a2)\n{\n__int64 v3; // [rsp+18h] [rbp-18h] BYREF\n__int64 *v4; // [rsp+20h] [rbp-10h]\nint v5; // [rsp+28h] [rbp-8h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nv3 = 0LL;\nv5 = 8;\nv4 = &v3;\nfor ( i = 0; a2 > i; ++i )\n*((_BYTE *)v4 + i % v5) ^= *(_BYTE *)(i + a1);\nreturn v3;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, unsigned __int64 a2)\n{\n__int64 v3; // [rsp+18h] [rbp-18h] BYREF\n__int64 *v4; // [rsp+20h] [rbp-10h]\nint v5; // [rsp+28h] [rbp-8h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nv3 = 0LL;\nv5 = 8;\nv4 = &v3;\nfor ( i = 0; a2 > i; ++i )\n*((_BYTE *)v4 + i % v5) ^= *(_BYTE *)(i + a1);\nreturn v3;\n}",
"original_code": "uint64_t hash_create(unsigned char *data, size_t len)\n{\n uint64_t hash;\n int hashlen;\n unsigned char *bytes;\n int i;\n hash = 0;\n hashlen = sizeof(hash);\n bytes = (unsigned char *)&hash;\n for(i = 0; i < len; i++)\n bytes[i % hashlen] ^= data[i];\n return hash;\n}",
"canonical_original_code": "unsigned long hash_create(unsigned char *data, unsigned long len)\n{\n unsigned long hash;\n int hashlen;\n unsigned char *bytes;\n int i;\n hash = 0;\n hashlen = sizeof(hash);\n bytes = (unsigned char *)&hash;\n for(i = 0; i < len; i++)\n bytes[i % hashlen] ^= data[i];\n return hash;\n}",
"variable_types": [
[
"data",
"unsigned char *"
],
[
"len",
"unsigned long"
],
[
"hash",
"unsigned long"
],
[
"hashlen",
"int"
],
[
"bytes",
"unsigned char *"
],
[
"i",
"int"
]
],
"return_type": "unsigned long",
"user_defined_types": [],
"binary_hash": "5ed7817edadffaf9b03e5a84ee7402de95b8fa2eb2a1ee4dcd3d1c515d0655fa"
}
] |
667b9dd9a51842bfa94baad0933bd0c944f88c1f3cf8201d01957a646edae841 | ivartj/platformer | [
[
"sdl_init",
"->",
"video_init"
],
[
"video_init",
"->",
"sdl_init",
"lockcanvas"
],
[
"lockcanvas",
"->",
"video_init",
"video_update"
],
[
"unlockcanvas",
"->",
"video_update"
],
[
"video_update",
"->",
"unlockcanvas",
"lockcanvas"
],
[
"image_destroy",
"->"
],
[
"image_fill",
"->"
],
[
"blit",
"->"
],
[
"blitxy",
"->"
],
[
"blitrxy",
"->"
],
[
"blitxymask",
"->"
],
[
"event_translate",
"->",
"event_wait",
"event_poll"
],
[
"event_wait",
"->",
"event_translate"
],
[
"event_poll",
"->",
"event_translate"
]
] | [
[
"image_destroy",
"void __fastcall func5(_QWORD *a1)\n{\n_DWORD *v1; // [rsp+18h] [rbp-8h]\n\nv1 = (_DWORD *)a1[2];\nif ( v1[10] || (*v1 & 0x4005) != 0 )\nSDL_UnlockSurface(v1);\nSDL_FreeSurface(v1);\nfree(a1);\n}"
],
[
"image_fill",
"__int64 __fastcall func6(__int64 a1, _DWORD *a2, unsigned int a3)\n{\n__int64 result; // rax\n__int16 v5[4]; // [rsp+20h] [rbp-10h] BYREF\n_DWORD *v6; // [rsp+28h] [rbp-8h]\n\nv5[0] = *a2;\nv5[1] = a2[1];\nv5[2] = a2[2];\nv5[3] = a2[3];\nv6 = *(_DWORD **)(a1 + 16);\nif ( v6[10] || (*v6 & 0x4005) != 0 )\nSDL_UnlockSurface(v6);\nSDL_FillRect(v6, v5, a3);\nif ( v6[10] || (result = *v6 & 0x4005, (_DWORD)result) )\nresult = SDL_LockSurface(v6);\nreturn result;\n}"
],
[
"blit",
"__int64 __fastcall func7(__int64 a1, __int64 a2)\n{\nconst char *v2; // rax\n_DWORD *v4; // [rsp+18h] [rbp-18h]\n_DWORD *v5; // [rsp+20h] [rbp-10h]\nunsigned int v6; // [rsp+2Ch] [rbp-4h]\n\nv5 = *(_DWORD **)(a1 + 16);\nv4 = *(_DWORD **)(a2 + 16);\nif ( v5[10] || (*v5 & 0x4005) != 0 )\nSDL_UnlockSurface(v5);\nif ( v4[10] || (*v4 & 0x4005) != 0 )\nSDL_UnlockSurface(v4);\nv6 = SDL_UpperBlit(*(_QWORD *)(a1 + 16), 0LL, *(_QWORD *)(a2 + 16), 0LL);\nif ( v6 )\n{\nv2 = (const char *)SDL_GetError();\nv6 = seterrmsg(\"SDL_BlitSurface: %s\", v2);\n}\nif ( v5[10] || (*v5 & 0x4005) != 0 )\nSDL_LockSurface(v5);\nif ( v4[10] || (*v4 & 0x4005) != 0 )\nSDL_LockSurface(v4);\nreturn v6;\n}"
],
[
"blitxy",
"__int64 __fastcall func8(__int64 a1, __int64 a2, unsigned __int16 a3, __int16 a4)\n{\nconst char *v4; // rax\n__int64 v6; // [rsp+20h] [rbp-20h] BYREF\n_DWORD *v7; // [rsp+28h] [rbp-18h]\n_DWORD *v8; // [rsp+30h] [rbp-10h]\nunsigned int v9; // [rsp+3Ch] [rbp-4h]\n\nv6 = a3;\nWORD1(v6) = a4;\nv8 = *(_DWORD **)(a1 + 16);\nv7 = *(_DWORD **)(a2 + 16);\nif ( v8[10] || (*v8 & 0x4005) != 0 )\nSDL_UnlockSurface(v8);\nif ( v7[10] || (*v7 & 0x4005) != 0 )\nSDL_UnlockSurface(v7);\nv9 = SDL_UpperBlit(*(_QWORD *)(a1 + 16), 0LL, *(_QWORD *)(a2 + 16), &v6);\nif ( v9 )\n{\nv4 = (const char *)SDL_GetError();\nv9 = seterrmsg(\"SDL_BlitSurface: %s\", v4);\n}\nif ( v8[10] || (*v8 & 0x4005) != 0 )\nSDL_LockSurface(v8);\nif ( v7[10] || (*v7 & 0x4005) != 0 )\nSDL_LockSurface(v7);\nreturn v9;\n}"
],
[
"blitrxy",
"__int64 __fastcall func9(__int64 a1, _DWORD *a2, __int64 a3, __int16 a4, __int16 a5)\n{\n__int64 v5; // rdi\nconst char *v6; // rax\n__int64 v9; // [rsp+28h] [rbp-28h] BYREF\n__int64 v10; // [rsp+30h] [rbp-20h] BYREF\n_DWORD *v11; // [rsp+38h] [rbp-18h]\n_DWORD *v12; // [rsp+40h] [rbp-10h]\nunsigned int v13; // [rsp+4Ch] [rbp-4h]\n\nv10 = 0LL;\nv9 = 0LL;\nv10 = (unsigned __int16)*a2;\n*(_DWORD *)((char *)&v10 + 2) = (unsigned __int16)a2[1];\nWORD2(v10) = a2[2];\nHIWORD(v10) = a2[3];\nLOWORD(v9) = a4;\nWORD1(v9) = a5;\nv12 = *(_DWORD **)(a1 + 16);\nv11 = *(_DWORD **)(a3 + 16);\nif ( v12[10] || (*v12 & 0x4005) != 0 )\nSDL_UnlockSurface(v12);\nif ( v11[10] || (*v11 & 0x4005) != 0 )\nSDL_UnlockSurface(v11);\nv5 = *(_QWORD *)(a1 + 16);\nv13 = SDL_UpperBlit(v5, &v10, *(_QWORD *)(a3 + 16), &v9);\nif ( v13 )\n{\nv6 = (const char *)SDL_GetError(v5);\nv13 = seterrmsg(\"SDL_BlitSurface: %s\", v6);\n}\nif ( v12[10] || (*v12 & 0x4005) != 0 )\nSDL_LockSurface(v12);\nif ( v11[10] || (*v11 & 0x4005) != 0 )\nSDL_LockSurface(v11);\nreturn v13;\n}"
],
[
"event_translate",
"__int64 __fastcall func11(__int64 a1, unsigned __int8 *a2)\n{\nint v2; // eax\n\nv2 = *a2;\nif ( v2 == 12 )\nexit(0);\nif ( *a2 > 0xCu )\nreturn 1LL;\nif ( v2 == 2 )\n{\n*(_DWORD *)a1 = 1;\n*(_BYTE *)(a1 + 4) = a2[4];\n*(_WORD *)(a1 + 6) = *((_DWORD *)a2 + 3);\n*(_WORD *)(a1 + 8) = *((_DWORD *)a2 + 2);\nreturn 0LL;\n}\nif ( *a2 < 2u || (unsigned int)(v2 - 4) > 1 )\nreturn 1LL;\n*(_DWORD *)a1 = 2;\nif ( *a2 == 5 )\n*(_BYTE *)(a1 + 12) = a2[3];\nelse\n*(_BYTE *)(a1 + 12) = a2[2];\n*(_DWORD *)(a1 + 4) = *((unsigned __int16 *)a2 + 2);\n*(_DWORD *)(a1 + 8) = *((unsigned __int16 *)a2 + 3);\nreturn 0LL;\n}"
],
[
"event_wait",
"__int64 __fastcall func12(__int64 a1)\n{\nunsigned __int8 v2[24]; // [rsp+10h] [rbp-20h] BYREF\nint v4; // [rsp+2Ch] [rbp-4h]\n\ndo\n{\nv4 = 0;\nif ( !(unsigned int)SDL_WaitEvent(v2) )\nreturn 0LL;\nv4 = func11(a1, v2);\n}\nwhile ( v4 );\nreturn 1LL;\n}"
],
[
"event_poll",
"__int64 __fastcall func13(__int64 a1)\n{\nunsigned __int8 v2[24]; // [rsp+10h] [rbp-20h] BYREF\nint v4; // [rsp+2Ch] [rbp-4h]\n\ndo\n{\nv4 = 0;\nif ( !(unsigned int)SDL_PollEvent(v2) )\nreturn 0LL;\nv4 = func11(a1, v2);\n}\nwhile ( v4 );\nreturn 1LL;\n}"
]
] | [
{
"name": "sdl_init",
"canonical_name": "func0",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 sdl_init()\n{\n__int64 result; // rax\nconst char *v1; // rax\n\nif ( sdl_initialized )\nreturn 0LL;\nif ( (unsigned int)SDL_Init(32LL) )\n{\nv1 = (const char *)SDL_GetError();\nresult = seterrmsg(\"SDL failed to initialize: %s\", v1);\n}\nelse\n{\natexit((void (*)(void))&SDL_Quit);\nsdl_initialized = 1;\nresult = 0LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 func0()\n{\n__int64 result; // rax\nconst char *v1; // rax\n\nif ( sdl_initialized )\nreturn 0LL;\nif ( (unsigned int)SDL_Init(32LL) )\n{\nv1 = (const char *)SDL_GetError();\nresult = seterrmsg(\"SDL failed to initialize: %s\", v1);\n}\nelse\n{\natexit((void (*)(void))&SDL_Quit);\nsdl_initialized = 1;\nresult = 0LL;\n}\nreturn result;\n}",
"original_code": "int sdl_init(void)\n{\n int err;\n if(sdl_initialized)\n return 0;\n err = SDL_Init(0x00000020);\n if(err)\n return seterrmsg(\"SDL failed to initialize: %s\", SDL_GetError());\n atexit(SDL_Quit);\n sdl_initialized = 1;\n return 0;\n}",
"canonical_original_code": "int sdl_init()\n{\n int err;\n if(sdl_initialized)\n return 0;\n err = SDL_Init(0x00000020);\n if(err)\n return seterrmsg(\"SDL failed to initialize: %s\", SDL_GetError());\n atexit(SDL_Quit);\n sdl_initialized = 1;\n return 0;\n}",
"variable_types": [
[
"err",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "667b9dd9a51842bfa94baad0933bd0c944f88c1f3cf8201d01957a646edae841"
},
{
"name": "video_init",
"canonical_name": "func1",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall video_init(unsigned int a1, unsigned int a2)\n{\n__int64 result; // rax\nconst char *v3; // rax\nconst char *v4; // rax\nunsigned int v5; // [rsp+1Ch] [rbp-4h]\n\nv5 = sdl_init();\nif ( v5 )\nreturn v5;\ncanvas = SDL_CreateRGBSurface(1LL, a1, a2, 32LL, 16711680LL, 65280LL, 255LL, -16777216LL);\nif ( canvas )\n{\nwindow = SDL_SetVideoMode(a1, a2, 32LL, 1LL);\nif ( window )\n{\nlockcanvas();\nresult = 0LL;\n}\nelse\n{\nv4 = (const char *)SDL_GetError();\nresult = seterrmsg(\"Failed to open SDL window: %s\", v4);\n}\n}\nelse\n{\nv3 = (const char *)SDL_GetError();\nresult = seterrmsg(\"Failed to create SDL canvas: %s\", v3);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(unsigned int a1, unsigned int a2)\n{\n__int64 result; // rax\nconst char *v3; // rax\nconst char *v4; // rax\nunsigned int v5; // [rsp+1Ch] [rbp-4h]\n\nv5 = func0();\nif ( v5 )\nreturn v5;\ncanvas = SDL_CreateRGBSurface(1LL, a1, a2, 32LL, 16711680LL, 65280LL, 255LL, -16777216LL);\nif ( canvas )\n{\nwindow = SDL_SetVideoMode(a1, a2, 32LL, 1LL);\nif ( window )\n{\nfunc2();\nresult = 0LL;\n}\nelse\n{\nv4 = (const char *)SDL_GetError();\nresult = seterrmsg(\"Failed to open SDL window: %s\", v4);\n}\n}\nelse\n{\nv3 = (const char *)SDL_GetError();\nresult = seterrmsg(\"Failed to create SDL canvas: %s\", v3);\n}\nreturn result;\n}",
"original_code": "int video_init(int w, int h)\n{\n int err;\n err = sdl_init();\n if(err)\n return err;\n canvas = SDL_CreateRGBSurface(0x00000001, w, h, 32,\n 0x00FF0000,\n 0x0000FF00,\n 0x000000FF,\n 0xFF000000);\n if(canvas == ((void *)0))\n return seterrmsg(\"Failed to create SDL canvas: %s\", SDL_GetError());\n window = SDL_SetVideoMode(w, h, 32, 0x00000001);\n if(window == ((void *)0))\n return seterrmsg(\"Failed to open SDL window: %s\", SDL_GetError());\n lockcanvas();\n return 0;\n}",
"canonical_original_code": "int video_init(int w, int h)\n{\n int err;\n err = sdl_init();\n if(err)\n return err;\n canvas = SDL_CreateRGBSurface(0x00000001, w, h, 32,\n 0x00FF0000,\n 0x0000FF00,\n 0x000000FF,\n 0xFF000000);\n if(canvas == ((void *)0))\n return seterrmsg(\"Failed to create SDL canvas: %s\", SDL_GetError());\n window = SDL_SetVideoMode(w, h, 32, 0x00000001);\n if(window == ((void *)0))\n return seterrmsg(\"Failed to open SDL window: %s\", SDL_GetError());\n lockcanvas();\n return 0;\n}",
"variable_types": [
[
"w",
"int"
],
[
"h",
"int"
],
[
"err",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "667b9dd9a51842bfa94baad0933bd0c944f88c1f3cf8201d01957a646edae841"
},
{
"name": "lockcanvas",
"canonical_name": "func2",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 lockcanvas()\n{\n__int64 result; // rax\n\nif ( *(_DWORD *)(canvas + 40) || (*(_DWORD *)canvas & 0x4005) != 0 )\nSDL_LockSurface(canvas);\nif ( !video )\nvideo = (__int64)calloc(1uLL, 0x18uLL);\n*(_QWORD *)(video + 8) = *(_QWORD *)(canvas + 32);\n*(_DWORD *)video = *(_DWORD *)(canvas + 16);\n*(_DWORD *)(video + 4) = *(_DWORD *)(canvas + 20);\nresult = video;\n*(_QWORD *)(video + 16) = canvas;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 func2()\n{\n__int64 result; // rax\n\nif ( *(_DWORD *)(canvas + 40) || (*(_DWORD *)canvas & 0x4005) != 0 )\nSDL_LockSurface(canvas);\nif ( !video )\nvideo = (__int64)calloc(1uLL, 0x18uLL);\n*(_QWORD *)(video + 8) = *(_QWORD *)(canvas + 32);\n*(_DWORD *)video = *(_DWORD *)(canvas + 16);\n*(_DWORD *)(video + 4) = *(_DWORD *)(canvas + 20);\nresult = video;\n*(_QWORD *)(video + 16) = canvas;\nreturn result;\n}",
"original_code": "void lockcanvas(void)\n{\n if((canvas->offset || ((canvas->flags & (0x00000001|0x00000004|0x00004000)) != 0)))\n SDL_LockSurface(canvas);\n if(video == ((void *)0))\n video = calloc(1, sizeof(image));\n video->pix = canvas->pixels;\n video->w = canvas->w;\n video->h = canvas->h;\n video->private = canvas;\n}",
"canonical_original_code": "void lockcanvas()\n{\n if((canvas->offset || ((canvas->flags & (0x00000001|0x00000004|0x00004000)) != 0)))\n SDL_LockSurface(canvas);\n if(video == ((void *)0))\n video = calloc(1, sizeof(image));\n video->pix = canvas->pixels;\n video->w = canvas->w;\n video->h = canvas->h;\n video->private = canvas;\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "667b9dd9a51842bfa94baad0933bd0c944f88c1f3cf8201d01957a646edae841"
},
{
"name": "unlockcanvas",
"canonical_name": "func3",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 unlockcanvas()\n{\n__int64 result; // rax\n\nif ( *(_DWORD *)(canvas + 40) || (result = *(_DWORD *)canvas & 0x4005, (_DWORD)result) )\nresult = SDL_UnlockSurface(canvas);\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 func3()\n{\n__int64 result; // rax\n\nif ( *(_DWORD *)(canvas + 40) || (result = *(_DWORD *)canvas & 0x4005, (_DWORD)result) )\nresult = SDL_UnlockSurface(canvas);\nreturn result;\n}",
"original_code": "void unlockcanvas(void)\n{\n if((canvas->offset || ((canvas->flags & (0x00000001|0x00000004|0x00004000)) != 0)))\n SDL_UnlockSurface(canvas);\n}",
"canonical_original_code": "void unlockcanvas()\n{\n if((canvas->offset || ((canvas->flags & (0x00000001|0x00000004|0x00004000)) != 0)))\n SDL_UnlockSurface(canvas);\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "667b9dd9a51842bfa94baad0933bd0c944f88c1f3cf8201d01957a646edae841"
},
{
"name": "video_update",
"canonical_name": "func4",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 video_update()\n{\nunlockcanvas();\nSDL_UpperBlit(canvas, 0LL, window, 0LL);\nSDL_Flip(window);\nreturn lockcanvas();\n}\n",
"canonical_decompiled_code": "__int64 func4()\n{\nfunc3();\nSDL_UpperBlit(canvas, 0LL, window, 0LL);\nSDL_Flip(window);\nreturn func2();\n}",
"original_code": "void video_update(void)\n{\n unlockcanvas();\n SDL_UpperBlit(canvas, ((void *)0), window, ((void *)0));\n SDL_Flip(window);\n lockcanvas();\n}",
"canonical_original_code": "void video_update()\n{\n unlockcanvas();\n SDL_UpperBlit(canvas, ((void *)0), window, ((void *)0));\n SDL_Flip(window);\n lockcanvas();\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "667b9dd9a51842bfa94baad0933bd0c944f88c1f3cf8201d01957a646edae841"
},
{
"name": "blitxymask",
"canonical_name": "func10",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 blitxymask()\n{\nreturn seterrmsg(\"Unimplemented method blitxymask\");\n}\n",
"canonical_decompiled_code": "__int64 func10()\n{\nreturn seterrmsg(\"Unimplemented method blitxymask\");\n}",
"original_code": "int blitxymask(image *src, image *dest, int x, int y, image *mask)\n{\n return seterrmsg(\"Unimplemented method blitxymask\");\n}",
"canonical_original_code": "int blitxymask(struct _image *src, struct _image *dest, int x, int y, struct _image *mask)\n{\n return seterrmsg(\"Unimplemented method blitxymask\");\n}",
"variable_types": [
[
"src",
"struct _image { int w; unsigned int *pix; void *private; } *"
],
[
"dest",
"struct _image *"
],
[
"x",
"int"
],
[
"y",
"int"
],
[
"mask",
"struct _image *"
]
],
"return_type": "int",
"user_defined_types": [
"struct _image { int w; unsigned int *pix; void *private; }"
],
"binary_hash": "667b9dd9a51842bfa94baad0933bd0c944f88c1f3cf8201d01957a646edae841"
}
] |
672899941491b5433f45b2a93a67c3786624c1304325578b89d05d3bea50c5d7 | ivartj/platformer | [
[
"iterate",
"->"
]
] | [] | [
{
"name": "iterate",
"canonical_name": "func0",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall iterate(__int64 a1, __int64 a2)\n{\nreturn (*(__int64 (__fastcall **)(__int64, __int64))(a1 + 8))(a1, a2);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, __int64 a2)\n{\nreturn (*(__int64 (__fastcall **)(__int64, __int64))(a1 + 8))(a1, a2);\n}",
"original_code": "int iterate(iter *i, void *retval)\n{\n return i->next(i, retval);\n}",
"canonical_original_code": "int iterate(struct _iter *i, void *retval)\n{\n return i->next(i, retval);\n}",
"variable_types": [
[
"i",
"struct _iter { union _data { void *v; int i; double d; } data; int (*next)(struct _iter *i, void *retval); } *"
],
[
"retval",
"void *"
]
],
"return_type": "int",
"user_defined_types": [
"struct _iter { union _data data; int (*next)(struct _iter *i, void *retval); }",
"union _data { void *v; int i; double d; }"
],
"binary_hash": "672899941491b5433f45b2a93a67c3786624c1304325578b89d05d3bea50c5d7"
}
] |
860c1acdbd3958695af5f0ae9b169ee043159dcc1fc4eae4f42f90be23ea0c4b | ivartj/platformer | [
[
"thread_sleep",
"->"
]
] | [] | [
{
"name": "thread_sleep",
"canonical_name": "func0",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall thread_sleep(unsigned int a1)\n{\nreturn SDL_Delay(a1);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(unsigned int a1)\n{\nreturn SDL_Delay(a1);\n}",
"original_code": "void thread_sleep(int ms)\n{\n SDL_Delay(ms);\n}",
"canonical_original_code": "void thread_sleep(int ms)\n{\n SDL_Delay(ms);\n}",
"variable_types": [
[
"ms",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "860c1acdbd3958695af5f0ae9b169ee043159dcc1fc4eae4f42f90be23ea0c4b"
}
] |
88f5ed586597aacc3f06e570186d435996ca171f15a1f407fe4b8b8d30a30fc7 | ivartj/platformer | [
[
"gfx_destroy",
"->"
],
[
"gfx_translate",
"->"
],
[
"gfx_color",
"->"
],
[
"gfx_dot",
"->"
],
[
"gfx_fill",
"->"
],
[
"gfx_get",
"->"
],
[
"gfx_blit",
"->"
]
] | [] | [
{
"name": "gfx_destroy",
"canonical_name": "func0",
"repo": "ivartj/platformer",
"decompiled_code": "void __fastcall gfx_destroy(void *a1)\n{\nfree(a1);\n}\n",
"canonical_decompiled_code": "void __fastcall func0(void *a1)\n{\nfree(a1);\n}",
"original_code": "void gfx_destroy(gfx *g)\n{\n free(g);\n}",
"canonical_original_code": "void gfx_destroy(struct _gfx *g)\n{\n free(g);\n}",
"variable_types": [
[
"g",
"struct _gfx { struct _image { int w; unsigned int *pix; void *private; } *img; int x; unsigned int c; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _gfx { struct _image *img; int x; unsigned int c; }",
"struct _image { int w; unsigned int *pix; void *private; }"
],
"binary_hash": "88f5ed586597aacc3f06e570186d435996ca171f15a1f407fe4b8b8d30a30fc7"
},
{
"name": "gfx_translate",
"canonical_name": "func1",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall gfx_translate(__int64 a1, int a2, int a3)\n{\n__int64 result; // rax\n\n*(_DWORD *)(a1 + 8) += a2;\nresult = a1;\n*(_DWORD *)(a1 + 12) += a3;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1, int a2, int a3)\n{\n__int64 result; // rax\n\n*(_DWORD *)(a1 + 8) += a2;\nresult = a1;\n*(_DWORD *)(a1 + 12) += a3;\nreturn result;\n}",
"original_code": "void gfx_translate(gfx *g, int x, int y)\n{\n g->x += x;\n g->y += y;\n}",
"canonical_original_code": "void gfx_translate(struct _gfx *g, int x, int y)\n{\n g->x += x;\n g->y += y;\n}",
"variable_types": [
[
"g",
"struct _gfx { struct _image { int w; unsigned int *pix; void *private; } *img; int x; unsigned int c; } *"
],
[
"x",
"int"
],
[
"y",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct _gfx { struct _image *img; int x; unsigned int c; }",
"struct _image { int w; unsigned int *pix; void *private; }"
],
"binary_hash": "88f5ed586597aacc3f06e570186d435996ca171f15a1f407fe4b8b8d30a30fc7"
},
{
"name": "gfx_color",
"canonical_name": "func2",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall gfx_color(__int64 a1, int a2)\n{\n__int64 result; // rax\n\nresult = a1;\n*(_DWORD *)(a1 + 16) = a2;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, int a2)\n{\n__int64 result; // rax\n\nresult = a1;\n*(_DWORD *)(a1 + 16) = a2;\nreturn result;\n}",
"original_code": "void gfx_color(gfx *g, color c)\n{\n g->c = c;\n}",
"canonical_original_code": "void gfx_color(struct _gfx *g, unsigned int c)\n{\n g->c = c;\n}",
"variable_types": [
[
"g",
"struct _gfx { struct _image { int w; unsigned int *pix; void *private; } *img; int x; unsigned int c; } *"
],
[
"c",
"unsigned int"
]
],
"return_type": "void",
"user_defined_types": [
"struct _gfx { struct _image *img; int x; unsigned int c; }",
"struct _image { int w; unsigned int *pix; void *private; }"
],
"binary_hash": "88f5ed586597aacc3f06e570186d435996ca171f15a1f407fe4b8b8d30a30fc7"
},
{
"name": "gfx_dot",
"canonical_name": "func3",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall gfx_dot(_DWORD *a1, int a2, int a3)\n{\nint v3; // edx\n__int64 result; // rax\nint v6; // [rsp+18h] [rbp-8h]\nint v7; // [rsp+1Ch] [rbp-4h]\n\nv7 = a1[2] + a2;\nv3 = a1[3];\nresult = (unsigned int)(v3 + a3);\nv6 = v3 + a3;\nif ( v7 >= 0 )\n{\nresult = **(unsigned int **)a1;\nif ( v7 < (int)result && v6 >= 0 )\n{\nresult = *(unsigned int *)(*(_QWORD *)a1 + 4LL);\nif ( v6 < (int)result )\n{\nresult = (unsigned int)a1[4];\n*(_DWORD *)(4LL * (v6 * **(_DWORD **)a1 + v7) + *(_QWORD *)(*(_QWORD *)a1 + 8LL)) = result;\n}\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(_DWORD *a1, int a2, int a3)\n{\nint v3; // edx\n__int64 result; // rax\nint v6; // [rsp+18h] [rbp-8h]\nint v7; // [rsp+1Ch] [rbp-4h]\n\nv7 = a1[2] + a2;\nv3 = a1[3];\nresult = (unsigned int)(v3 + a3);\nv6 = v3 + a3;\nif ( v7 >= 0 )\n{\nresult = **(unsigned int **)a1;\nif ( v7 < (int)result && v6 >= 0 )\n{\nresult = *(unsigned int *)(*(_QWORD *)a1 + 4LL);\nif ( v6 < (int)result )\n{\nresult = (unsigned int)a1[4];\n*(_DWORD *)(4LL * (v6 * **(_DWORD **)a1 + v7) + *(_QWORD *)(*(_QWORD *)a1 + 8LL)) = result;\n}\n}\n}\nreturn result;\n}",
"original_code": "void gfx_dot(gfx *g, int x, int y)\n{\n int tx, ty;\n tx = x + g->x;\n ty = y + g->y;\n if(tx < 0 || tx >= g->img->w)\n return;\n if(ty < 0 || ty >= g->img->h)\n return;\n g->img->pix[tx + ty * g->img->w] = g->c;\n}",
"canonical_original_code": "void gfx_dot(struct _gfx *g, int x, int y)\n{\n int tx; int ty;\n tx = x + g->x;\n ty = y + g->y;\n if(tx < 0 || tx >= g->img->w)\n return;\n if(ty < 0 || ty >= g->img->h)\n return;\n g->img->pix[tx + ty * g->img->w] = g->c;\n}",
"variable_types": [
[
"g",
"struct _gfx { struct _image { int w; unsigned int *pix; void *private; } *img; int x; unsigned int c; } *"
],
[
"x",
"int"
],
[
"y",
"int"
],
[
"tx",
"int"
],
[
"ty",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct _gfx { struct _image *img; int x; unsigned int c; }",
"struct _image { int w; unsigned int *pix; void *private; }"
],
"binary_hash": "88f5ed586597aacc3f06e570186d435996ca171f15a1f407fe4b8b8d30a30fc7"
},
{
"name": "gfx_fill",
"canonical_name": "func4",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall gfx_fill(__int64 a1, __int64 *a2)\n{\n__int64 v2; // rdx\n__int64 v4[2]; // [rsp+10h] [rbp-10h] BYREF\n\nv2 = a2[1];\nv4[0] = *a2;\nv4[1] = v2;\nLODWORD(v4[0]) += *(_DWORD *)(a1 + 8);\nHIDWORD(v4[0]) += *(_DWORD *)(a1 + 12);\nreturn image_fill(*(_QWORD *)a1, v4, *(unsigned int *)(a1 + 16));\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1, __int64 *a2)\n{\n__int64 v2; // rdx\n__int64 v4[2]; // [rsp+10h] [rbp-10h] BYREF\n\nv2 = a2[1];\nv4[0] = *a2;\nv4[1] = v2;\nLODWORD(v4[0]) += *(_DWORD *)(a1 + 8);\nHIDWORD(v4[0]) += *(_DWORD *)(a1 + 12);\nreturn image_fill(*(_QWORD *)a1, v4, *(unsigned int *)(a1 + 16));\n}",
"original_code": "void gfx_fill(gfx *g, rect *r)\n{\n rect rr;\n memcpy(&rr, r, sizeof(rr));\n rr.x += g->x;\n rr.y += g->y;\n image_fill(g->img, &rr, g->c);\n}",
"canonical_original_code": "void gfx_fill(struct _gfx *g, struct rect *r)\n{\n struct rect rr;\n memcpy(&rr, r, sizeof(rr));\n rr.x += g->x;\n rr.y += g->y;\n image_fill(g->img, &rr, g->c);\n}",
"variable_types": [
[
"g",
"struct _gfx { struct _image { int w; unsigned int *pix; void *private; } *img; int x; unsigned int c; } *"
],
[
"r",
"struct rect { int x; } *"
],
[
"rr",
"struct rect { int x; }"
]
],
"return_type": "void",
"user_defined_types": [
"struct rect { int x; }",
"struct _gfx { struct _image *img; int x; unsigned int c; }",
"struct _image { int w; unsigned int *pix; void *private; }"
],
"binary_hash": "88f5ed586597aacc3f06e570186d435996ca171f15a1f407fe4b8b8d30a30fc7"
},
{
"name": "gfx_get",
"canonical_name": "func5",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall gfx_get(_DWORD *a1, int a2, int a3)\n{\nint v4; // [rsp+0h] [rbp-10h]\nint v5; // [rsp+4h] [rbp-Ch]\n\nv5 = a1[2] + a2;\nv4 = a1[3] + a3;\nif ( v5 < 0 || v5 >= **(_DWORD **)a1 )\nreturn 0LL;\nif ( v4 >= 0 && v4 < *(_DWORD *)(*(_QWORD *)a1 + 4LL) )\nreturn *(unsigned int *)(*(_QWORD *)(*(_QWORD *)a1 + 8LL) + 4LL * (v4 * **(_DWORD **)a1 + v5));\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(_DWORD *a1, int a2, int a3)\n{\nint v4; // [rsp+0h] [rbp-10h]\nint v5; // [rsp+4h] [rbp-Ch]\n\nv5 = a1[2] + a2;\nv4 = a1[3] + a3;\nif ( v5 < 0 || v5 >= **(_DWORD **)a1 )\nreturn 0LL;\nif ( v4 >= 0 && v4 < *(_DWORD *)(*(_QWORD *)a1 + 4LL) )\nreturn *(unsigned int *)(*(_QWORD *)(*(_QWORD *)a1 + 8LL) + 4LL * (v4 * **(_DWORD **)a1 + v5));\nreturn 0LL;\n}",
"original_code": "color gfx_get(gfx *g, int x, int y)\n{\n x += g->x;\n y += g->y;\n if(x < 0 || x >= g->img->w)\n return 0;\n if(y < 0 || y >= g->img->h)\n return 0;\n return g->img->pix[x + g->img->w * y];\n}",
"canonical_original_code": "unsigned int gfx_get(struct _gfx *g, int x, int y)\n{\n x += g->x;\n y += g->y;\n if(x < 0 || x >= g->img->w)\n return 0;\n if(y < 0 || y >= g->img->h)\n return 0;\n return g->img->pix[x + g->img->w * y];\n}",
"variable_types": [
[
"g",
"struct _gfx { struct _image { int w; unsigned int *pix; void *private; } *img; int x; unsigned int c; } *"
],
[
"x",
"int"
],
[
"y",
"int"
]
],
"return_type": "unsigned int",
"user_defined_types": [
"struct _gfx { struct _image *img; int x; unsigned int c; }",
"struct _image { int w; unsigned int *pix; void *private; }"
],
"binary_hash": "88f5ed586597aacc3f06e570186d435996ca171f15a1f407fe4b8b8d30a30fc7"
},
{
"name": "gfx_blit",
"canonical_name": "func6",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall gfx_blit(__int64 a1, __int64 a2, __int64 a3, int a4, int a5)\n{\nreturn blitrxy(\na2,\na3,\n*(_QWORD *)a1,\n(unsigned int)(*(_DWORD *)(a1 + 8) + a4),\n(unsigned int)(*(_DWORD *)(a1 + 12) + a5));\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func6(__int64 a1, __int64 a2, __int64 a3, int a4, int a5)\n{\nreturn blitrxy(\na2,\na3,\n*(_QWORD *)a1,\n(unsigned int)(*(_DWORD *)(a1 + 8) + a4),\n(unsigned int)(*(_DWORD *)(a1 + 12) + a5));\n}",
"original_code": "void gfx_blit(gfx *g, image *img, rect *r, int x, int y)\n{\n blitrxy(img, r, g->img, g->x + x, g->y + y);\n}",
"canonical_original_code": "void gfx_blit(struct _gfx *g, struct _image *img, struct rect *r, int x, int y)\n{\n blitrxy(img, r, g->img, g->x + x, g->y + y);\n}",
"variable_types": [
[
"g",
"struct _gfx { struct _image { int w; unsigned int *pix; void *private; } *img; int x; unsigned int c; } *"
],
[
"img",
"struct _image *"
],
[
"r",
"struct rect { int x; } *"
],
[
"x",
"int"
],
[
"y",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct _gfx { struct _image *img; int x; unsigned int c; }",
"struct rect { int x; }",
"struct _image { int w; unsigned int *pix; void *private; }"
],
"binary_hash": "88f5ed586597aacc3f06e570186d435996ca171f15a1f407fe4b8b8d30a30fc7"
}
] |
94086feca732a85e0456d1f74f355b8c381ebb829d7d621088c2ec2d6b4b7bbc | ivartj/platformer | [
[
"add",
"->",
"inc"
],
[
"inc",
"->",
"add",
"prime_check",
"prime_get"
],
[
"prime_get",
"->",
"inc",
"prime_check"
],
[
"prime_check",
"->",
"inc",
"prime_get",
"prime_above"
],
[
"prime_above",
"->",
"prime_check"
]
] | [] | [
{
"name": "add",
"canonical_name": "func0",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall add(unsigned int a1)\n{\nint v1; // eax\n\nif ( cap == len )\n{\nif ( cap )\ncap *= 2;\nelse\ncap = 256;\nprimes = realloc(primes, 4LL * cap);\n}\nv1 = len++;\n*((_DWORD *)primes + v1) = a1;\nreturn a1;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(unsigned int a1)\n{\nint v1; // eax\n\nif ( cap == len )\n{\nif ( cap )\ncap *= 2;\nelse\ncap = 256;\nprimes = realloc(primes, 4LL * cap);\n}\nv1 = len++;\n*((_DWORD *)primes + v1) = a1;\nreturn a1;\n}",
"original_code": "int add(int prime)\n{\n if(cap == len) {\n if(cap == 0)\n cap = 256;\n else\n cap <<= 1;\n primes = realloc(primes, sizeof(int) * cap);\n }\n primes[len++] = prime;\n return prime;\n}",
"canonical_original_code": "int add(int prime)\n{\n if(cap == len) {\n if(cap == 0)\n cap = 256;\n else\n cap <<= 1;\n primes = realloc(primes, sizeof(int) * cap);\n }\n primes[len++] = prime;\n return prime;\n}",
"variable_types": [
[
"prime",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "94086feca732a85e0456d1f74f355b8c381ebb829d7d621088c2ec2d6b4b7bbc"
},
{
"name": "inc",
"canonical_name": "func1",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 inc()\n{\nunsigned int v1; // [rsp+Ch] [rbp-4h]\n\nif ( !len )\nreturn add(2u);\nif ( len == 1 )\nreturn add(3u);\nv1 = *((_DWORD *)primes + len - 1);\ndo\nv1 += 2;\nwhile ( !(unsigned int)prime_check(v1) );\nreturn add(v1);\n}\n",
"canonical_decompiled_code": "__int64 func1()\n{\nunsigned int v1; // [rsp+Ch] [rbp-4h]\n\nif ( !len )\nreturn func0(2u);\nif ( len == 1 )\nreturn func0(3u);\nv1 = *((_DWORD *)primes + len - 1);\ndo\nv1 += 2;\nwhile ( !(unsigned int)func3(v1) );\nreturn func0(v1);\n}",
"original_code": "int inc(void)\n{\n int num;\n switch(len) {\n case 0:\n return add(2);\n case 1:\n return add(3);\n default:\n num = primes[len - 1];\n do {\n num += 2;\n } while(!prime_check(num));\n return add(num);\n }\n}",
"canonical_original_code": "int inc()\n{\n int num;\n switch(len) {\n case 0:\n return add(2);\n case 1:\n return add(3);\n default:\n num = primes[len - 1];\n do {\n num += 2;\n } while(!prime_check(num));\n return add(num);\n }\n}",
"variable_types": [
[
"num",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "94086feca732a85e0456d1f74f355b8c381ebb829d7d621088c2ec2d6b4b7bbc"
},
{
"name": "prime_get",
"canonical_name": "func2",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall prime_get(int a1)\n{\nwhile ( a1 >= len )\ninc();\nreturn *((unsigned int *)primes + a1);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(int a1)\n{\nwhile ( a1 >= len )\nfunc1();\nreturn *((unsigned int *)primes + a1);\n}",
"original_code": "int prime_get(int idx)\n{\n while(len <= idx)\n inc();\n return primes[idx];\n}",
"canonical_original_code": "int prime_get(int idx)\n{\n while(len <= idx)\n inc();\n return primes[idx];\n}",
"variable_types": [
[
"idx",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "94086feca732a85e0456d1f74f355b8c381ebb829d7d621088c2ec2d6b4b7bbc"
},
{
"name": "prime_check",
"canonical_name": "func3",
"repo": "ivartj/platformer",
"decompiled_code": "_BOOL8 __fastcall prime_check(int a1)\n{\nint i; // [rsp+18h] [rbp-8h]\nint v3; // [rsp+1Ch] [rbp-4h]\n\nv3 = 0;\nfor ( i = prime_get(0); a1 >= i * i && a1 % i; i = prime_get(v3) )\n++v3;\nreturn a1 < i * i;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func3(int a1)\n{\nint i; // [rsp+18h] [rbp-8h]\nint v3; // [rsp+1Ch] [rbp-4h]\n\nv3 = 0;\nfor ( i = func2(0); a1 >= i * i && a1 % i; i = func2(v3) )\n++v3;\nreturn a1 < i * i;\n}",
"original_code": "int prime_check(int num)\n{\n int i;\n int prime;\n for(prime = prime_get(i = 0);\n (prime * prime <= num) && (num % prime != 0);\n prime = prime_get(++i));\n if(prime * prime > num)\n return 1;\n else\n return 0;\n}",
"canonical_original_code": "int prime_check(int num)\n{\n int i;\n int prime;\n for(prime = prime_get(i = 0);\n (prime * prime <= num) && (num % prime != 0);\n prime = prime_get(++i));\n if(prime * prime > num)\n return 1;\n else\n return 0;\n}",
"variable_types": [
[
"num",
"int"
],
[
"i",
"int"
],
[
"prime",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "94086feca732a85e0456d1f74f355b8c381ebb829d7d621088c2ec2d6b4b7bbc"
},
{
"name": "prime_above",
"canonical_name": "func4",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall prime_above(int a1)\n{\n_BOOL4 i; // eax\nunsigned int v3; // [rsp+Ch] [rbp-4h]\n\nv3 = a1 + 1;\nfor ( i = prime_check(a1 + 1); !i; i = prime_check(v3) )\n++v3;\nreturn v3;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(int a1)\n{\n_BOOL4 i; // eax\nunsigned int v3; // [rsp+Ch] [rbp-4h]\n\nv3 = a1 + 1;\nfor ( i = func3(a1 + 1); !i; i = func3(v3) )\n++v3;\nreturn v3;\n}",
"original_code": "int prime_above(int num)\n{\n for(++num; !prime_check(num); num++);\n return num;\n}",
"canonical_original_code": "int prime_above(int num)\n{\n for(++num; !prime_check(num); num++);\n return num;\n}",
"variable_types": [
[
"num",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "94086feca732a85e0456d1f74f355b8c381ebb829d7d621088c2ec2d6b4b7bbc"
}
] |
bad56f4f9a108600defa720c7c6c4fa52efa75f2824166a38217fb9fc65fe138 | ivartj/platformer | [
[
"array_create",
"->"
],
[
"array_add",
"->"
],
[
"array_get",
"->"
]
] | [] | [
{
"name": "array_create",
"canonical_name": "func0",
"repo": "ivartj/platformer",
"decompiled_code": "void *array_create()\n{\nreturn calloc(1uLL, 0x10uLL);\n}\n",
"canonical_decompiled_code": "void *func0()\n{\nreturn calloc(1uLL, 0x10uLL);\n}",
"original_code": "array *array_create(void)\n{\n return (array *)calloc(1, sizeof(array));\n}",
"canonical_original_code": "struct _array *array_create()\n{\n return (struct _array *)calloc(1, sizeof(array));\n}",
"variable_types": [],
"return_type": "struct _array { int len; void **els; } *",
"user_defined_types": [
"struct _array { int len; void **els; }"
],
"binary_hash": "bad56f4f9a108600defa720c7c6c4fa52efa75f2824166a38217fb9fc65fe138"
},
{
"name": "array_add",
"canonical_name": "func1",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall array_add(__int64 a1, __int64 a2)\n{\n__int64 v2; // rsi\nint v3; // eax\n\nif ( *(_DWORD *)a1 == *(_DWORD *)(a1 + 4) )\n{\nif ( *(_DWORD *)(a1 + 4) )\n*(_DWORD *)(a1 + 4) *= 2;\nelse\n*(_DWORD *)(a1 + 4) = 256;\n*(_QWORD *)(a1 + 8) = realloc(*(void **)(a1 + 8), 8LL * *(int *)(a1 + 4));\n}\nv2 = *(_QWORD *)(a1 + 8);\nv3 = (*(_DWORD *)a1)++;\n*(_QWORD *)(v2 + 8LL * v3) = a2;\nreturn (unsigned int)(*(_DWORD *)a1 - 1);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1, __int64 a2)\n{\n__int64 v2; // rsi\nint v3; // eax\n\nif ( *(_DWORD *)a1 == *(_DWORD *)(a1 + 4) )\n{\nif ( *(_DWORD *)(a1 + 4) )\n*(_DWORD *)(a1 + 4) *= 2;\nelse\n*(_DWORD *)(a1 + 4) = 256;\n*(_QWORD *)(a1 + 8) = realloc(*(void **)(a1 + 8), 8LL * *(int *)(a1 + 4));\n}\nv2 = *(_QWORD *)(a1 + 8);\nv3 = (*(_DWORD *)a1)++;\n*(_QWORD *)(v2 + 8LL * v3) = a2;\nreturn (unsigned int)(*(_DWORD *)a1 - 1);\n}",
"original_code": "int array_add(array *a, void *el)\n{\n if(a->len == a->cap) {\n if(a->cap == 0)\n a->cap = 256;\n else\n a->cap <<= 1;\n a->els = realloc(a->els, a->cap * sizeof(void *));\n }\n a->els[a->len++] = el;\n return a->len - 1;\n}",
"canonical_original_code": "int array_add(struct _array *a, void *el)\n{\n if(a->len == a->cap) {\n if(a->cap == 0)\n a->cap = 256;\n else\n a->cap <<= 1;\n a->els = realloc(a->els, a->cap * sizeof(void *));\n }\n a->els[a->len++] = el;\n return a->len - 1;\n}",
"variable_types": [
[
"a",
"struct _array { int len; void **els; } *"
],
[
"el",
"void *"
]
],
"return_type": "int",
"user_defined_types": [
"struct _array { int len; void **els; }"
],
"binary_hash": "bad56f4f9a108600defa720c7c6c4fa52efa75f2824166a38217fb9fc65fe138"
},
{
"name": "array_get",
"canonical_name": "func2",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall array_get(__int64 a1, int a2)\n{\n__int64 result; // rax\n\nif ( a2 < *(_DWORD *)a1 )\nresult = *(_QWORD *)(*(_QWORD *)(a1 + 8) + 8LL * a2);\nelse\nresult = 0LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, int a2)\n{\n__int64 result; // rax\n\nif ( a2 < *(_DWORD *)a1 )\nresult = *(_QWORD *)(*(_QWORD *)(a1 + 8) + 8LL * a2);\nelse\nresult = 0LL;\nreturn result;\n}",
"original_code": "void *array_get(array *a, int idx)\n{\n if(idx >= a->len)\n return ((void *)0);\n return a->els[idx];\n}",
"canonical_original_code": "void *array_get(struct _array *a, int idx)\n{\n if(idx >= a->len)\n return ((void *)0);\n return a->els[idx];\n}",
"variable_types": [
[
"a",
"struct _array { int len; void **els; } *"
],
[
"idx",
"int"
]
],
"return_type": "void *",
"user_defined_types": [
"struct _array { int len; void **els; }"
],
"binary_hash": "bad56f4f9a108600defa720c7c6c4fa52efa75f2824166a38217fb9fc65fe138"
}
] |
bfc74420505029695b687851c9461f9d168a41e4da35900be338cd34eb423f2b | ivartj/platformer | [
[
"dlist_create",
"->"
],
[
"dnode_data",
"->"
],
[
"dnode_next",
"->"
],
[
"dnode_prev",
"->"
],
[
"dlist_last",
"->"
],
[
"dlist_first",
"->"
],
[
"dnode_rem",
"->"
],
[
"dlist_add_last",
"->"
],
[
"dlist_add_first",
"->"
],
[
"dlist_iter",
"->"
],
[
"dnode_iter_next",
"->"
]
] | [
[
"dnode_data",
"void *__fastcall func1(__int64 a1, void *a2, size_t a3)\n{\nsize_t n; // [rsp+8h] [rbp-18h]\n\nn = a3;\nif ( a3 != *(_QWORD *)(a1 + 8) )\nwarning(\"dnode_data: mismatch between data type sizes stored and requested\");\nif ( n > *(_QWORD *)(a1 + 8) )\nn = *(_QWORD *)(a1 + 8);\nreturn memcpy(a2, *(const void **)a1, n);\n}"
],
[
"dlist_add_last",
"void **__fastcall func7(void ***a1, const void *a2, size_t a3)\n{\nvoid **v5; // [rsp+28h] [rbp-8h]\n\nv5 = (void **)calloc(1uLL, 0x28uLL);\n*v5 = malloc(a3);\nmemcpy(*v5, a2, a3);\nv5[1] = (void *)a3;\nv5[4] = a1;\nif ( a1[1] )\n{\na1[1][2] = v5;\nv5[3] = a1[1];\n}\nelse\n{\n*a1 = v5;\n}\na1[1] = v5;\nreturn v5;\n}"
],
[
"dlist_add_first",
"void **__fastcall func8(void ***a1, const void *a2, size_t a3)\n{\nvoid **v5; // [rsp+28h] [rbp-8h]\n\nv5 = (void **)calloc(1uLL, 0x28uLL);\n*v5 = malloc(a3);\nmemcpy(*v5, a2, a3);\nv5[1] = (void *)a3;\nv5[4] = a1;\nif ( *a1 )\n{\n(*a1)[3] = v5;\nv5[2] = *a1;\n}\nelse\n{\na1[1] = v5;\n}\n*a1 = v5;\nreturn v5;\n}"
]
] | [
{
"name": "dlist_create",
"canonical_name": "func0",
"repo": "ivartj/platformer",
"decompiled_code": "void *dlist_create()\n{\nreturn calloc(1uLL, 0x10uLL);\n}\n",
"canonical_decompiled_code": "void *func0()\n{\nreturn calloc(1uLL, 0x10uLL);\n}",
"original_code": "dlist *dlist_create(void)\n{\n dlist *dl;\n dl = calloc(1, sizeof(dlist));\n return dl;\n}",
"canonical_original_code": "struct _dlist *dlist_create()\n{\n struct _dlist *dl;\n dl = calloc(1, sizeof(dlist));\n return dl;\n}",
"variable_types": [
[
"dl",
"struct _dlist { struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist *list; } *first; struct _dnode *last; } *"
]
],
"return_type": "struct _dlist { struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist *list; } *first; struct _dnode *last; } *",
"user_defined_types": [
"struct _dlist { struct _dnode *first; struct _dnode *last; }",
"struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist *list; }"
],
"binary_hash": "bfc74420505029695b687851c9461f9d168a41e4da35900be338cd34eb423f2b"
},
{
"name": "dnode_next",
"canonical_name": "func2",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall dnode_next(__int64 a1)\n{\nreturn *(_QWORD *)(a1 + 16);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1)\n{\nreturn *(_QWORD *)(a1 + 16);\n}",
"original_code": "dnode *dnode_next(dnode *dn)\n{\n return dn->next;\n}",
"canonical_original_code": "struct _dnode *dnode_next(struct _dnode *dn)\n{\n return dn->next;\n}",
"variable_types": [
[
"dn",
"struct _dnode *"
]
],
"return_type": "struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist { struct _dnode *first; struct _dnode *last; } *list; } *",
"user_defined_types": [
"struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist *list; }",
"struct _dlist { struct _dnode *first; struct _dnode *last; }"
],
"binary_hash": "bfc74420505029695b687851c9461f9d168a41e4da35900be338cd34eb423f2b"
},
{
"name": "dnode_prev",
"canonical_name": "func3",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall dnode_prev(__int64 a1)\n{\nreturn *(_QWORD *)(a1 + 24);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1)\n{\nreturn *(_QWORD *)(a1 + 24);\n}",
"original_code": "dnode *dnode_prev(dnode *dn)\n{\n return dn->prev;\n}",
"canonical_original_code": "struct _dnode *dnode_prev(struct _dnode *dn)\n{\n return dn->prev;\n}",
"variable_types": [
[
"dn",
"struct _dnode *"
]
],
"return_type": "struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist { struct _dnode *first; struct _dnode *last; } *list; } *",
"user_defined_types": [
"struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist *list; }",
"struct _dlist { struct _dnode *first; struct _dnode *last; }"
],
"binary_hash": "bfc74420505029695b687851c9461f9d168a41e4da35900be338cd34eb423f2b"
},
{
"name": "dlist_last",
"canonical_name": "func4",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall dlist_last(__int64 a1)\n{\nreturn *(_QWORD *)(a1 + 8);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1)\n{\nreturn *(_QWORD *)(a1 + 8);\n}",
"original_code": "dnode *dlist_last(dlist *dl)\n{\n return dl->last;\n}",
"canonical_original_code": "struct _dnode *dlist_last(struct _dlist *dl)\n{\n return dl->last;\n}",
"variable_types": [
[
"dl",
"struct _dlist *"
]
],
"return_type": "struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist { struct _dnode *first; struct _dnode *last; } *list; } *",
"user_defined_types": [
"struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist *list; }",
"struct _dlist { struct _dnode *first; struct _dnode *last; }"
],
"binary_hash": "bfc74420505029695b687851c9461f9d168a41e4da35900be338cd34eb423f2b"
},
{
"name": "dlist_first",
"canonical_name": "func5",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall dlist_first(__int64 a1)\n{\nreturn *(_QWORD *)a1;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1)\n{\nreturn *(_QWORD *)a1;\n}",
"original_code": "dnode *dlist_first(dlist *dl)\n{\n return dl->first;\n}",
"canonical_original_code": "struct _dnode *dlist_first(struct _dlist *dl)\n{\n return dl->first;\n}",
"variable_types": [
[
"dl",
"struct _dlist *"
]
],
"return_type": "struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist { struct _dnode *first; struct _dnode *last; } *list; } *",
"user_defined_types": [
"struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist *list; }",
"struct _dlist { struct _dnode *first; struct _dnode *last; }"
],
"binary_hash": "bfc74420505029695b687851c9461f9d168a41e4da35900be338cd34eb423f2b"
},
{
"name": "dnode_rem",
"canonical_name": "func6",
"repo": "ivartj/platformer",
"decompiled_code": "void __fastcall dnode_rem(__int64 a1)\n{\nif ( *(_QWORD *)(a1 + 24) )\n*(_QWORD *)(*(_QWORD *)(a1 + 24) + 16LL) = *(_QWORD *)(a1 + 16);\nelse\n**(_QWORD **)(a1 + 32) = *(_QWORD *)(a1 + 16);\nif ( *(_QWORD *)(a1 + 16) )\n*(_QWORD *)(*(_QWORD *)(a1 + 16) + 24LL) = *(_QWORD *)(a1 + 24);\nelse\n*(_QWORD *)(*(_QWORD *)(a1 + 32) + 8LL) = *(_QWORD *)(a1 + 24);\nfree(*(void **)a1);\nfree((void *)a1);\n}\n",
"canonical_decompiled_code": "void __fastcall func6(__int64 a1)\n{\nif ( *(_QWORD *)(a1 + 24) )\n*(_QWORD *)(*(_QWORD *)(a1 + 24) + 16LL) = *(_QWORD *)(a1 + 16);\nelse\n**(_QWORD **)(a1 + 32) = *(_QWORD *)(a1 + 16);\nif ( *(_QWORD *)(a1 + 16) )\n*(_QWORD *)(*(_QWORD *)(a1 + 16) + 24LL) = *(_QWORD *)(a1 + 24);\nelse\n*(_QWORD *)(*(_QWORD *)(a1 + 32) + 8LL) = *(_QWORD *)(a1 + 24);\nfree(*(void **)a1);\nfree((void *)a1);\n}",
"original_code": "void dnode_rem(dnode *dn)\n{\n if(dn->prev != ((void *)0))\n dn->prev->next = dn->next;\n else\n dn->list->first = dn->next;\n if(dn->next != ((void *)0))\n dn->next->prev = dn->prev;\n else\n dn->list->last = dn->prev;\n free(dn->data);\n free(dn);\n}",
"canonical_original_code": "void dnode_rem(struct _dnode *dn)\n{\n if(dn->prev != ((void *)0))\n dn->prev->next = dn->next;\n else\n dn->list->first = dn->next;\n if(dn->next != ((void *)0))\n dn->next->prev = dn->prev;\n else\n dn->list->last = dn->prev;\n free(dn->data);\n free(dn);\n}",
"variable_types": [
[
"dn",
"struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist { struct _dnode *first; struct _dnode *last; } *list; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist *list; }",
"struct _dlist { struct _dnode *first; struct _dnode *last; }"
],
"binary_hash": "bfc74420505029695b687851c9461f9d168a41e4da35900be338cd34eb423f2b"
},
{
"name": "dlist_iter",
"canonical_name": "func9",
"repo": "ivartj/platformer",
"decompiled_code": "_BOOL8 __fastcall dlist_iter(_QWORD *a1, _QWORD *a2)\n{\n*a2 = *a1;\na2[1] = dnode_iter_next;\nreturn *a1 != 0LL;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func9(_QWORD *a1, _QWORD *a2)\n{\n*a2 = *a1;\na2[1] = dnode_iter_next;\nreturn *a1 != 0LL;\n}",
"original_code": "int dlist_iter(dlist *dl, iter *i)\n{\n i->data.v = dl->first;\n i->next = dnode_iter_next;\n return dl->first != ((void *)0);\n}",
"canonical_original_code": "int dlist_iter(struct _dlist *dl, struct _iter *i)\n{\n i->data.v = dl->first;\n i->next = dnode_iter_next;\n return dl->first != ((void *)0);\n}",
"variable_types": [
[
"dl",
"struct _dlist { struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist *list; } *first; struct _dnode *last; } *"
],
[
"i",
"struct _iter { union _data { void *v; int i; double d; } data; int (*next)(struct _iter *i, void *retval); } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct _dlist { struct _dnode *first; struct _dnode *last; }",
"struct _iter { union _data data; int (*next)(struct _iter *i, void *retval); }",
"union _data { void *v; int i; double d; }",
"struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist *list; }"
],
"binary_hash": "bfc74420505029695b687851c9461f9d168a41e4da35900be338cd34eb423f2b"
},
{
"name": "dnode_iter_next",
"canonical_name": "func10",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall dnode_iter_next(__int64 *a1, void *a2)\n{\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nv3 = *a1;\nif ( !*a1 )\nreturn 0LL;\n*a1 = *(_QWORD *)(v3 + 16);\nmemcpy(a2, *(const void **)v3, *(_QWORD *)(v3 + 8));\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func10(__int64 *a1, void *a2)\n{\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nv3 = *a1;\nif ( !*a1 )\nreturn 0LL;\n*a1 = *(_QWORD *)(v3 + 16);\nmemcpy(a2, *(const void **)v3, *(_QWORD *)(v3 + 8));\nreturn 1LL;\n}",
"original_code": "int dnode_iter_next(iter *i, void *retval)\n{\n dnode *dn;\n dn = (dnode *)(i->data.v);\n if(dn == ((void *)0))\n return 0;\n i->data.v = dn->next;\n memcpy(retval, dn->data, dn->datalen);\n return 1;\n}",
"canonical_original_code": "int dnode_iter_next(struct _iter *i, void *retval)\n{\n struct _dnode *dn;\n dn = (struct _dnode *)(i->data.v);\n if(dn == ((void *)0))\n return 0;\n i->data.v = dn->next;\n memcpy(retval, dn->data, dn->datalen);\n return 1;\n}",
"variable_types": [
[
"i",
"struct _iter { union _data { void *v; int i; double d; } data; int (*next)(struct _iter *i, void *retval); } *"
],
[
"retval",
"void *"
],
[
"dn",
"struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist { struct _dnode *first; struct _dnode *last; } *list; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct _iter { union _data data; int (*next)(struct _iter *i, void *retval); }",
"struct _dnode { void *data; unsigned long datalen; struct _dnode *next; struct _dnode *prev; struct _dlist *list; }",
"union _data { void *v; int i; double d; }",
"struct _dlist { struct _dnode *first; struct _dnode *last; }"
],
"binary_hash": "bfc74420505029695b687851c9461f9d168a41e4da35900be338cd34eb423f2b"
}
] |
d756886964b3524f15b971877c8cadd81f2de76039e76b782bdd482f7c269c0b | ivartj/platformer | [
[
"ps2rect",
"->"
],
[
"rect_isoverlap",
"->"
],
[
"rect_iswithin",
"->"
]
] | [] | [
{
"name": "ps2rect",
"canonical_name": "func0",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall ps2rect(int a1, int a2, int a3, int a4)\n{\n__int64 v5; // [rsp+10h] [rbp-10h]\n\nif ( a1 >= a3 )\nLODWORD(v5) = a3;\nelse\nLODWORD(v5) = a1;\nif ( a2 >= a4 )\nHIDWORD(v5) = a4;\nelse\nHIDWORD(v5) = a2;\nreturn v5;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(int a1, int a2, int a3, int a4)\n{\n__int64 v5; // [rsp+10h] [rbp-10h]\n\nif ( a1 >= a3 )\nLODWORD(v5) = a3;\nelse\nLODWORD(v5) = a1;\nif ( a2 >= a4 )\nHIDWORD(v5) = a4;\nelse\nHIDWORD(v5) = a2;\nreturn v5;\n}",
"original_code": "rect ps2rect(int x, int y, int x2, int y2)\n{\n rect r;\n if(x < x2) {\n r.x = x;\n r.w = x2 - x;\n } else {\n r.x = x2;\n r.w = x - x2;\n }\n if(y < y2) {\n r.y = y;\n r.h = y2 - y;\n } else {\n r.y = y2;\n r.h = y - y2;\n }\n return r;\n}",
"canonical_original_code": "struct rect ps2rect(int x, int y, int x2, int y2)\n{\n struct rect r;\n if(x < x2) {\n r.x = x;\n r.w = x2 - x;\n } else {\n r.x = x2;\n r.w = x - x2;\n }\n if(y < y2) {\n r.y = y;\n r.h = y2 - y;\n } else {\n r.y = y2;\n r.h = y - y2;\n }\n return r;\n}",
"variable_types": [
[
"x",
"int"
],
[
"y",
"int"
],
[
"x2",
"int"
],
[
"y2",
"int"
],
[
"r",
"struct rect { int x; }"
]
],
"return_type": "struct rect { int x; }",
"user_defined_types": [
"struct rect { int x; }"
],
"binary_hash": "d756886964b3524f15b971877c8cadd81f2de76039e76b782bdd482f7c269c0b"
},
{
"name": "rect_isoverlap",
"canonical_name": "func1",
"repo": "ivartj/platformer",
"decompiled_code": "_BOOL8 __fastcall rect_isoverlap(_DWORD *a1, _DWORD *a2)\n{\nif ( *a2 >= *a1 + a1[2] )\nreturn 0LL;\nif ( *a1 >= *a2 + a2[2] )\nreturn 0LL;\nif ( a2[1] < a1[1] + a1[3] )\nreturn a1[1] < a2[1] + a2[3];\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func1(_DWORD *a1, _DWORD *a2)\n{\nif ( *a2 >= *a1 + a1[2] )\nreturn 0LL;\nif ( *a1 >= *a2 + a2[2] )\nreturn 0LL;\nif ( a2[1] < a1[1] + a1[3] )\nreturn a1[1] < a2[1] + a2[3];\nreturn 0LL;\n}",
"original_code": "int rect_isoverlap(rect *a, rect *b)\n{\n if(b->x >= a->x + a->w)\n return 0;\n if(a->x >= b->x + b->w)\n return 0;\n if(b->y >= a->y + a->h)\n return 0;\n if(a->y >= b->y + b->h)\n return 0;\n return 1;\n}",
"canonical_original_code": "int rect_isoverlap(struct rect *a, struct rect *b)\n{\n if(b->x >= a->x + a->w)\n return 0;\n if(a->x >= b->x + b->w)\n return 0;\n if(b->y >= a->y + a->h)\n return 0;\n if(a->y >= b->y + b->h)\n return 0;\n return 1;\n}",
"variable_types": [
[
"a",
"struct rect { int x; } *"
],
[
"b",
"struct rect *"
]
],
"return_type": "int",
"user_defined_types": [
"struct rect { int x; }"
],
"binary_hash": "d756886964b3524f15b971877c8cadd81f2de76039e76b782bdd482f7c269c0b"
},
{
"name": "rect_iswithin",
"canonical_name": "func2",
"repo": "ivartj/platformer",
"decompiled_code": "_BOOL8 __fastcall rect_iswithin(_DWORD *a1, _DWORD *a2)\n{\nif ( *a1 > *a2 )\nreturn 0LL;\nif ( a1[2] + *a1 < *a2 + a2[2] )\nreturn 0LL;\nif ( a1[1] <= a2[1] )\nreturn a1[3] + a1[1] >= a2[1] + a2[3];\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func2(_DWORD *a1, _DWORD *a2)\n{\nif ( *a1 > *a2 )\nreturn 0LL;\nif ( a1[2] + *a1 < *a2 + a2[2] )\nreturn 0LL;\nif ( a1[1] <= a2[1] )\nreturn a1[3] + a1[1] >= a2[1] + a2[3];\nreturn 0LL;\n}",
"original_code": "int rect_iswithin(rect *a, rect *b)\n{\n if(a->x > b->x)\n return 0;\n if(a->x + a->w < b->x + b->w)\n return 0;\n if(a->y > b->y)\n return 0;\n if(a->y + a->h < b->y + b->h)\n return 0;\n return 1;\n}",
"canonical_original_code": "int rect_iswithin(struct rect *a, struct rect *b)\n{\n if(a->x > b->x)\n return 0;\n if(a->x + a->w < b->x + b->w)\n return 0;\n if(a->y > b->y)\n return 0;\n if(a->y + a->h < b->y + b->h)\n return 0;\n return 1;\n}",
"variable_types": [
[
"a",
"struct rect { int x; } *"
],
[
"b",
"struct rect *"
]
],
"return_type": "int",
"user_defined_types": [
"struct rect { int x; }"
],
"binary_hash": "d756886964b3524f15b971877c8cadd81f2de76039e76b782bdd482f7c269c0b"
}
] |
e06c9b7b1f298134c86cfefa7c6407c3d9b9d07cb7f8663d60e8759667a34906 | ivartj/platformer | [
[
"usage",
"->",
"parseargs"
],
[
"parseargs",
"->",
"usage",
"main"
],
[
"init",
"->",
"main"
],
[
"fail",
"->"
],
[
"quit",
"->",
"main"
],
[
"main",
"->",
"parseargs",
"init",
"quit"
]
] | [
[
"usage",
"size_t __fastcall func0(FILE *a1)\n{\nreturn fwrite(\"usage: game\\n\", 1uLL, 0xCuLL, a1);\n}"
]
] | [
{
"name": "parseargs",
"canonical_name": "func1",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall parseargs(int a1, char *const *a2)\n{\nint v2; // eax\n__int64 result; // rax\n\nwhile ( 1 )\n{\nv2 = getopt_long(a1, a2, \"h\", &longopts_0, 0LL);\nif ( v2 == -1 )\nbreak;\nif ( v2 == 104 )\n{\nusage(stdout);\nexit(0);\n}\nif ( v2 <= 104 && (v2 == 58 || v2 == 63) )\n{\nusage(stderr);\nexit(1);\n}\n}\nresult = (unsigned int)(a1 - optind);\nif ( a1 != optind )\n{\nusage(stderr);\nexit(1);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(int a1, char *const *a2)\n{\nint v2; // eax\n__int64 result; // rax\n\nwhile ( 1 )\n{\nv2 = getopt_long(a1, a2, \"h\", &longopts_0, 0LL);\nif ( v2 == -1 )\nbreak;\nif ( v2 == 104 )\n{\nfunc0(stdout);\nexit(0);\n}\nif ( v2 <= 104 && (v2 == 58 || v2 == 63) )\n{\nfunc0(stderr);\nexit(1);\n}\n}\nresult = (unsigned int)(a1 - optind);\nif ( a1 != optind )\n{\nfunc0(stderr);\nexit(1);\n}\nreturn result;\n}",
"original_code": "void parseargs(int argc, char *argv[])\n{\n int c;\n static struct option longopts[] = {\n { \"help\", 0, ((void *)0), 'h' },\n { 0, 0, 0, 0 },\n };\n while((c = getopt_long(argc, argv, \"h\", longopts, ((void *)0))) != -1)\n switch(c) {\n case 'h':\n usage(stdout);\n exit(0);\n case '?':\n case ':':\n usage(stderr);\n exit(1);\n }\n switch(argc - optind) {\n case 0:\n break;\n default:\n usage(stderr);\n exit(1);\n }\n}",
"canonical_original_code": "void parseargs(int argc, char *argv[])\n{\n int c;\n static struct option longopts[] = {\n { \"help\", 0, ((void *)0), 'h' },\n { 0, 0, 0, 0 },\n };\n while((c = getopt_long(argc, argv, \"h\", longopts, ((void *)0))) != -1)\n switch(c) {\n case 'h':\n usage(stdout);\n exit(0);\n case '?':\n case ':':\n usage(stderr);\n exit(1);\n }\n switch(argc - optind) {\n case 0:\n break;\n default:\n usage(stderr);\n exit(1);\n }\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char *[]"
],
[
"c",
"int"
],
[
"longopts",
"struct option { char *name; int has_arg; int *flag; int val; } []"
]
],
"return_type": "void",
"user_defined_types": [
"struct option { char *name; int has_arg; int *flag; int val; }"
],
"binary_hash": "e06c9b7b1f298134c86cfefa7c6407c3d9b9d07cb7f8663d60e8759667a34906"
},
{
"name": "init",
"canonical_name": "func2",
"repo": "ivartj/platformer",
"decompiled_code": "void init()\n{\nint v0; // eax\nconst char *v1; // rdx\nint v2; // eax\nconst char *v3; // rdx\n\nif ( (unsigned int)video_init(640LL, 480LL) )\n{\nv0 = geterrmsg();\nerror((int)\"Failed to initialize video: %s\", v0, v1);\n}\nif ( (unsigned int)load_init() )\n{\nv2 = geterrmsg();\nerror((int)\"Failed to initialize image loading: %s\", v2, v3);\n}\n}\n",
"canonical_decompiled_code": "void func2()\n{\nint v0; // eax\nconst char *v1; // rdx\nint v2; // eax\nconst char *v3; // rdx\n\nif ( (unsigned int)video_init(640LL, 480LL) )\n{\nv0 = geterrmsg();\nerror((int)\"Failed to initialize video: %s\", v0, v1);\n}\nif ( (unsigned int)load_init() )\n{\nv2 = geterrmsg();\nerror((int)\"Failed to initialize image loading: %s\", v2, v3);\n}\n}",
"original_code": "void init(void)\n{\n int err;\n err = video_init(640, 480);\n if(err)\n error(\"Failed to initialize video: %s\", geterrmsg());\n err = load_init();\n if(err)\n error(\"Failed to initialize image loading: %s\", geterrmsg());\n}",
"canonical_original_code": "void init()\n{\n int err;\n err = video_init(640, 480);\n if(err)\n error(\"Failed to initialize video: %s\", geterrmsg());\n err = load_init();\n if(err)\n error(\"Failed to initialize image loading: %s\", geterrmsg());\n}",
"variable_types": [
[
"err",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "e06c9b7b1f298134c86cfefa7c6407c3d9b9d07cb7f8663d60e8759667a34906"
},
{
"name": "fail",
"canonical_name": "func3",
"repo": "ivartj/platformer",
"decompiled_code": "void __noreturn fail()\n{\nexit(1);\n}\n",
"canonical_decompiled_code": "void __noreturn func3()\n{\nexit(1);\n}",
"original_code": "void fail(void)\n{\n exit(1);\n}",
"canonical_original_code": "void fail()\n{\n exit(1);\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "e06c9b7b1f298134c86cfefa7c6407c3d9b9d07cb7f8663d60e8759667a34906"
},
{
"name": "quit",
"canonical_name": "func4",
"repo": "ivartj/platformer",
"decompiled_code": "void __noreturn quit()\n{\nexit(0);\n}\n",
"canonical_decompiled_code": "void __noreturn func4()\n{\nexit(0);\n}",
"original_code": "void quit(void)\n{\n exit(0);\n}",
"canonical_original_code": "void quit()\n{\n exit(0);\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "e06c9b7b1f298134c86cfefa7c6407c3d9b9d07cb7f8663d60e8759667a34906"
},
{
"name": "main",
"canonical_name": "main",
"repo": "ivartj/platformer",
"decompiled_code": "int __cdecl __noreturn main(int argc, const char **argv, const char **envp)\n{\nparseargs(argc, (char *const *)argv);\ninit();\nquit((unsigned int)argc);\n}\n",
"canonical_decompiled_code": "int __cdecl __noreturn main(int argc, const char **argv, const char **envp)\n{\nfunc1(argc, (char *const *)argv);\nfunc2();\nfunc4((unsigned int)argc);\n}",
"original_code": "int main(int argc, char *argv[])\n{\n parseargs(argc, argv);\n init();\n quit();\n return 0;\n}",
"canonical_original_code": "int main(int argc, char *argv[])\n{\n parseargs(argc, argv);\n init();\n quit();\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char *[]"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "e06c9b7b1f298134c86cfefa7c6407c3d9b9d07cb7f8663d60e8759667a34906"
}
] |
e0922b9f5c1541636462ee6f262af4c492bc588fbd8972bfb8e3b7128f4a861e | ivartj/platformer | [
[
"seterrmsg_freeimage",
"->"
],
[
"load_init",
"->"
],
[
"load_image",
"->"
]
] | [] | [
{
"name": "seterrmsg_freeimage",
"canonical_name": "func0",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall seterrmsg_freeimage(__int64 a1, __int64 a2)\n{\nreturn seterrmsg(&unk_1F4, a2);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, __int64 a2)\n{\nreturn seterrmsg(&unk_1F4, a2);\n}",
"original_code": "static void seterrmsg_freeimage(FREE_IMAGE_FORMAT fif, const char *message)\n{\n seterrmsg(\"%s\", message);\n}",
"canonical_original_code": "static void seterrmsg_freeimage(int fif, char *message)\n{\n seterrmsg(\"%s\", message);\n}",
"variable_types": [
[
"fif",
"int"
],
[
"message",
"char *"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "e0922b9f5c1541636462ee6f262af4c492bc588fbd8972bfb8e3b7128f4a861e"
},
{
"name": "load_init",
"canonical_name": "func1",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 load_init()\n{\nFreeImage_Initialise(0LL);\natexit((void (*)(void))&FreeImage_DeInitialise);\nFreeImage_SetOutputMessage(seterrmsg_freeimage);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 func1()\n{\nFreeImage_Initialise(0LL);\natexit((void (*)(void))&FreeImage_DeInitialise);\nFreeImage_SetOutputMessage(seterrmsg_freeimage);\nreturn 0LL;\n}",
"original_code": "int load_init(void)\n{\n FreeImage_Initialise(0);\n atexit(FreeImage_DeInitialise);\n FreeImage_SetOutputMessage(seterrmsg_freeimage);\n return 0;\n}",
"canonical_original_code": "int load_init()\n{\n FreeImage_Initialise(0);\n atexit(FreeImage_DeInitialise);\n FreeImage_SetOutputMessage(seterrmsg_freeimage);\n return 0;\n}",
"variable_types": [],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "e0922b9f5c1541636462ee6f262af4c492bc588fbd8972bfb8e3b7128f4a861e"
},
{
"name": "load_image",
"canonical_name": "func2",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 __fastcall load_image(__int64 a1)\n{\nconst char *v1; // rax\n__int64 result; // rax\nconst char *v3; // rax\n__int64 v4; // [rsp+18h] [rbp-38h]\n__int64 v5; // [rsp+28h] [rbp-28h]\nunsigned int v6; // [rsp+30h] [rbp-20h]\nunsigned int v7; // [rsp+34h] [rbp-1Ch]\n__int64 v8; // [rsp+38h] [rbp-18h]\n__int64 v9; // [rsp+40h] [rbp-10h]\nint i; // [rsp+4Ch] [rbp-4h]\n\nv8 = FreeImage_Load(13LL, a1, 0LL);\nif ( v8 )\n{\nv7 = FreeImage_GetWidth(v8);\nv6 = FreeImage_GetHeight(v8);\nv5 = FreeImage_Allocate(v7, v6, 32LL, 16711680LL, 65280LL, 255LL);\nif ( (unsigned int)FreeImage_Paste(v5, v8, 0LL, 0LL, 255LL) )\n{\nFreeImage_Unload(v8);\nv4 = FreeImage_GetBits(v5);\nv9 = image_create(v7, v6);\nfor ( i = 0; i < (int)v6; ++i )\nmemcpy(\n(void *)(*(_QWORD *)(v9 + 8) + 4LL * (int)(v7 * i)),\n(const void *)(v4 + 4LL * (int)(v7 * (v6 - 1 - i))),\n4LL * (int)v7);\nFreeImage_Unload(v5);\nresult = v9;\n}\nelse\n{\nv3 = (const char *)geterrmsg();\nseterrmsg(\"FreeImage_Paste: %s\", v3);\nFreeImage_Unload(v8);\nFreeImage_Unload(v5);\nresult = 0LL;\n}\n}\nelse\n{\nv1 = (const char *)geterrmsg();\nseterrmsg(\"FreeImage_Load: %s\", v1);\nresult = 0LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1)\n{\nconst char *v1; // rax\n__int64 result; // rax\nconst char *v3; // rax\n__int64 v4; // [rsp+18h] [rbp-38h]\n__int64 v5; // [rsp+28h] [rbp-28h]\nunsigned int v6; // [rsp+30h] [rbp-20h]\nunsigned int v7; // [rsp+34h] [rbp-1Ch]\n__int64 v8; // [rsp+38h] [rbp-18h]\n__int64 v9; // [rsp+40h] [rbp-10h]\nint i; // [rsp+4Ch] [rbp-4h]\n\nv8 = FreeImage_Load(13LL, a1, 0LL);\nif ( v8 )\n{\nv7 = FreeImage_GetWidth(v8);\nv6 = FreeImage_GetHeight(v8);\nv5 = FreeImage_Allocate(v7, v6, 32LL, 16711680LL, 65280LL, 255LL);\nif ( (unsigned int)FreeImage_Paste(v5, v8, 0LL, 0LL, 255LL) )\n{\nFreeImage_Unload(v8);\nv4 = FreeImage_GetBits(v5);\nv9 = image_create(v7, v6);\nfor ( i = 0; i < (int)v6; ++i )\nmemcpy(\n(void *)(*(_QWORD *)(v9 + 8) + 4LL * (int)(v7 * i)),\n(const void *)(v4 + 4LL * (int)(v7 * (v6 - 1 - i))),\n4LL * (int)v7);\nFreeImage_Unload(v5);\nresult = v9;\n}\nelse\n{\nv3 = (const char *)geterrmsg();\nseterrmsg(\"FreeImage_Paste: %s\", v3);\nFreeImage_Unload(v8);\nFreeImage_Unload(v5);\nresult = 0LL;\n}\n}\nelse\n{\nv1 = (const char *)geterrmsg();\nseterrmsg(\"FreeImage_Load: %s\", v1);\nresult = 0LL;\n}\nreturn result;\n}",
"original_code": "image *load_image(const char *path)\n{\n FIBITMAP *src;\n FIBITMAP *dest;\n int width, height;\n int ok;\n int x, y;\n image *val = ((void *)0);\n color *bitmap;\n src = FreeImage_Load(FIF_PNG, path, 0);\n if(src == ((void *)0)) {\n seterrmsg(\"FreeImage_Load: %s\", geterrmsg());\n return ((void *)0);\n }\n width = FreeImage_GetWidth(src);\n height = FreeImage_GetHeight(src);\n dest = FreeImage_Allocate(width, height, 32,\n 0x00FF0000,\n 0x0000FF00,\n 0x000000FF);\n ok = FreeImage_Paste(dest, src, 0, 0, 255);\n if(!ok) {\n seterrmsg(\"FreeImage_Paste: %s\", geterrmsg());\n FreeImage_Unload(src);\n FreeImage_Unload(dest);\n return ((void *)0);\n }\n FreeImage_Unload(src);\n bitmap = (color *)FreeImage_GetBits(dest);\n val = image_create(width, height);\n for(y = 0; y < height; y++)\n memcpy(&(val->pix[y * width]), &(bitmap[(height - 1 - y) * width]), width * sizeof(color));\n FreeImage_Unload(dest);\n return val;\n}",
"canonical_original_code": "struct _image *load_image(char *path)\n{\n struct FIBITMAP *src;\n struct FIBITMAP *dest;\n int width; int height;\n int ok;\n int x; int y;\n struct _image *val = ((void *)0);\n unsigned int *bitmap;\n src = FreeImage_Load(FIF_PNG, path, 0);\n if(src == ((void *)0)) {\n seterrmsg(\"FreeImage_Load: %s\", geterrmsg());\n return ((void *)0);\n }\n width = FreeImage_GetWidth(src);\n height = FreeImage_GetHeight(src);\n dest = FreeImage_Allocate(width, height, 32,\n 0x00FF0000,\n 0x0000FF00,\n 0x000000FF);\n ok = FreeImage_Paste(dest, src, 0, 0, 255);\n if(!ok) {\n seterrmsg(\"FreeImage_Paste: %s\", geterrmsg());\n FreeImage_Unload(src);\n FreeImage_Unload(dest);\n return ((void *)0);\n }\n FreeImage_Unload(src);\n bitmap = (unsigned int *)FreeImage_GetBits(dest);\n val = image_create(width, height);\n for(y = 0; y < height; y++)\n memcpy(&(val->pix[y * width]), &(bitmap[(height - 1 - y) * width]), width * sizeof(color));\n FreeImage_Unload(dest);\n return val;\n}",
"variable_types": [
[
"path",
"char *"
],
[
"src",
"struct FIBITMAP { void *data; } *"
],
[
"dest",
"struct FIBITMAP { void *data; } *"
],
[
"width",
"int"
],
[
"height",
"int"
],
[
"ok",
"int"
],
[
"x",
"int"
],
[
"y",
"int"
],
[
"val",
"struct _image { int w; unsigned int *pix; void *private; } *"
],
[
"bitmap",
"unsigned int *"
]
],
"return_type": "struct _image { int w; unsigned int *pix; void *private; } *",
"user_defined_types": [
"struct FIBITMAP { void *data; }",
"struct _image { int w; unsigned int *pix; void *private; }"
],
"binary_hash": "e0922b9f5c1541636462ee6f262af4c492bc588fbd8972bfb8e3b7128f4a861e"
}
] |
e0dcb09af64baf515410cd7c64a5081db502336e0fb0b33935760a22965f5e3e | ivartj/platformer | [
[
"geterrmsg",
"->"
],
[
"seterrmsg",
"->"
],
[
"vwarning",
"->",
"error",
"warning"
],
[
"error",
"->",
"vwarning"
],
[
"warning",
"->",
"vwarning"
]
] | [] | [
{
"name": "geterrmsg",
"canonical_name": "func0",
"repo": "ivartj/platformer",
"decompiled_code": "void *geterrmsg()\n{\nreturn &errmsg;\n}\n",
"canonical_decompiled_code": "void *func0()\n{\nreturn &errmsg;\n}",
"original_code": "char *geterrmsg(void)\n{\n return errmsg;\n}",
"canonical_original_code": "char *geterrmsg()\n{\n return errmsg;\n}",
"variable_types": [],
"return_type": "char *",
"user_defined_types": [],
"binary_hash": "e0dcb09af64baf515410cd7c64a5081db502336e0fb0b33935760a22965f5e3e"
},
{
"name": "seterrmsg",
"canonical_name": "func1",
"repo": "ivartj/platformer",
"decompiled_code": "__int64 seterrmsg(const char *a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, ...)\n{\nchar s[8]; // [rsp+10h] [rbp-1D0h] BYREF\n__int64 v8; // [rsp+18h] [rbp-1C8h]\n__int64 v9; // [rsp+20h] [rbp-1C0h]\n__int64 v10; // [rsp+28h] [rbp-1B8h]\n__int64 v11; // [rsp+30h] [rbp-1B0h]\n__int64 v12; // [rsp+38h] [rbp-1A8h]\n__int64 v13; // [rsp+40h] [rbp-1A0h]\n__int64 v14; // [rsp+48h] [rbp-198h]\n__int64 v15; // [rsp+50h] [rbp-190h]\n__int64 v16; // [rsp+58h] [rbp-188h]\n__int64 v17; // [rsp+60h] [rbp-180h]\n__int64 v18; // [rsp+68h] [rbp-178h]\n__int64 v19; // [rsp+70h] [rbp-170h]\n__int64 v20; // [rsp+78h] [rbp-168h]\n__int64 v21; // [rsp+80h] [rbp-160h]\n__int64 v22; // [rsp+88h] [rbp-158h]\n__int64 v23; // [rsp+90h] [rbp-150h]\n__int64 v24; // [rsp+98h] [rbp-148h]\n__int64 v25; // [rsp+A0h] [rbp-140h]\n__int64 v26; // [rsp+A8h] [rbp-138h]\n__int64 v27; // [rsp+B0h] [rbp-130h]\n__int64 v28; // [rsp+B8h] [rbp-128h]\n__int64 v29; // [rsp+C0h] [rbp-120h]\n__int64 v30; // [rsp+C8h] [rbp-118h]\n__int64 v31; // [rsp+D0h] [rbp-110h]\n__int64 v32; // [rsp+D8h] [rbp-108h]\n__int64 v33; // [rsp+E0h] [rbp-100h]\n__int64 v34; // [rsp+E8h] [rbp-F8h]\n__int64 v35; // [rsp+F0h] [rbp-F0h]\n__int64 v36; // [rsp+F8h] [rbp-E8h]\n__int64 v37; // [rsp+100h] [rbp-E0h]\n__int64 v38; // [rsp+108h] [rbp-D8h]\ngcc_va_list arg; // [rsp+110h] [rbp-D0h] BYREF\nint v40; // [rsp+12Ch] [rbp-B4h]\n__int64 v41; // [rsp+138h] [rbp-A8h]\n__int64 v42; // [rsp+140h] [rbp-A0h]\n__int64 v43; // [rsp+148h] [rbp-98h]\n__int64 v44; // [rsp+150h] [rbp-90h]\n__int64 v45; // [rsp+158h] [rbp-88h]\n\nva_start(arg, a6);\nv41 = a2;\nv42 = a3;\nv43 = a4;\nv44 = a5;\nv45 = a6;\n*(_QWORD *)s = 0LL;\nv8 = 0LL;\nv9 = 0LL;\nv10 = 0LL;\nv11 = 0LL;\nv12 = 0LL;\nv13 = 0LL;\nv14 = 0LL;\nv15 = 0LL;\nv16 = 0LL;\nv17 = 0LL;\nv18 = 0LL;\nv19 = 0LL;\nv20 = 0LL;\nv21 = 0LL;\nv22 = 0LL;\nv23 = 0LL;\nv24 = 0LL;\nv25 = 0LL;\nv26 = 0LL;\nv27 = 0LL;\nv28 = 0LL;\nv29 = 0LL;\nv30 = 0LL;\nv31 = 0LL;\nv32 = 0LL;\nv33 = 0LL;\nv34 = 0LL;\nv35 = 0LL;\nv36 = 0LL;\nv37 = 0LL;\nv38 = 0LL;\narg[0].gp_offset = 8;\nv40 = vsnprintf(s, 0x100uLL, a1, arg);\nmemcpy(&errmsg, s, v40 + 1);\nreturn 0xFFFFFFFFLL;\n}\n",
"canonical_decompiled_code": "__int64 func1(const char *a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, ...)\n{\nchar s[8]; // [rsp+10h] [rbp-1D0h] BYREF\n__int64 v8; // [rsp+18h] [rbp-1C8h]\n__int64 v9; // [rsp+20h] [rbp-1C0h]\n__int64 v10; // [rsp+28h] [rbp-1B8h]\n__int64 v11; // [rsp+30h] [rbp-1B0h]\n__int64 v12; // [rsp+38h] [rbp-1A8h]\n__int64 v13; // [rsp+40h] [rbp-1A0h]\n__int64 v14; // [rsp+48h] [rbp-198h]\n__int64 v15; // [rsp+50h] [rbp-190h]\n__int64 v16; // [rsp+58h] [rbp-188h]\n__int64 v17; // [rsp+60h] [rbp-180h]\n__int64 v18; // [rsp+68h] [rbp-178h]\n__int64 v19; // [rsp+70h] [rbp-170h]\n__int64 v20; // [rsp+78h] [rbp-168h]\n__int64 v21; // [rsp+80h] [rbp-160h]\n__int64 v22; // [rsp+88h] [rbp-158h]\n__int64 v23; // [rsp+90h] [rbp-150h]\n__int64 v24; // [rsp+98h] [rbp-148h]\n__int64 v25; // [rsp+A0h] [rbp-140h]\n__int64 v26; // [rsp+A8h] [rbp-138h]\n__int64 v27; // [rsp+B0h] [rbp-130h]\n__int64 v28; // [rsp+B8h] [rbp-128h]\n__int64 v29; // [rsp+C0h] [rbp-120h]\n__int64 v30; // [rsp+C8h] [rbp-118h]\n__int64 v31; // [rsp+D0h] [rbp-110h]\n__int64 v32; // [rsp+D8h] [rbp-108h]\n__int64 v33; // [rsp+E0h] [rbp-100h]\n__int64 v34; // [rsp+E8h] [rbp-F8h]\n__int64 v35; // [rsp+F0h] [rbp-F0h]\n__int64 v36; // [rsp+F8h] [rbp-E8h]\n__int64 v37; // [rsp+100h] [rbp-E0h]\n__int64 v38; // [rsp+108h] [rbp-D8h]\ngcc_va_list arg; // [rsp+110h] [rbp-D0h] BYREF\nint v40; // [rsp+12Ch] [rbp-B4h]\n__int64 v41; // [rsp+138h] [rbp-A8h]\n__int64 v42; // [rsp+140h] [rbp-A0h]\n__int64 v43; // [rsp+148h] [rbp-98h]\n__int64 v44; // [rsp+150h] [rbp-90h]\n__int64 v45; // [rsp+158h] [rbp-88h]\n\nva_start(arg, a6);\nv41 = a2;\nv42 = a3;\nv43 = a4;\nv44 = a5;\nv45 = a6;\n*(_QWORD *)s = 0LL;\nv8 = 0LL;\nv9 = 0LL;\nv10 = 0LL;\nv11 = 0LL;\nv12 = 0LL;\nv13 = 0LL;\nv14 = 0LL;\nv15 = 0LL;\nv16 = 0LL;\nv17 = 0LL;\nv18 = 0LL;\nv19 = 0LL;\nv20 = 0LL;\nv21 = 0LL;\nv22 = 0LL;\nv23 = 0LL;\nv24 = 0LL;\nv25 = 0LL;\nv26 = 0LL;\nv27 = 0LL;\nv28 = 0LL;\nv29 = 0LL;\nv30 = 0LL;\nv31 = 0LL;\nv32 = 0LL;\nv33 = 0LL;\nv34 = 0LL;\nv35 = 0LL;\nv36 = 0LL;\nv37 = 0LL;\nv38 = 0LL;\narg[0].gp_offset = 8;\nv40 = vsnprintf(s, 0x100uLL, a1, arg);\nmemcpy(&errmsg, s, v40 + 1);\nreturn 0xFFFFFFFFLL;\n}",
"original_code": "int seterrmsg(const char *fmt, ...)\n{\n va_list ap;\n int len;\n char bakmsg[sizeof(errmsg)] = { 0 };\n __builtin_va_start(ap,fmt);\n len = vsnprintf(bakmsg, sizeof(errmsg), fmt, ap);\n memcpy(errmsg, bakmsg, len + 1);\n __builtin_va_end(ap);\n return -1;\n}",
"canonical_original_code": "int seterrmsg(char *fmt, ...)\n{\n __builtin_va_list ap;\n int len;\n char bakmsg[-1] = { 0 };\n __builtin_va_start(ap,fmt);\n len = vsnprintf(bakmsg, sizeof(errmsg), fmt, ap);\n memcpy(errmsg, bakmsg, len + 1);\n __builtin_va_end(ap);\n return -1;\n}",
"variable_types": [
[
"fmt",
"char *"
],
[
"ap",
"__builtin_va_list"
],
[
"len",
"int"
],
[
"bakmsg",
"char [-1]"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "e0dcb09af64baf515410cd7c64a5081db502336e0fb0b33935760a22965f5e3e"
},
{
"name": "vwarning",
"canonical_name": "func2",
"repo": "ivartj/platformer",
"decompiled_code": "size_t __fastcall vwarning(const char *a1, void *a2)\n{\nvfprintf(stderr, a1, a2);\nreturn fwrite(&unk_4E0, 1uLL, 2uLL, stderr);\n}\n",
"canonical_decompiled_code": "size_t __fastcall func2(const char *a1, void *a2)\n{\nvfprintf(stderr, a1, a2);\nreturn fwrite(&unk_4E0, 1uLL, 2uLL, stderr);\n}",
"original_code": "void vwarning(const char *fmt, va_list ap)\n{\n vfprintf(stderr, fmt, ap);\n fprintf(stderr, \".\\n\");\n}",
"canonical_original_code": "void vwarning(char *fmt, __builtin_va_list ap)\n{\n vfprintf(stderr, fmt, ap);\n fprintf(stderr, \".\\n\");\n}",
"variable_types": [
[
"fmt",
"char *"
],
[
"ap",
"__builtin_va_list"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "e0dcb09af64baf515410cd7c64a5081db502336e0fb0b33935760a22965f5e3e"
},
{
"name": "error",
"canonical_name": "func3",
"repo": "ivartj/platformer",
"decompiled_code": "void __noreturn error(const char *a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, ...)\n{\ngcc_va_list va; // [rsp+18h] [rbp-C8h] BYREF\n__int64 v7; // [rsp+38h] [rbp-A8h]\n__int64 v8; // [rsp+40h] [rbp-A0h]\n__int64 v9; // [rsp+48h] [rbp-98h]\n__int64 v10; // [rsp+50h] [rbp-90h]\n__int64 v11; // [rsp+58h] [rbp-88h]\n\nva_start(va, a6);\nv7 = a2;\nv8 = a3;\nv9 = a4;\nv10 = a5;\nv11 = a6;\nva[0].gp_offset = 8;\nvwarning(a1, va);\nexit(1);\n}\n",
"canonical_decompiled_code": "void __noreturn func3(const char *a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, ...)\n{\ngcc_va_list va; // [rsp+18h] [rbp-C8h] BYREF\n__int64 v7; // [rsp+38h] [rbp-A8h]\n__int64 v8; // [rsp+40h] [rbp-A0h]\n__int64 v9; // [rsp+48h] [rbp-98h]\n__int64 v10; // [rsp+50h] [rbp-90h]\n__int64 v11; // [rsp+58h] [rbp-88h]\n\nva_start(va, a6);\nv7 = a2;\nv8 = a3;\nv9 = a4;\nv10 = a5;\nv11 = a6;\nva[0].gp_offset = 8;\nfunc2(a1, va);\nexit(1);\n}",
"original_code": "void error(const char *fmt, ...)\n{\n va_list ap;\n __builtin_va_start(ap,fmt);\n vwarning(fmt, ap);\n __builtin_va_end(ap);\n exit(1);\n}",
"canonical_original_code": "void error(char *fmt, ...)\n{\n __builtin_va_list ap;\n __builtin_va_start(ap,fmt);\n vwarning(fmt, ap);\n __builtin_va_end(ap);\n exit(1);\n}",
"variable_types": [
[
"fmt",
"char *"
],
[
"ap",
"__builtin_va_list"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "e0dcb09af64baf515410cd7c64a5081db502336e0fb0b33935760a22965f5e3e"
},
{
"name": "warning",
"canonical_name": "func4",
"repo": "ivartj/platformer",
"decompiled_code": "size_t warning(const char *a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, ...)\n{\ngcc_va_list va; // [rsp+18h] [rbp-C8h] BYREF\n__int64 v8; // [rsp+38h] [rbp-A8h]\n__int64 v9; // [rsp+40h] [rbp-A0h]\n__int64 v10; // [rsp+48h] [rbp-98h]\n__int64 v11; // [rsp+50h] [rbp-90h]\n__int64 v12; // [rsp+58h] [rbp-88h]\n\nva_start(va, a6);\nv8 = a2;\nv9 = a3;\nv10 = a4;\nv11 = a5;\nv12 = a6;\nva[0].gp_offset = 8;\nreturn vwarning(a1, va);\n}\n",
"canonical_decompiled_code": "size_t func4(const char *a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, ...)\n{\ngcc_va_list va; // [rsp+18h] [rbp-C8h] BYREF\n__int64 v8; // [rsp+38h] [rbp-A8h]\n__int64 v9; // [rsp+40h] [rbp-A0h]\n__int64 v10; // [rsp+48h] [rbp-98h]\n__int64 v11; // [rsp+50h] [rbp-90h]\n__int64 v12; // [rsp+58h] [rbp-88h]\n\nva_start(va, a6);\nv8 = a2;\nv9 = a3;\nv10 = a4;\nv11 = a5;\nv12 = a6;\nva[0].gp_offset = 8;\nreturn func2(a1, va);\n}",
"original_code": "void warning(const char *fmt, ...)\n{\n va_list ap;\n __builtin_va_start(ap,fmt);\n vwarning(fmt, ap);\n __builtin_va_end(ap);\n}",
"canonical_original_code": "void warning(char *fmt, ...)\n{\n __builtin_va_list ap;\n __builtin_va_start(ap,fmt);\n vwarning(fmt, ap);\n __builtin_va_end(ap);\n}",
"variable_types": [
[
"fmt",
"char *"
],
[
"ap",
"__builtin_va_list"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "e0dcb09af64baf515410cd7c64a5081db502336e0fb0b33935760a22965f5e3e"
}
] |
f3d1efc124ff87ad6e61b3630bcd43188ea825491cb8c48fcd598c3bb0678277 | dfellis/fakeShebang | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"escapedSize",
"->",
"escapeString",
"main"
],
[
"escapeString",
"->",
"escapedSize",
"main"
],
[
"main",
"->",
"escapedSize",
"escapeString"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_404010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"char *func3()\n{\nreturn &_bss_start;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"char *func5()\n{\nchar *result; // rax\n\nif ( !_bss_start )\n{\nresult = func3();\n_bss_start = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"main",
"int __cdecl main(int argc, const char **argv, const char **envp)\n{\nint v3; // ebx\nint v4; // eax\nsize_t v5; // rbx\nconst char *v6; // rcx\nsize_t v7; // rbx\nconst char *v8; // rax\nsize_t v9; // rbx\nconst char *v10; // rax\nchar *dest; // [rsp+10h] [rbp-40h]\nFILE *stream; // [rsp+18h] [rbp-38h]\nconst char *v14; // [rsp+20h] [rbp-30h]\nint v15; // [rsp+34h] [rbp-1Ch]\nint v16; // [rsp+34h] [rbp-1Ch]\nint v17; // [rsp+34h] [rbp-1Ch]\nint v18; // [rsp+38h] [rbp-18h]\nint i; // [rsp+3Ch] [rbp-14h]\nint j; // [rsp+3Ch] [rbp-14h]\n\nv18 = 0;\nv14 = (const char *)malloc(0x400uLL);\nstream = fopen(\"./node_modules/test_script.js\", \"r\");\n__isoc99_fscanf();\nfclose(stream);\nfor ( i = 1; i < argc; ++i )\nv18 += func7(argv[i]) + 1;\nv3 = func7(v14) + 1;\nv4 = func7(\"./node_modules/test_script.js\");\ndest = (char *)malloc(v3 + v4 + v18);\nv5 = (int)func7(v14);\nv6 = func8(v14);\nstrncpy(dest, v6, v5);\nv15 = func7(v14);\ndest[v15++] = 32;\nv7 = (int)func7(\"./node_modules/test_script.js\");\nv8 = func8(\"./node_modules/test_script.js\");\nstrncpy(&dest[v15], v8, v7);\nv16 = func7(\"./node_modules/test_script.js\") + v15;\nfor ( j = 1; j < argc; ++j )\n{\ndest[v16] = 32;\nv17 = v16 + 1;\nv9 = (int)func7(argv[j]);\nv10 = func8(argv[j]);\nstrncpy(&dest[v17], v10, v9);\nv16 = func7(argv[j]) + v17;\n}\ndest[v16] = 0;\nreturn system(dest);\n}"
],
[
"_libc_csu_init",
"void __fastcall func9(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func10(void)\n{\n;\n}"
]
] | [
{
"name": "escapedSize",
"canonical_name": "func7",
"repo": "dfellis/fakeShebang",
"decompiled_code": "__int64 __fastcall escapedSize(const char *a1)\n{\nunsigned int v2; // [rsp+18h] [rbp-18h]\nint i; // [rsp+1Ch] [rbp-14h]\n\nv2 = strlen(a1);\nif ( strchr(a1, 32) )\n{\nv2 += 2;\nif ( strchr(a1, 34) )\n{\nfor ( i = 0; i < strlen(a1); ++i )\n{\nif ( a1[i] == 34 )\n++v2;\n}\n}\n}\nreturn v2;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(const char *a1)\n{\nunsigned int v2; // [rsp+18h] [rbp-18h]\nint i; // [rsp+1Ch] [rbp-14h]\n\nv2 = strlen(a1);\nif ( strchr(a1, 32) )\n{\nv2 += 2;\nif ( strchr(a1, 34) )\n{\nfor ( i = 0; i < strlen(a1); ++i )\n{\nif ( a1[i] == 34 )\n++v2;\n}\n}\n}\nreturn v2;\n}",
"original_code": "int escapedSize(const char* toEscape) {\n int i, newSize = strlen(toEscape);\n if(strchr(toEscape, ' ') != ((void *)0)) {\n newSize += 2;\n if(strchr(toEscape, '\"') != ((void *)0)) {\n for(i = 0; i < strlen(toEscape); i++) {\n if(*(toEscape+i) == '\"') {\n newSize++;\n }\n }\n }\n }\n return newSize;\n}",
"canonical_original_code": "int escapedSize(char *toEscape) {\n int i; int newSize = strlen(toEscape);\n if(strchr(toEscape, ' ') != ((void *)0)) {\n newSize += 2;\n if(strchr(toEscape, '\"') != ((void *)0)) {\n for(i = 0; i < strlen(toEscape); i++) {\n if(*(toEscape+i) == '\"') {\n newSize++;\n }\n }\n }\n }\n return newSize;\n}",
"variable_types": [
[
"toEscape",
"char *"
],
[
"i",
"int"
],
[
"newSize",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "f3d1efc124ff87ad6e61b3630bcd43188ea825491cb8c48fcd598c3bb0678277"
},
{
"name": "escapeString",
"canonical_name": "func8",
"repo": "dfellis/fakeShebang",
"decompiled_code": "const char *__fastcall escapeString(const char *a1)\n{\nsize_t v1; // rax\n_BYTE *v3; // [rsp+10h] [rbp-10h]\nint v4; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nv4 = escapedSize(a1);\nif ( !strchr(a1, 32) )\nreturn a1;\nv3 = malloc(v4 + 1);\n*v3 = 34;\nv3[v4] = 34;\nif ( strchr(a1, 34) )\n{\nfor ( i = 0; i < v4 - 2; ++i )\n{\nif ( a1[i] == 34 )\n{\nv3[i++] = 92;\nv3[i] = 34;\n}\nelse\n{\nv3[i] = a1[i];\n}\n}\n}\nelse\n{\nv1 = strlen(a1);\nstrncpy(v3 + 1, a1, v1);\n}\nreturn v3;\n}\n",
"canonical_decompiled_code": "const char *__fastcall func8(const char *a1)\n{\nsize_t v1; // rax\n_BYTE *v3; // [rsp+10h] [rbp-10h]\nint v4; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nv4 = func7(a1);\nif ( !strchr(a1, 32) )\nreturn a1;\nv3 = malloc(v4 + 1);\n*v3 = 34;\nv3[v4] = 34;\nif ( strchr(a1, 34) )\n{\nfor ( i = 0; i < v4 - 2; ++i )\n{\nif ( a1[i] == 34 )\n{\nv3[i++] = 92;\nv3[i] = 34;\n}\nelse\n{\nv3[i] = a1[i];\n}\n}\n}\nelse\n{\nv1 = strlen(a1);\nstrncpy(v3 + 1, a1, v1);\n}\nreturn v3;\n}",
"original_code": "const char* escapeString(const char* toEscape) {\n int i, escapedLength = escapedSize(toEscape);\n char* escapedString;\n if(strchr(toEscape, ' ') != ((void *)0)) {\n escapedString = (char*)malloc((escapedLength+1)*sizeof(char));\n *escapedString = '\"';\n *(escapedString+escapedLength) = '\"';\n if(strchr(toEscape, '\"') != ((void *)0)) {\n for(i = 0; i < escapedLength-2; i++) {\n if(*(toEscape+i) == '\"') {\n *(escapedString+i) = '\\\\';\n i++;\n *(escapedString+i) = '\"';\n } else {\n *(escapedString+i) = *(toEscape+i);\n }\n }\n } else {\n strncpy(escapedString+1, toEscape, strlen(toEscape));\n }\n return escapedString;\n } else {\n return toEscape;\n }\n}",
"canonical_original_code": "char *escapeString(char *toEscape) {\n int i; int escapedLength = escapedSize(toEscape);\n char *escapedString;\n if(strchr(toEscape, ' ') != ((void *)0)) {\n escapedString = (char *)malloc((escapedLength+1)*sizeof(char));\n *escapedString = '\"';\n *(escapedString+escapedLength) = '\"';\n if(strchr(toEscape, '\"') != ((void *)0)) {\n for(i = 0; i < escapedLength-2; i++) {\n if(*(toEscape+i) == '\"') {\n *(escapedString+i) = '\\\\';\n i++;\n *(escapedString+i) = '\"';\n } else {\n *(escapedString+i) = *(toEscape+i);\n }\n }\n } else {\n strncpy(escapedString+1, toEscape, strlen(toEscape));\n }\n return escapedString;\n } else {\n return toEscape;\n }\n}",
"variable_types": [
[
"toEscape",
"char *"
],
[
"i",
"int"
],
[
"escapedLength",
"int"
],
[
"escapedString",
"char *"
]
],
"return_type": "char *",
"user_defined_types": [],
"binary_hash": "f3d1efc124ff87ad6e61b3630bcd43188ea825491cb8c48fcd598c3bb0678277"
}
] |
3f31a86e6236fa563ffc6506dfc3a9ce1718d2e9debffb4ecf8ccfbe3d1b74da | tbmufeng/cs_project | [
[
"main",
"->"
]
] | [] | [
{
"name": "main",
"canonical_name": "main",
"repo": "tbmufeng/cs_project",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nchar v4[1008]; // [rsp+0h] [rbp-3F0h] BYREF\n\nputs(\"please input a string!\");\n_isoc99_scanf(\"%s\", v4);\nreturn printf(\"%s\", v4);\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nchar v4[1008]; // [rsp+0h] [rbp-3F0h] BYREF\n\nputs(\"please input a string!\");\n_isoc99_scanf(\"%s\", v4);\nreturn printf(\"%s\", v4);\n}",
"original_code": "void main(){\n char buf[1000];\n printf(\"%s\",\"please input a string!\\n\");\n scanf(\"%s\",buf);\n printf(\"%s\",buf);\n}",
"canonical_original_code": "void main(){\n char buf[1000];\n printf(\"%s\",\"please input a string!\\n\");\n scanf(\"%s\",buf);\n printf(\"%s\",buf);\n}",
"variable_types": [
[
"buf",
"char [1000]"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "3f31a86e6236fa563ffc6506dfc3a9ce1718d2e9debffb4ecf8ccfbe3d1b74da"
}
] |
2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f | StephenNi/expression-compiler | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"main",
"->",
"string_str",
"vector_dump",
"vector_get",
"token_dump",
"vector_delete",
"string_delete"
],
[
"vector_new",
"->",
"vector_new_capacity",
"string_new"
],
[
"vector_new_capacity",
"->",
"vector_new",
"string_str"
],
[
"vector_delete",
"->",
"main",
"string_delete"
],
[
"vector_dump",
"->",
"main"
],
[
"vector_full",
"->",
"vector_push"
],
[
"vector_grow",
"->",
"vector_push"
],
[
"vector_push",
"->",
"vector_full",
"vector_grow",
"string_new",
"string_str",
"string_append_char"
],
[
"vector_pop",
"->",
"string_append_char"
],
[
"vector_get",
"->",
"main"
],
[
"vector_put",
"->"
],
[
"clp2",
"->",
"string_str"
],
[
"string_new",
"->",
"vector_new",
"vector_push"
],
[
"string_str",
"->",
"main",
"clp2",
"vector_new_capacity",
"vector_push"
],
[
"string_delete",
"->",
"main",
"vector_delete"
],
[
"string_dump",
"->"
],
[
"string_append_char",
"->",
"vector_pop",
"vector_push",
"string_append_chars"
],
[
"string_append_chars",
"->",
"string_append_char"
],
[
"string_compare",
"->"
],
[
"token_dump",
"->",
"main"
],
[
"blank",
"->"
],
[
"digit",
"->"
],
[
"symbol",
"->"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_404010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"void *func3()\n{\nreturn &end;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"void *func5()\n{\nvoid *result; // rax\n\nif ( !_bss_start )\n{\nresult = func3();\n_bss_start = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"main",
"int __cdecl main(int argc, const char **argv, const char **envp)\n{\n__int64 v4[5]; // [rsp+0h] [rbp-80h] BYREF\nchar v5[8]; // [rsp+28h] [rbp-58h] BYREF\n__int64 v6; // [rsp+30h] [rbp-50h] BYREF\nunsigned __int64 v7; // [rsp+38h] [rbp-48h]\n__int64 v8; // [rsp+40h] [rbp-40h]\n__int64 v9; // [rsp+48h] [rbp-38h]\nchar v10[24]; // [rsp+50h] [rbp-30h] BYREF\nchar *s; // [rsp+68h] [rbp-18h]\nunsigned __int64 i; // [rsp+78h] [rbp-8h]\n\nfunc19(v10, \"(1+2)*3+4\", envp);\nputs(s);\nscan(v4, v10);\nv6 = v4[0];\nv7 = v4[1];\nv8 = v4[2];\nv9 = v4[3];\nfunc10(&v6);\nfor ( i = 0LL; i < v7; ++i )\n{\nfunc15(&v6, i, v5);\nfunc25(v5);\n}\nfunc9(&v6);\nfunc20(v10);\nreturn 0;\n}"
],
[
"_libc_csu_init",
"void __fastcall func29(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func30(void)\n{\n;\n}"
]
] | [
{
"name": "vector_new",
"canonical_name": "func7",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall vector_new(__int64 a1, __int64 a2)\n{\nreturn vector_new_capacity(a1, 16LL, a2);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(__int64 a1, __int64 a2)\n{\nreturn func8(a1, 16LL, a2);\n}",
"original_code": "void vector_new(vector_t *v, size_t s) {\n vector_new_capacity(v, DEFAULT_CAPACITY, s);\n}",
"canonical_original_code": "void vector_new(struct vector_t *v, unsigned long s) {\n vector_new_capacity(v, DEFAULT_CAPACITY, s);\n}",
"variable_types": [
[
"v",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"s",
"unsigned long"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "vector_new_capacity",
"canonical_name": "func8",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "void *__fastcall vector_new_capacity(__int64 a1, __int64 a2, __int64 a3)\n{\nsize_t size; // [rsp+28h] [rbp-8h]\n\nif ( !a1 || !a2 || !a3 )\n__assert_fail(\"v != NULL && c > 0 && s > 0\", \"vectors.c\", 0x16u, \"vector_new_capacity\");\n*(_QWORD *)(a1 + 8) = 0LL;\n*(_QWORD *)a1 = a3;\n*(_QWORD *)(a1 + 16) = a2;\nsize = *(_QWORD *)a1 * *(_QWORD *)(a1 + 16);\n*(_QWORD *)(a1 + 24) = malloc(size);\nif ( !*(_QWORD *)(a1 + 24) )\n__assert_fail(\"v->data != NULL\", \"vectors.c\", 0x1Eu, \"vector_new_capacity\");\nreturn memset(*(void **)(a1 + 24), 88, size);\n}\n",
"canonical_decompiled_code": "void *__fastcall func8(__int64 a1, __int64 a2, __int64 a3)\n{\nsize_t size; // [rsp+28h] [rbp-8h]\n\nif ( !a1 || !a2 || !a3 )\n__assert_fail(\"v != NULL && c > 0 && s > 0\", \"vectors.c\", 0x16u, \"vector_new_capacity\");\n*(_QWORD *)(a1 + 8) = 0LL;\n*(_QWORD *)a1 = a3;\n*(_QWORD *)(a1 + 16) = a2;\nsize = *(_QWORD *)a1 * *(_QWORD *)(a1 + 16);\n*(_QWORD *)(a1 + 24) = malloc(size);\nif ( !*(_QWORD *)(a1 + 24) )\n__assert_fail(\"v->data != NULL\", \"vectors.c\", 0x1Eu, \"vector_new_capacity\");\nreturn memset(*(void **)(a1 + 24), 88, size);\n}",
"original_code": "void vector_new_capacity(vector_t *v, size_t c, size_t s) {\n size_t total;\n ((v != ((void *)0) && c > 0 && s > 0) ? (void) (0) : __assert_fail (\"v != NULL && c > 0 && s > 0\", \"vectors.c\", 22, __extension__ __PRETTY_FUNCTION__));\n v->length = 0;\n v->element = s;\n v->capacity = c;\n total = v->element * v->capacity;\n v->data = malloc(total);\n ((v->data != ((void *)0)) ? (void) (0) : __assert_fail (\"v->data != NULL\", \"vectors.c\", 30, __extension__ __PRETTY_FUNCTION__));\n memset(v->data, 'X', total);\n}",
"canonical_original_code": "void vector_new_capacity(struct vector_t *v, unsigned long c, unsigned long s) {\n unsigned long total;\n ((v != ((void *)0) && c > 0 && s > 0) ? (void) (0) : __assert_fail (\"v != NULL && c > 0 && s > 0\", \"vectors.c\", 22, __extension__ __PRETTY_FUNCTION__));\n v->length = 0;\n v->element = s;\n v->capacity = c;\n total = v->element * v->capacity;\n v->data = malloc(total);\n ((v->data != ((void *)0)) ? (void) (0) : __assert_fail (\"v->data != NULL\", \"vectors.c\", 30, __extension__ __PRETTY_FUNCTION__));\n memset(v->data, 'X', total);\n}",
"variable_types": [
[
"v",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"c",
"unsigned long"
],
[
"s",
"unsigned long"
],
[
"total",
"unsigned long"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "vector_delete",
"canonical_name": "func9",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall vector_delete(__int64 a1)\n{\n__int64 result; // rax\n\nif ( !a1 || !*(_QWORD *)(a1 + 24) )\n__assert_fail(\"v != NULL && v->data != NULL\", \"vectors.c\", 0x24u, \"vector_delete\");\nfree(*(void **)(a1 + 24));\n*(_QWORD *)(a1 + 24) = 0LL;\n*(_QWORD *)(a1 + 8) = -1LL;\n*(_QWORD *)a1 = -1LL;\nresult = a1;\n*(_QWORD *)(a1 + 16) = -1LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func9(__int64 a1)\n{\n__int64 result; // rax\n\nif ( !a1 || !*(_QWORD *)(a1 + 24) )\n__assert_fail(\"v != NULL && v->data != NULL\", \"vectors.c\", 0x24u, \"vector_delete\");\nfree(*(void **)(a1 + 24));\n*(_QWORD *)(a1 + 24) = 0LL;\n*(_QWORD *)(a1 + 8) = -1LL;\n*(_QWORD *)a1 = -1LL;\nresult = a1;\n*(_QWORD *)(a1 + 16) = -1LL;\nreturn result;\n}",
"original_code": "void vector_delete( vector_t *v) {\n ((v != ((void *)0) && v->data != ((void *)0)) ? (void) (0) : __assert_fail (\"v != NULL && v->data != NULL\", \"vectors.c\", 36, __extension__ __PRETTY_FUNCTION__));\n free(v->data);\n v->data = ((void *)0);\n v->length = -1;\n v->element = -1;\n v->capacity = -1;\n}",
"canonical_original_code": "void vector_delete(struct vector_t *v) {\n ((v != ((void *)0) && v->data != ((void *)0)) ? (void) (0) : __assert_fail (\"v != NULL && v->data != NULL\", \"vectors.c\", 36, __extension__ __PRETTY_FUNCTION__));\n free(v->data);\n v->data = ((void *)0);\n v->length = -1;\n v->element = -1;\n v->capacity = -1;\n}",
"variable_types": [
[
"v",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "vector_dump",
"canonical_name": "func10",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "int __fastcall vector_dump(__int64 a1)\n{\nreturn printf(\n\"vector_t<data: %p size: %zu length: %zu capacity: %zu>\\n\",\n*(const void **)(a1 + 24),\n*(_QWORD *)a1,\n*(_QWORD *)(a1 + 8),\n*(_QWORD *)(a1 + 16));\n}\n",
"canonical_decompiled_code": "int __fastcall func10(__int64 a1)\n{\nreturn printf(\n\"vector_t<data: %p size: %zu length: %zu capacity: %zu>\\n\",\n*(const void **)(a1 + 24),\n*(_QWORD *)a1,\n*(_QWORD *)(a1 + 8),\n*(_QWORD *)(a1 + 16));\n}",
"original_code": "void vector_dump(const vector_t *v) {\n printf(\n \"vector_t<data: %p size: %zu length: %zu capacity: %zu>\\n\",\n v->data, v->element, v->length, v->capacity\n );\n}",
"canonical_original_code": "void vector_dump(struct vector_t *v) {\n printf(\n \"vector_t<data: %p size: %zu length: %zu capacity: %zu>\\n\",\n v->data, v->element, v->length, v->capacity\n );\n}",
"variable_types": [
[
"v",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "vector_full",
"canonical_name": "func11",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "bool __fastcall vector_full(__int64 a1)\n{\nreturn *(_QWORD *)(a1 + 8) == *(_QWORD *)(a1 + 16);\n}\n",
"canonical_decompiled_code": "bool __fastcall func11(__int64 a1)\n{\nreturn *(_QWORD *)(a1 + 8) == *(_QWORD *)(a1 + 16);\n}",
"original_code": "static _Bool vector_full(const vector_t *v) {\n return v->length == v->capacity;\n}",
"canonical_original_code": "static _Bool vector_full(struct vector_t *v) {\n return v->length == v->capacity;\n}",
"variable_types": [
[
"v",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
]
],
"return_type": "_Bool",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "vector_grow",
"canonical_name": "func12",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall vector_grow(__int64 a1)\n{\n__int64 result; // rax\nvoid *s; // [rsp+10h] [rbp-10h]\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nv3 = 2LL * *(_QWORD *)(a1 + 16);\ns = malloc(v3 * *(_QWORD *)a1);\nif ( !s )\n__assert_fail(\"new != NULL\", \"vectors.c\", 0x3Du, \"vector_grow\");\nmemset(s, 88, v3 * *(_QWORD *)a1);\nmemcpy(s, *(const void **)(a1 + 24), *(_QWORD *)(a1 + 16) * *(_QWORD *)a1);\nfree(*(void **)(a1 + 24));\n*(_QWORD *)(a1 + 24) = s;\nresult = a1;\n*(_QWORD *)(a1 + 16) = v3;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func12(__int64 a1)\n{\n__int64 result; // rax\nvoid *s; // [rsp+10h] [rbp-10h]\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nv3 = 2LL * *(_QWORD *)(a1 + 16);\ns = malloc(v3 * *(_QWORD *)a1);\nif ( !s )\n__assert_fail(\"new != NULL\", \"vectors.c\", 0x3Du, \"vector_grow\");\nmemset(s, 88, v3 * *(_QWORD *)a1);\nmemcpy(s, *(const void **)(a1 + 24), *(_QWORD *)(a1 + 16) * *(_QWORD *)a1);\nfree(*(void **)(a1 + 24));\n*(_QWORD *)(a1 + 24) = s;\nresult = a1;\n*(_QWORD *)(a1 + 16) = v3;\nreturn result;\n}",
"original_code": "static void vector_grow(vector_t *v) {\n size_t bigger = v->capacity * 2;\n char *new = malloc(v->element * bigger);\n ((new != ((void *)0)) ? (void) (0) : __assert_fail (\"new != NULL\", \"vectors.c\", 61, __extension__ __PRETTY_FUNCTION__));\n memset(new, 'X', v->element * bigger);\n memcpy(new, v->data, v->element * v->capacity);\n free(v->data);\n v->data = new;\n v->capacity = bigger;\n}",
"canonical_original_code": "static void vector_grow(struct vector_t *v) {\n unsigned long bigger = v->capacity * 2;\n char *new = malloc(v->element * bigger);\n ((new != ((void *)0)) ? (void) (0) : __assert_fail (\"new != NULL\", \"vectors.c\", 61, __extension__ __PRETTY_FUNCTION__));\n memset(new, 'X', v->element * bigger);\n memcpy(new, v->data, v->element * v->capacity);\n free(v->data);\n v->data = new;\n v->capacity = bigger;\n}",
"variable_types": [
[
"v",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"bigger",
"unsigned long"
],
[
"new",
"char *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "vector_push",
"canonical_name": "func13",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "size_t *__fastcall vector_push(size_t *a1, const void *a2)\n{\nsize_t *result; // rax\n\nif ( !a1 || !a1[3] )\n__assert_fail(\"v != NULL && v->data != NULL\", \"vectors.c\", 0x48u, \"vector_push\");\nif ( !a2 )\n__assert_fail(\"e != NULL\", \"vectors.c\", 0x49u, \"vector_push\");\nif ( vector_full((__int64)a1) )\nvector_grow((__int64)a1);\nmemcpy((void *)(a1[3] + a1[1] * *a1), a2, *a1);\nresult = a1;\n++a1[1];\nreturn result;\n}\n",
"canonical_decompiled_code": "size_t *__fastcall func13(size_t *a1, const void *a2)\n{\nsize_t *result; // rax\n\nif ( !a1 || !a1[3] )\n__assert_fail(\"v != NULL && v->data != NULL\", \"vectors.c\", 0x48u, \"vector_push\");\nif ( !a2 )\n__assert_fail(\"e != NULL\", \"vectors.c\", 0x49u, \"vector_push\");\nif ( func11((__int64)a1) )\nfunc12((__int64)a1);\nmemcpy((void *)(a1[3] + a1[1] * *a1), a2, *a1);\nresult = a1;\n++a1[1];\nreturn result;\n}",
"original_code": "void vector_push(vector_t *v, const void *e) {\n ((v != ((void *)0) && v->data != ((void *)0)) ? (void) (0) : __assert_fail (\"v != NULL && v->data != NULL\", \"vectors.c\", 72, __extension__ __PRETTY_FUNCTION__));\n ((e != ((void *)0)) ? (void) (0) : __assert_fail (\"e != NULL\", \"vectors.c\", 73, __extension__ __PRETTY_FUNCTION__));\n if (vector_full(v)) {\n vector_grow(v);\n }\n memcpy(v->data + v->length*v->element, e, v->element);\n v->length += 1;\n}",
"canonical_original_code": "void vector_push(struct vector_t *v, void *e) {\n ((v != ((void *)0) && v->data != ((void *)0)) ? (void) (0) : __assert_fail (\"v != NULL && v->data != NULL\", \"vectors.c\", 72, __extension__ __PRETTY_FUNCTION__));\n ((e != ((void *)0)) ? (void) (0) : __assert_fail (\"e != NULL\", \"vectors.c\", 73, __extension__ __PRETTY_FUNCTION__));\n if (vector_full(v)) {\n vector_grow(v);\n }\n memcpy(v->data + v->length*v->element, e, v->element);\n v->length += 1;\n}",
"variable_types": [
[
"v",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"e",
"void *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "vector_pop",
"canonical_name": "func14",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall vector_pop(__int64 a1)\n{\n__int64 result; // rax\n\nif ( !a1 || !*(_QWORD *)(a1 + 24) || !*(_QWORD *)(a1 + 8) )\n__assert_fail(\"v != NULL && v->data != NULL && v->length > 0\", \"vectors.c\", 0x54u, \"vector_pop\");\nresult = a1;\n--*(_QWORD *)(a1 + 8);\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func14(__int64 a1)\n{\n__int64 result; // rax\n\nif ( !a1 || !*(_QWORD *)(a1 + 24) || !*(_QWORD *)(a1 + 8) )\n__assert_fail(\"v != NULL && v->data != NULL && v->length > 0\", \"vectors.c\", 0x54u, \"vector_pop\");\nresult = a1;\n--*(_QWORD *)(a1 + 8);\nreturn result;\n}",
"original_code": "void vector_pop(vector_t *v) {\n ((v != ((void *)0) && v->data != ((void *)0) && v->length > 0) ? (void) (0) : __assert_fail (\"v != NULL && v->data != NULL && v->length > 0\", \"vectors.c\", 84, __extension__ __PRETTY_FUNCTION__));\n v->length -= 1;\n}",
"canonical_original_code": "void vector_pop(struct vector_t *v) {\n ((v != ((void *)0) && v->data != ((void *)0) && v->length > 0) ? (void) (0) : __assert_fail (\"v != NULL && v->data != NULL && v->length > 0\", \"vectors.c\", 84, __extension__ __PRETTY_FUNCTION__));\n v->length -= 1;\n}",
"variable_types": [
[
"v",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "vector_get",
"canonical_name": "func15",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "void *__fastcall vector_get(size_t *a1, size_t a2, void *a3)\n{\nif ( !a1 || !a1[3] )\n__assert_fail(\"v != NULL && v->data != NULL\", \"vectors.c\", 0x59u, \"vector_get\");\nif ( a2 >= a1[1] || !a3 )\n__assert_fail(\"i < v->length && e != NULL\", \"vectors.c\", 0x5Au, \"vector_get\");\nreturn memcpy(a3, (const void *)(a2 * *a1 + a1[3]), *a1);\n}\n",
"canonical_decompiled_code": "void *__fastcall func15(size_t *a1, size_t a2, void *a3)\n{\nif ( !a1 || !a1[3] )\n__assert_fail(\"v != NULL && v->data != NULL\", \"vectors.c\", 0x59u, \"vector_get\");\nif ( a2 >= a1[1] || !a3 )\n__assert_fail(\"i < v->length && e != NULL\", \"vectors.c\", 0x5Au, \"vector_get\");\nreturn memcpy(a3, (const void *)(a2 * *a1 + a1[3]), *a1);\n}",
"original_code": "void vector_get(const vector_t *v, size_t i, void *e) {\n ((v != ((void *)0) && v->data != ((void *)0)) ? (void) (0) : __assert_fail (\"v != NULL && v->data != NULL\", \"vectors.c\", 89, __extension__ __PRETTY_FUNCTION__));\n ((i < v->length && e != ((void *)0)) ? (void) (0) : __assert_fail (\"i < v->length && e != NULL\", \"vectors.c\", 90, __extension__ __PRETTY_FUNCTION__));\n memcpy(e, v->data + i*v->element, v->element);\n}",
"canonical_original_code": "void vector_get(struct vector_t *v, unsigned long i, void *e) {\n ((v != ((void *)0) && v->data != ((void *)0)) ? (void) (0) : __assert_fail (\"v != NULL && v->data != NULL\", \"vectors.c\", 89, __extension__ __PRETTY_FUNCTION__));\n ((i < v->length && e != ((void *)0)) ? (void) (0) : __assert_fail (\"i < v->length && e != NULL\", \"vectors.c\", 90, __extension__ __PRETTY_FUNCTION__));\n memcpy(e, v->data + i*v->element, v->element);\n}",
"variable_types": [
[
"v",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"i",
"unsigned long"
],
[
"e",
"void *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "vector_put",
"canonical_name": "func16",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "void *__fastcall vector_put(size_t *a1, size_t a2, const void *a3)\n{\nif ( !a1 || !a1[3] )\n__assert_fail(\"v != NULL && v->data != NULL\", \"vectors.c\", 0x5Fu, \"vector_put\");\nif ( a2 >= a1[1] || !a3 )\n__assert_fail(\"i < v->length && e != NULL\", \"vectors.c\", 0x60u, \"vector_put\");\nreturn memcpy((void *)(a2 * *a1 + a1[3]), a3, *a1);\n}\n",
"canonical_decompiled_code": "void *__fastcall func16(size_t *a1, size_t a2, const void *a3)\n{\nif ( !a1 || !a1[3] )\n__assert_fail(\"v != NULL && v->data != NULL\", \"vectors.c\", 0x5Fu, \"vector_put\");\nif ( a2 >= a1[1] || !a3 )\n__assert_fail(\"i < v->length && e != NULL\", \"vectors.c\", 0x60u, \"vector_put\");\nreturn memcpy((void *)(a2 * *a1 + a1[3]), a3, *a1);\n}",
"original_code": "void vector_put(vector_t *v, size_t i, const void *e) {\n ((v != ((void *)0) && v->data != ((void *)0)) ? (void) (0) : __assert_fail (\"v != NULL && v->data != NULL\", \"vectors.c\", 95, __extension__ __PRETTY_FUNCTION__));\n ((i < v->length && e != ((void *)0)) ? (void) (0) : __assert_fail (\"i < v->length && e != NULL\", \"vectors.c\", 96, __extension__ __PRETTY_FUNCTION__));\n memcpy(v->data + i*v->element, e, v->element);\n}",
"canonical_original_code": "void vector_put(struct vector_t *v, unsigned long i, void *e) {\n ((v != ((void *)0) && v->data != ((void *)0)) ? (void) (0) : __assert_fail (\"v != NULL && v->data != NULL\", \"vectors.c\", 95, __extension__ __PRETTY_FUNCTION__));\n ((i < v->length && e != ((void *)0)) ? (void) (0) : __assert_fail (\"i < v->length && e != NULL\", \"vectors.c\", 96, __extension__ __PRETTY_FUNCTION__));\n memcpy(v->data + i*v->element, e, v->element);\n}",
"variable_types": [
[
"v",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"i",
"unsigned long"
],
[
"e",
"void *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "clp2",
"canonical_name": "func17",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall clp2(__int64 a1)\n{\nunsigned __int64 v2; // [rsp+0h] [rbp-8h]\nunsigned __int64 v3; // [rsp+0h] [rbp-8h]\n\nv2 = ((((unsigned __int64)(a1 - 1) >> 1) | (a1 - 1)) >> 2) | ((unsigned __int64)(a1 - 1) >> 1) | (a1 - 1);\nv3 = (((v2 >> 4) | v2) >> 8) | (v2 >> 4) | v2;\nreturn ((v3 >> 16) | v3) + 1;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func17(__int64 a1)\n{\nunsigned __int64 v2; // [rsp+0h] [rbp-8h]\nunsigned __int64 v3; // [rsp+0h] [rbp-8h]\n\nv2 = ((((unsigned __int64)(a1 - 1) >> 1) | (a1 - 1)) >> 2) | ((unsigned __int64)(a1 - 1) >> 1) | (a1 - 1);\nv3 = (((v2 >> 4) | v2) >> 8) | (v2 >> 4) | v2;\nreturn ((v3 >> 16) | v3) + 1;\n}",
"original_code": "static size_t clp2(size_t n) {\n n = n - 1;\n n = n | (n >> 1);\n n = n | (n >> 2);\n n = n | (n >> 4);\n n = n | (n >> 8);\n n = n | (n >> 16);\n n = n + 1;\n return n;\n}",
"canonical_original_code": "static unsigned long clp2(unsigned long n) {\n n = n - 1;\n n = n | (n >> 1);\n n = n | (n >> 2);\n n = n | (n >> 4);\n n = n | (n >> 8);\n n = n | (n >> 16);\n n = n + 1;\n return n;\n}",
"variable_types": [
[
"n",
"unsigned long"
]
],
"return_type": "unsigned long",
"user_defined_types": [],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "string_new",
"canonical_name": "func18",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "size_t *__fastcall string_new(size_t *a1)\n{\nvector_new((__int64)a1, 1LL);\nreturn vector_push(a1, &THE_NUL);\n}\n",
"canonical_decompiled_code": "size_t *__fastcall func18(size_t *a1)\n{\nfunc7((__int64)a1, 1LL);\nreturn func13(a1, &THE_NUL);\n}",
"original_code": "void string_new(string_t *s) {\n vector_new(s, sizeof(char));\n vector_push(s, &THE_NUL);\n}",
"canonical_original_code": "void string_new(struct vector_t *s) {\n vector_new(s, sizeof(char));\n vector_push(s, &THE_NUL);\n}",
"variable_types": [
[
"s",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "string_str",
"canonical_name": "func19",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "size_t *__fastcall string_str(__int64 a1, const char *a2)\n{\n__int64 v3; // [rsp+10h] [rbp-10h]\nsize_t n; // [rsp+18h] [rbp-8h]\n\nn = strlen(a2);\nv3 = clp2(n + 1);\nvector_new_capacity(a1, v3, 1LL);\nstrncpy(*(char **)(a1 + 24), a2, n);\n*(_QWORD *)(a1 + 8) = n;\nreturn vector_push((size_t *)a1, &THE_NUL);\n}\n",
"canonical_decompiled_code": "size_t *__fastcall func19(__int64 a1, const char *a2)\n{\n__int64 v3; // [rsp+10h] [rbp-10h]\nsize_t n; // [rsp+18h] [rbp-8h]\n\nn = strlen(a2);\nv3 = func17(n + 1);\nfunc8(a1, v3, 1LL);\nstrncpy(*(char **)(a1 + 24), a2, n);\n*(_QWORD *)(a1 + 8) = n;\nreturn func13((size_t *)a1, &THE_NUL);\n}",
"original_code": "void string_str(string_t *s, const char *chars) {\n size_t length = strlen(chars);\n size_t capacity = clp2(length+1);\n vector_new_capacity(s, capacity, sizeof(char));\n strncpy(s->data, chars, length);\n s->length = length;\n vector_push(s, &THE_NUL);\n}",
"canonical_original_code": "void string_str(struct vector_t *s, char *chars) {\n unsigned long length = strlen(chars);\n unsigned long capacity = clp2(length+1);\n vector_new_capacity(s, capacity, sizeof(char));\n strncpy(s->data, chars, length);\n s->length = length;\n vector_push(s, &THE_NUL);\n}",
"variable_types": [
[
"s",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"chars",
"char *"
],
[
"length",
"unsigned long"
],
[
"capacity",
"unsigned long"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "string_delete",
"canonical_name": "func20",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall string_delete(__int64 a1)\n{\nreturn vector_delete(a1);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func20(__int64 a1)\n{\nreturn func9(a1);\n}",
"original_code": "void string_delete( string_t *s) {\n vector_delete(s);\n}",
"canonical_original_code": "void string_delete(struct vector_t *s) {\n vector_delete(s);\n}",
"variable_types": [
[
"s",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "string_dump",
"canonical_name": "func21",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "int __fastcall string_dump(__int64 a1)\n{\nreturn printf(\n\"string_t<data: \\\"%s\\\" length: %zu capacity: %zu>\\n\",\n*(const char **)(a1 + 24),\n*(_QWORD *)(a1 + 8),\n*(_QWORD *)(a1 + 16));\n}\n",
"canonical_decompiled_code": "int __fastcall func21(__int64 a1)\n{\nreturn printf(\n\"string_t<data: \\\"%s\\\" length: %zu capacity: %zu>\\n\",\n*(const char **)(a1 + 24),\n*(_QWORD *)(a1 + 8),\n*(_QWORD *)(a1 + 16));\n}",
"original_code": "void string_dump(const string_t *s) {\n printf(\n \"string_t<data: \\\"%s\\\" length: %zu capacity: %zu>\\n\",\n s->data, s->length, s->capacity\n );\n}",
"canonical_original_code": "void string_dump(struct vector_t *s) {\n printf(\n \"string_t<data: \\\"%s\\\" length: %zu capacity: %zu>\\n\",\n s->data, s->length, s->capacity\n );\n}",
"variable_types": [
[
"s",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "string_append_char",
"canonical_name": "func22",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "size_t *__fastcall string_append_char(size_t *a1, char a2)\n{\nchar v3[4]; // [rsp+4h] [rbp-Ch] BYREF\nsize_t *v4; // [rsp+8h] [rbp-8h]\n\nv4 = a1;\nv3[0] = a2;\nvector_pop((__int64)a1);\nvector_push(a1, v3);\nreturn vector_push(v4, &THE_NUL);\n}\n",
"canonical_decompiled_code": "size_t *__fastcall func22(size_t *a1, char a2)\n{\nchar v3[4]; // [rsp+4h] [rbp-Ch] BYREF\nsize_t *v4; // [rsp+8h] [rbp-8h]\n\nv4 = a1;\nv3[0] = a2;\nfunc14((__int64)a1);\nfunc13(a1, v3);\nreturn func13(v4, &THE_NUL);\n}",
"original_code": "void string_append_char(string_t *s, char c) {\n vector_pop(s);\n vector_push(s, &c);\n vector_push(s, &THE_NUL);\n}",
"canonical_original_code": "void string_append_char(struct vector_t *s, char c) {\n vector_pop(s);\n vector_push(s, &c);\n vector_push(s, &THE_NUL);\n}",
"variable_types": [
[
"s",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"c",
"char"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "string_append_chars",
"canonical_name": "func23",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall string_append_chars(size_t *a1, char *a2)\n{\n__int64 result; // rax\n\nwhile ( 1 )\n{\nresult = (unsigned __int8)*a2;\nif ( !(_BYTE)result )\nbreak;\nstring_append_char(a1, *a2++);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func23(size_t *a1, char *a2)\n{\n__int64 result; // rax\n\nwhile ( 1 )\n{\nresult = (unsigned __int8)*a2;\nif ( !(_BYTE)result )\nbreak;\nfunc22(a1, *a2++);\n}\nreturn result;\n}",
"original_code": "void string_append_chars(string_t *s, const char *c) {\n while (*c != '\\0') {\n string_append_char(s, *c);\n c++;\n }\n}",
"canonical_original_code": "void string_append_chars(struct vector_t *s, char *c) {\n while (*c != '\\0') {\n string_append_char(s, *c);\n c++;\n }\n}",
"variable_types": [
[
"s",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"c",
"char *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "string_compare",
"canonical_name": "func24",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "int __fastcall string_compare(__int64 a1, __int64 a2)\n{\nsize_t v2; // rdx\n\nv2 = *(_QWORD *)(a1 + 8);\nif ( v2 < *(_QWORD *)(a2 + 8) )\nv2 = *(_QWORD *)(a2 + 8);\nreturn strncmp(*(const char **)(a1 + 24), *(const char **)(a2 + 24), v2);\n}\n",
"canonical_decompiled_code": "int __fastcall func24(__int64 a1, __int64 a2)\n{\nsize_t v2; // rdx\n\nv2 = *(_QWORD *)(a1 + 8);\nif ( v2 < *(_QWORD *)(a2 + 8) )\nv2 = *(_QWORD *)(a2 + 8);\nreturn strncmp(*(const char **)(a1 + 24), *(const char **)(a2 + 24), v2);\n}",
"original_code": "int string_compare(const string_t *s, const string_t *t) {\n return strncmp(s->data, t->data, ((s->length) < (t->length) ? (t->length) : (s->length)));\n}",
"canonical_original_code": "int string_compare(struct vector_t *s, struct vector_t *t) {\n return strncmp(s->data, t->data, ((s->length) < (t->length) ? (t->length) : (s->length)));\n}",
"variable_types": [
[
"s",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"t",
"struct vector_t *"
]
],
"return_type": "int",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "token_dump",
"canonical_name": "func25",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "int __fastcall token_dump(int *a1)\n{\nint result; // eax\n\nif ( !a1 || *a1 < 0 || *a1 > 6 )\n__assert_fail(\"t != NULL && (_FIRST < t->kind && t->kind < _LAST)\", \"tokens.c\", 0x12u, \"token_dump\");\nif ( *a1 == 6 )\nresult = printf(\"integer<%d>\\n\", (unsigned int)a1[1]);\nelse\nresult = printf(\"symbol<%c>\\n\", (unsigned int)mapping[*a1]);\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func25(int *a1)\n{\nint result; // eax\n\nif ( !a1 || *a1 < 0 || *a1 > 6 )\n__assert_fail(\"t != NULL && (_FIRST < t->kind && t->kind < _LAST)\", \"tokens.c\", 0x12u, \"token_dump\");\nif ( *a1 == 6 )\nresult = printf(\"integer<%d>\\n\", (unsigned int)a1[1]);\nelse\nresult = printf(\"symbol<%c>\\n\", (unsigned int)mapping[*a1]);\nreturn result;\n}",
"original_code": "void token_dump(const token_t *t) {\n ((t != ((void *)0) && (_FIRST < t->kind && t->kind < _LAST)) ? (void) (0) : __assert_fail (\"t != NULL && (_FIRST < t->kind && t->kind < _LAST)\", \"tokens.c\", 18, __extension__ __PRETTY_FUNCTION__));\n if (t->kind == INTEGER) {\n printf(\"integer<%d>\\n\", t->value);\n }\n else {\n printf(\"symbol<%c>\\n\", mapping[t->kind]);\n }\n}",
"canonical_original_code": "void token_dump(struct token_t *t) {\n ((t != ((void *)0) && (_FIRST < t->kind && t->kind < _LAST)) ? (void) (0) : __assert_fail (\"t != NULL && (_FIRST < t->kind && t->kind < _LAST)\", \"tokens.c\", 18, __extension__ __PRETTY_FUNCTION__));\n if (t->kind == INTEGER) {\n printf(\"integer<%d>\\n\", t->value);\n }\n else {\n printf(\"symbol<%c>\\n\", mapping[t->kind]);\n }\n}",
"variable_types": [
[
"t",
"struct token_t { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct token_t { enum token_kind_t kind; int value; }",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "blank",
"canonical_name": "func26",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "_BOOL8 __fastcall blank(char a1)\n{\nreturn a1 == 32 || a1 == 9 || a1 == 10 || a1 == 13 || a1 == 11 || a1 == 12;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func26(char a1)\n{\nreturn a1 == 32 || a1 == 9 || a1 == 10 || a1 == 13 || a1 == 11 || a1 == 12;\n}",
"original_code": "static _Bool blank(char c) {\n return c == ' ' || c == '\\t' || c == '\\n' || c == '\\r'\n || c == '\\v' || c == '\\f';\n}",
"canonical_original_code": "static _Bool blank(char c) {\n return c == ' ' || c == '\\t' || c == '\\n' || c == '\\r'\n || c == '\\v' || c == '\\f';\n}",
"variable_types": [
[
"c",
"char"
]
],
"return_type": "_Bool",
"user_defined_types": [],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "digit",
"canonical_name": "func27",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "_BOOL8 __fastcall digit(char a1)\n{\nreturn a1 > 47 && a1 <= 57;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func27(char a1)\n{\nreturn a1 > 47 && a1 <= 57;\n}",
"original_code": "static _Bool digit(char c) {\n return ('0' <= c) && (c <= '9');\n}",
"canonical_original_code": "static _Bool digit(char c) {\n return ('0' <= c) && (c <= '9');\n}",
"variable_types": [
[
"c",
"char"
]
],
"return_type": "_Bool",
"user_defined_types": [],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
},
{
"name": "symbol",
"canonical_name": "func28",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "_BOOL8 __fastcall symbol(char a1)\n{\nreturn a1 == 43 || a1 == 45 || a1 == 42 || a1 == 47 || a1 == 40 || a1 == 41;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func28(char a1)\n{\nreturn a1 == 43 || a1 == 45 || a1 == 42 || a1 == 47 || a1 == 40 || a1 == 41;\n}",
"original_code": "static _Bool symbol(char c) {\n return c == '+' || c == '-' || c == '*' || c == '/'\n || c == '(' || c == ')';\n}",
"canonical_original_code": "static _Bool symbol(char c) {\n return c == '+' || c == '-' || c == '*' || c == '/'\n || c == '(' || c == ')';\n}",
"variable_types": [
[
"c",
"char"
]
],
"return_type": "_Bool",
"user_defined_types": [],
"binary_hash": "2e4233a3c2e8f644b4e1b2669ea58a69a9b74e7e8afb259c0bec460689f1256f"
}
] |
37f4d81c2579b1103f40cf05379416f6e1933c9d17c0636d943101a0805d53fe | StephenNi/expression-compiler | [
[
"valid",
"->",
"next"
],
[
"next",
"->",
"valid",
"Factor",
"Term",
"Expression",
"parse"
],
[
"Factor",
"->",
"next",
"Expression",
"Term"
],
[
"Term",
"->",
"next",
"Factor",
"Expression"
],
[
"Expression",
"->",
"Factor",
"Term",
"next",
"parse"
],
[
"parse",
"->",
"next",
"Expression"
]
] | [] | [
{
"name": "valid",
"canonical_name": "func0",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "bool valid()\n{\nreturn position < (unsigned __int64)length;\n}\n",
"canonical_decompiled_code": "bool func0()\n{\nreturn position < (unsigned __int64)length;\n}",
"original_code": "static _Bool valid(void) {\n return position < length;\n}",
"canonical_original_code": "static _Bool valid() {\n return position < length;\n}",
"variable_types": [],
"return_type": "_Bool",
"user_defined_types": [],
"binary_hash": "37f4d81c2579b1103f40cf05379416f6e1933c9d17c0636d943101a0805d53fe"
},
{
"name": "next",
"canonical_name": "func1",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "char next()\n{\nchar result; // al\n\nresult = valid();\nif ( result )\n{\nvector_get(tokens, position, ¤t);\nresult = ++position;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "char func1()\n{\nchar result; // al\n\nresult = func0();\nif ( result )\n{\nvector_get(tokens, position, ¤t);\nresult = ++position;\n}\nreturn result;\n}",
"original_code": "static void next(void) {\n if (valid()) {\n vector_get(tokens, position, ¤t);\n position += 1;\n }\n}",
"canonical_original_code": "static void next() {\n if (valid()) {\n vector_get(tokens, position, ¤t);\n position += 1;\n }\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "37f4d81c2579b1103f40cf05379416f6e1933c9d17c0636d943101a0805d53fe"
},
{
"name": "Factor",
"canonical_name": "func2",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 Factor()\n{\n__int64 v1; // [rsp+8h] [rbp-8h]\n\nif ( current == 4 )\n{\nnext();\nv1 = Expression();\nif ( current != 5 )\n{\nputs(\") expected!\");\nexit(1);\n}\nnext();\n}\nelse\n{\nif ( current != 6 )\n{\nputs(\"( or integer expected!\");\nexit(1);\n}\nv1 = node_new(6LL);\n*(_DWORD *)(v1 + 4) = dword_234;\nnext();\n}\nreturn v1;\n}\n",
"canonical_decompiled_code": "__int64 func2()\n{\n__int64 v1; // [rsp+8h] [rbp-8h]\n\nif ( current == 4 )\n{\nfunc1();\nv1 = func4();\nif ( current != 5 )\n{\nputs(\") expected!\");\nexit(1);\n}\nfunc1();\n}\nelse\n{\nif ( current != 6 )\n{\nputs(\"( or integer expected!\");\nexit(1);\n}\nv1 = node_new(6LL);\n*(_DWORD *)(v1 + 4) = dword_234;\nfunc1();\n}\nreturn v1;\n}",
"original_code": "static node_t *Factor(void) {\n node_t *expr = ((void *)0);\n switch (current.kind) {\n case OPEN:\n next();\n expr = Expression();\n if (current.kind != CLOSE) {\n puts(\") expected!\");\n exit(1);\n }\n else {\n next();\n }\n break;\n case INTEGER:\n expr = node_new(INTEGER);\n expr->value = current.value;\n next();\n break;\n default:\n puts(\"( or integer expected!\");\n exit(1);\n break;\n }\n return expr;\n}",
"canonical_original_code": "static struct node *Factor() {\n struct node *expr = ((void *)0);\n switch (current.kind) {\n case OPEN:\n next();\n expr = Expression();\n if (current.kind != CLOSE) {\n puts(\") expected!\");\n exit(1);\n }\n else {\n next();\n }\n break;\n case INTEGER:\n expr = node_new(INTEGER);\n expr->value = current.value;\n next();\n break;\n default:\n puts(\"( or integer expected!\");\n exit(1);\n break;\n }\n return expr;\n}",
"variable_types": [
[
"expr",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
]
],
"return_type": "struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *",
"user_defined_types": [
"struct node { enum token_kind_t kind; int value; struct node *left; struct node *right; }",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
"binary_hash": "37f4d81c2579b1103f40cf05379416f6e1933c9d17c0636d943101a0805d53fe"
},
{
"name": "Term",
"canonical_name": "func3",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall Term(__int64 a1)\n{\n__int64 v2; // [rsp+0h] [rbp-20h]\n__int64 v3; // [rsp+8h] [rbp-18h]\nunsigned int v4; // [rsp+14h] [rbp-Ch]\n__int64 v5; // [rsp+18h] [rbp-8h]\n\nv5 = ((__int64 (*)(void))Factor)();\nwhile ( current == 2 || current == 3 )\n{\nv4 = current;\nnext();\nv3 = Factor(a1);\na1 = v4;\nv2 = node_new(v4);\n*(_QWORD *)(v2 + 8) = v5;\n*(_QWORD *)(v2 + 16) = v3;\nv5 = v2;\n}\nreturn v5;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1)\n{\n__int64 v2; // [rsp+0h] [rbp-20h]\n__int64 v3; // [rsp+8h] [rbp-18h]\nunsigned int v4; // [rsp+14h] [rbp-Ch]\n__int64 v5; // [rsp+18h] [rbp-8h]\n\nv5 = ((__int64 (*)(void))Factor)();\nwhile ( current == 2 || current == 3 )\n{\nv4 = current;\nfunc1();\nv3 = func2(a1);\na1 = v4;\nv2 = node_new(v4);\n*(_QWORD *)(v2 + 8) = v5;\n*(_QWORD *)(v2 + 16) = v3;\nv5 = v2;\n}\nreturn v5;\n}",
"original_code": "static node_t *Term(void) {\n node_t *left = Factor();\n node_t *right, *new;\n while (current.kind == TIMES || current.kind == SLASH) {\n node_kind_t op = current.kind;\n next();\n right = Factor();\n new = node_new(op);\n new->left = left;\n new->right = right;\n left = new;\n }\n return left;\n}",
"canonical_original_code": "static struct node *Term() {\n struct node *left = Factor();\n struct node *right; struct node *new;\n while (current.kind == TIMES || current.kind == SLASH) {\n enum token_kind_t op = current.kind;\n next();\n right = Factor();\n new = node_new(op);\n new->left = left;\n new->right = right;\n left = new;\n }\n return left;\n}",
"variable_types": [
[
"left",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
],
[
"right",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
],
[
"new",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
],
[
"op",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
]
],
"return_type": "struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *",
"user_defined_types": [
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }",
"struct node { enum token_kind_t kind; int value; struct node *left; struct node *right; }"
],
"binary_hash": "37f4d81c2579b1103f40cf05379416f6e1933c9d17c0636d943101a0805d53fe"
},
{
"name": "Expression",
"canonical_name": "func4",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall Expression(__int64 a1)\n{\n__int64 v2; // [rsp+0h] [rbp-20h]\n__int64 v3; // [rsp+8h] [rbp-18h]\nunsigned int v4; // [rsp+14h] [rbp-Ch]\n__int64 v5; // [rsp+18h] [rbp-8h]\n\nv5 = Term(a1);\nwhile ( !current || current == 1 )\n{\nv4 = current;\nnext();\nv3 = Term(a1);\na1 = v4;\nv2 = node_new(v4);\n*(_QWORD *)(v2 + 8) = v5;\n*(_QWORD *)(v2 + 16) = v3;\nv5 = v2;\n}\nreturn v5;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1)\n{\n__int64 v2; // [rsp+0h] [rbp-20h]\n__int64 v3; // [rsp+8h] [rbp-18h]\nunsigned int v4; // [rsp+14h] [rbp-Ch]\n__int64 v5; // [rsp+18h] [rbp-8h]\n\nv5 = func3(a1);\nwhile ( !current || current == 1 )\n{\nv4 = current;\nfunc1();\nv3 = func3(a1);\na1 = v4;\nv2 = node_new(v4);\n*(_QWORD *)(v2 + 8) = v5;\n*(_QWORD *)(v2 + 16) = v3;\nv5 = v2;\n}\nreturn v5;\n}",
"original_code": "static node_t *Expression(void) {\n node_t *left = Term();\n node_t *right, *new;\n while (current.kind == PLUS || current.kind == MINUS) {\n node_kind_t op = current.kind;\n next();\n right = Term();\n new = node_new(op);\n new->left = left;\n new->right = right;\n left = new;\n }\n return left;\n}",
"canonical_original_code": "static struct node *Expression() {\n struct node *left = Term();\n struct node *right; struct node *new;\n while (current.kind == PLUS || current.kind == MINUS) {\n enum token_kind_t op = current.kind;\n next();\n right = Term();\n new = node_new(op);\n new->left = left;\n new->right = right;\n left = new;\n }\n return left;\n}",
"variable_types": [
[
"left",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
],
[
"right",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
],
[
"new",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
],
[
"op",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
]
],
"return_type": "struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *",
"user_defined_types": [
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }",
"struct node { enum token_kind_t kind; int value; struct node *left; struct node *right; }"
],
"binary_hash": "37f4d81c2579b1103f40cf05379416f6e1933c9d17c0636d943101a0805d53fe"
},
{
"name": "parse",
"canonical_name": "func5",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall parse(__int64 a1)\n{\ntokens = a1;\nlength = *(_QWORD *)(a1 + 8);\nposition = 0LL;\nnext();\nreturn Expression(a1);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1)\n{\ntokens = a1;\nlength = *(_QWORD *)(a1 + 8);\nposition = 0LL;\nfunc1();\nreturn func4(a1);\n}",
"original_code": "node_t *parse(vector_t *ts) {\n tokens = ts;\n length = ts->length;\n position = 0;\n next();\n return Expression();\n}",
"canonical_original_code": "struct node *parse(struct vector_t *ts) {\n tokens = ts;\n length = ts->length;\n position = 0;\n next();\n return Expression();\n}",
"variable_types": [
[
"ts",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
]
],
"return_type": "struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }",
"struct node { enum token_kind_t kind; int value; struct node *left; struct node *right; }",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
"binary_hash": "37f4d81c2579b1103f40cf05379416f6e1933c9d17c0636d943101a0805d53fe"
}
] |
681e6e745f65a42477a15a32d1cbd4982fb06cd4f22710323cd1fc39a6d7d26a | StephenNi/expression-compiler | [
[
"operator",
"->",
"eval"
],
[
"eval",
"->",
"operator"
]
] | [] | [
{
"name": "operator",
"canonical_name": "func0",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "_BOOL8 __fastcall operator(int a1)\n{\nreturn a1 >= 0 && a1 <= 3;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func0(int a1)\n{\nreturn a1 >= 0 && a1 <= 3;\n}",
"original_code": "static _Bool operator(node_kind_t kind) {\n return (PLUS <= kind && kind <= SLASH);\n}",
"canonical_original_code": "static _Bool operator(enum token_kind_t kind) {\n return (PLUS <= kind && kind <= SLASH);\n}",
"variable_types": [
[
"kind",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
]
],
"return_type": "_Bool",
"user_defined_types": [
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
"binary_hash": "681e6e745f65a42477a15a32d1cbd4982fb06cd4f22710323cd1fc39a6d7d26a"
},
{
"name": "eval",
"canonical_name": "func1",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall eval(__int64 a1)\n{\nint v2; // eax\nint v3; // [rsp+18h] [rbp-8h]\nint v4; // [rsp+1Ch] [rbp-4h]\n\nif ( *(_DWORD *)a1 == 6 )\nreturn *(unsigned int *)(a1 + 4);\nif ( !operator(*(_DWORD *)a1) )\n_assert_fail(\"0\", \"interpreter.c\", 0x20u, \"eval\");\nv4 = eval(*(_QWORD *)(a1 + 8));\nv3 = eval(*(_QWORD *)(a1 + 16));\nv2 = *(_DWORD *)a1;\nif ( *(_DWORD *)a1 == 3 )\nreturn (unsigned int)(v4 / v3);\nif ( v2 > 3 )\ngoto LABEL_15;\nif ( v2 == 2 )\nreturn (unsigned int)(v3 * v4);\nif ( v2 > 2 )\ngoto LABEL_15;\nif ( !v2 )\nreturn (unsigned int)(v4 + v3);\nif ( v2 != 1 )\nLABEL_15:\n_assert_fail(\"0\", \"interpreter.c\", 0x1Bu, \"eval\");\nreturn (unsigned int)(v4 - v3);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1)\n{\nint v2; // eax\nint v3; // [rsp+18h] [rbp-8h]\nint v4; // [rsp+1Ch] [rbp-4h]\n\nif ( *(_DWORD *)a1 == 6 )\nreturn *(unsigned int *)(a1 + 4);\nif ( !func0(*(_DWORD *)a1) )\n_assert_fail(\"0\", \"interpreter.c\", 0x20u, \"eval\");\nv4 = func1(*(_QWORD *)(a1 + 8));\nv3 = func1(*(_QWORD *)(a1 + 16));\nv2 = *(_DWORD *)a1;\nif ( *(_DWORD *)a1 == 3 )\nreturn (unsigned int)(v4 / v3);\nif ( v2 > 3 )\ngoto LABEL_15;\nif ( v2 == 2 )\nreturn (unsigned int)(v3 * v4);\nif ( v2 > 2 )\ngoto LABEL_15;\nif ( !v2 )\nreturn (unsigned int)(v4 + v3);\nif ( v2 != 1 )\nLABEL_15:\n_assert_fail(\"0\", \"interpreter.c\", 0x1Bu, \"eval\");\nreturn (unsigned int)(v4 - v3);\n}",
"original_code": "int eval(const node_t *ast) {\n int left, right;\n if (ast->kind == INTEGER) {\n return ast->value;\n }\n else if (operator(ast->kind)) {\n left = eval(ast->left);\n right = eval(ast->right);\n switch (ast->kind) {\n case PLUS: return left + right;\n case MINUS: return left - right;\n case TIMES: return left * right;\n case SLASH: return left / right;\n default: ((0) ? (void) (0) : __assert_fail (\"0\", \"interpreter.c\", 27, __extension__ __PRETTY_FUNCTION__));\n }\n }\n else {\n ((0) ? (void) (0) : __assert_fail (\"0\", \"interpreter.c\", 32, __extension__ __PRETTY_FUNCTION__));\n }\n}",
"canonical_original_code": "int eval(struct node *ast) {\n int left; int right;\n if (ast->kind == INTEGER) {\n return ast->value;\n }\n else if (operator(ast->kind)) {\n left = eval(ast->left);\n right = eval(ast->right);\n switch (ast->kind) {\n case PLUS: return left + right;\n case MINUS: return left - right;\n case TIMES: return left * right;\n case SLASH: return left / right;\n default: ((0) ? (void) (0) : __assert_fail (\"0\", \"interpreter.c\", 27, __extension__ __PRETTY_FUNCTION__));\n }\n }\n else {\n ((0) ? (void) (0) : __assert_fail (\"0\", \"interpreter.c\", 32, __extension__ __PRETTY_FUNCTION__));\n }\n}",
"variable_types": [
[
"ast",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
],
[
"left",
"int"
],
[
"right",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct node { enum token_kind_t kind; int value; struct node *left; struct node *right; }",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
"binary_hash": "681e6e745f65a42477a15a32d1cbd4982fb06cd4f22710323cd1fc39a6d7d26a"
}
] |
c1b8d311d2cbd66b3cca186e1580d4b84312b8ae512df556e258015712e1df2c | StephenNi/expression-compiler | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"test_static",
"->",
"node_dump",
"main"
],
[
"test_dynamic",
"->",
"node_dump",
"node_delete",
"main"
],
[
"main",
"->",
"test_static",
"test_dynamic"
],
[
"real_dump",
"->",
"node_dump"
],
[
"node_dump",
"->",
"test_static",
"test_dynamic",
"real_dump"
],
[
"node_delete",
"->",
"test_dynamic"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_404010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"void *func3()\n{\nreturn &end;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"void *func5()\n{\nvoid *result; // rax\n\nif ( !_bss_start )\n{\nresult = func3();\n_bss_start = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"_libc_csu_init",
"void __fastcall func12(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func13(void)\n{\n;\n}"
]
] | [
{
"name": "test_static",
"canonical_name": "func7",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 test_static()\n{\nint v1; // [rsp+0h] [rbp-60h] BYREF\nint *v2; // [rsp+8h] [rbp-58h]\nint *v3; // [rsp+10h] [rbp-50h]\nint v4[8]; // [rsp+20h] [rbp-40h] BYREF\nint v5[8]; // [rsp+40h] [rbp-20h] BYREF\n\nv5[0] = 6;\nv5[1] = 42;\nnode_dump(v5);\nv4[0] = 6;\nv4[1] = 10;\nnode_dump(v4);\nv1 = 0;\nv2 = v5;\nv3 = v4;\nreturn node_dump(&v1);\n}\n",
"canonical_decompiled_code": "__int64 func7()\n{\nint v1; // [rsp+0h] [rbp-60h] BYREF\nint *v2; // [rsp+8h] [rbp-58h]\nint *v3; // [rsp+10h] [rbp-50h]\nint v4[8]; // [rsp+20h] [rbp-40h] BYREF\nint v5[8]; // [rsp+40h] [rbp-20h] BYREF\n\nv5[0] = 6;\nv5[1] = 42;\nfunc10(v5);\nv4[0] = 6;\nv4[1] = 10;\nfunc10(v4);\nv1 = 0;\nv2 = v5;\nv3 = v4;\nreturn func10(&v1);\n}",
"original_code": "void test_static(void) {\n node_t t;\n node_t q;\n node_t r;\n t.kind = INTEGER;\n t.value = 42;\n node_dump(&t);\n q.kind = INTEGER;\n q.value = 10;\n node_dump(&q);\n r.kind = PLUS;\n r.left = &t;\n r.right = &q;\n node_dump(&r);\n}",
"canonical_original_code": "void test_static() {\n struct node t;\n struct node q;\n struct node r;\n t.kind = INTEGER;\n t.value = 42;\n node_dump(&t);\n q.kind = INTEGER;\n q.value = 10;\n node_dump(&q);\n r.kind = PLUS;\n r.left = &t;\n r.right = &q;\n node_dump(&r);\n}",
"variable_types": [
[
"t",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; }"
],
[
"q",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; }"
],
[
"r",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; }"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { enum token_kind_t kind; int value; struct node *left; struct node *right; }",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
"binary_hash": "c1b8d311d2cbd66b3cca186e1580d4b84312b8ae512df556e258015712e1df2c"
},
{
"name": "test_dynamic",
"canonical_name": "func8",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 test_dynamic()\n{\n__int64 v1; // [rsp+8h] [rbp-18h]\n__int64 v2; // [rsp+10h] [rbp-10h]\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nv3 = node_new(0LL);\nv2 = node_new(6LL);\n*(_DWORD *)(v2 + 4) = 42;\nv1 = node_new(6LL);\n*(_DWORD *)(v1 + 4) = 10;\n*(_QWORD *)(v3 + 8) = v2;\n*(_QWORD *)(v3 + 16) = v1;\nnode_dump(v3);\nreturn node_delete(v3);\n}\n",
"canonical_decompiled_code": "__int64 func8()\n{\n__int64 v1; // [rsp+8h] [rbp-18h]\n__int64 v2; // [rsp+10h] [rbp-10h]\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nv3 = node_new(0LL);\nv2 = node_new(6LL);\n*(_DWORD *)(v2 + 4) = 42;\nv1 = node_new(6LL);\n*(_DWORD *)(v1 + 4) = 10;\n*(_QWORD *)(v3 + 8) = v2;\n*(_QWORD *)(v3 + 16) = v1;\nfunc10(v3);\nreturn func11(v3);\n}",
"original_code": "void test_dynamic(void) {\n node_t *p, *l, *r;\n p = node_new(PLUS);\n l = node_new(INTEGER);\n l->value = 42;\n r = node_new(INTEGER);\n r->value = 10;\n p->left = l;\n p->right = r;\n node_dump(p);\n node_delete(p);\n}",
"canonical_original_code": "void test_dynamic() {\n struct node *p; struct node *l; struct node *r;\n p = node_new(PLUS);\n l = node_new(INTEGER);\n l->value = 42;\n r = node_new(INTEGER);\n r->value = 10;\n p->left = l;\n p->right = r;\n node_dump(p);\n node_delete(p);\n}",
"variable_types": [
[
"p",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
],
[
"l",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
],
[
"r",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { enum token_kind_t kind; int value; struct node *left; struct node *right; }",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
"binary_hash": "c1b8d311d2cbd66b3cca186e1580d4b84312b8ae512df556e258015712e1df2c"
},
{
"name": "real_dump",
"canonical_name": "func9",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "int __fastcall real_dump(int *a1, int a2)\n{\nint i; // [rsp+1Ch] [rbp-4h]\n\nif ( !a1 || *a1 < 0 || *a1 > 6 )\n__assert_fail(\"t != NULL && (_FIRST < t->kind && t->kind < _LAST)\", \"nodes.c\", 0x15u, \"real_dump\");\nfor ( i = 0; i < a2; ++i )\nprintf(\" \");\nif ( *a1 == 6 )\nreturn printf(\"integer<%d>\\n\", (unsigned int)a1[1]);\nprintf(\"operator<%c>\\n\", (unsigned int)mapping[*a1]);\nreal_dump(*((_QWORD *)a1 + 1), (unsigned int)(a2 + 1));\nreturn real_dump(*((_QWORD *)a1 + 2), (unsigned int)(a2 + 1));\n}\n",
"canonical_decompiled_code": "int __fastcall func9(int *a1, int a2)\n{\nint i; // [rsp+1Ch] [rbp-4h]\n\nif ( !a1 || *a1 < 0 || *a1 > 6 )\n__assert_fail(\"t != NULL && (_FIRST < t->kind && t->kind < _LAST)\", \"nodes.c\", 0x15u, \"real_dump\");\nfor ( i = 0; i < a2; ++i )\nprintf(\" \");\nif ( *a1 == 6 )\nreturn printf(\"integer<%d>\\n\", (unsigned int)a1[1]);\nprintf(\"operator<%c>\\n\", (unsigned int)mapping[*a1]);\nfunc9(*((_QWORD *)a1 + 1), (unsigned int)(a2 + 1));\nreturn func9(*((_QWORD *)a1 + 2), (unsigned int)(a2 + 1));\n}",
"original_code": "static void real_dump(const node_t *t, int level) {\n int i;\n ((t != ((void *)0) && (_FIRST < t->kind && t->kind < _LAST)) ? (void) (0) : __assert_fail (\"t != NULL && (_FIRST < t->kind && t->kind < _LAST)\", \"nodes.c\", 21, __extension__ __PRETTY_FUNCTION__));\n for (i = 0; i < level; i++) {\n printf(\" \");\n }\n if (t->kind == INTEGER) {\n printf(\"integer<%d>\\n\", t->value);\n }\n else {\n printf(\"operator<%c>\\n\", mapping[t->kind]);\n real_dump(t->left, level+1);\n real_dump(t->right, level+1);\n }\n}",
"canonical_original_code": "static void real_dump(struct node *t, int level) {\n int i;\n ((t != ((void *)0) && (_FIRST < t->kind && t->kind < _LAST)) ? (void) (0) : __assert_fail (\"t != NULL && (_FIRST < t->kind && t->kind < _LAST)\", \"nodes.c\", 21, __extension__ __PRETTY_FUNCTION__));\n for (i = 0; i < level; i++) {\n printf(\" \");\n }\n if (t->kind == INTEGER) {\n printf(\"integer<%d>\\n\", t->value);\n }\n else {\n printf(\"operator<%c>\\n\", mapping[t->kind]);\n real_dump(t->left, level+1);\n real_dump(t->right, level+1);\n }\n}",
"variable_types": [
[
"t",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
],
[
"level",
"int"
],
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { enum token_kind_t kind; int value; struct node *left; struct node *right; }",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
"binary_hash": "c1b8d311d2cbd66b3cca186e1580d4b84312b8ae512df556e258015712e1df2c"
},
{
"name": "node_dump",
"canonical_name": "func10",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "int __fastcall node_dump(int *a1)\n{\nreturn real_dump(a1, 0);\n}\n",
"canonical_decompiled_code": "int __fastcall func10(int *a1)\n{\nreturn func9(a1, 0);\n}",
"original_code": "void node_dump(const node_t *t) {\n real_dump(t, 0);\n}",
"canonical_original_code": "void node_dump(struct node *t) {\n real_dump(t, 0);\n}",
"variable_types": [
[
"t",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { enum token_kind_t kind; int value; struct node *left; struct node *right; }",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
"binary_hash": "c1b8d311d2cbd66b3cca186e1580d4b84312b8ae512df556e258015712e1df2c"
},
{
"name": "node_delete",
"canonical_name": "func11",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "void __fastcall node_delete(_QWORD *a1)\n{\nif ( a1 )\n{\nnode_delete(a1[1]);\na1[1] = 0LL;\nnode_delete(a1[2]);\na1[1] = 0LL;\nfree(a1);\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func11(_QWORD *a1)\n{\nif ( a1 )\n{\nfunc11(a1[1]);\na1[1] = 0LL;\nfunc11(a1[2]);\na1[1] = 0LL;\nfree(a1);\n}\n}",
"original_code": "void node_delete(node_t *node) {\n if (node != ((void *)0)) {\n node_delete(node->left);\n node->left = ((void *)0);\n node_delete(node->right);\n node->left = ((void *)0);\n free(node);\n }\n}",
"canonical_original_code": "void node_delete(struct node *node) {\n if (node != ((void *)0)) {\n node_delete(node->left);\n node->left = ((void *)0);\n node_delete(node->right);\n node->left = ((void *)0);\n free(node);\n }\n}",
"variable_types": [
[
"node",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { enum token_kind_t kind; int value; struct node *left; struct node *right; }",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
"binary_hash": "c1b8d311d2cbd66b3cca186e1580d4b84312b8ae512df556e258015712e1df2c"
},
{
"name": "main",
"canonical_name": "main",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\ntest_static(argc, argv, envp);\ntest_dynamic();\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nfunc7(argc, argv, envp);\nfunc8();\nreturn 0;\n}",
"original_code": "int main(void) {\n test_static();\n test_dynamic();\n return 0;\n}",
"canonical_original_code": "int main() {\n test_static();\n test_dynamic();\n return 0;\n}",
"variable_types": [],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "c1b8d311d2cbd66b3cca186e1580d4b84312b8ae512df556e258015712e1df2c"
}
] |
f7b99492a214f0da6624daedb9b70f0d315fc7e3a3ff93e9597416a33e7e595a | StephenNi/expression-compiler | [
[
"label",
"->",
"prologue",
"epilogue"
],
[
"instruction",
"->",
"push",
"pop",
"load",
"operation",
"prologue",
"epilogue"
],
[
"push",
"->",
"instruction",
"load",
"operation"
],
[
"pop",
"->",
"instruction",
"operation",
"epilogue"
],
[
"load",
"->",
"instruction",
"push",
"recurse"
],
[
"operator",
"->",
"operation",
"recurse"
],
[
"operation",
"->",
"operator",
"pop",
"instruction",
"push",
"recurse"
],
[
"prologue",
"->",
"instruction",
"label",
"generate"
],
[
"epilogue",
"->",
"label",
"pop",
"instruction",
"generate"
],
[
"recurse",
"->",
"load",
"operator",
"operation",
"generate"
],
[
"generate",
"->",
"prologue",
"recurse",
"epilogue"
]
] | [] | [
{
"name": "label",
"canonical_name": "func0",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall label(__int64 a1, __int64 a2)\n{\nstring_append_chars(a1, a2);\nreturn string_append_chars(a1, &unk_638);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, __int64 a2)\n{\nstring_append_chars(a1, a2);\nreturn string_append_chars(a1, &unk_638);\n}",
"original_code": "static void label(string_t *buffer, const char *lab) {\n string_append_chars(buffer, lab);\n string_append_chars(buffer, \":\\n\");\n}",
"canonical_original_code": "static void label(struct vector_t *buffer, char *lab) {\n string_append_chars(buffer, lab);\n string_append_chars(buffer, \":\\n\");\n}",
"variable_types": [
[
"buffer",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"lab",
"char *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "f7b99492a214f0da6624daedb9b70f0d315fc7e3a3ff93e9597416a33e7e595a"
},
{
"name": "instruction",
"canonical_name": "func1",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall instruction(__int64 a1, __int64 a2)\n{\nstring_append_char(a1, 9LL);\nstring_append_chars(a1, a2);\nreturn string_append_char(a1, 10LL);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1, __int64 a2)\n{\nstring_append_char(a1, 9LL);\nstring_append_chars(a1, a2);\nreturn string_append_char(a1, 10LL);\n}",
"original_code": "static void instruction(string_t *buffer, const char *inst) {\n string_append_char(buffer, '\\t');\n string_append_chars(buffer, inst);\n string_append_char(buffer, '\\n');\n}",
"canonical_original_code": "static void instruction(struct vector_t *buffer, char *inst) {\n string_append_char(buffer, '\\t');\n string_append_chars(buffer, inst);\n string_append_char(buffer, '\\n');\n}",
"variable_types": [
[
"buffer",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"inst",
"char *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "f7b99492a214f0da6624daedb9b70f0d315fc7e3a3ff93e9597416a33e7e595a"
},
{
"name": "push",
"canonical_name": "func2",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall push(__int64 a1, const char *a2)\n{\nchar v3[8]; // [rsp+10h] [rbp-30h] BYREF\n__int64 v4; // [rsp+18h] [rbp-28h]\n__int64 v5; // [rsp+20h] [rbp-20h]\n__int64 v6; // [rsp+28h] [rbp-18h]\nint v7; // [rsp+3Ch] [rbp-4h]\n\n*(_QWORD *)v3 = 0LL;\nv4 = 0LL;\nv5 = 0LL;\nv6 = 0LL;\nif ( strlen(a2) != 3 )\n_assert_fail(\"strlen(reg) == 3\", \"spim.c\", 0x24u, \"push\");\ninstruction(a1, (__int64)\"addi $sp, $sp, -4\");\nv7 = snprintf(v3, 0x20uLL, \"sw %s, ($sp)\", a2);\nif ( v7 > 31 )\n_assert_fail(\"res < LEN\", \"spim.c\", 0x27u, \"push\");\nreturn instruction(a1, (__int64)v3);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, const char *a2)\n{\nchar v3[8]; // [rsp+10h] [rbp-30h] BYREF\n__int64 v4; // [rsp+18h] [rbp-28h]\n__int64 v5; // [rsp+20h] [rbp-20h]\n__int64 v6; // [rsp+28h] [rbp-18h]\nint v7; // [rsp+3Ch] [rbp-4h]\n\n*(_QWORD *)v3 = 0LL;\nv4 = 0LL;\nv5 = 0LL;\nv6 = 0LL;\nif ( strlen(a2) != 3 )\n_assert_fail(\"strlen(reg) == 3\", \"spim.c\", 0x24u, \"push\");\nfunc1(a1, (__int64)\"addi $sp, $sp, -4\");\nv7 = snprintf(v3, 0x20uLL, \"sw %s, ($sp)\", a2);\nif ( v7 > 31 )\n_assert_fail(\"res < LEN\", \"spim.c\", 0x27u, \"push\");\nreturn func1(a1, (__int64)v3);\n}",
"original_code": "static void push(string_t *buffer, const char *reg) {\n int res;\n char inst[32] = \"\";\n ((strlen(reg) == 3) ? (void) (0) : __assert_fail (\"strlen(reg) == 3\", \"spim.c\", 36, __extension__ __PRETTY_FUNCTION__));\n instruction(buffer, \"addi $sp, $sp, -4\");\n res = snprintf(inst, 32, \"sw %s, ($sp)\", reg);\n ((res < 32) ? (void) (0) : __assert_fail (\"res < LEN\", \"spim.c\", 39, __extension__ __PRETTY_FUNCTION__));\n instruction(buffer, inst);\n}",
"canonical_original_code": "static void push(struct vector_t *buffer, char *reg) {\n int res;\n char inst[32] = \"\";\n ((strlen(reg) == 3) ? (void) (0) : __assert_fail (\"strlen(reg) == 3\", \"spim.c\", 36, __extension__ __PRETTY_FUNCTION__));\n instruction(buffer, \"addi $sp, $sp, -4\");\n res = snprintf(inst, 32, \"sw %s, ($sp)\", reg);\n ((res < 32) ? (void) (0) : __assert_fail (\"res < LEN\", \"spim.c\", 39, __extension__ __PRETTY_FUNCTION__));\n instruction(buffer, inst);\n}",
"variable_types": [
[
"buffer",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"reg",
"char *"
],
[
"res",
"int"
],
[
"inst",
"char [32]"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "f7b99492a214f0da6624daedb9b70f0d315fc7e3a3ff93e9597416a33e7e595a"
},
{
"name": "pop",
"canonical_name": "func3",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall pop(__int64 a1, const char *a2)\n{\nchar v3[8]; // [rsp+10h] [rbp-30h] BYREF\n__int64 v4; // [rsp+18h] [rbp-28h]\n__int64 v5; // [rsp+20h] [rbp-20h]\n__int64 v6; // [rsp+28h] [rbp-18h]\nint v7; // [rsp+3Ch] [rbp-4h]\n\n*(_QWORD *)v3 = 0LL;\nv4 = 0LL;\nv5 = 0LL;\nv6 = 0LL;\nif ( strlen(a2) != 3 )\n_assert_fail(\"strlen(reg) == 3\", \"spim.c\", 0x2Eu, \"pop\");\nv7 = snprintf(v3, 0x20uLL, \"lw %s, ($sp)\", a2);\nif ( v7 > 31 )\n_assert_fail(\"res < LEN\", \"spim.c\", 0x30u, \"pop\");\ninstruction(a1, (__int64)v3);\nreturn instruction(a1, (__int64)\"addi $sp, $sp, 4\");\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1, const char *a2)\n{\nchar v3[8]; // [rsp+10h] [rbp-30h] BYREF\n__int64 v4; // [rsp+18h] [rbp-28h]\n__int64 v5; // [rsp+20h] [rbp-20h]\n__int64 v6; // [rsp+28h] [rbp-18h]\nint v7; // [rsp+3Ch] [rbp-4h]\n\n*(_QWORD *)v3 = 0LL;\nv4 = 0LL;\nv5 = 0LL;\nv6 = 0LL;\nif ( strlen(a2) != 3 )\n_assert_fail(\"strlen(reg) == 3\", \"spim.c\", 0x2Eu, \"pop\");\nv7 = snprintf(v3, 0x20uLL, \"lw %s, ($sp)\", a2);\nif ( v7 > 31 )\n_assert_fail(\"res < LEN\", \"spim.c\", 0x30u, \"pop\");\nfunc1(a1, (__int64)v3);\nreturn func1(a1, (__int64)\"addi $sp, $sp, 4\");\n}",
"original_code": "static void pop(string_t *buffer, const char *reg) {\n int res;\n char inst[32] = \"\";\n ((strlen(reg) == 3) ? (void) (0) : __assert_fail (\"strlen(reg) == 3\", \"spim.c\", 46, __extension__ __PRETTY_FUNCTION__));\n res = snprintf(inst, 32, \"lw %s, ($sp)\", reg);\n ((res < 32) ? (void) (0) : __assert_fail (\"res < LEN\", \"spim.c\", 48, __extension__ __PRETTY_FUNCTION__));\n instruction(buffer, inst);\n instruction(buffer, \"addi $sp, $sp, 4\");\n}",
"canonical_original_code": "static void pop(struct vector_t *buffer, char *reg) {\n int res;\n char inst[32] = \"\";\n ((strlen(reg) == 3) ? (void) (0) : __assert_fail (\"strlen(reg) == 3\", \"spim.c\", 46, __extension__ __PRETTY_FUNCTION__));\n res = snprintf(inst, 32, \"lw %s, ($sp)\", reg);\n ((res < 32) ? (void) (0) : __assert_fail (\"res < LEN\", \"spim.c\", 48, __extension__ __PRETTY_FUNCTION__));\n instruction(buffer, inst);\n instruction(buffer, \"addi $sp, $sp, 4\");\n}",
"variable_types": [
[
"buffer",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"reg",
"char *"
],
[
"res",
"int"
],
[
"inst",
"char [32]"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "f7b99492a214f0da6624daedb9b70f0d315fc7e3a3ff93e9597416a33e7e595a"
},
{
"name": "load",
"canonical_name": "func4",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall load(__int64 a1, unsigned int a2, const char *a3)\n{\nchar v5[8]; // [rsp+20h] [rbp-30h] BYREF\n__int64 v6; // [rsp+28h] [rbp-28h]\n__int64 v7; // [rsp+30h] [rbp-20h]\n__int64 v8; // [rsp+38h] [rbp-18h]\nint v9; // [rsp+4Ch] [rbp-4h]\n\n*(_QWORD *)v5 = 0LL;\nv6 = 0LL;\nv7 = 0LL;\nv8 = 0LL;\nif ( strlen(a3) != 3 )\n_assert_fail(\"strlen(reg) == 3\", \"spim.c\", 0x38u, \"load\");\nv9 = snprintf(v5, 0x20uLL, \"li %s, %d\", a3, a2);\nif ( v9 > 31 )\n_assert_fail(\"res < LEN\", \"spim.c\", 0x3Au, \"load\");\ninstruction(a1, (__int64)v5);\nreturn push(a1, a3);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1, unsigned int a2, const char *a3)\n{\nchar v5[8]; // [rsp+20h] [rbp-30h] BYREF\n__int64 v6; // [rsp+28h] [rbp-28h]\n__int64 v7; // [rsp+30h] [rbp-20h]\n__int64 v8; // [rsp+38h] [rbp-18h]\nint v9; // [rsp+4Ch] [rbp-4h]\n\n*(_QWORD *)v5 = 0LL;\nv6 = 0LL;\nv7 = 0LL;\nv8 = 0LL;\nif ( strlen(a3) != 3 )\n_assert_fail(\"strlen(reg) == 3\", \"spim.c\", 0x38u, \"load\");\nv9 = snprintf(v5, 0x20uLL, \"li %s, %d\", a3, a2);\nif ( v9 > 31 )\n_assert_fail(\"res < LEN\", \"spim.c\", 0x3Au, \"load\");\nfunc1(a1, (__int64)v5);\nreturn func2(a1, a3);\n}",
"original_code": "static void load(string_t *buffer, int val, const char *reg) {\n int res;\n char inst[32] = \"\";\n ((strlen(reg) == 3) ? (void) (0) : __assert_fail (\"strlen(reg) == 3\", \"spim.c\", 56, __extension__ __PRETTY_FUNCTION__));\n res = snprintf(inst, 32, \"li %s, %d\", reg, val);\n ((res < 32) ? (void) (0) : __assert_fail (\"res < LEN\", \"spim.c\", 58, __extension__ __PRETTY_FUNCTION__));\n instruction(buffer, inst);\n push(buffer, reg);\n}",
"canonical_original_code": "static void load(struct vector_t *buffer, int val, char *reg) {\n int res;\n char inst[32] = \"\";\n ((strlen(reg) == 3) ? (void) (0) : __assert_fail (\"strlen(reg) == 3\", \"spim.c\", 56, __extension__ __PRETTY_FUNCTION__));\n res = snprintf(inst, 32, \"li %s, %d\", reg, val);\n ((res < 32) ? (void) (0) : __assert_fail (\"res < LEN\", \"spim.c\", 58, __extension__ __PRETTY_FUNCTION__));\n instruction(buffer, inst);\n push(buffer, reg);\n}",
"variable_types": [
[
"buffer",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"val",
"int"
],
[
"reg",
"char *"
],
[
"res",
"int"
],
[
"inst",
"char [32]"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "f7b99492a214f0da6624daedb9b70f0d315fc7e3a3ff93e9597416a33e7e595a"
},
{
"name": "operator",
"canonical_name": "func5",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "_BOOL8 __fastcall operator(int a1)\n{\nreturn a1 >= 0 && a1 <= 3;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func5(int a1)\n{\nreturn a1 >= 0 && a1 <= 3;\n}",
"original_code": "static _Bool operator(node_kind_t kind) {\n return (PLUS <= kind && kind <= SLASH);\n}",
"canonical_original_code": "static _Bool operator(enum token_kind_t kind) {\n return (PLUS <= kind && kind <= SLASH);\n}",
"variable_types": [
[
"kind",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
]
],
"return_type": "_Bool",
"user_defined_types": [
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
"binary_hash": "f7b99492a214f0da6624daedb9b70f0d315fc7e3a3ff93e9597416a33e7e595a"
},
{
"name": "operation",
"canonical_name": "func6",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall operation(__int64 a1, int a2)\n{\nchar s[8]; // [rsp+10h] [rbp-30h] BYREF\n__int64 v4; // [rsp+18h] [rbp-28h]\n__int64 v5; // [rsp+20h] [rbp-20h]\n__int64 v6; // [rsp+28h] [rbp-18h]\nint v7; // [rsp+3Ch] [rbp-4h]\n\n*(_QWORD *)s = 0LL;\nv4 = 0LL;\nv5 = 0LL;\nv6 = 0LL;\nif ( !operator(a2) )\n_assert_fail(\"operator(kind)\", \"spim.c\", 0x47u, \"operation\");\npop(a1, \"$s1\");\npop(a1, \"$s0\");\nv7 = snprintf(s, 0x20uLL, \"%s $s0, $s0, $s1\", (const char *)*(&mapping + a2));\nif ( v7 > 31 )\n_assert_fail(\"res < LEN\", \"spim.c\", 0x4Bu, \"operation\");\ninstruction(a1, (__int64)s);\nreturn push(a1, \"$s0\");\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func6(__int64 a1, int a2)\n{\nchar s[8]; // [rsp+10h] [rbp-30h] BYREF\n__int64 v4; // [rsp+18h] [rbp-28h]\n__int64 v5; // [rsp+20h] [rbp-20h]\n__int64 v6; // [rsp+28h] [rbp-18h]\nint v7; // [rsp+3Ch] [rbp-4h]\n\n*(_QWORD *)s = 0LL;\nv4 = 0LL;\nv5 = 0LL;\nv6 = 0LL;\nif ( !func5(a2) )\n_assert_fail(\"operator(kind)\", \"spim.c\", 0x47u, \"operation\");\nfunc3(a1, \"$s1\");\nfunc3(a1, \"$s0\");\nv7 = snprintf(s, 0x20uLL, \"%s $s0, $s0, $s1\", (const char *)*(&mapping + a2));\nif ( v7 > 31 )\n_assert_fail(\"res < LEN\", \"spim.c\", 0x4Bu, \"operation\");\nfunc1(a1, (__int64)s);\nreturn func2(a1, \"$s0\");\n}",
"original_code": "static void operation(string_t *buffer, node_kind_t kind) {\n int res;\n char inst[32] = \"\";\n ((operator(kind)) ? (void) (0) : __assert_fail (\"operator(kind)\", \"spim.c\", 71, __extension__ __PRETTY_FUNCTION__));\n pop(buffer, \"$s1\");\n pop(buffer, \"$s0\");\n res = snprintf(inst, 32, \"%s $s0, $s0, $s1\", mapping[kind]);\n ((res < 32) ? (void) (0) : __assert_fail (\"res < LEN\", \"spim.c\", 75, __extension__ __PRETTY_FUNCTION__));\n instruction(buffer, inst);\n push(buffer, \"$s0\");\n}",
"canonical_original_code": "static void operation(struct vector_t *buffer, enum token_kind_t kind) {\n int res;\n char inst[32] = \"\";\n ((operator(kind)) ? (void) (0) : __assert_fail (\"operator(kind)\", \"spim.c\", 71, __extension__ __PRETTY_FUNCTION__));\n pop(buffer, \"$s1\");\n pop(buffer, \"$s0\");\n res = snprintf(inst, 32, \"%s $s0, $s0, $s1\", mapping[kind]);\n ((res < 32) ? (void) (0) : __assert_fail (\"res < LEN\", \"spim.c\", 75, __extension__ __PRETTY_FUNCTION__));\n instruction(buffer, inst);\n push(buffer, \"$s0\");\n}",
"variable_types": [
[
"buffer",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
],
[
"kind",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
[
"res",
"int"
],
[
"inst",
"char [32]"
]
],
"return_type": "void",
"user_defined_types": [
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "f7b99492a214f0da6624daedb9b70f0d315fc7e3a3ff93e9597416a33e7e595a"
},
{
"name": "prologue",
"canonical_name": "func7",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall prologue(__int64 a1)\n{\ninstruction(a1, (__int64)\".data\");\nlabel(a1, (__int64)\"newline\");\ninstruction(a1, (__int64)\".asciiz \\\"\\\\n\\\"\");\ninstruction(a1, (__int64)\".text\");\nreturn label(a1, (__int64)\"main\");\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(__int64 a1)\n{\nfunc1(a1, (__int64)\".data\");\nfunc0(a1, (__int64)\"newline\");\nfunc1(a1, (__int64)\".asciiz \\\"\\\\n\\\"\");\nfunc1(a1, (__int64)\".text\");\nreturn func0(a1, (__int64)\"main\");\n}",
"original_code": "static void prologue(string_t *buffer) {\n instruction(buffer, \".data\");\n label(buffer, \"newline\");\n instruction(buffer, \".asciiz \\\"\\\\n\\\"\");\n instruction(buffer, \".text\");\n label(buffer, \"main\");\n}",
"canonical_original_code": "static void prologue(struct vector_t *buffer) {\n instruction(buffer, \".data\");\n label(buffer, \"newline\");\n instruction(buffer, \".asciiz \\\"\\\\n\\\"\");\n instruction(buffer, \".text\");\n label(buffer, \"main\");\n}",
"variable_types": [
[
"buffer",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "f7b99492a214f0da6624daedb9b70f0d315fc7e3a3ff93e9597416a33e7e595a"
},
{
"name": "epilogue",
"canonical_name": "func8",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall epilogue(__int64 a1)\n{\nlabel(a1, (__int64)\"print\");\npop(a1, \"$a0\");\ninstruction(a1, (__int64)\"li $v0, 1\");\ninstruction(a1, (__int64)\"syscall\");\ninstruction(a1, (__int64)\"la $a0, newline\");\ninstruction(a1, (__int64)\"li $v0, 4\");\ninstruction(a1, (__int64)\"syscall\");\nlabel(a1, (__int64)\"exit\");\ninstruction(a1, (__int64)\"li $v0, 10\");\ninstruction(a1, (__int64)\"syscall\");\nreturn instruction(a1, (__int64)\".end\");\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func8(__int64 a1)\n{\nfunc0(a1, (__int64)\"print\");\nfunc3(a1, \"$a0\");\nfunc1(a1, (__int64)\"li $v0, 1\");\nfunc1(a1, (__int64)\"syscall\");\nfunc1(a1, (__int64)\"la $a0, newline\");\nfunc1(a1, (__int64)\"li $v0, 4\");\nfunc1(a1, (__int64)\"syscall\");\nfunc0(a1, (__int64)\"exit\");\nfunc1(a1, (__int64)\"li $v0, 10\");\nfunc1(a1, (__int64)\"syscall\");\nreturn func1(a1, (__int64)\".end\");\n}",
"original_code": "static void epilogue(string_t *buffer) {\n label(buffer, \"print\");\n pop(buffer, \"$a0\");\n instruction(buffer, \"li $v0, 1\");\n instruction(buffer, \"syscall\");\n instruction(buffer, \"la $a0, newline\");\n instruction(buffer, \"li $v0, 4\");\n instruction(buffer, \"syscall\");\n label(buffer, \"exit\");\n instruction(buffer, \"li $v0, 10\");\n instruction(buffer, \"syscall\");\n instruction(buffer, \".end\");\n}",
"canonical_original_code": "static void epilogue(struct vector_t *buffer) {\n label(buffer, \"print\");\n pop(buffer, \"$a0\");\n instruction(buffer, \"li $v0, 1\");\n instruction(buffer, \"syscall\");\n instruction(buffer, \"la $a0, newline\");\n instruction(buffer, \"li $v0, 4\");\n instruction(buffer, \"syscall\");\n label(buffer, \"exit\");\n instruction(buffer, \"li $v0, 10\");\n instruction(buffer, \"syscall\");\n instruction(buffer, \".end\");\n}",
"variable_types": [
[
"buffer",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }"
],
"binary_hash": "f7b99492a214f0da6624daedb9b70f0d315fc7e3a3ff93e9597416a33e7e595a"
},
{
"name": "recurse",
"canonical_name": "func9",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall recurse(__int64 a1, __int64 a2)\n{\nif ( *(_DWORD *)a1 == 6 )\nreturn load(a2, *(_DWORD *)(a1 + 4), \"$s0\");\nif ( !operator(*(_DWORD *)a1) )\n_assert_fail(\"0\", \"spim.c\", 0x71u, \"recurse\");\nrecurse(*(_QWORD *)(a1 + 8), a2);\nrecurse(*(_QWORD *)(a1 + 16), a2);\nreturn operation(a2, *(_DWORD *)a1);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func9(__int64 a1, __int64 a2)\n{\nif ( *(_DWORD *)a1 == 6 )\nreturn func4(a2, *(_DWORD *)(a1 + 4), \"$s0\");\nif ( !func5(*(_DWORD *)a1) )\n_assert_fail(\"0\", \"spim.c\", 0x71u, \"recurse\");\nfunc9(*(_QWORD *)(a1 + 8), a2);\nfunc9(*(_QWORD *)(a1 + 16), a2);\nreturn func6(a2, *(_DWORD *)a1);\n}",
"original_code": "static void recurse(const node_t *ast, string_t *buffer) {\n if (ast->kind == INTEGER) {\n load(buffer, ast->value, \"$s0\");\n }\n else if (operator(ast->kind)) {\n recurse(ast->left, buffer);\n recurse(ast->right, buffer);\n operation(buffer, ast->kind);\n }\n else {\n ((0) ? (void) (0) : __assert_fail (\"0\", \"spim.c\", 113, __extension__ __PRETTY_FUNCTION__));\n }\n}",
"canonical_original_code": "static void recurse(struct node *ast, struct vector_t *buffer) {\n if (ast->kind == INTEGER) {\n load(buffer, ast->value, \"$s0\");\n }\n else if (operator(ast->kind)) {\n recurse(ast->left, buffer);\n recurse(ast->right, buffer);\n operation(buffer, ast->kind);\n }\n else {\n ((0) ? (void) (0) : __assert_fail (\"0\", \"spim.c\", 113, __extension__ __PRETTY_FUNCTION__));\n }\n}",
"variable_types": [
[
"ast",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
],
[
"buffer",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { enum token_kind_t kind; int value; struct node *left; struct node *right; }",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
"binary_hash": "f7b99492a214f0da6624daedb9b70f0d315fc7e3a3ff93e9597416a33e7e595a"
},
{
"name": "generate",
"canonical_name": "func10",
"repo": "StephenNi/expression-compiler",
"decompiled_code": "__int64 __fastcall generate(__int64 a1, __int64 a2)\n{\nprologue(a2);\nrecurse(a1, a2);\nreturn epilogue(a2);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func10(__int64 a1, __int64 a2)\n{\nfunc7(a2);\nfunc9(a1, a2);\nreturn func8(a2);\n}",
"original_code": "void generate(const node_t *ast, string_t *buffer) {\n prologue(buffer);\n recurse(ast, buffer);\n epilogue(buffer);\n}",
"canonical_original_code": "void generate(struct node *ast, struct vector_t *buffer) {\n prologue(buffer);\n recurse(ast, buffer);\n epilogue(buffer);\n}",
"variable_types": [
[
"ast",
"struct node { enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 } kind; int value; struct node *left; struct node *right; } *"
],
[
"buffer",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { enum token_kind_t kind; int value; struct node *left; struct node *right; }",
"struct vector_t { unsigned long element; unsigned long length; unsigned long capacity; char *data; }",
"enum token_kind_t { _FIRST=-1, PLUS=0, MINUS=1, TIMES=2, SLASH=3, OPEN=4, CLOSE=5, INTEGER=6, _LAST=7 }"
],
"binary_hash": "f7b99492a214f0da6624daedb9b70f0d315fc7e3a3ff93e9597416a33e7e595a"
}
] |
3329cc89898831900a194b1d48f1fe6b64daa2d8a3685a4000249c797c220517 | Hugne/udp_mc | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"diep",
"->",
"main"
],
[
"recvloop",
"->",
"main"
],
[
"main",
"->",
"diep",
"recvloop"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_404010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"void *func3()\n{\nreturn &_bss_start;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"void *func5()\n{\nvoid *result; // rax\n\nif ( !completed_0 )\n{\nresult = func3();\ncompleted_0 = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"main",
"int __cdecl __noreturn main(int argc, const char **argv, const char **envp)\n{\nchar buf[16]; // [rsp+10h] [rbp-A0h] BYREF\nint v4; // [rsp+20h] [rbp-90h]\nint optval; // [rsp+2Ch] [rbp-84h] BYREF\nstruct sockaddr addr; // [rsp+30h] [rbp-80h] BYREF\nunsigned int v7; // [rsp+48h] [rbp-68h]\nchar s[36]; // [rsp+50h] [rbp-60h] BYREF\nint v9; // [rsp+74h] [rbp-3Ch]\nint fd; // [rsp+78h] [rbp-38h]\nint v11; // [rsp+7Ch] [rbp-34h]\nint v12; // [rsp+80h] [rbp-30h]\nint v13; // [rsp+84h] [rbp-2Ch]\nint v14; // [rsp+88h] [rbp-28h]\nint v15; // [rsp+8Ch] [rbp-24h]\nchar *nptr; // [rsp+90h] [rbp-20h]\nchar *ifname; // [rsp+98h] [rbp-18h]\nchar *cp; // [rsp+A0h] [rbp-10h]\nchar *v19; // [rsp+A8h] [rbp-8h]\n\nv14 = 28;\nv13 = 1;\nv12 = 0;\nv19 = 0LL;\ncp = 0LL;\nifname = 0LL;\nnptr = 0LL;\nwhile ( 1 )\n{\nv11 = getopt(argc, (char *const *)argv, \"m:s:e:p:\");\nif ( v11 == -1 )\nbreak;\nif ( v11 == 115 )\n{\ncp = (char *)optarg;\n}\nelse if ( v11 <= 115 )\n{\nif ( v11 == 112 )\n{\nnptr = (char *)optarg;\n}\nelse if ( v11 <= 112 )\n{\nif ( v11 == 101 )\n{\nifname = (char *)optarg;\n}\nelse if ( v11 == 109 )\n{\nv19 = (char *)optarg;\n}\n}\n}\n}\nif ( !cp )\nfunc7(\"server address reqd\\n\");\nprintf(\"Server bind address: %s\\n\", cp);\nprintf(\"Multicast group: %s\\n\", v19);\nfd = socket(10, 2, 17);\nif ( fd == -1 )\nfunc7(\"Socket\");\nmemset(s, 0, 0x1CuLL);\naddr.sa_family = 10;\nv15 = 9930;\nif ( nptr )\nv15 = atoi(nptr);\n*(_WORD *)addr.sa_data = htons(v15);\nif ( !inet_pton(10, cp, &addr.sa_data[6]) )\n{\nfwrite(\"inet_aton() failed\\n\", 1uLL, 0x13uLL, stderr);\nfunc7(\"aton\");\n}\nif ( ifname )\nv7 = if_nametoindex(ifname);\nelse\nputs(\"no etherdevice specified, scope will be 0\");\nif ( v19 )\n{\nif ( !inet_pton(10, v19, buf) )\nfunc7(\"aton/mcast\");\nv4 = 0;\nprintf(\"join mc group %s\\n\", v19);\nif ( setsockopt(fd, 41, 20, buf, 0x14u) )\nfunc7(\"IPV6_ADD_MEMBERSHIP\");\n}\noptval = 1;\nv9 = setsockopt(fd, 1, 2, &optval, 4u);\nif ( bind(fd, &addr, 0x1Cu) )\nfunc7(\"bind failed\");\nfunc8(fd);\n}"
],
[
"_libc_csu_init",
"void __fastcall func9(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func10(void)\n{\n;\n}"
]
] | [
{
"name": "diep",
"canonical_name": "func7",
"repo": "Hugne/udp_mc",
"decompiled_code": "void __fastcall __noreturn diep(const char *a1)\n{\nperror(a1);\nexit(1);\n}\n",
"canonical_decompiled_code": "void __fastcall __noreturn func7(const char *a1)\n{\nperror(a1);\nexit(1);\n}",
"original_code": "void diep(char *s)\n{\n perror(s);\n exit(1);\n}",
"canonical_original_code": "void diep(char *s)\n{\n perror(s);\n exit(1);\n}",
"variable_types": [
[
"s",
"char *"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "3329cc89898831900a194b1d48f1fe6b64daa2d8a3685a4000249c797c220517"
},
{
"name": "recvloop",
"canonical_name": "func8",
"repo": "Hugne/udp_mc",
"decompiled_code": "void __fastcall __noreturn recvloop(unsigned int a1)\n{\nsocklen_t addr_len; // [rsp+1Ch] [rbp-14C4h] BYREF\nchar s[4096]; // [rsp+20h] [rbp-14C0h] BYREF\nchar v3[1000]; // [rsp+1020h] [rbp-4C0h] BYREF\nchar *stringp; // [rsp+1408h] [rbp-D8h] BYREF\nstruct sockaddr addr; // [rsp+1410h] [rbp-D0h] BYREF\ndouble v6; // [rsp+1498h] [rbp-48h]\ndouble v7; // [rsp+14A0h] [rbp-40h]\nint v8; // [rsp+14ACh] [rbp-34h]\nvoid *buf; // [rsp+14B0h] [rbp-30h]\nchar *v10; // [rsp+14B8h] [rbp-28h]\nint v11; // [rsp+14C4h] [rbp-1Ch]\nchar *nptr; // [rsp+14C8h] [rbp-18h]\nchar *s2; // [rsp+14D0h] [rbp-10h]\nint i; // [rsp+14DCh] [rbp-4h]\n\nbuf = malloc(0x2710uLL);\nmemset(s, 0, sizeof(s));\nv11 = 0;\nv10 = 0LL;\nprintf(\"msg pointer is 0x%p\\n\", stringp);\nwhile ( 1 )\n{\nmemset(&addr, 0, 0x80uLL);\naddr_len = 128;\nprintf(\"param recvfrom (%d, %p, %d, %d, %p, %p)\\n\", a1, stringp, 10000LL, 0LL, &addr, &addr_len);\nv8 = recvfrom(a1, buf, 0x2710uLL, 0, &addr, &addr_len);\nif ( v8 <= 0 )\n{\nperror(\"recvfrom\\n\");\n_exit(-1);\n}\ninet_ntop(10, &addr, v3, 0x3E8u);\nstringp = (char *)buf;\nprintf(\"From: %s msg: %.*s\\n\", v3, 16, (const char *)buf);\nfor ( i = 0; i <= 1; ++i )\n{\nif ( i )\n{\nif ( i == 1 )\nnptr = strsep(&stringp, \":\");\n}\nelse\n{\ns2 = strsep(&stringp, \":\");\n}\n}\nv10 = 0LL;\nfor ( i = 0; ; ++i )\n{\nif ( i >= v11 )\ngoto LABEL_16;\nif ( !strcmp(&s[128 * (__int64)i], s2) )\nbreak;\n}\nv10 = &s[128 * (__int64)i];\nLABEL_16:\nif ( v10 )\n{\nprintf(\"Key: %s Value %s\\n\", v10, v10 + 64);\nv7 = strtod(nptr, 0LL);\nv6 = strtod(v10 + 64, 0LL);\nif ( v7 - v6 > 1.0 )\n{\nprintf(\"ERROR - missed packet from: %s - current %f previous %f \\n\", v10, v7, v6);\nexit(1);\n}\nprintf(\" Update Key:%s old Value=%s, new Value=%s\\n\", v10, v10 + 64, nptr);\nstrcpy(v10 + 64, nptr);\n}\nelse\n{\nprintf(\"add new entry with key %s to list\\n\", s2);\nstrncpy(&s[128 * (__int64)v11++], s2, 0x3FuLL);\n}\n}\n}\n",
"canonical_decompiled_code": "void __fastcall __noreturn func8(unsigned int a1)\n{\nsocklen_t addr_len; // [rsp+1Ch] [rbp-14C4h] BYREF\nchar s[4096]; // [rsp+20h] [rbp-14C0h] BYREF\nchar v3[1000]; // [rsp+1020h] [rbp-4C0h] BYREF\nchar *stringp; // [rsp+1408h] [rbp-D8h] BYREF\nstruct sockaddr addr; // [rsp+1410h] [rbp-D0h] BYREF\ndouble v6; // [rsp+1498h] [rbp-48h]\ndouble v7; // [rsp+14A0h] [rbp-40h]\nint v8; // [rsp+14ACh] [rbp-34h]\nvoid *buf; // [rsp+14B0h] [rbp-30h]\nchar *v10; // [rsp+14B8h] [rbp-28h]\nint v11; // [rsp+14C4h] [rbp-1Ch]\nchar *nptr; // [rsp+14C8h] [rbp-18h]\nchar *s2; // [rsp+14D0h] [rbp-10h]\nint i; // [rsp+14DCh] [rbp-4h]\n\nbuf = malloc(0x2710uLL);\nmemset(s, 0, sizeof(s));\nv11 = 0;\nv10 = 0LL;\nprintf(\"msg pointer is 0x%p\\n\", stringp);\nwhile ( 1 )\n{\nmemset(&addr, 0, 0x80uLL);\naddr_len = 128;\nprintf(\"param recvfrom (%d, %p, %d, %d, %p, %p)\\n\", a1, stringp, 10000LL, 0LL, &addr, &addr_len);\nv8 = recvfrom(a1, buf, 0x2710uLL, 0, &addr, &addr_len);\nif ( v8 <= 0 )\n{\nperror(\"recvfrom\\n\");\n_exit(-1);\n}\ninet_ntop(10, &addr, v3, 0x3E8u);\nstringp = (char *)buf;\nprintf(\"From: %s msg: %.*s\\n\", v3, 16, (const char *)buf);\nfor ( i = 0; i <= 1; ++i )\n{\nif ( i )\n{\nif ( i == 1 )\nnptr = strsep(&stringp, \":\");\n}\nelse\n{\ns2 = strsep(&stringp, \":\");\n}\n}\nv10 = 0LL;\nfor ( i = 0; ; ++i )\n{\nif ( i >= v11 )\ngoto LABEL_16;\nif ( !strcmp(&s[128 * (__int64)i], s2) )\nbreak;\n}\nv10 = &s[128 * (__int64)i];\nLABEL_16:\nif ( v10 )\n{\nprintf(\"Key: %s Value %s\\n\", v10, v10 + 64);\nv7 = strtod(nptr, 0LL);\nv6 = strtod(v10 + 64, 0LL);\nif ( v7 - v6 > 1.0 )\n{\nprintf(\"ERROR - missed packet from: %s - current %f previous %f \\n\", v10, v7, v6);\nexit(1);\n}\nprintf(\" Update Key:%s old Value=%s, new Value=%s\\n\", v10, v10 + 64, nptr);\nstrcpy(v10 + 64, nptr);\n}\nelse\n{\nprintf(\"add new entry with key %s to list\\n\", s2);\nstrncpy(&s[128 * (__int64)v11++], s2, 0x3FuLL);\n}\n}\n}",
"original_code": "void recvloop(uint32_t s)\n{\n int i;\n struct sockaddr_storage sender;\n char *buf = (char *)malloc(10000);\n char *message;\n char name[1000];\n char *key;\n char *viewId;\n struct entry {\n char key[64];\n char value[64];\n };\n struct entry dumblist[32];\n memset(dumblist,0,sizeof(struct entry)*32);\n int nextfree = 0;\n struct entry *e = ((void *)0);\n printf (\"msg pointer is 0x%p\\n\",message);\n while(1) {\n memset(&sender,0,sizeof(struct sockaddr_storage));\n socklen_t sendsize = sizeof(sender);\n printf(\"param recvfrom (%d, %p, %d, %d, %p, %p)\\n\",\n s, message, 10000, 0, &sender, &sendsize);\n int recvSize = recvfrom(s, buf, 10000, 0, (struct sockaddr *)&sender, &sendsize);\n if (recvSize <= 0){\n perror(\"recvfrom\\n\");\n _exit(-1);\n }\n inet_ntop(10, &sender, name, 1000);\n message = buf;\n printf(\"From: %s msg: %.*s\\n\", name,16, message);\n for (i=0; i < 2; i++) {\n if (i == 0) {\n key = strsep(&message, \":\");\n } else if (i == 1) {\n viewId = strsep(&message, \":\");\n }\n }\n e = ((void *)0);\n for(i=0;i<nextfree;i++){\n if(strcmp(dumblist[i].key, key) == 0){\n e = &dumblist[i];\n break;\n }\n }\n if (e != ((void *)0)) {\n printf(\"Key: %s Value %s\\n\", e->key, e->value);\n double current_val = strtod(viewId, ((void *)0));\n double previous_val = strtod(e->value, ((void *)0));\n if ((current_val - previous_val) > 1 ) {\n printf(\"ERROR - missed packet from: %s - current %f previous %f \\n\",\n e->key, current_val, previous_val);\n exit(1);\n } else {\n printf(\" Update Key:%s old Value=%s, new Value=%s\\n\",e->key, e->value, viewId);\n strcpy(e->value, viewId);\n continue;\n }\n }else {\n printf(\"add new entry with key %s to list\\n\", key);\n strncpy(dumblist[nextfree].key,key,63);\n nextfree++;\n }\n }\n}",
"canonical_original_code": "void recvloop(unsigned int s)\n{\n int i;\n struct sockaddr_storage sender;\n char *buf = (char *)malloc(10000);\n char *message;\n char name[1000];\n char *key;\n char *viewId;\n struct entry {\n char key[64];\n char value[64];\n };\n struct entry dumblist[32];\n memset(dumblist,0,sizeof(struct entry)*32);\n int nextfree = 0;\n struct entry *e = ((void *)0);\n printf (\"msg pointer is 0x%p\\n\",message);\n while(1) {\n memset(&sender,0,sizeof(struct sockaddr_storage));\n unsigned int sendsize = sizeof(sender);\n printf(\"param recvfrom (%d, %p, %d, %d, %p, %p)\\n\",\n s, message, 10000, 0, &sender, &sendsize);\n int recvSize = recvfrom(s, buf, 10000, 0, (struct sockaddr *)&sender, &sendsize);\n if (recvSize <= 0){\n perror(\"recvfrom\\n\");\n _exit(-1);\n }\n inet_ntop(10, &sender, name, 1000);\n message = buf;\n printf(\"From: %s msg: %.*s\\n\", name,16, message);\n for (i=0; i < 2; i++) {\n if (i == 0) {\n key = strsep(&message, \":\");\n } else if (i == 1) {\n viewId = strsep(&message, \":\");\n }\n }\n e = ((void *)0);\n for(i=0;i<nextfree;i++){\n if(strcmp(dumblist[i].key, key) == 0){\n e = &dumblist[i];\n break;\n }\n }\n if (e != ((void *)0)) {\n printf(\"Key: %s Value %s\\n\", e->key, e->value);\n double current_val = strtod(viewId, ((void *)0));\n double previous_val = strtod(e->value, ((void *)0));\n if ((current_val - previous_val) > 1 ) {\n printf(\"ERROR - missed packet from: %s - current %f previous %f \\n\",\n e->key, current_val, previous_val);\n exit(1);\n } else {\n printf(\" Update Key:%s old Value=%s, new Value=%s\\n\",e->key, e->value, viewId);\n strcpy(e->value, viewId);\n continue;\n }\n }else {\n printf(\"add new entry with key %s to list\\n\", key);\n strncpy(dumblist[nextfree].key,key,63);\n nextfree++;\n }\n }\n}",
"variable_types": [
[
"s",
"unsigned int"
],
[
"i",
"int"
],
[
"sender",
"struct sockaddr_storage { unsigned short ss_family; char __ss_padding[-1]; unsigned long __ss_align; }"
],
[
"buf",
"char *"
],
[
"message",
"char *"
],
[
"name",
"char [1000]"
],
[
"key",
"char *"
],
[
"viewId",
"char *"
],
[
"dumblist",
"struct entry { char *key; void *data; } [32]"
],
[
"nextfree",
"int"
],
[
"e",
"struct entry { char *key; void *data; } *"
],
[
"sendsize",
"unsigned int"
],
[
"recvSize",
"int"
],
[
"current_val",
"double"
],
[
"previous_val",
"double"
]
],
"return_type": "void",
"user_defined_types": [
"struct sockaddr_storage { unsigned short ss_family; char __ss_padding[-1]; unsigned long __ss_align; }",
"struct entry { char *key; void *data; }"
],
"binary_hash": "3329cc89898831900a194b1d48f1fe6b64daa2d8a3685a4000249c797c220517"
}
] |
9e60e3e2bfc857fa27b675532dd686f6478b73a13cd9d0ce560db541c01743bb | donapieppo/libnss-ato | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"main",
"->"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_404010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"char *func3()\n{\nreturn &_bss_start;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"char *func5()\n{\nchar *result; // rax\n\nif ( !_bss_start )\n{\nresult = func3();\n_bss_start = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"_libc_csu_init",
"void __fastcall func7(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func8(void)\n{\n;\n}"
]
] | [
{
"name": "main",
"canonical_name": "main",
"repo": "donapieppo/libnss-ato",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nstruct spwd *v4; // [rsp+18h] [rbp-18h]\nstruct passwd *v5; // [rsp+20h] [rbp-10h]\nchar *name; // [rsp+28h] [rbp-8h]\n\nname = \"pippo.pluto\";\nif ( argc == 2 )\nname = (char *)argv[1];\nv5 = getpwnam(name);\nif ( !v5 )\nreturn -1;\nputs(\"FROM PASSWORD:\");\nprintf(\"\\tname: %s\\n\", v5->pw_name);\nprintf(\"\\tdir: %s\\n\", v5->pw_dir);\nprintf(\"\\tgecos: %s\\n\", v5->pw_gecos);\nputs(\"FROM SHADOW:\");\nv4 = getspnam(name);\nif ( !v4 )\nreturn -1;\nprintf(\"\\tname: %s\\n\", v4->sp_namp);\nprintf(\"\\tpass: %s\\n\", v4->sp_pwdp);\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nstruct spwd *v4; // [rsp+18h] [rbp-18h]\nstruct passwd *v5; // [rsp+20h] [rbp-10h]\nchar *name; // [rsp+28h] [rbp-8h]\n\nname = \"pippo.pluto\";\nif ( argc == 2 )\nname = (char *)argv[1];\nv5 = getpwnam(name);\nif ( !v5 )\nreturn -1;\nputs(\"FROM PASSWORD:\");\nprintf(\"\\tname: %s\\n\", v5->pw_name);\nprintf(\"\\tdir: %s\\n\", v5->pw_dir);\nprintf(\"\\tgecos: %s\\n\", v5->pw_gecos);\nputs(\"FROM SHADOW:\");\nv4 = getspnam(name);\nif ( !v4 )\nreturn -1;\nprintf(\"\\tname: %s\\n\", v4->sp_namp);\nprintf(\"\\tpass: %s\\n\", v4->sp_pwdp);\nreturn 0;\n}",
"original_code": "int main (int argc, char *argv[]){\n struct passwd *p;\n struct spwd *s;\n char *usern=\"pippo.pluto\";\n if(argc ==2)\n {\n usern=argv[1];\n }\n if (!(p=getpwnam(usern))) {\n return -1;\n }\n printf(\"FROM PASSWORD:\\n\");\n printf(\"\\tname: %s\\n\", p->pw_name);\n printf(\"\\tdir: %s\\n\", p->pw_dir);\n printf(\"\\tgecos: %s\\n\", p->pw_gecos);\n printf(\"FROM SHADOW:\\n\");\n if (!(s = getspnam(usern))) {\n return -1;\n }\n printf (\"\\tname: %s\\n\", s->sp_namp);\n printf (\"\\tpass: %s\\n\", s->sp_pwdp);\n return 0;\n}",
"canonical_original_code": "int main(int argc, char *argv[]){\n struct passwd *p;\n struct spwd *s;\n char *usern = \"pippo.pluto\";\n if(argc ==2)\n {\n usern=argv[1];\n }\n if (!(p=getpwnam(usern))) {\n return -1;\n }\n printf(\"FROM PASSWORD:\\n\");\n printf(\"\\tname: %s\\n\", p->pw_name);\n printf(\"\\tdir: %s\\n\", p->pw_dir);\n printf(\"\\tgecos: %s\\n\", p->pw_gecos);\n printf(\"FROM SHADOW:\\n\");\n if (!(s = getspnam(usern))) {\n return -1;\n }\n printf (\"\\tname: %s\\n\", s->sp_namp);\n printf (\"\\tpass: %s\\n\", s->sp_pwdp);\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char *[]"
],
[
"p",
"struct passwd { char *pw_name; char *pw_passwd; unsigned int pw_uid; unsigned int pw_gid; char *pw_gecos; char *pw_dir; char *pw_shell; } *"
],
[
"s",
"struct spwd { char *sp_namp; char *sp_pwdp; long sp_lstchg; long sp_min; long sp_max; long sp_warn; long sp_inact; long sp_expire; unsigned long sp_flag; } *"
],
[
"usern",
"char *"
]
],
"return_type": "int",
"user_defined_types": [
"struct passwd { char *pw_name; char *pw_passwd; unsigned int pw_uid; unsigned int pw_gid; char *pw_gecos; char *pw_dir; char *pw_shell; }",
"struct spwd { char *sp_namp; char *sp_pwdp; long sp_lstchg; long sp_min; long sp_max; long sp_warn; long sp_inact; long sp_expire; unsigned long sp_flag; }"
],
"binary_hash": "9e60e3e2bfc857fa27b675532dd686f6478b73a13cd9d0ce560db541c01743bb"
}
] |
9f74e91a6f81d6a53597b0b2fd8f0d7c7e96ba24c0891795fd95a40f74174321 | donapieppo/libnss-ato | [
[
"sub_1020",
"->"
],
[
"_cxa_finalize",
"->",
"_do_global_dtors_aux"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"_cxa_finalize",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"read_conf",
"->",
"nss_ato_getpwnam_r"
],
[
"get_static",
"->",
"nss_ato_getpwnam_r",
"nss_ato_getspnam_r"
],
[
"nss_ato_getpwnam_r",
"->",
"read_conf",
"get_static"
],
[
"nss_ato_getspnam_r",
"->",
"get_static"
]
] | [
[
"sub_1020",
"void func0()\n{\nJUMPOUT(0LL);\n}"
],
[
"_cxa_finalize",
"int __fastcall func1(void *a1)\n{\nreturn __cxa_finalize(a1);\n}"
],
[
"deregister_tm_clones",
"char *func2()\n{\nreturn &completed_0;\n}"
],
[
"register_tm_clones",
"__int64 func3()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"char *func4()\n{\nchar *result; // rax\n\nif ( !completed_0 )\n{\nif ( &__cxa_finalize )\nfunc1(_dso_handle);\nresult = func2();\ncompleted_0 = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func5()\n{\nreturn func3();\n}"
],
[
"read_conf",
"struct passwd *func6()\n{\nstruct passwd *v1; // [rsp+0h] [rbp-10h]\nFILE *stream; // [rsp+8h] [rbp-8h]\n\nstream = fopen(\"/etc/libnss-ato.conf\", \"r\");\nif ( !stream )\nreturn 0LL;\nv1 = fgetpwent(stream);\nif ( v1->pw_uid <= 0x1F3 )\nv1->pw_uid = 500;\nif ( v1->pw_gid <= 0x1F3 )\nv1->pw_gid = 500;\nfclose(stream);\nreturn v1;\n}"
],
[
"nss_ato_getpwnam_r",
"__int64 __fastcall func8(char *a1, __int64 a2, __int64 a3, __int64 a4)\n{\n_QWORD *v5; // rax\n_QWORD *v6; // rdx\n__int64 v7; // rbx\n__int64 v8; // rbx\n__int64 v9; // rbx\nint v10; // eax\n__int64 v11; // rax\n__int64 v12; // rax\n__int64 v13; // [rsp+10h] [rbp-50h] BYREF\n__int64 v14; // [rsp+18h] [rbp-48h] BYREF\n_QWORD *v15; // [rsp+20h] [rbp-40h]\nchar *s; // [rsp+28h] [rbp-38h]\nint v17; // [rsp+3Ch] [rbp-24h]\n_QWORD *v18; // [rsp+40h] [rbp-20h]\nint i; // [rsp+4Ch] [rbp-14h]\n\ns = a1;\nv15 = (_QWORD *)a2;\nv14 = a3;\nv13 = a4;\nv18 = (_QWORD *)func6();\nif ( !v18 )\nreturn 0LL;\nv17 = 1;\nfor ( i = 0; i < v17; ++i )\n{\nif ( strchr(s, asc_2017[i]) )\nreturn 0LL;\n}\nv5 = v15;\nv6 = v18;\nv7 = v18[1];\n*v15 = *v18;\nv5[1] = v7;\nv8 = v6[3];\nv5[2] = v6[2];\nv5[3] = v8;\nv9 = v6[5];\nv5[4] = v6[4];\nv5[5] = v9;\nv10 = strlen(s);\nv11 = func7(&v14, &v13, v10 + 1);\n*v15 = v11;\nif ( !*v15 )\nreturn 4294967294LL;\nstrcpy((char *)*v15, s);\nv12 = func7(&v14, &v13, 2);\nv15[1] = v12;\nif ( !v15[1] )\nreturn 4294967294LL;\n*(_WORD *)v15[1] = 120;\nreturn 1LL;\n}"
],
[
"nss_ato_getspnam_r",
"__int64 __fastcall func9(char *a1, __int64 a2, __int64 a3, __int64 a4)\n{\nint v4; // eax\n__int64 v5; // rax\n__int64 v7; // rax\n__int64 v8; // [rsp+10h] [rbp-20h] BYREF\n__int64 v9; // [rsp+18h] [rbp-18h] BYREF\n__int64 v10; // [rsp+20h] [rbp-10h]\nchar *s; // [rsp+28h] [rbp-8h]\n\ns = a1;\nv10 = a2;\nv9 = a3;\nv8 = a4;\nv4 = strlen(a1);\nv5 = func7(&v9, &v8, v4 + 1);\n*(_QWORD *)v10 = v5;\nif ( !*(_QWORD *)v10 )\nreturn 4294967294LL;\nstrcpy(*(char **)v10, s);\nv7 = func7(&v9, &v8, 2);\n*(_QWORD *)(v10 + 8) = v7;\nif ( !*(_QWORD *)(v10 + 8) )\nreturn 4294967294LL;\n**(_WORD **)(v10 + 8) = 42;\n*(_QWORD *)(v10 + 16) = 13571LL;\n*(_QWORD *)(v10 + 24) = 0LL;\n*(_QWORD *)(v10 + 32) = 99999LL;\n*(_QWORD *)(v10 + 40) = 7LL;\nreturn 1LL;\n}"
]
] | [
{
"name": "get_static",
"canonical_name": "func7",
"repo": "donapieppo/libnss-ato",
"decompiled_code": "__int64 __fastcall get_static(__int64 *a1, _QWORD *a2, int a3)\n{\n__int64 v4; // [rsp+1Ch] [rbp-8h]\n\nif ( !a1 || !a2 || *a2 < (unsigned __int64)a3 )\nreturn 0LL;\nv4 = *a1;\n*a1 += a3;\n*a2 -= a3;\nreturn v4;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(__int64 *a1, _QWORD *a2, int a3)\n{\n__int64 v4; // [rsp+1Ch] [rbp-8h]\n\nif ( !a1 || !a2 || *a2 < (unsigned __int64)a3 )\nreturn 0LL;\nv4 = *a1;\n*a1 += a3;\n*a2 -= a3;\nreturn v4;\n}",
"original_code": "static char *\nget_static(char **buffer, size_t *buflen, int len)\n{\n char *result;\n if ((buffer == ((void *)0)) || (buflen == ((void *)0)) || (*buflen < len)) {\n return ((void *)0);\n }\n result = *buffer;\n *buffer += len;\n *buflen -= len;\n return result;\n}",
"canonical_original_code": "static char *get_static(char **buffer, unsigned long *buflen, int len)\n{\n char *result;\n if ((buffer == ((void *)0)) || (buflen == ((void *)0)) || (*buflen < len)) {\n return ((void *)0);\n }\n result = *buffer;\n *buffer += len;\n *buflen -= len;\n return result;\n}",
"variable_types": [
[
"buffer",
"char **"
],
[
"buflen",
"unsigned long *"
],
[
"len",
"int"
],
[
"result",
"char *"
]
],
"return_type": "char *",
"user_defined_types": [],
"binary_hash": "9f74e91a6f81d6a53597b0b2fd8f0d7c7e96ba24c0891795fd95a40f74174321"
}
] |
9789bbc8966673ca39d966b99c014268d7317ea518d4ee890754fd7c29f6ba56 | gryftir/recursivereverse | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"main",
"->",
"printList",
"recursiveReverse",
"tailrecursereverse",
"interativetail",
"freeMem"
],
[
"freeMem",
"->",
"main"
],
[
"tailrecursereverse",
"->",
"main"
],
[
"interativetail",
"->",
"main"
],
[
"printList",
"->",
"main"
],
[
"recursiveReverse",
"->",
"main"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_404010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"char *func3()\n{\nreturn &_bss_start;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"char *func5()\n{\nchar *result; // rax\n\nif ( !_bss_start )\n{\nresult = func3();\n_bss_start = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"_libc_csu_init",
"void __fastcall func12(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func13(void)\n{\n;\n}"
]
] | [
{
"name": "main",
"canonical_name": "main",
"repo": "gryftir/recursivereverse",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\n__int64 v4; // [rsp+10h] [rbp-10h] BYREF\nunsigned int i; // [rsp+1Ch] [rbp-4h]\n\nv4 = makenode(0LL, argv, envp);\nfor ( i = 1; (int)i <= 10; ++i )\nv4 = pushNode(v4, i);\nputs(\"before reverse\");\nprintList(v4);\nv4 = recursiveReverse(v4);\nputs(\"after recursive reverse\");\nprintList(v4);\nputs(\"now we use the tailrecursereverse\");\nv4 = tailrecursereverse(v4, 0LL);\nprintList(v4);\nputs(\"now interative reversal based on tail reversal\");\nv4 = interativetail(v4);\nprintList(v4);\nfreeMem(&v4);\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\n__int64 v4; // [rsp+10h] [rbp-10h] BYREF\nunsigned int i; // [rsp+1Ch] [rbp-4h]\n\nv4 = makenode(0LL, argv, envp);\nfor ( i = 1; (int)i <= 10; ++i )\nv4 = pushNode(v4, i);\nputs(\"before reverse\");\nfunc10(v4);\nv4 = func11(v4);\nputs(\"after recursive reverse\");\nfunc10(v4);\nputs(\"now we use the tailrecursereverse\");\nv4 = func8(v4, 0LL);\nfunc10(v4);\nputs(\"now interative reversal based on tail reversal\");\nv4 = func9(v4);\nfunc10(v4);\nfunc7(&v4);\nreturn 0;\n}",
"original_code": "int main (int argc, char * argv[]){\nint count;\nNODE * list = makenode(0);\nfor (count = 1; count <= 10; count++)\n list = pushNode(list,count);\nprintf(\"before reverse\\n\");\nprintList(list);\nlist = recursiveReverse(list);\nprintf (\"after recursive reverse\\n\");\nprintList(list);\nprintf(\"now we use the tailrecursereverse\\n\");\nlist = tailrecursereverse(list, ((void *)0));\nprintList(list);\nprintf(\"now interative reversal based on tail reversal\\n\");\nlist = interativetail(list);\nprintList(list);\nfreeMem(&list);\n return 0;\n}",
"canonical_original_code": "int main(int argc, char *argv[]){\nint count;\nstruct NODE *list = makenode(0);\nfor (count = 1; count <= 10; count++)\n list = pushNode(list,count);\nprintf(\"before reverse\\n\");\nprintList(list);\nlist = recursiveReverse(list);\nprintf (\"after recursive reverse\\n\");\nprintList(list);\nprintf(\"now we use the tailrecursereverse\\n\");\nlist = tailrecursereverse(list, ((void *)0));\nprintList(list);\nprintf(\"now interative reversal based on tail reversal\\n\");\nlist = interativetail(list);\nprintList(list);\nfreeMem(&list);\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char *[]"
],
[
"count",
"int"
],
[
"list",
"struct NODE { int num; struct NODE *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct NODE { int num; struct NODE *next; }"
],
"binary_hash": "9789bbc8966673ca39d966b99c014268d7317ea518d4ee890754fd7c29f6ba56"
},
{
"name": "freeMem",
"canonical_name": "func7",
"repo": "gryftir/recursivereverse",
"decompiled_code": "__int64 __fastcall freeMem(_QWORD *a1)\n{\n__int64 result; // rax\nvoid *ptr; // [rsp+10h] [rbp-10h]\n_QWORD *v3; // [rsp+18h] [rbp-8h]\n\nv3 = (_QWORD *)*a1;\nwhile ( a1 )\n{\nptr = v3;\nv3 = (_QWORD *)v3[1];\nfree(ptr);\n}\nresult = 0LL;\nMEMORY[0] = 0LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(_QWORD *a1)\n{\n__int64 result; // rax\nvoid *ptr; // [rsp+10h] [rbp-10h]\n_QWORD *v3; // [rsp+18h] [rbp-8h]\n\nv3 = (_QWORD *)*a1;\nwhile ( a1 )\n{\nptr = v3;\nv3 = (_QWORD *)v3[1];\nfree(ptr);\n}\nresult = 0LL;\nMEMORY[0] = 0LL;\nreturn result;\n}",
"original_code": "void freeMem (NODE ** current) {\nNODE * walker, * front = *current;\nwhile (current) {\n walker = front;\n front = front->next;\n free (walker);\n}\n*current = ((void *)0);\n return;\n}",
"canonical_original_code": "void freeMem(struct NODE **current) {\nstruct NODE *walker; struct NODE *front = *current;\nwhile (current) {\n walker = front;\n front = front->next;\n free (walker);\n}\n*current = ((void *)0);\n return;\n}",
"variable_types": [
[
"current",
"struct NODE { int num; struct NODE *next; } **"
],
[
"walker",
"struct NODE { int num; struct NODE *next; } *"
],
[
"front",
"struct NODE { int num; struct NODE *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct NODE { int num; struct NODE *next; }"
],
"binary_hash": "9789bbc8966673ca39d966b99c014268d7317ea518d4ee890754fd7c29f6ba56"
},
{
"name": "tailrecursereverse",
"canonical_name": "func8",
"repo": "gryftir/recursivereverse",
"decompiled_code": "__int64 __fastcall tailrecursereverse(__int64 a1, __int64 a2)\n{\n__int64 result; // rax\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nif ( a1 == a2 )\nreturn a1;\nif ( *(_QWORD *)(a1 + 8) )\n{\nv3 = *(_QWORD *)(a1 + 8);\n*(_QWORD *)(a1 + 8) = a2;\nresult = tailrecursereverse(v3, a1);\n}\nelse\n{\n*(_QWORD *)(a1 + 8) = a2;\nresult = a1;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func8(__int64 a1, __int64 a2)\n{\n__int64 result; // rax\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nif ( a1 == a2 )\nreturn a1;\nif ( *(_QWORD *)(a1 + 8) )\n{\nv3 = *(_QWORD *)(a1 + 8);\n*(_QWORD *)(a1 + 8) = a2;\nresult = func8(v3, a1);\n}\nelse\n{\n*(_QWORD *)(a1 + 8) = a2;\nresult = a1;\n}\nreturn result;\n}",
"original_code": "NODE * tailrecursereverse(NODE * current, NODE * append){\n NODE * next;\n if (current == append)\n return current;\n if (current->next == ((void *)0)) {\n current->next = append;\n return current;\n }\n next = current->next;\n current->next = append;\n return tailrecursereverse(next, current);\n}",
"canonical_original_code": "struct NODE *tailrecursereverse(struct NODE *current, struct NODE *append){\n struct NODE *next;\n if (current == append)\n return current;\n if (current->next == ((void *)0)) {\n current->next = append;\n return current;\n }\n next = current->next;\n current->next = append;\n return tailrecursereverse(next, current);\n}",
"variable_types": [
[
"current",
"struct NODE *"
],
[
"append",
"struct NODE *"
],
[
"next",
"struct NODE { int num; struct NODE *next; } *"
]
],
"return_type": "struct NODE { int num; struct NODE *next; } *",
"user_defined_types": [
"struct NODE { int num; struct NODE *next; }"
],
"binary_hash": "9789bbc8966673ca39d966b99c014268d7317ea518d4ee890754fd7c29f6ba56"
},
{
"name": "interativetail",
"canonical_name": "func9",
"repo": "gryftir/recursivereverse",
"decompiled_code": "__int64 __fastcall interativetail(__int64 a1)\n{\n__int64 v2; // [rsp+0h] [rbp-18h]\n__int64 v3; // [rsp+8h] [rbp-10h]\n__int64 v4; // [rsp+10h] [rbp-8h]\n\nv2 = a1;\nv4 = 0LL;\nif ( !a1 )\nreturn 0LL;\nwhile ( *(_QWORD *)(v2 + 8) )\n{\nv3 = *(_QWORD *)(v2 + 8);\n*(_QWORD *)(v2 + 8) = v4;\nv4 = v2;\nv2 = v3;\n}\n*(_QWORD *)(v2 + 8) = v4;\nreturn v2;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func9(__int64 a1)\n{\n__int64 v2; // [rsp+0h] [rbp-18h]\n__int64 v3; // [rsp+8h] [rbp-10h]\n__int64 v4; // [rsp+10h] [rbp-8h]\n\nv2 = a1;\nv4 = 0LL;\nif ( !a1 )\nreturn 0LL;\nwhile ( *(_QWORD *)(v2 + 8) )\n{\nv3 = *(_QWORD *)(v2 + 8);\n*(_QWORD *)(v2 + 8) = v4;\nv4 = v2;\nv2 = v3;\n}\n*(_QWORD *)(v2 + 8) = v4;\nreturn v2;\n}",
"original_code": "NODE * interativetail(NODE * current){\n NODE * next;\n NODE * append = ((void *)0);\n if (current == append)\n return current;\n while (current->next != ((void *)0)) {\n next = current->next;\n current->next = append;\n append = current;\n current = next;\n }\n current->next = append;\n return current;\n}",
"canonical_original_code": "struct NODE *interativetail(struct NODE *current){\n struct NODE *next;\n struct NODE *append = ((void *)0);\n if (current == append)\n return current;\n while (current->next != ((void *)0)) {\n next = current->next;\n current->next = append;\n append = current;\n current = next;\n }\n current->next = append;\n return current;\n}",
"variable_types": [
[
"current",
"struct NODE *"
],
[
"next",
"struct NODE { int num; struct NODE *next; } *"
],
[
"append",
"struct NODE { int num; struct NODE *next; } *"
]
],
"return_type": "struct NODE { int num; struct NODE *next; } *",
"user_defined_types": [
"struct NODE { int num; struct NODE *next; }"
],
"binary_hash": "9789bbc8966673ca39d966b99c014268d7317ea518d4ee890754fd7c29f6ba56"
},
{
"name": "printList",
"canonical_name": "func10",
"repo": "gryftir/recursivereverse",
"decompiled_code": "unsigned int *__fastcall printList(unsigned int *a1)\n{\nunsigned int *result; // rax\n\nwhile ( a1 )\n{\nprintf(\"%d\\n\", *a1);\nresult = (unsigned int *)*((_QWORD *)a1 + 1);\na1 = result;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "unsigned int *__fastcall func10(unsigned int *a1)\n{\nunsigned int *result; // rax\n\nwhile ( a1 )\n{\nprintf(\"%d\\n\", *a1);\nresult = (unsigned int *)*((_QWORD *)a1 + 1);\na1 = result;\n}\nreturn result;\n}",
"original_code": "void printList (NODE * first){\n while (first)\n {\n printf (\"%d\\n\", first->num);\n first = first->next;\n }\n return;\n}",
"canonical_original_code": "void printList(struct NODE *first){\n while (first)\n {\n printf (\"%d\\n\", first->num);\n first = first->next;\n }\n return;\n}",
"variable_types": [
[
"first",
"struct NODE { int num; struct NODE *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct NODE { int num; struct NODE *next; }"
],
"binary_hash": "9789bbc8966673ca39d966b99c014268d7317ea518d4ee890754fd7c29f6ba56"
},
{
"name": "recursiveReverse",
"canonical_name": "func11",
"repo": "gryftir/recursivereverse",
"decompiled_code": "__int64 __fastcall recursiveReverse(__int64 a1)\n{\n__int64 result; // rax\n\nif ( !a1 )\nreturn 0LL;\nif ( !*(_QWORD *)(a1 + 8) )\nreturn a1;\nresult = recursiveReverse(*(_QWORD *)(a1 + 8));\n*(_QWORD *)(*(_QWORD *)(a1 + 8) + 8LL) = a1;\n*(_QWORD *)(a1 + 8) = 0LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func11(__int64 a1)\n{\n__int64 result; // rax\n\nif ( !a1 )\nreturn 0LL;\nif ( !*(_QWORD *)(a1 + 8) )\nreturn a1;\nresult = func11(*(_QWORD *)(a1 + 8));\n*(_QWORD *)(*(_QWORD *)(a1 + 8) + 8LL) = a1;\n*(_QWORD *)(a1 + 8) = 0LL;\nreturn result;\n}",
"original_code": "NODE * recursiveReverse(NODE * current){\n NODE * next;\n if (!current)\n return current;\n if (current->next) {\n next = recursiveReverse(current->next);\n }\n else {\n return current;\n }\n current->next->next = current;\n current->next = ((void *)0);\n return next;\n}",
"canonical_original_code": "struct NODE *recursiveReverse(struct NODE *current){\n struct NODE *next;\n if (!current)\n return current;\n if (current->next) {\n next = recursiveReverse(current->next);\n }\n else {\n return current;\n }\n current->next->next = current;\n current->next = ((void *)0);\n return next;\n}",
"variable_types": [
[
"current",
"struct NODE *"
],
[
"next",
"struct NODE { int num; struct NODE *next; } *"
]
],
"return_type": "struct NODE { int num; struct NODE *next; } *",
"user_defined_types": [
"struct NODE { int num; struct NODE *next; }"
],
"binary_hash": "9789bbc8966673ca39d966b99c014268d7317ea518d4ee890754fd7c29f6ba56"
}
] |
25b1e4b205d703493414f1ff093d66c0aa367e1198e3acce53a1bf6066d620c2 | ioerror/libmsr | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"reverse_byte",
"->",
"main"
],
[
"main",
"->",
"reverse_byte"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_404010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"char *func3()\n{\nreturn &_bss_start;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"char *func5()\n{\nchar *result; // rax\n\nif ( !_bss_start )\n{\nresult = func3();\n_bss_start = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"_libc_csu_init",
"void __fastcall func8(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func9(void)\n{\n;\n}"
]
] | [
{
"name": "reverse_byte",
"canonical_name": "func7",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall reverse_byte(unsigned __int8 a1)\n{\nreturn (32 * a1) & 0x40 | (8 * a1) & 0x20 | (2 * a1) & 0x10 | ((int)a1 >> 1) & 8 | ((int)a1 >> 3) & 4 | ((int)a1 >> 5) & 2 | (a1 >> 7) | (a1 << 7);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(unsigned __int8 a1)\n{\nreturn (32 * a1) & 0x40 | (8 * a1) & 0x20 | (2 * a1) & 0x10 | ((int)a1 >> 1) & 8 | ((int)a1 >> 3) & 4 | ((int)a1 >> 5) & 2 | (a1 >> 7) | (a1 << 7);\n}",
"original_code": "unsigned char reverse_byte(unsigned char byte)\n{\n return\n ((byte & 1<<7) >> 7) |\n ((byte & 1<<6) >> 5) |\n ((byte & 1<<5) >> 3) |\n ((byte & 1<<4) >> 1) |\n ((byte & 1<<3) << 1) |\n ((byte & 1<<2) << 3) |\n ((byte & 1<<1) << 5) |\n ((byte & 1<<0) << 7);\n}",
"canonical_original_code": "unsigned char reverse_byte(unsigned char byte)\n{\n return\n ((byte & 1<<7) >> 7) |\n ((byte & 1<<6) >> 5) |\n ((byte & 1<<5) >> 3) |\n ((byte & 1<<4) >> 1) |\n ((byte & 1<<3) << 1) |\n ((byte & 1<<2) << 3) |\n ((byte & 1<<1) << 5) |\n ((byte & 1<<0) << 7);\n}",
"variable_types": [
[
"byte",
"unsigned char"
]
],
"return_type": "unsigned char",
"user_defined_types": [],
"binary_hash": "25b1e4b205d703493414f1ff093d66c0aa367e1198e3acce53a1bf6066d620c2"
},
{
"name": "main",
"canonical_name": "main",
"repo": "ioerror/libmsr",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nunsigned __int8 buf; // [rsp+13h] [rbp-Dh] BYREF\nint fd; // [rsp+14h] [rbp-Ch]\n__off_t v6; // [rsp+18h] [rbp-8h]\n\nfd = -1;\nif ( argc <= 1 )\n{\nprintf(\"Usage: %s [file]\\n\", *argv);\nexit(1);\n}\nfd = open(argv[1], 0, envp);\nv6 = lseek(fd, 0LL, 2);\nwhile ( v6 > 0 )\n{\nv6 = lseek(fd, v6 - 1, 0);\nread(fd, &buf, 1uLL);\nbuf = reverse_byte(buf);\nwrite(2, &buf, 1uLL);\n}\nclose(fd);\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nunsigned __int8 buf; // [rsp+13h] [rbp-Dh] BYREF\nint fd; // [rsp+14h] [rbp-Ch]\n__off_t v6; // [rsp+18h] [rbp-8h]\n\nfd = -1;\nif ( argc <= 1 )\n{\nprintf(\"Usage: %s [file]\\n\", *argv);\nexit(1);\n}\nfd = open(argv[1], 0, envp);\nv6 = lseek(fd, 0LL, 2);\nwhile ( v6 > 0 )\n{\nv6 = lseek(fd, v6 - 1, 0);\nread(fd, &buf, 1uLL);\nbuf = func7(buf);\nwrite(2, &buf, 1uLL);\n}\nclose(fd);\nreturn 0;\n}",
"original_code": "int main(int argc, char **argv)\n{\n int fd = -1;\n off_t filepos;\n unsigned char byte;\n if (argc < 2)\n {\n printf(\"Usage: %s [file]\\n\", argv[0]);\n exit(1);\n }\n fd = open(argv[1], 00);\n filepos = lseek(fd, 0, 2);\n while (filepos > 0)\n {\n filepos = lseek(fd, filepos - 1, 0);\n read(fd, &byte, 1);\n byte = reverse_byte(byte);\n write(2, &byte, 1);\n }\n close(fd);\n return 0;\n}",
"canonical_original_code": "int main(int argc, char **argv)\n{\n int fd = -1;\n long filepos;\n unsigned char byte;\n if (argc < 2)\n {\n printf(\"Usage: %s [file]\\n\", argv[0]);\n exit(1);\n }\n fd = open(argv[1], 00);\n filepos = lseek(fd, 0, 2);\n while (filepos > 0)\n {\n filepos = lseek(fd, filepos - 1, 0);\n read(fd, &byte, 1);\n byte = reverse_byte(byte);\n write(2, &byte, 1);\n }\n close(fd);\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char **"
],
[
"fd",
"int"
],
[
"filepos",
"long"
],
[
"byte",
"unsigned char"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "25b1e4b205d703493414f1ff093d66c0aa367e1198e3acce53a1bf6066d620c2"
}
] |
4eead7a5e746c4b028648097966813eab9bd2682f2939e5239f00645a0de6c4b | ioerror/libmsr | [
[
"do_leet_led_dance",
"->",
"main"
],
[
"main",
"->",
"do_leet_led_dance"
]
] | [] | [
{
"name": "do_leet_led_dance",
"canonical_name": "func0",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall do_leet_led_dance(unsigned int a1)\n{\nint i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i <= 2; ++i )\n{\nmsr_flash_led(a1, 129LL);\nmsr_flash_led(a1, 131LL);\nmsr_flash_led(a1, 132LL);\nmsr_flash_led(a1, 133LL);\nusleep(0x186A0u);\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(unsigned int a1)\n{\nint i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i <= 2; ++i )\n{\nmsr_flash_led(a1, 129LL);\nmsr_flash_led(a1, 131LL);\nmsr_flash_led(a1, 132LL);\nmsr_flash_led(a1, 133LL);\nusleep(0x186A0u);\n}\nreturn 0LL;\n}",
"original_code": "int\ndo_leet_led_dance (int fd)\n{\n int z = 0;\n while (z < 3) {\n msr_flash_led(fd, 0x81);\n msr_flash_led(fd, 0x83);\n msr_flash_led(fd, 0x84);\n msr_flash_led(fd, 0x85);\n usleep (100000);\n z++;\n }\n return(0);\n}",
"canonical_original_code": "int do_leet_led_dance(int fd)\n{\n int z = 0;\n while (z < 3) {\n msr_flash_led(fd, 0x81);\n msr_flash_led(fd, 0x83);\n msr_flash_led(fd, 0x84);\n msr_flash_led(fd, 0x85);\n usleep (100000);\n z++;\n }\n return(0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"z",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "4eead7a5e746c4b028648097966813eab9bd2682f2939e5239f00645a0de6c4b"
},
{
"name": "main",
"canonical_name": "main",
"repo": "ioerror/libmsr",
"decompiled_code": "int __cdecl __noreturn main(int argc, const char **argv, const char **envp)\n{\nchar s[776]; // [rsp+10h] [rbp-320h] BYREF\nunsigned int v4; // [rsp+318h] [rbp-18h] BYREF\nint v5; // [rsp+31Ch] [rbp-14h]\nconst char *v6; // [rsp+320h] [rbp-10h]\nint i; // [rsp+32Ch] [rbp-4h]\n\nv4 = -1;\nv6 = \"/dev/ttyS0\";\nif ( argv[1] )\nv6 = argv[1];\nelse\nprintf(\"no device specified, defaulting to %s\\n\", v6);\nv5 = serial_open(v6, &v4, 2048LL, 13LL);\nif ( v5 == -1 )\nerr(1, \"Serial open of %s failed\", v6);\nmsr_init(v4);\nmsr_model(v4);\nmsr_fwrev(v4);\nmsr_set_lo_co(v4);\nmsr_sensor_test(v4);\nmsr_ram_test(v4);\nputs(\"Preparing reader for reading...\");\ndo_leet_led_dance(v4);\nputs(\"Ready to read an ISO formatted card. Please slide a card.\");\nbzero(s, 0x300uLL);\nfor ( i = 0; i <= 2; ++i )\ns[256 * (__int64)i + 255] = -1;\nmsr_iso_read(v4, s);\nfor ( i = 0; i <= 2; ++i )\n{\nif ( s[256 * (__int64)i + 255] )\nprintf(\"track%d: [%s]\\n\", (unsigned int)i, &s[256 * (__int64)i]);\n}\nmsr_init(v4);\nputs(\"Attempting erase, please swipe card...\");\nmsr_erase(v4, 7LL);\nmsr_init(v4);\nputs(\"Attempting ISO write, please swipe card...\");\nmsr_iso_write(v4, s);\nputs(\"write complete\");\nmsr_init(v4);\nserial_close(v4);\nexit(0);\n}\n",
"canonical_decompiled_code": "int __cdecl __noreturn main(int argc, const char **argv, const char **envp)\n{\nchar s[776]; // [rsp+10h] [rbp-320h] BYREF\nunsigned int v4; // [rsp+318h] [rbp-18h] BYREF\nint v5; // [rsp+31Ch] [rbp-14h]\nconst char *v6; // [rsp+320h] [rbp-10h]\nint i; // [rsp+32Ch] [rbp-4h]\n\nv4 = -1;\nv6 = \"/dev/ttyS0\";\nif ( argv[1] )\nv6 = argv[1];\nelse\nprintf(\"no device specified, defaulting to %s\\n\", v6);\nv5 = serial_open(v6, &v4, 2048LL, 13LL);\nif ( v5 == -1 )\nerr(1, \"Serial open of %s failed\", v6);\nmsr_init(v4);\nmsr_model(v4);\nmsr_fwrev(v4);\nmsr_set_lo_co(v4);\nmsr_sensor_test(v4);\nmsr_ram_test(v4);\nputs(\"Preparing reader for reading...\");\nfunc0(v4);\nputs(\"Ready to read an ISO formatted card. Please slide a card.\");\nbzero(s, 0x300uLL);\nfor ( i = 0; i <= 2; ++i )\ns[256 * (__int64)i + 255] = -1;\nmsr_iso_read(v4, s);\nfor ( i = 0; i <= 2; ++i )\n{\nif ( s[256 * (__int64)i + 255] )\nprintf(\"track%d: [%s]\\n\", (unsigned int)i, &s[256 * (__int64)i]);\n}\nmsr_init(v4);\nputs(\"Attempting erase, please swipe card...\");\nmsr_erase(v4, 7LL);\nmsr_init(v4);\nputs(\"Attempting ISO write, please swipe card...\");\nmsr_iso_write(v4, s);\nputs(\"write complete\");\nmsr_init(v4);\nserial_close(v4);\nexit(0);\n}",
"original_code": "int main(int argc, char * argv[])\n{\n int fd = -1;\n int serial;\n msr_tracks_t tracks;\n int i;\n char *device = \"/dev/ttyS0\";\n if (argv[1] != ((void *)0))\n device = argv[1];\n else\n printf (\"no device specified, defaulting to %s\\n\", device);\n serial = serial_open (device, &fd, 04000, 0000015);\n if (serial == -1) {\n err(1, \"Serial open of %s failed\", device);\n exit(1);\n }\n msr_init (fd);\n msr_model (fd);\n msr_fwrev (fd);\n msr_set_lo_co (fd);\n msr_sensor_test (fd);\n msr_ram_test (fd);\n printf(\"Preparing reader for reading...\\n\");\n do_leet_led_dance (fd);\n printf(\"Ready to read an ISO formatted card. Please slide a card.\\n\");\n bzero ((char *)&tracks, sizeof(tracks));\n for (i = 0; i < 3; i++)\n tracks.msr_tracks[i].msr_tk_len = 255;\n msr_iso_read (fd, &tracks);\n for (i = 0; i < 3; i++) {\n if (tracks.msr_tracks[i].msr_tk_len)\n printf (\"track%d: [%s]\\n\", i,\n tracks.msr_tracks[i].msr_tk_data);\n }\n msr_init (fd);\n printf (\"Attempting erase, please swipe card...\\n\");\n msr_erase (fd, 0x07);\n msr_init (fd);\n printf (\"Attempting ISO write, please swipe card...\\n\");\n msr_iso_write (fd, &tracks);\n printf (\"write complete\\n\");\n msr_init (fd);\n serial_close (fd);\n exit(0);\n}",
"canonical_original_code": "int main(int argc, char *argv[])\n{\n int fd = -1;\n int serial;\n struct msr_tracks tracks;\n int i;\n char *device = \"/dev/ttyS0\";\n if (argv[1] != ((void *)0))\n device = argv[1];\n else\n printf (\"no device specified, defaulting to %s\\n\", device);\n serial = serial_open (device, &fd, 04000, 0000015);\n if (serial == -1) {\n err(1, \"Serial open of %s failed\", device);\n exit(1);\n }\n msr_init (fd);\n msr_model (fd);\n msr_fwrev (fd);\n msr_set_lo_co (fd);\n msr_sensor_test (fd);\n msr_ram_test (fd);\n printf(\"Preparing reader for reading...\\n\");\n do_leet_led_dance (fd);\n printf(\"Ready to read an ISO formatted card. Please slide a card.\\n\");\n bzero ((char *)&tracks, sizeof(tracks));\n for (i = 0; i < 3; i++)\n tracks.msr_tracks[i].msr_tk_len = 255;\n msr_iso_read (fd, &tracks);\n for (i = 0; i < 3; i++) {\n if (tracks.msr_tracks[i].msr_tk_len)\n printf (\"track%d: [%s]\\n\", i,\n tracks.msr_tracks[i].msr_tk_data);\n }\n msr_init (fd);\n printf (\"Attempting erase, please swipe card...\\n\");\n msr_erase (fd, 0x07);\n msr_init (fd);\n printf (\"Attempting ISO write, please swipe card...\\n\");\n msr_iso_write (fd, &tracks);\n printf (\"write complete\\n\");\n msr_init (fd);\n serial_close (fd);\n exit(0);\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char *[]"
],
[
"fd",
"int"
],
[
"serial",
"int"
],
[
"tracks",
"struct msr_tracks { struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; } msr_tracks[3]; }"
],
[
"i",
"int"
],
[
"device",
"char *"
]
],
"return_type": "int",
"user_defined_types": [
"struct msr_tracks { struct msr_track msr_tracks[3]; }",
"struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; }"
],
"binary_hash": "4eead7a5e746c4b028648097966813eab9bd2682f2939e5239f00645a0de6c4b"
}
] |
5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1 | ioerror/libmsr | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"main",
"->",
"display_header",
"add_card",
"display_card",
"display_footer",
"shift_card",
"remove_card",
"card_list_destroy"
],
[
"card_list_create",
"->",
"add_card"
],
[
"card_list_destroy",
"->",
"main",
"card_list_remove"
],
[
"card_list_remove",
"->",
"card_list_destroy",
"add_card",
"remove_card"
],
[
"add_card",
"->",
"main",
"card_list_create",
"read_file",
"card_list_remove"
],
[
"remove_card",
"->",
"main",
"card_list_remove"
],
[
"display_card",
"->",
"main",
"dump_buffer"
],
[
"shift_card",
"->",
"main"
],
[
"read_file",
"->",
"add_card"
],
[
"dump_buffer",
"->",
"display_card",
"print_bits"
],
[
"print_bits",
"->",
"dump_buffer"
],
[
"display_header",
"->",
"main"
],
[
"display_footer",
"->",
"main"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_404010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"WINDOW **func3()\n{\nreturn &_bss_start;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"WINDOW **func5()\n{\nWINDOW **result; // rax\n\nif ( !completed_0 )\n{\nresult = func3();\ncompleted_0 = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"_libc_csu_init",
"void __fastcall func19(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func20(void)\n{\n;\n}"
]
] | [
{
"name": "card_list_create",
"canonical_name": "func7",
"repo": "ioerror/libmsr",
"decompiled_code": "void *card_list_create()\n{\nreturn calloc(1uLL, 0x138uLL);\n}\n",
"canonical_decompiled_code": "void *func7()\n{\nreturn calloc(1uLL, 0x138uLL);\n}",
"original_code": "CARD_LIST *card_list_create()\n{\n return (CARD_LIST *)calloc(1, sizeof(CARD_LIST));\n}",
"canonical_original_code": "struct card_list *card_list_create()\n{\n return (struct card_list *)calloc(1, sizeof(CARD_LIST));\n}",
"variable_types": [],
"return_type": "struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; } *",
"user_defined_types": [
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; }"
],
"binary_hash": "5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1"
},
{
"name": "card_list_destroy",
"canonical_name": "func8",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall card_list_destroy(__int64 a1)\n{\n__int64 result; // rax\n__int64 v2; // [rsp+8h] [rbp-18h]\n\ndo\n{\nv2 = a1;\na1 = *(_QWORD *)(a1 + 296);\ncard_list_remove(v2);\nresult = a1;\n}\nwhile ( a1 != v2 );\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func8(__int64 a1)\n{\n__int64 result; // rax\n__int64 v2; // [rsp+8h] [rbp-18h]\n\ndo\n{\nv2 = a1;\na1 = *(_QWORD *)(a1 + 296);\nfunc9(v2);\nresult = a1;\n}\nwhile ( a1 != v2 );\nreturn result;\n}",
"original_code": "void card_list_destroy(CARD_LIST *item)\n{\n CARD_LIST *next;\n next = item;\n do\n {\n item = next;\n next = item->next;\n card_list_remove(item);\n }\n while (next != item);\n}",
"canonical_original_code": "void card_list_destroy(struct card_list *item)\n{\n struct card_list *next;\n next = item;\n do\n {\n item = next;\n next = item->next;\n card_list_remove(item);\n }\n while (next != item);\n}",
"variable_types": [
[
"item",
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; } *"
],
[
"next",
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; }"
],
"binary_hash": "5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1"
},
{
"name": "card_list_remove",
"canonical_name": "func9",
"repo": "ioerror/libmsr",
"decompiled_code": "void __fastcall card_list_remove(_QWORD *a1)\n{\n*(_QWORD *)(a1[37] + 304LL) = a1[38];\n*(_QWORD *)(a1[38] + 296LL) = a1[37];\nmemset(a1, 0, 0x138uLL);\nfree(a1);\n}\n",
"canonical_decompiled_code": "void __fastcall func9(_QWORD *a1)\n{\n*(_QWORD *)(a1[37] + 304LL) = a1[38];\n*(_QWORD *)(a1[38] + 296LL) = a1[37];\nmemset(a1, 0, 0x138uLL);\nfree(a1);\n}",
"original_code": "void card_list_remove(CARD_LIST *item)\n{\n item->next->prev = item->prev;\n item->prev->next = item->next;\n memset(item, 0, sizeof(CARD_LIST));\n free(item);\n}",
"canonical_original_code": "void card_list_remove(struct card_list *item)\n{\n item->next->prev = item->prev;\n item->prev->next = item->next;\n memset(item, 0, sizeof(CARD_LIST));\n free(item);\n}",
"variable_types": [
[
"item",
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; }"
],
"binary_hash": "5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1"
},
{
"name": "add_card",
"canonical_name": "func10",
"repo": "ioerror/libmsr",
"decompiled_code": "char *__fastcall add_card(char *a1, char *a2)\n{\nchar s[44]; // [rsp+10h] [rbp-40h] BYREF\nint v4; // [rsp+3Ch] [rbp-14h]\nchar *dest; // [rsp+40h] [rbp-10h]\nchar *src; // [rsp+48h] [rbp-8h]\n\nif ( a1 )\n{\nsrc = a1;\n}\nelse\n{\nmemset(s, 0, 0x20uLL);\nprintw(\"Filename: \");\nwrefresh(_bss_start);\necho();\nwgetnstr(_bss_start, s, -1);\nnoecho();\nsrc = s;\n}\nif ( a2 )\n{\ndest = (char *)card_list_insert((__int64)a2);\n}\nelse\n{\ndest = (char *)card_list_create();\n*((_QWORD *)dest + 37) = dest;\n*((_QWORD *)dest + 38) = dest;\n}\nstrcpy(dest, src);\nv4 = read_file(src, dest + 32);\nif ( v4 == -1 )\n{\ncard_list_remove(dest);\ndest = a2;\nprintw(\"Could not load \\\"%s\\\".\\n\", src);\nwrefresh(_bss_start);\nsleep(1u);\n}\nelse\n{\nmemcpy(dest + 160, dest + 32, 0x80uLL);\n*((_DWORD *)dest + 72) = 0;\nprintw(\"Loaded \\\"%s\\\".\\n\", src);\nwrefresh(_bss_start);\n}\nreturn dest;\n}\n",
"canonical_decompiled_code": "char *__fastcall func10(char *a1, char *a2)\n{\nchar s[44]; // [rsp+10h] [rbp-40h] BYREF\nint v4; // [rsp+3Ch] [rbp-14h]\nchar *dest; // [rsp+40h] [rbp-10h]\nchar *src; // [rsp+48h] [rbp-8h]\n\nif ( a1 )\n{\nsrc = a1;\n}\nelse\n{\nmemset(s, 0, 0x20uLL);\nprintw(\"Filename: \");\nwrefresh(_bss_start);\necho();\nwgetnstr(_bss_start, s, -1);\nnoecho();\nsrc = s;\n}\nif ( a2 )\n{\ndest = (char *)card_list_insert((__int64)a2);\n}\nelse\n{\ndest = (char *)func7();\n*((_QWORD *)dest + 37) = dest;\n*((_QWORD *)dest + 38) = dest;\n}\nstrcpy(dest, src);\nv4 = func14(src, dest + 32);\nif ( v4 == -1 )\n{\nfunc9(dest);\ndest = a2;\nprintw(\"Could not load \\\"%s\\\".\\n\", src);\nwrefresh(_bss_start);\nsleep(1u);\n}\nelse\n{\nmemcpy(dest + 160, dest + 32, 0x80uLL);\n*((_DWORD *)dest + 72) = 0;\nprintw(\"Loaded \\\"%s\\\".\\n\", src);\nwrefresh(_bss_start);\n}\nreturn dest;\n}",
"original_code": "CARD_LIST *add_card(const char *filename, CARD_LIST *cur_item)\n{\n char *fn;\n char buffer[32];\n int status;\n CARD_LIST *new_item;\n if (filename == ((void *)0))\n {\n memset(buffer, 0, 32);\n printw(\"Filename: \");\n wrefresh(stdscr);\n echo();\n wgetnstr(stdscr, (buffer), -1);\n noecho();\n fn = buffer;\n }\n else\n {\n fn = (char *)filename;\n }\n if (cur_item == ((void *)0))\n {\n new_item = card_list_create();\n new_item->next = new_item;\n new_item->prev = new_item;\n }\n else\n {\n new_item = card_list_insert(cur_item);\n }\n strcpy(new_item->filename, fn);\n status = read_file(fn, new_item->raw_card);\n if (status == -1)\n {\n card_list_remove(new_item);\n new_item = cur_item;\n printw(\"Could not load \\\"%s\\\".\\n\", fn);\n wrefresh(stdscr);\n sleep(1);\n }\n else\n {\n memcpy(new_item->mod_card, new_item->raw_card, 128);\n new_item->offset = 0;\n printw(\"Loaded \\\"%s\\\".\\n\", fn);\n wrefresh(stdscr);\n }\n return new_item;\n}",
"canonical_original_code": "struct card_list *add_card(char *filename, struct card_list *cur_item)\n{\n char *fn;\n char buffer[32];\n int status;\n struct card_list *new_item;\n if (filename == ((void *)0))\n {\n memset(buffer, 0, 32);\n printw(\"Filename: \");\n wrefresh(stdscr);\n echo();\n wgetnstr(stdscr, (buffer), -1);\n noecho();\n fn = buffer;\n }\n else\n {\n fn = (char *)filename;\n }\n if (cur_item == ((void *)0))\n {\n new_item = card_list_create();\n new_item->next = new_item;\n new_item->prev = new_item;\n }\n else\n {\n new_item = card_list_insert(cur_item);\n }\n strcpy(new_item->filename, fn);\n status = read_file(fn, new_item->raw_card);\n if (status == -1)\n {\n card_list_remove(new_item);\n new_item = cur_item;\n printw(\"Could not load \\\"%s\\\".\\n\", fn);\n wrefresh(stdscr);\n sleep(1);\n }\n else\n {\n memcpy(new_item->mod_card, new_item->raw_card, 128);\n new_item->offset = 0;\n printw(\"Loaded \\\"%s\\\".\\n\", fn);\n wrefresh(stdscr);\n }\n return new_item;\n}",
"variable_types": [
[
"filename",
"char *"
],
[
"cur_item",
"struct card_list *"
],
[
"fn",
"char *"
],
[
"buffer",
"char [32]"
],
[
"status",
"int"
],
[
"new_item",
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; } *"
]
],
"return_type": "struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; } *",
"user_defined_types": [
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; }"
],
"binary_hash": "5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1"
},
{
"name": "remove_card",
"canonical_name": "func11",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall remove_card(__int64 a1)\n{\n__int64 v2; // [rsp+18h] [rbp-8h]\n\nv2 = *(_QWORD *)(a1 + 296);\nif ( a1 == v2 )\n{\nprintw(\"You cannot remove the only remaining card!\\n\");\n}\nelse\n{\nprintw(\"Removed \\\"%s\\\".\\n\\n\", (const char *)a1);\ncard_list_remove((_QWORD *)a1);\n}\nwrefresh(_bss_start);\nsleep(1u);\nreturn v2;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func11(__int64 a1)\n{\n__int64 v2; // [rsp+18h] [rbp-8h]\n\nv2 = *(_QWORD *)(a1 + 296);\nif ( a1 == v2 )\n{\nprintw(\"You cannot remove the only remaining card!\\n\");\n}\nelse\n{\nprintw(\"Removed \\\"%s\\\".\\n\\n\", (const char *)a1);\nfunc9((_QWORD *)a1);\n}\nwrefresh(_bss_start);\nsleep(1u);\nreturn v2;\n}",
"original_code": "CARD_LIST *remove_card(CARD_LIST *item)\n{\n CARD_LIST *next;\n next = item->next;\n if (item == next)\n {\n printw(\"You cannot remove the only remaining card!\\n\");\n }\n else\n {\n printw (\"Removed \\\"%s\\\".\\n\\n\", item->filename);\n card_list_remove(item);\n }\n wrefresh(stdscr);\n sleep(1);\n return next;\n}",
"canonical_original_code": "struct card_list *remove_card(struct card_list *item)\n{\n struct card_list *next;\n next = item->next;\n if (item == next)\n {\n printw(\"You cannot remove the only remaining card!\\n\");\n }\n else\n {\n printw (\"Removed \\\"%s\\\".\\n\\n\", item->filename);\n card_list_remove(item);\n }\n wrefresh(stdscr);\n sleep(1);\n return next;\n}",
"variable_types": [
[
"item",
"struct card_list *"
],
[
"next",
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; } *"
]
],
"return_type": "struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; } *",
"user_defined_types": [
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; }"
],
"binary_hash": "5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1"
},
{
"name": "display_card",
"canonical_name": "func12",
"repo": "ioerror/libmsr",
"decompiled_code": "int __fastcall display_card(__int64 a1)\n{\nprintw(\"File: %s (Offset: %+d bits)\\n\\n\", (const char *)a1, *(unsigned int *)(a1 + 288));\ndump_buffer(a1 + 160);\nreturn wrefresh(_bss_start);\n}\n",
"canonical_decompiled_code": "int __fastcall func12(__int64 a1)\n{\nprintw(\"File: %s (Offset: %+d bits)\\n\\n\", (const char *)a1, *(unsigned int *)(a1 + 288));\nfunc15(a1 + 160);\nreturn wrefresh(_bss_start);\n}",
"original_code": "void display_card(CARD_LIST *item)\n{\n printw(\"File: %s (Offset: %+d bits)\\n\\n\", item->filename, item->offset);\n dump_buffer(item->mod_card);\n wrefresh(stdscr);\n}",
"canonical_original_code": "void display_card(struct card_list *item)\n{\n printw(\"File: %s (Offset: %+d bits)\\n\\n\", item->filename, item->offset);\n dump_buffer(item->mod_card);\n wrefresh(stdscr);\n}",
"variable_types": [
[
"item",
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; }"
],
"binary_hash": "5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1"
},
{
"name": "shift_card",
"canonical_name": "func13",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall shift_card(__int64 a1, int a2)\n{\n__int64 result; // rax\nunsigned __int8 v3; // [rsp+17h] [rbp-29h]\nunsigned int v4; // [rsp+18h] [rbp-28h]\nint i; // [rsp+1Ch] [rbp-24h]\nchar v6; // [rsp+23h] [rbp-1Dh]\nint v7; // [rsp+24h] [rbp-1Ch]\n_BYTE *s; // [rsp+28h] [rbp-18h]\n__int64 v9; // [rsp+30h] [rbp-10h]\nunsigned __int8 v10; // [rsp+3Fh] [rbp-1h]\n\nv9 = a1 + 32;\ns = (_BYTE *)(a1 + 160);\nmemset((void *)(a1 + 160), 0, 0x80uLL);\n*(_DWORD *)(a1 + 288) += a2;\nv7 = (int)abs32(*(_DWORD *)(a1 + 288)) / 8;\nv4 = abs32(*(_DWORD *)(a1 + 288)) & 7;\nif ( *(int *)(a1 + 288) < 0 )\n{\nv9 += ++v7;\nv6 = 8 - v4;\nv10 = *(_BYTE *)(v9 - 1);\n}\nelse\n{\ns += v7;\nv6 = v4;\nv10 = 0;\n}\nfor ( i = 0; ; ++i )\n{\nresult = (unsigned int)(128 - v7);\nif ( i >= (int)result )\nbreak;\nv3 = *(_BYTE *)(i + v9);\ns[i] = (v3 | (v10 << 8)) >> v6;\nv10 = v3;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func13(__int64 a1, int a2)\n{\n__int64 result; // rax\nunsigned __int8 v3; // [rsp+17h] [rbp-29h]\nunsigned int v4; // [rsp+18h] [rbp-28h]\nint i; // [rsp+1Ch] [rbp-24h]\nchar v6; // [rsp+23h] [rbp-1Dh]\nint v7; // [rsp+24h] [rbp-1Ch]\n_BYTE *s; // [rsp+28h] [rbp-18h]\n__int64 v9; // [rsp+30h] [rbp-10h]\nunsigned __int8 v10; // [rsp+3Fh] [rbp-1h]\n\nv9 = a1 + 32;\ns = (_BYTE *)(a1 + 160);\nmemset((void *)(a1 + 160), 0, 0x80uLL);\n*(_DWORD *)(a1 + 288) += a2;\nv7 = (int)abs32(*(_DWORD *)(a1 + 288)) / 8;\nv4 = abs32(*(_DWORD *)(a1 + 288)) & 7;\nif ( *(int *)(a1 + 288) < 0 )\n{\nv9 += ++v7;\nv6 = 8 - v4;\nv10 = *(_BYTE *)(v9 - 1);\n}\nelse\n{\ns += v7;\nv6 = v4;\nv10 = 0;\n}\nfor ( i = 0; ; ++i )\n{\nresult = (unsigned int)(128 - v7);\nif ( i >= (int)result )\nbreak;\nv3 = *(_BYTE *)(i + v9);\ns[i] = (v3 | (v10 << 8)) >> v6;\nv10 = v3;\n}\nreturn result;\n}",
"original_code": "void shift_card(CARD_LIST *item, int shift)\n{\n unsigned char a, b;\n unsigned char *src, *dst;\n int bit_offset, byte_offset;\n unsigned char rel_shift;\n int i;\n src = item->raw_card;\n dst = item->mod_card;\n memset(dst, 0, 128);\n item->offset += shift;\n byte_offset = abs(item->offset) / 8;\n bit_offset = abs(item->offset) % 8;\n if (item->offset >= 0)\n {\n dst += byte_offset;\n rel_shift = bit_offset;\n a = 0;\n }\n else\n {\n byte_offset += 1;\n src += byte_offset;\n rel_shift = 8 - bit_offset;\n a = *(src - 1);\n }\n for (i=0; i<128 - byte_offset; i++)\n {\n b = *(src + i);\n *(dst + i) = (((a<<8 | b) >> rel_shift ) & 0xff);\n a = b;\n }\n}",
"canonical_original_code": "void shift_card(struct card_list *item, int shift)\n{\n unsigned char a; unsigned char b;\n unsigned char *src; unsigned char *dst;\n int bit_offset; int byte_offset;\n unsigned char rel_shift;\n int i;\n src = item->raw_card;\n dst = item->mod_card;\n memset(dst, 0, 128);\n item->offset += shift;\n byte_offset = abs(item->offset) / 8;\n bit_offset = abs(item->offset) % 8;\n if (item->offset >= 0)\n {\n dst += byte_offset;\n rel_shift = bit_offset;\n a = 0;\n }\n else\n {\n byte_offset += 1;\n src += byte_offset;\n rel_shift = 8 - bit_offset;\n a = *(src - 1);\n }\n for (i=0; i<128 - byte_offset; i++)\n {\n b = *(src + i);\n *(dst + i) = (((a<<8 | b) >> rel_shift ) & 0xff);\n a = b;\n }\n}",
"variable_types": [
[
"item",
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; } *"
],
[
"shift",
"int"
],
[
"a",
"unsigned char"
],
[
"b",
"unsigned char"
],
[
"src",
"unsigned char *"
],
[
"dst",
"unsigned char *"
],
[
"bit_offset",
"int"
],
[
"byte_offset",
"int"
],
[
"rel_shift",
"unsigned char"
],
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; }"
],
"binary_hash": "5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1"
},
{
"name": "read_file",
"canonical_name": "func14",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall read_file(const char *a1, char *a2)\n{\nint *v2; // rax\nchar *v3; // rax\n__int64 result; // rax\nssize_t v6; // [rsp+10h] [rbp-10h]\nint fd; // [rsp+1Ch] [rbp-4h]\n\nfd = open(a1, 0);\nif ( fd == -1 )\n{\nv2 = __errno_location();\nv3 = strerror(*v2);\nprintw(\"open: %s.\\n\", v3);\nwrefresh(_bss_start);\nsleep(1u);\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\ndo\n{\nv6 = read(fd, a2, 8uLL);\na2 += 8;\n}\nwhile ( v6 > 0 );\nclose(fd);\nresult = v6;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func14(const char *a1, char *a2)\n{\nint *v2; // rax\nchar *v3; // rax\n__int64 result; // rax\nssize_t v6; // [rsp+10h] [rbp-10h]\nint fd; // [rsp+1Ch] [rbp-4h]\n\nfd = open(a1, 0);\nif ( fd == -1 )\n{\nv2 = __errno_location();\nv3 = strerror(*v2);\nprintw(\"open: %s.\\n\", v3);\nwrefresh(_bss_start);\nsleep(1u);\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\ndo\n{\nv6 = read(fd, a2, 8uLL);\na2 += 8;\n}\nwhile ( v6 > 0 );\nclose(fd);\nresult = v6;\n}\nreturn result;\n}",
"original_code": "int read_file (const char *filename, unsigned char *buffer)\n{\n int fd;\n ssize_t bytes_read;\n fd = open(filename, 00);\n if (fd == -1)\n {\n printw(\"open: %s.\\n\", strerror((*__errno_location ())));\n wrefresh(stdscr);\n sleep(1);\n return -1;\n }\n do\n {\n bytes_read = read(fd, buffer, 8);\n buffer += 8;\n }\n while (bytes_read > 0);\n buffer = ((void *)0);\n close(fd);\n return bytes_read;\n}",
"canonical_original_code": "int read_file(char *filename, unsigned char *buffer)\n{\n int fd;\n long bytes_read;\n fd = open(filename, 00);\n if (fd == -1)\n {\n printw(\"open: %s.\\n\", strerror((*__errno_location ())));\n wrefresh(stdscr);\n sleep(1);\n return -1;\n }\n do\n {\n bytes_read = read(fd, buffer, 8);\n buffer += 8;\n }\n while (bytes_read > 0);\n buffer = ((void *)0);\n close(fd);\n return bytes_read;\n}",
"variable_types": [
[
"filename",
"char *"
],
[
"buffer",
"unsigned char *"
],
[
"fd",
"int"
],
[
"bytes_read",
"long"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1"
},
{
"name": "dump_buffer",
"canonical_name": "func15",
"repo": "ioerror/libmsr",
"decompiled_code": "int __fastcall dump_buffer(__int64 a1)\n{\nint result; // eax\nint i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i <= 127; ++i )\n{\nprint_bits(*(unsigned __int8 *)(i + a1));\nprintw(\" \");\nif ( (((_BYTE)i + 1) & 7) != 0 )\n{\nresult = ((_BYTE)i + 1) & 3;\nif ( (((_BYTE)i + 1) & 3) == 0 )\nresult = printw(\" \");\n}\nelse\n{\nresult = printw(\"\\n\");\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func15(__int64 a1)\n{\nint result; // eax\nint i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i <= 127; ++i )\n{\nfunc16(*(unsigned __int8 *)(i + a1));\nprintw(\" \");\nif ( (((_BYTE)i + 1) & 7) != 0 )\n{\nresult = ((_BYTE)i + 1) & 3;\nif ( (((_BYTE)i + 1) & 3) == 0 )\nresult = printw(\" \");\n}\nelse\n{\nresult = printw(\"\\n\");\n}\n}\nreturn result;\n}",
"original_code": "void dump_buffer(const unsigned char *buffer)\n{\n int i;\n for (i=0; i<128; i++)\n {\n print_bits(*(buffer +i));\n printw(\" \");\n if ((i + 1) % 8 == 0)\n {\n printw(\"\\n\");\n }\n else if ((i + 1) % 4 == 0)\n {\n printw(\" \");\n }\n }\n}",
"canonical_original_code": "void dump_buffer(unsigned char *buffer)\n{\n int i;\n for (i=0; i<128; i++)\n {\n print_bits(*(buffer +i));\n printw(\" \");\n if ((i + 1) % 8 == 0)\n {\n printw(\"\\n\");\n }\n else if ((i + 1) % 4 == 0)\n {\n printw(\" \");\n }\n }\n}",
"variable_types": [
[
"buffer",
"unsigned char *"
],
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1"
},
{
"name": "print_bits",
"canonical_name": "func16",
"repo": "ioerror/libmsr",
"decompiled_code": "int __fastcall print_bits(int a1)\n{\nint result; // eax\nunsigned int v2; // eax\nchar v3; // [rsp+Ch] [rbp-14h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nresult = a1;\nv3 = a1;\nfor ( i = 0; i <= 7; ++i )\n{\nif ( v3 >= 0 )\nv2 = 48;\nelse\nv2 = 49;\nresult = printw(\"%c\", v2);\nv3 *= 2;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func16(int a1)\n{\nint result; // eax\nunsigned int v2; // eax\nchar v3; // [rsp+Ch] [rbp-14h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nresult = a1;\nv3 = a1;\nfor ( i = 0; i <= 7; ++i )\n{\nif ( v3 >= 0 )\nv2 = 48;\nelse\nv2 = 49;\nresult = printw(\"%c\", v2);\nv3 *= 2;\n}\nreturn result;\n}",
"original_code": "void print_bits(unsigned char c)\n{\n int i;\n for (i = 0; i<8; i++)\n {\n printw(\"%c\", (c&0x80)?'1':'0');\n c <<= 1;\n }\n}",
"canonical_original_code": "void print_bits(unsigned char c)\n{\n int i;\n for (i = 0; i<8; i++)\n {\n printw(\"%c\", (c&0x80)?'1':'0');\n c <<= 1;\n }\n}",
"variable_types": [
[
"c",
"unsigned char"
],
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1"
},
{
"name": "display_header",
"canonical_name": "func17",
"repo": "ioerror/libmsr",
"decompiled_code": "int display_header()\n{\nchar s[40]; // [rsp+0h] [rbp-30h] BYREF\nint v2; // [rsp+28h] [rbp-8h]\nint v3; // [rsp+2Ch] [rbp-4h]\n\nstrcpy(s, \"File Field Visualizer 0.1\");\nv3 = 0;\nv2 = (72 - strlen(s)) >> 1;\nmvprintw(v3, v2, \"%s\\n\", s);\nprintw(\"\\n\");\nreturn wrefresh(_bss_start);\n}\n",
"canonical_decompiled_code": "int func17()\n{\nchar s[40]; // [rsp+0h] [rbp-30h] BYREF\nint v2; // [rsp+28h] [rbp-8h]\nint v3; // [rsp+2Ch] [rbp-4h]\n\nstrcpy(s, \"File Field Visualizer 0.1\");\nv3 = 0;\nv2 = (72 - strlen(s)) >> 1;\nmvprintw(v3, v2, \"%s\\n\", s);\nprintw(\"\\n\");\nreturn wrefresh(_bss_start);\n}",
"original_code": "void display_header()\n{\n int y, x;\n char title[] = \"File Field Visualizer 0.1\";\n y = 0;\n x = (72 - strlen(title)) / 2;\n mvprintw(y, x, \"%s\\n\", title);\n printw(\"\\n\");\n wrefresh(stdscr);\n}",
"canonical_original_code": "void display_header()\n{\n int y; int x;\n char title[] = \"File Field Visualizer 0.1\";\n y = 0;\n x = (72 - strlen(title)) / 2;\n mvprintw(y, x, \"%s\\n\", title);\n printw(\"\\n\");\n wrefresh(stdscr);\n}",
"variable_types": [
[
"y",
"int"
],
[
"x",
"int"
],
[
"title",
"char []"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1"
},
{
"name": "display_footer",
"canonical_name": "func18",
"repo": "ioerror/libmsr",
"decompiled_code": "int display_footer()\n{\nchar v1[48]; // [rsp+0h] [rbp-30h] BYREF\n\nstrcpy(v1, \"Commands: <L>, <R>, <U>, <D>, a, r, ?, q.\");\nprintw(\"\\n\");\nprintw(\"%s\\n\", v1);\nreturn wrefresh(_bss_start);\n}\n",
"canonical_decompiled_code": "int func18()\n{\nchar v1[48]; // [rsp+0h] [rbp-30h] BYREF\n\nstrcpy(v1, \"Commands: <L>, <R>, <U>, <D>, a, r, ?, q.\");\nprintw(\"\\n\");\nprintw(\"%s\\n\", v1);\nreturn wrefresh(_bss_start);\n}",
"original_code": "void display_footer()\n{\n char commands[] = \"Commands: <L>, <R>, <U>, <D>, a, r, ?, q.\";\n printw(\"\\n\");\n printw(\"%s\\n\", commands);\n wrefresh(stdscr);\n}",
"canonical_original_code": "void display_footer()\n{\n char commands[] = \"Commands: <L>, <R>, <U>, <D>, a, r, ?, q.\";\n printw(\"\\n\");\n printw(\"%s\\n\", commands);\n wrefresh(stdscr);\n}",
"variable_types": [
[
"commands",
"char []"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1"
},
{
"name": "main",
"canonical_name": "main",
"repo": "ioerror/libmsr",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nint v4; // [rsp+14h] [rbp-1Ch]\nint i; // [rsp+18h] [rbp-18h]\nchar v6; // [rsp+1Fh] [rbp-11h]\n__int64 v7; // [rsp+20h] [rbp-10h]\n__int64 v8; // [rsp+28h] [rbp-8h]\n\nif ( argc <= 1 )\n{\nprintf(\"Usage: %s [file1] ... [fileN]\\n\", *argv);\nexit(1);\n}\ninitscr();\nkeypad(_bss_start, 1);\nnoecho();\ndisplay_header();\nv8 = 0LL;\nfor ( i = 1; i < argc; ++i )\nv8 = add_card(argv[i], v8);\nv7 = *(_QWORD *)(v8 + 296);\nsleep(1u);\nv6 = 1;\nwhile ( v6 )\n{\nwclear(_bss_start);\ndisplay_header();\ndisplay_card(v7);\ndisplay_footer();\nprintw(\"\\n\");\nwrefresh(_bss_start);\nv4 = wgetch(_bss_start);\nif ( v4 == 261 )\n{\nshift_card(v7, 1LL);\ngoto LABEL_29;\n}\nif ( v4 > 261 )\ngoto LABEL_28;\nswitch ( v4 )\n{\ncase 260:\nshift_card(v7, 0xFFFFFFFFLL);\ngoto LABEL_29;\ncase 259:\nv7 = *(_QWORD *)(v7 + 304);\ngoto LABEL_29;\ncase 258:\nv7 = *(_QWORD *)(v7 + 296);\ngoto LABEL_29;\ncase 114:\nv7 = remove_card(v7);\ngoto LABEL_29;\n}\nif ( v4 > 114 )\ngoto LABEL_28;\nif ( v4 == 113 )\n{\nv6 = 0;\ngoto LABEL_29;\n}\nif ( v4 == 97 )\n{\nv7 = add_card(0LL, v7);\ngoto LABEL_29;\n}\nif ( v4 > 97 )\n{\nLABEL_28:\nprintw(\"Unrecognized command: %c.\\n\", (unsigned int)v4);\nwrefresh(_bss_start);\nsleep(1u);\nLABEL_29:\nwrefresh(_bss_start);\n}\nelse if ( v4 != 10 )\n{\nif ( v4 == 63 )\n{\nprintw(\"<DOWN> - next card\\n\");\nprintw(\"<UP> - previous card\\n\");\nprintw(\"<LEFT> - bit shift left\\n\");\nprintw(\"<RIGHT> - bit shift right\\n\");\nprintw(\"a - add card\\n\");\nprintw(\"r - remove card\\n\");\nprintw(\"? - this help screen\\n\");\nprintw(\"q - exit program\\n\");\nprintw(\"\\n\");\nprintw(\"Press any key to continue ...\\n\");\nwrefresh(_bss_start);\nwgetch(_bss_start);\ngoto LABEL_29;\n}\ngoto LABEL_28;\n}\n}\ncard_list_destroy(v8);\nendwin();\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nint v4; // [rsp+14h] [rbp-1Ch]\nint i; // [rsp+18h] [rbp-18h]\nchar v6; // [rsp+1Fh] [rbp-11h]\n__int64 v7; // [rsp+20h] [rbp-10h]\n__int64 v8; // [rsp+28h] [rbp-8h]\n\nif ( argc <= 1 )\n{\nprintf(\"Usage: %s [file1] ... [fileN]\\n\", *argv);\nexit(1);\n}\ninitscr();\nkeypad(_bss_start, 1);\nnoecho();\nfunc17();\nv8 = 0LL;\nfor ( i = 1; i < argc; ++i )\nv8 = func10(argv[i], v8);\nv7 = *(_QWORD *)(v8 + 296);\nsleep(1u);\nv6 = 1;\nwhile ( v6 )\n{\nwclear(_bss_start);\nfunc17();\nfunc12(v7);\nfunc18();\nprintw(\"\\n\");\nwrefresh(_bss_start);\nv4 = wgetch(_bss_start);\nif ( v4 == 261 )\n{\nfunc13(v7, 1LL);\ngoto LABEL_29;\n}\nif ( v4 > 261 )\ngoto LABEL_28;\nswitch ( v4 )\n{\ncase 260:\nfunc13(v7, 0xFFFFFFFFLL);\ngoto LABEL_29;\ncase 259:\nv7 = *(_QWORD *)(v7 + 304);\ngoto LABEL_29;\ncase 258:\nv7 = *(_QWORD *)(v7 + 296);\ngoto LABEL_29;\ncase 114:\nv7 = func11(v7);\ngoto LABEL_29;\n}\nif ( v4 > 114 )\ngoto LABEL_28;\nif ( v4 == 113 )\n{\nv6 = 0;\ngoto LABEL_29;\n}\nif ( v4 == 97 )\n{\nv7 = func10(0LL, v7);\ngoto LABEL_29;\n}\nif ( v4 > 97 )\n{\nLABEL_28:\nprintw(\"Unrecognized command: %c.\\n\", (unsigned int)v4);\nwrefresh(_bss_start);\nsleep(1u);\nLABEL_29:\nwrefresh(_bss_start);\n}\nelse if ( v4 != 10 )\n{\nif ( v4 == 63 )\n{\nprintw(\"<DOWN> - next card\\n\");\nprintw(\"<UP> - previous card\\n\");\nprintw(\"<LEFT> - bit shift left\\n\");\nprintw(\"<RIGHT> - bit shift right\\n\");\nprintw(\"a - add card\\n\");\nprintw(\"r - remove card\\n\");\nprintw(\"? - this help screen\\n\");\nprintw(\"q - exit program\\n\");\nprintw(\"\\n\");\nprintw(\"Press any key to continue ...\\n\");\nwrefresh(_bss_start);\nwgetch(_bss_start);\ngoto LABEL_29;\n}\ngoto LABEL_28;\n}\n}\nfunc8(v8);\nendwin();\nreturn 0;\n}",
"original_code": "int main(int argc, char **argv)\n{\n CARD_LIST *cards;\n CARD_LIST *cur_card;\n unsigned char loop;\n int command;\n int i;\n if (argc <2)\n {\n printf(\"Usage: %s [file1] ... [fileN]\\n\", argv[0]);\n exit(1);\n }\n initscr();\n keypad(stdscr, 1);\n noecho();\n display_header();\n cards = ((void *)0);\n for (i=1; i<argc; i++)\n {\n cards = add_card(argv[i], cards);\n }\n cur_card = cards->next;\n sleep(1);\n loop = 1;\n while (loop)\n {\n wclear(stdscr);\n display_header();\n display_card(cur_card);\n display_footer();\n printw(\"\\n\");\n wrefresh(stdscr);\n command = wgetch(stdscr);\n switch (command)\n {\n case 0404:\n shift_card(cur_card, -1);\n break;\n case 0405:\n shift_card(cur_card, 1);\n break;\n case 0402:\n cur_card = cur_card->next;\n break;\n case 0403:\n cur_card = cur_card->prev;\n break;\n case 'a':\n cur_card = add_card(((void *)0), cur_card);\n break;\n case 'r':\n cur_card = remove_card(cur_card);\n break;\n case '?':\n printw(\"<DOWN> - next card\\n\");\n printw(\"<UP> - previous card\\n\");\n printw(\"<LEFT> - bit shift left\\n\");\n printw(\"<RIGHT> - bit shift right\\n\");\n printw(\"a - add card\\n\");\n printw(\"r - remove card\\n\");\n printw(\"? - this help screen\\n\");\n printw(\"q - exit program\\n\");\n printw(\"\\n\");\n printw(\"Press any key to continue ...\\n\");\n wrefresh(stdscr);\n wgetch(stdscr);\n break;\n case 'q':\n loop = 0;\n break;\n case '\\n':\n continue;\n default:\n printw(\"Unrecognized command: %c.\\n\", command);\n wrefresh(stdscr);\n sleep(1);\n break;\n }\n wrefresh(stdscr);\n }\n card_list_destroy(cards);\n endwin();\n return 0;\n}",
"canonical_original_code": "int main(int argc, char **argv)\n{\n struct card_list *cards;\n struct card_list *cur_card;\n unsigned char loop;\n int command;\n int i;\n if (argc <2)\n {\n printf(\"Usage: %s [file1] ... [fileN]\\n\", argv[0]);\n exit(1);\n }\n initscr();\n keypad(stdscr, 1);\n noecho();\n display_header();\n cards = ((void *)0);\n for (i=1; i<argc; i++)\n {\n cards = add_card(argv[i], cards);\n }\n cur_card = cards->next;\n sleep(1);\n loop = 1;\n while (loop)\n {\n wclear(stdscr);\n display_header();\n display_card(cur_card);\n display_footer();\n printw(\"\\n\");\n wrefresh(stdscr);\n command = wgetch(stdscr);\n switch (command)\n {\n case 0404:\n shift_card(cur_card, -1);\n break;\n case 0405:\n shift_card(cur_card, 1);\n break;\n case 0402:\n cur_card = cur_card->next;\n break;\n case 0403:\n cur_card = cur_card->prev;\n break;\n case 'a':\n cur_card = add_card(((void *)0), cur_card);\n break;\n case 'r':\n cur_card = remove_card(cur_card);\n break;\n case '?':\n printw(\"<DOWN> - next card\\n\");\n printw(\"<UP> - previous card\\n\");\n printw(\"<LEFT> - bit shift left\\n\");\n printw(\"<RIGHT> - bit shift right\\n\");\n printw(\"a - add card\\n\");\n printw(\"r - remove card\\n\");\n printw(\"? - this help screen\\n\");\n printw(\"q - exit program\\n\");\n printw(\"\\n\");\n printw(\"Press any key to continue ...\\n\");\n wrefresh(stdscr);\n wgetch(stdscr);\n break;\n case 'q':\n loop = 0;\n break;\n case '\\n':\n continue;\n default:\n printw(\"Unrecognized command: %c.\\n\", command);\n wrefresh(stdscr);\n sleep(1);\n break;\n }\n wrefresh(stdscr);\n }\n card_list_destroy(cards);\n endwin();\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char **"
],
[
"cards",
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; } *"
],
[
"cur_card",
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; } *"
],
[
"loop",
"unsigned char"
],
[
"command",
"int"
],
[
"i",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct card_list { char filename[32]; unsigned char raw_card[128]; unsigned char mod_card[128]; int offset; struct card_list *next; struct card_list *prev; }"
],
"binary_hash": "5f4c4b42f6ef256d5930a09d5141bf371f6e802e256e125a9e0b2858efe05cf1"
}
] |
66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a | ioerror/libmsr | [
[
"msr_cmd",
"->",
"msr_zeros",
"msr_commtest",
"msr_fwrev",
"msr_model",
"msr_flash_led",
"msr_sensor_test",
"msr_ram_test",
"msr_set_hi_co",
"msr_set_lo_co",
"msr_reset",
"msr_iso_read",
"msr_erase",
"msr_iso_write",
"msr_raw_read",
"msr_raw_write",
"msr_set_bpi",
"msr_set_bpc"
],
[
"msr_zeros",
"->",
"msr_cmd"
],
[
"getstart",
"->",
"msr_iso_read",
"msr_raw_read"
],
[
"getend",
"->",
"msr_iso_read",
"msr_raw_read"
],
[
"msr_commtest",
"->",
"msr_cmd",
"msr_init"
],
[
"msr_fwrev",
"->",
"msr_cmd"
],
[
"msr_model",
"->",
"msr_cmd"
],
[
"msr_flash_led",
"->",
"msr_cmd"
],
[
"gettrack_iso",
"->",
"msr_iso_read"
],
[
"gettrack_raw",
"->",
"msr_raw_read"
],
[
"msr_sensor_test",
"->",
"msr_cmd"
],
[
"msr_ram_test",
"->",
"msr_cmd"
],
[
"msr_set_hi_co",
"->",
"msr_cmd"
],
[
"msr_set_lo_co",
"->",
"msr_cmd"
],
[
"msr_reset",
"->",
"msr_cmd",
"msr_init"
],
[
"msr_iso_read",
"->",
"msr_cmd",
"getstart",
"gettrack_iso",
"getend"
],
[
"msr_erase",
"->",
"msr_cmd"
],
[
"msr_iso_write",
"->",
"msr_cmd"
],
[
"msr_raw_read",
"->",
"msr_cmd",
"getstart",
"gettrack_raw",
"getend"
],
[
"msr_raw_write",
"->",
"msr_cmd"
],
[
"msr_init",
"->",
"msr_reset",
"msr_commtest"
],
[
"msr_set_bpi",
"->",
"msr_cmd"
],
[
"msr_set_bpc",
"->",
"msr_cmd"
]
] | [] | [
{
"name": "msr_cmd",
"canonical_name": "func0",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_cmd(unsigned int a1, char a2)\n{\nchar v3[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nv3[0] = 27;\nv3[1] = a2;\nreturn serial_write(a1, v3, 2LL);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(unsigned int a1, char a2)\n{\nchar v3[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nv3[0] = 27;\nv3[1] = a2;\nreturn serial_write(a1, v3, 2LL);\n}",
"original_code": "int\nmsr_cmd (int fd, uint8_t c)\n{\n msr_cmd_t cmd;\n cmd.msr_esc = 0x1B;\n cmd.msr_cmd = c;\n return (serial_write (fd, &cmd, sizeof(cmd)));\n}",
"canonical_original_code": "int msr_cmd(int fd, unsigned char c)\n{\n struct msr_cmd cmd;\n cmd.msr_esc = 0x1B;\n cmd.msr_cmd = c;\n return (serial_write (fd, &cmd, sizeof(cmd)));\n}",
"variable_types": [
[
"fd",
"int"
],
[
"c",
"unsigned char"
],
[
"cmd",
"struct msr_cmd { unsigned char msr_esc; unsigned char msr_cmd; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct msr_cmd { unsigned char msr_esc; unsigned char msr_cmd; }"
],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_zeros",
"canonical_name": "func1",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_zeros(unsigned int a1)\n{\nchar v2[3]; // [rsp+1Dh] [rbp-3h] BYREF\n\nmsr_cmd(a1, 108);\nserial_read(a1, v2, 3LL);\nprintf(\"zero13: %d zero: %d\\n\", (unsigned __int8)v2[1], (unsigned __int8)v2[2]);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(unsigned int a1)\n{\nchar v2[3]; // [rsp+1Dh] [rbp-3h] BYREF\n\nfunc0(a1, 108);\nserial_read(a1, v2, 3LL);\nprintf(\"zero13: %d zero: %d\\n\", (unsigned __int8)v2[1], (unsigned __int8)v2[2]);\nreturn 0LL;\n}",
"original_code": "int msr_zeros (int fd)\n{\n msr_lz_t lz;\n msr_cmd (fd, 0x6C);\n serial_read (fd, &lz, sizeof(lz));\n printf(\"zero13: %d zero: %d\\n\", lz.msr_lz_tk1_3, lz.msr_lz_tk2);\n return (0);\n}",
"canonical_original_code": "int msr_zeros(int fd)\n{\n struct msr_lz lz;\n msr_cmd (fd, 0x6C);\n serial_read (fd, &lz, sizeof(lz));\n printf(\"zero13: %d zero: %d\\n\", lz.msr_lz_tk1_3, lz.msr_lz_tk2);\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"lz",
"struct msr_lz { unsigned char msr_esc; unsigned char msr_lz_tk1_3; unsigned char msr_lz_tk2; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct msr_lz { unsigned char msr_esc; unsigned char msr_lz_tk1_3; unsigned char msr_lz_tk2; }"
],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "getstart",
"canonical_name": "func2",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall getstart(unsigned int a1)\n{\n__int64 result; // rax\nchar v2; // [rsp+17h] [rbp-9h] BYREF\nint v3; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i <= 2; ++i )\n{\nv3 = serial_readchar(a1, &v2);\nif ( v2 == 115 )\nbreak;\n}\nif ( i == 3 )\nresult = 0xFFFFFFFFLL;\nelse\nresult = 0LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(unsigned int a1)\n{\n__int64 result; // rax\nchar v2; // [rsp+17h] [rbp-9h] BYREF\nint v3; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i <= 2; ++i )\n{\nv3 = serial_readchar(a1, &v2);\nif ( v2 == 115 )\nbreak;\n}\nif ( i == 3 )\nresult = 0xFFFFFFFFLL;\nelse\nresult = 0LL;\nreturn result;\n}",
"original_code": "static int\ngetstart (int fd)\n{\n uint8_t b;\n int i, r;\n for (i = 0; i < 3; i++) {\n r = serial_readchar(fd, &b);\n if (b == 0x73)\n break;\n }\n if (i == 3)\n return (-1);\n return (0);\n}",
"canonical_original_code": "static int getstart(int fd)\n{\n unsigned char b;\n int i; int r;\n for (i = 0; i < 3; i++) {\n r = serial_readchar(fd, &b);\n if (b == 0x73)\n break;\n }\n if (i == 3)\n return (-1);\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"b",
"unsigned char"
],
[
"i",
"int"
],
[
"r",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "getend",
"canonical_name": "func3",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall getend(unsigned int a1)\n{\nchar v2[3]; // [rsp+1Ch] [rbp-4h] BYREF\nunsigned __int8 v3; // [rsp+1Fh] [rbp-1h]\n\nserial_read(a1, v2, 4LL);\nif ( v3 == 48 )\nreturn 0LL;\nprintf(\"read returned error status: 0x%x\\n\", v3);\nreturn 0xFFFFFFFFLL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(unsigned int a1)\n{\nchar v2[3]; // [rsp+1Ch] [rbp-4h] BYREF\nunsigned __int8 v3; // [rsp+1Fh] [rbp-1h]\n\nserial_read(a1, v2, 4LL);\nif ( v3 == 48 )\nreturn 0LL;\nprintf(\"read returned error status: 0x%x\\n\", v3);\nreturn 0xFFFFFFFFLL;\n}",
"original_code": "static int\ngetend (int fd)\n{\n msr_end_t m;\n serial_read (fd, &m, sizeof(m));\n if (m.msr_sts != 0x30) {\n printf (\"read returned error status: 0x%x\\n\", m.msr_sts);\n return (-1);\n }\n return (0);\n}",
"canonical_original_code": "static int getend(int fd)\n{\n struct msr_end m;\n serial_read (fd, &m, sizeof(m));\n if (m.msr_sts != 0x30) {\n printf (\"read returned error status: 0x%x\\n\", m.msr_sts);\n return (-1);\n }\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"m",
"struct msr_end { unsigned char msr_enddelim; unsigned char msr_fs; unsigned char msr_esc; unsigned char msr_sts; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct msr_end { unsigned char msr_enddelim; unsigned char msr_fs; unsigned char msr_esc; unsigned char msr_sts; }"
],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_commtest",
"canonical_name": "func4",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_commtest(unsigned int a1)\n{\nchar v2[2]; // [rsp+1Ah] [rbp-6h] BYREF\nint v3; // [rsp+1Ch] [rbp-4h]\n\nv3 = msr_cmd(a1, 101);\nif ( v3 == -1 )\nerr(1, \"Commtest write failed\");\ndo\nserial_readchar(a1, v2);\nwhile ( v2[0] != 121 );\nputs(\"Communications test passed.\");\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(unsigned int a1)\n{\nchar v2[2]; // [rsp+1Ah] [rbp-6h] BYREF\nint v3; // [rsp+1Ch] [rbp-4h]\n\nv3 = func0(a1, 101);\nif ( v3 == -1 )\nerr(1, \"Commtest write failed\");\ndo\nserial_readchar(a1, v2);\nwhile ( v2[0] != 121 );\nputs(\"Communications test passed.\");\nreturn 0LL;\n}",
"original_code": "int\nmsr_commtest (int fd)\n{\n int r;\n uint8_t buf[2];\n r = msr_cmd (fd, 0x65);\n if (r == -1)\n err(1, \"Commtest write failed\");\n while (1) {\n serial_readchar (fd, &buf[0]);\n if (buf[0] == 0x79)\n break;\n }\n if (buf[0] != 0x79) {\n printf(\"Communications test failure\\n\");\n return (-1);\n } else\n printf(\"Communications test passed.\\n\");\n return (0);\n}",
"canonical_original_code": "int msr_commtest(int fd)\n{\n int r;\n unsigned char buf[2];\n r = msr_cmd (fd, 0x65);\n if (r == -1)\n err(1, \"Commtest write failed\");\n while (1) {\n serial_readchar (fd, &buf[0]);\n if (buf[0] == 0x79)\n break;\n }\n if (buf[0] != 0x79) {\n printf(\"Communications test failure\\n\");\n return (-1);\n } else\n printf(\"Communications test passed.\\n\");\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"r",
"int"
],
[
"buf",
"unsigned char [2]"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_fwrev",
"canonical_name": "func5",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_fwrev(unsigned int a1)\n{\nchar s[64]; // [rsp+10h] [rbp-40h] BYREF\n\nbzero(s, 0x40uLL);\nif ( (unsigned int)msr_cmd(a1, 118) )\nreturn 0xFFFFFFFFLL;\nserial_readchar(a1, s);\nserial_read(a1, s, 8LL);\ns[8] = 0;\nprintf(\"Firmware Version: %s\\n\", s);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(unsigned int a1)\n{\nchar s[64]; // [rsp+10h] [rbp-40h] BYREF\n\nbzero(s, 0x40uLL);\nif ( (unsigned int)func0(a1, 118) )\nreturn 0xFFFFFFFFLL;\nserial_readchar(a1, s);\nserial_read(a1, s, 8LL);\ns[8] = 0;\nprintf(\"Firmware Version: %s\\n\", s);\nreturn 0LL;\n}",
"original_code": "int\nmsr_fwrev (int fd)\n{\n uint8_t buf[64];\n bzero (buf, sizeof(buf));\n if (msr_cmd (fd, 0x76) != 0)\n return (-1);\n serial_readchar (fd, &buf[0]);\n serial_read (fd, buf, 8);\n buf[8] = '\\0';\n printf (\"Firmware Version: %s\\n\", buf);\n return (0);\n}",
"canonical_original_code": "int msr_fwrev(int fd)\n{\n unsigned char buf[64];\n bzero (buf, sizeof(buf));\n if (msr_cmd (fd, 0x76) != 0)\n return (-1);\n serial_readchar (fd, &buf[0]);\n serial_read (fd, buf, 8);\n buf[8] = '\\0';\n printf (\"Firmware Version: %s\\n\", buf);\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"buf",
"unsigned char [64]"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_model",
"canonical_name": "func6",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_model(unsigned int a1)\n{\nchar v2[3]; // [rsp+1Dh] [rbp-3h] BYREF\n\nmsr_cmd(a1, 116);\nserial_read(a1, v2, 3LL);\nif ( v2[2] != 83 )\nreturn 1LL;\nprintf(\"Device Model: MSR-206-%c\\n\", (unsigned __int8)v2[1]);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func6(unsigned int a1)\n{\nchar v2[3]; // [rsp+1Dh] [rbp-3h] BYREF\n\nfunc0(a1, 116);\nserial_read(a1, v2, 3LL);\nif ( v2[2] != 83 )\nreturn 1LL;\nprintf(\"Device Model: MSR-206-%c\\n\", (unsigned __int8)v2[1]);\nreturn 0LL;\n}",
"original_code": "int\nmsr_model (int fd)\n{\n msr_model_t m;\n msr_cmd (fd, 0x74);\n serial_read (fd, &m, sizeof(m));\n if (m.msr_s != 0x53)\n return (1);\n printf(\"Device Model: MSR-206-%c\\n\", m.msr_model);\n return (0);\n}",
"canonical_original_code": "int msr_model(int fd)\n{\n struct msr_model m;\n msr_cmd (fd, 0x74);\n serial_read (fd, &m, sizeof(m));\n if (m.msr_s != 0x53)\n return (1);\n printf(\"Device Model: MSR-206-%c\\n\", m.msr_model);\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"m",
"struct msr_model { unsigned char msr_esc; unsigned char msr_model; unsigned char msr_s; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct msr_model { unsigned char msr_esc; unsigned char msr_model; unsigned char msr_s; }"
],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_flash_led",
"canonical_name": "func7",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_flash_led(unsigned int a1, char a2)\n{\nif ( (unsigned int)msr_cmd(a1, a2) == -1 )\nerr(1, \"LED failure\");\nusleep(0x186A0u);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(unsigned int a1, char a2)\n{\nif ( (unsigned int)func0(a1, a2) == -1 )\nerr(1, \"LED failure\");\nusleep(0x186A0u);\nreturn 0LL;\n}",
"original_code": "int\nmsr_flash_led (int fd, uint8_t led)\n{\n int r;\n r = msr_cmd (fd, led);\n if (r == -1)\n err(1, \"LED failure\");\n usleep (100000);\n return (0);\n}",
"canonical_original_code": "int msr_flash_led(int fd, unsigned char led)\n{\n int r;\n r = msr_cmd (fd, led);\n if (r == -1)\n err(1, \"LED failure\");\n usleep (100000);\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"led",
"unsigned char"
],
[
"r",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "gettrack_iso",
"canonical_name": "func8",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall gettrack_iso(unsigned int a1, int a2, __int64 a3, _BYTE *a4)\n{\n__int64 result; // rax\nunsigned __int8 v7; // [rsp+27h] [rbp-9h] BYREF\nint v8; // [rsp+28h] [rbp-8h]\nint v9; // [rsp+2Ch] [rbp-4h]\n\nv9 = 0;\nv8 = 0;\nserial_readchar(a1, &v7);\nif ( v7 == 27 )\n{\nserial_readchar(a1, &v7);\nif ( a2 == v7 )\n{\nwhile ( 1 )\n{\ndo\n{\ndo\nserial_readchar(a1, &v7);\nwhile ( v7 == 37 );\n}\nwhile ( v7 == 59 );\nif ( v7 == 63 || v7 == 27 )\nbreak;\nif ( v9 < (unsigned __int8)*a4 )\n{\n++v8;\n*(_BYTE *)(a3 + v9) = v7;\n}\n++v9;\n}\nif ( v7 == 63 )\n{\n*a4 = v8;\nresult = 0LL;\n}\nelse\n{\n*a4 = 0;\nserial_readchar(a1, &v7);\nresult = 0xFFFFFFFFLL;\n}\n}\nelse\n{\n*a4 = 0;\nresult = 0xFFFFFFFFLL;\n}\n}\nelse\n{\n*a4 = 0;\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func8(unsigned int a1, int a2, __int64 a3, _BYTE *a4)\n{\n__int64 result; // rax\nunsigned __int8 v7; // [rsp+27h] [rbp-9h] BYREF\nint v8; // [rsp+28h] [rbp-8h]\nint v9; // [rsp+2Ch] [rbp-4h]\n\nv9 = 0;\nv8 = 0;\nserial_readchar(a1, &v7);\nif ( v7 == 27 )\n{\nserial_readchar(a1, &v7);\nif ( a2 == v7 )\n{\nwhile ( 1 )\n{\ndo\n{\ndo\nserial_readchar(a1, &v7);\nwhile ( v7 == 37 );\n}\nwhile ( v7 == 59 );\nif ( v7 == 63 || v7 == 27 )\nbreak;\nif ( v9 < (unsigned __int8)*a4 )\n{\n++v8;\n*(_BYTE *)(a3 + v9) = v7;\n}\n++v9;\n}\nif ( v7 == 63 )\n{\n*a4 = v8;\nresult = 0LL;\n}\nelse\n{\n*a4 = 0;\nserial_readchar(a1, &v7);\nresult = 0xFFFFFFFFLL;\n}\n}\nelse\n{\n*a4 = 0;\nresult = 0xFFFFFFFFLL;\n}\n}\nelse\n{\n*a4 = 0;\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}",
"original_code": "static int\ngettrack_iso (int fd, int t, uint8_t * buf, uint8_t * len)\n{\n uint8_t b;\n int i = 0;\n int l = 0;\n serial_readchar (fd, &b);\n if (b != 0x1B) {\n *len = 0;\n return (-1);\n }\n serial_readchar (fd, &b);\n if (b != t) {\n *len = 0;\n return (-1);\n }\n while (1) {\n serial_readchar (fd, &b);\n if (b == '%')\n continue;\n if (b == ';')\n continue;\n if (b == 0x3F)\n break;\n if (b == 0x1B)\n break;\n if (i < *len) {\n l++;\n buf[i] = b;\n }\n i++;\n }\n if (b == 0x3F) {\n *len = l;\n return (0);\n } else {\n *len = 0;\n serial_readchar (fd, &b);\n }\n return (-1);\n}",
"canonical_original_code": "static int gettrack_iso(int fd, int t, unsigned char *buf, unsigned char *len)\n{\n unsigned char b;\n int i = 0;\n int l = 0;\n serial_readchar (fd, &b);\n if (b != 0x1B) {\n *len = 0;\n return (-1);\n }\n serial_readchar (fd, &b);\n if (b != t) {\n *len = 0;\n return (-1);\n }\n while (1) {\n serial_readchar (fd, &b);\n if (b == '%')\n continue;\n if (b == ';')\n continue;\n if (b == 0x3F)\n break;\n if (b == 0x1B)\n break;\n if (i < *len) {\n l++;\n buf[i] = b;\n }\n i++;\n }\n if (b == 0x3F) {\n *len = l;\n return (0);\n } else {\n *len = 0;\n serial_readchar (fd, &b);\n }\n return (-1);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"t",
"int"
],
[
"buf",
"unsigned char *"
],
[
"len",
"unsigned char *"
],
[
"b",
"unsigned char"
],
[
"i",
"int"
],
[
"l",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "gettrack_raw",
"canonical_name": "func9",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall gettrack_raw(unsigned int a1, int a2, __int64 a3, _BYTE *a4)\n{\n__int64 result; // rax\nunsigned __int8 v7; // [rsp+26h] [rbp-Ah] BYREF\nunsigned __int8 v8; // [rsp+27h] [rbp-9h] BYREF\nint v9; // [rsp+28h] [rbp-8h]\nint i; // [rsp+2Ch] [rbp-4h]\n\ni = 0;\nv9 = 0;\nserial_readchar(a1, &v8);\nif ( v8 == 27 )\n{\nserial_readchar(a1, &v8);\nif ( a2 == v8 )\n{\nserial_readchar(a1, &v7);\nif ( v7 )\n{\nfor ( i = 0; i < v7; ++i )\n{\nserial_readchar(a1, &v8);\nif ( i < (unsigned __int8)*a4 )\n{\n++v9;\n*(_BYTE *)(a3 + i) = v8;\n}\n}\n*a4 = v9;\nresult = 0LL;\n}\nelse\n{\n*a4 = 0;\nresult = 0LL;\n}\n}\nelse\n{\n*a4 = 0;\nresult = 0xFFFFFFFFLL;\n}\n}\nelse\n{\n*a4 = 0;\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func9(unsigned int a1, int a2, __int64 a3, _BYTE *a4)\n{\n__int64 result; // rax\nunsigned __int8 v7; // [rsp+26h] [rbp-Ah] BYREF\nunsigned __int8 v8; // [rsp+27h] [rbp-9h] BYREF\nint v9; // [rsp+28h] [rbp-8h]\nint i; // [rsp+2Ch] [rbp-4h]\n\ni = 0;\nv9 = 0;\nserial_readchar(a1, &v8);\nif ( v8 == 27 )\n{\nserial_readchar(a1, &v8);\nif ( a2 == v8 )\n{\nserial_readchar(a1, &v7);\nif ( v7 )\n{\nfor ( i = 0; i < v7; ++i )\n{\nserial_readchar(a1, &v8);\nif ( i < (unsigned __int8)*a4 )\n{\n++v9;\n*(_BYTE *)(a3 + i) = v8;\n}\n}\n*a4 = v9;\nresult = 0LL;\n}\nelse\n{\n*a4 = 0;\nresult = 0LL;\n}\n}\nelse\n{\n*a4 = 0;\nresult = 0xFFFFFFFFLL;\n}\n}\nelse\n{\n*a4 = 0;\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}",
"original_code": "static int\ngettrack_raw (int fd, int t, uint8_t * buf, uint8_t * len)\n{\n uint8_t b, s;\n int i = 0;\n int l = 0;\n serial_readchar (fd, &b);\n if (b != 0x1B) {\n *len = 0;\n return (-1);\n }\n serial_readchar (fd, &b);\n if (b != t) {\n *len = 0;\n return (-1);\n }\n serial_readchar (fd, &s);\n if (!s) {\n *len = 0;\n return (0);\n }\n for (i = 0; i < s; i++) {\n serial_readchar (fd, &b);\n if (i < *len) {\n l++;\n buf[i] = b;\n }\n }\n *len = l;\n return (0);\n}",
"canonical_original_code": "static int gettrack_raw(int fd, int t, unsigned char *buf, unsigned char *len)\n{\n unsigned char b; unsigned char s;\n int i = 0;\n int l = 0;\n serial_readchar (fd, &b);\n if (b != 0x1B) {\n *len = 0;\n return (-1);\n }\n serial_readchar (fd, &b);\n if (b != t) {\n *len = 0;\n return (-1);\n }\n serial_readchar (fd, &s);\n if (!s) {\n *len = 0;\n return (0);\n }\n for (i = 0; i < s; i++) {\n serial_readchar (fd, &b);\n if (i < *len) {\n l++;\n buf[i] = b;\n }\n }\n *len = l;\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"t",
"int"
],
[
"buf",
"unsigned char *"
],
[
"len",
"unsigned char *"
],
[
"b",
"unsigned char"
],
[
"s",
"unsigned char"
],
[
"i",
"int"
],
[
"l",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_sensor_test",
"canonical_name": "func10",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_sensor_test(unsigned int a1)\n{\n__int64 result; // rax\nchar v2[4]; // [rsp+1Ch] [rbp-4h] BYREF\n\nmsr_cmd(a1, 134);\nputs(\"Attempting sensor test -- please slide a card...\");\nserial_read(a1, v2, 2LL);\nif ( v2[0] == 27 && v2[1] == 48 )\n{\nputs(\"Sensor test successfull\");\nresult = 0LL;\n}\nelse\n{\nputs(\"It appears that the sensor did not sense a magnetic card.\");\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func10(unsigned int a1)\n{\n__int64 result; // rax\nchar v2[4]; // [rsp+1Ch] [rbp-4h] BYREF\n\nfunc0(a1, 134);\nputs(\"Attempting sensor test -- please slide a card...\");\nserial_read(a1, v2, 2LL);\nif ( v2[0] == 27 && v2[1] == 48 )\n{\nputs(\"Sensor test successfull\");\nresult = 0LL;\n}\nelse\n{\nputs(\"It appears that the sensor did not sense a magnetic card.\");\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}",
"original_code": "int\nmsr_sensor_test (int fd)\n{\n uint8_t b[4];\n msr_cmd (fd, 0x86);\n printf(\"Attempting sensor test -- please slide a card...\\n\");\n serial_read (fd, &b, 2);\n if (b[0] == 0x1B && b[1] == 0x30) {\n printf(\"Sensor test successfull\\n\");\n return 0;\n }\n printf(\"It appears that the sensor did not sense a magnetic card.\\n\");\n return (-1);\n}",
"canonical_original_code": "int msr_sensor_test(int fd)\n{\n unsigned char b[4];\n msr_cmd (fd, 0x86);\n printf(\"Attempting sensor test -- please slide a card...\\n\");\n serial_read (fd, &b, 2);\n if (b[0] == 0x1B && b[1] == 0x30) {\n printf(\"Sensor test successfull\\n\");\n return 0;\n }\n printf(\"It appears that the sensor did not sense a magnetic card.\\n\");\n return (-1);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"b",
"unsigned char [4]"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_ram_test",
"canonical_name": "func11",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_ram_test(unsigned int a1)\n{\n__int64 result; // rax\nchar v2[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nputs(\"Running ram test...\");\nmsr_cmd(a1, 135);\nserial_read(a1, v2, 2LL);\nif ( v2[0] == 27 && v2[1] == 48 )\n{\nputs(\"RAM test successfull.\");\nresult = 0LL;\n}\nelse\n{\nputs(\"It appears that the RAM test failed\");\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func11(unsigned int a1)\n{\n__int64 result; // rax\nchar v2[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nputs(\"Running ram test...\");\nfunc0(a1, 135);\nserial_read(a1, v2, 2LL);\nif ( v2[0] == 27 && v2[1] == 48 )\n{\nputs(\"RAM test successfull.\");\nresult = 0LL;\n}\nelse\n{\nputs(\"It appears that the RAM test failed\");\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}",
"original_code": "int\nmsr_ram_test (int fd)\n{\n uint8_t b[2];\n printf(\"Running ram test...\\n\");\n msr_cmd (fd, 0x87);\n serial_read(fd, b, sizeof(b));\n if (b[0] == 0x1B && b[1] == 0x30) {\n printf(\"RAM test successfull.\\n\");\n return (0);\n }\n printf(\"It appears that the RAM test failed\\n\");\n return (-1);\n}",
"canonical_original_code": "int msr_ram_test(int fd)\n{\n unsigned char b[2];\n printf(\"Running ram test...\\n\");\n msr_cmd (fd, 0x87);\n serial_read(fd, b, sizeof(b));\n if (b[0] == 0x1B && b[1] == 0x30) {\n printf(\"RAM test successfull.\\n\");\n return (0);\n }\n printf(\"It appears that the RAM test failed\\n\");\n return (-1);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"b",
"unsigned char [2]"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_set_hi_co",
"canonical_name": "func12",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_set_hi_co(unsigned int a1)\n{\n__int64 result; // rax\nchar v2[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nputs(\"Putting the writer to Hi-Co mode...\");\nmsr_cmd(a1, 120);\nserial_read(a1, v2, 2LL);\nif ( v2[0] == 27 && v2[1] == 48 )\n{\nputs(\"We were able to put the writer into Hi-Co mode.\");\nresult = 0LL;\n}\nelse\n{\nprintf(\"It appears that the reader did not switch to Hi-Co mode.\");\nresult = 1LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func12(unsigned int a1)\n{\n__int64 result; // rax\nchar v2[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nputs(\"Putting the writer to Hi-Co mode...\");\nfunc0(a1, 120);\nserial_read(a1, v2, 2LL);\nif ( v2[0] == 27 && v2[1] == 48 )\n{\nputs(\"We were able to put the writer into Hi-Co mode.\");\nresult = 0LL;\n}\nelse\n{\nprintf(\"It appears that the reader did not switch to Hi-Co mode.\");\nresult = 1LL;\n}\nreturn result;\n}",
"original_code": "int\nmsr_set_hi_co (int fd)\n{\n char b[2];\n printf(\"Putting the writer to Hi-Co mode...\\n\");\n msr_cmd (fd, 0x78);\n serial_read (fd, &b, 2);\n if (b[0] == 0x1B && b[1] == 0x30) {\n printf(\"We were able to put the writer into Hi-Co mode.\\n\");\n return (0);\n }\n printf(\"It appears that the reader did not switch to Hi-Co mode.\");\n return (1);\n}",
"canonical_original_code": "int msr_set_hi_co(int fd)\n{\n char b[2];\n printf(\"Putting the writer to Hi-Co mode...\\n\");\n msr_cmd (fd, 0x78);\n serial_read (fd, &b, 2);\n if (b[0] == 0x1B && b[1] == 0x30) {\n printf(\"We were able to put the writer into Hi-Co mode.\\n\");\n return (0);\n }\n printf(\"It appears that the reader did not switch to Hi-Co mode.\");\n return (1);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"b",
"char [2]"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_set_lo_co",
"canonical_name": "func13",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_set_lo_co(unsigned int a1)\n{\n__int64 result; // rax\nchar v2[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nputs(\"Putting the writer to Lo-Co mode...\");\nmsr_cmd(a1, 121);\nserial_read(a1, v2, 2LL);\nif ( v2[0] == 27 && v2[1] == 48 )\n{\nputs(\"We were able to put the writer into Lo-Co mode.\");\nresult = 0LL;\n}\nelse\n{\nprintf(\"It appears that the reader did not switch to Lo-Co mode.\");\nresult = 1LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func13(unsigned int a1)\n{\n__int64 result; // rax\nchar v2[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nputs(\"Putting the writer to Lo-Co mode...\");\nfunc0(a1, 121);\nserial_read(a1, v2, 2LL);\nif ( v2[0] == 27 && v2[1] == 48 )\n{\nputs(\"We were able to put the writer into Lo-Co mode.\");\nresult = 0LL;\n}\nelse\n{\nprintf(\"It appears that the reader did not switch to Lo-Co mode.\");\nresult = 1LL;\n}\nreturn result;\n}",
"original_code": "int\nmsr_set_lo_co (int fd)\n{\n char b[2];\n printf(\"Putting the writer to Lo-Co mode...\\n\");\n msr_cmd (fd, 0x79);\n serial_read (fd, &b, 2);\n if (b[0] == 0x1B && b[1] == 0x30) {\n printf(\"We were able to put the writer into Lo-Co mode.\\n\");\n return (0);\n }\n printf(\"It appears that the reader did not switch to Lo-Co mode.\");\n return (1);\n}",
"canonical_original_code": "int msr_set_lo_co(int fd)\n{\n char b[2];\n printf(\"Putting the writer to Lo-Co mode...\\n\");\n msr_cmd (fd, 0x79);\n serial_read (fd, &b, 2);\n if (b[0] == 0x1B && b[1] == 0x30) {\n printf(\"We were able to put the writer into Lo-Co mode.\\n\");\n return (0);\n }\n printf(\"It appears that the reader did not switch to Lo-Co mode.\");\n return (1);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"b",
"char [2]"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_reset",
"canonical_name": "func14",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_reset(unsigned int a1)\n{\nmsr_cmd(a1, 97);\nusleep(0x186A0u);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func14(unsigned int a1)\n{\nfunc0(a1, 97);\nusleep(0x186A0u);\nreturn 0LL;\n}",
"original_code": "int\nmsr_reset (int fd)\n{\n msr_cmd (fd, 0x61);\n usleep (100000);\n return (0);\n}",
"canonical_original_code": "int msr_reset(int fd)\n{\n msr_cmd (fd, 0x61);\n usleep (100000);\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_iso_read",
"canonical_name": "func15",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_iso_read(unsigned int a1, __int64 a2)\n{\nint i; // [rsp+1Ch] [rbp-4h]\n\nif ( (unsigned int)msr_cmd(a1, 114) == -1 )\nerr(1, \"Command write failed\");\nif ( (unsigned int)getstart(a1) == -1 )\nerr(1, \"get start delimiter failed\");\nfor ( i = 0; i <= 2; ++i )\ngettrack_iso(a1, i + 1, a2 + ((__int64)i << 8), (_BYTE *)(((__int64)i << 8) + 240 + a2 + 15));\nif ( (unsigned int)getend(a1) != -1 )\nreturn 0LL;\nwarnx(\"read failed\");\nreturn 0xFFFFFFFFLL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func15(unsigned int a1, __int64 a2)\n{\nint i; // [rsp+1Ch] [rbp-4h]\n\nif ( (unsigned int)func0(a1, 114) == -1 )\nerr(1, \"Command write failed\");\nif ( (unsigned int)func2(a1) == -1 )\nerr(1, \"get start delimiter failed\");\nfor ( i = 0; i <= 2; ++i )\nfunc8(a1, i + 1, a2 + ((__int64)i << 8), (_BYTE *)(((__int64)i << 8) + 240 + a2 + 15));\nif ( (unsigned int)func3(a1) != -1 )\nreturn 0LL;\nwarnx(\"read failed\");\nreturn 0xFFFFFFFFLL;\n}",
"original_code": "int\nmsr_iso_read(int fd, msr_tracks_t * tracks)\n{\n int r;\n int i;\n r = msr_cmd (fd, 0x72);\n if (r == -1)\n err(1, \"Command write failed\");\n if (getstart (fd) == -1)\n err(1, \"get start delimiter failed\");\n for (i = 0; i < 3; i++)\n gettrack_iso (fd, i + 1, tracks->msr_tracks[i].msr_tk_data,\n &tracks->msr_tracks[i].msr_tk_len);\n if (getend (fd) == -1) {\n warnx(\"read failed\");\n return (-1);\n }\n return (0);\n}",
"canonical_original_code": "int msr_iso_read(int fd, struct msr_tracks *tracks)\n{\n int r;\n int i;\n r = msr_cmd (fd, 0x72);\n if (r == -1)\n err(1, \"Command write failed\");\n if (getstart (fd) == -1)\n err(1, \"get start delimiter failed\");\n for (i = 0; i < 3; i++)\n gettrack_iso (fd, i + 1, tracks->msr_tracks[i].msr_tk_data,\n &tracks->msr_tracks[i].msr_tk_len);\n if (getend (fd) == -1) {\n warnx(\"read failed\");\n return (-1);\n }\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"tracks",
"struct msr_tracks { struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; } msr_tracks[3]; } *"
],
[
"r",
"int"
],
[
"i",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct msr_tracks { struct msr_track msr_tracks[3]; }",
"struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; }"
],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_erase",
"canonical_name": "func16",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_erase(unsigned int a1, char a2)\n{\n__int64 result; // rax\nchar v3[4]; // [rsp+8h] [rbp-18h] BYREF\nunsigned int v4; // [rsp+Ch] [rbp-14h]\nunsigned __int8 v5; // [rsp+1Eh] [rbp-2h] BYREF\nunsigned __int8 v6; // [rsp+1Fh] [rbp-1h]\n\nv4 = a1;\nv3[0] = a2;\nmsr_cmd(a1, 99);\nserial_write(a1, v3, 1LL);\nif ( (unsigned int)serial_read(v4, &v5, 2LL) == -1 )\nerr(1, \"read erase response failed\");\nif ( v5 == 27 && v6 == 48 )\n{\nputs(\"Erase successfull\");\nresult = 0LL;\n}\nelse\n{\nprintf(\"%x %x\\n\", v5, v6);\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func16(unsigned int a1, char a2)\n{\n__int64 result; // rax\nchar v3[4]; // [rsp+8h] [rbp-18h] BYREF\nunsigned int v4; // [rsp+Ch] [rbp-14h]\nunsigned __int8 v5; // [rsp+1Eh] [rbp-2h] BYREF\nunsigned __int8 v6; // [rsp+1Fh] [rbp-1h]\n\nv4 = a1;\nv3[0] = a2;\nfunc0(a1, 99);\nserial_write(a1, v3, 1LL);\nif ( (unsigned int)serial_read(v4, &v5, 2LL) == -1 )\nerr(1, \"read erase response failed\");\nif ( v5 == 27 && v6 == 48 )\n{\nputs(\"Erase successfull\");\nresult = 0LL;\n}\nelse\n{\nprintf(\"%x %x\\n\", v5, v6);\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}",
"original_code": "int\nmsr_erase (int fd, uint8_t tracks)\n{\n uint8_t b[2];\n msr_cmd (fd, 0x63);\n serial_write (fd, &tracks, 1);\n if (serial_read (fd, b, 2) == -1)\n err(1, \"read erase response failed\");\n if (b[0] == 0x1B && b[1] == 0x30) {\n printf(\"Erase successfull\\n\");\n return (0);\n } else\n printf (\"%x %x\\n\", b[0], b[1]);\n return (-1);\n}",
"canonical_original_code": "int msr_erase(int fd, unsigned char tracks)\n{\n unsigned char b[2];\n msr_cmd (fd, 0x63);\n serial_write (fd, &tracks, 1);\n if (serial_read (fd, b, 2) == -1)\n err(1, \"read erase response failed\");\n if (b[0] == 0x1B && b[1] == 0x30) {\n printf(\"Erase successfull\\n\");\n return (0);\n } else\n printf (\"%x %x\\n\", b[0], b[1]);\n return (-1);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"tracks",
"unsigned char"
],
[
"b",
"unsigned char [2]"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_iso_write",
"canonical_name": "func17",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_iso_write(unsigned int a1, __int64 a2)\n{\nchar v3; // [rsp+18h] [rbp-8h] BYREF\nchar v4; // [rsp+19h] [rbp-7h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nmsr_cmd(a1, 119);\nv3 = 27;\nv4 = 115;\nserial_write(a1, &v3, 2LL);\nfor ( i = 0; i <= 2; ++i )\n{\nv3 = 27;\nv4 = i + 1;\nserial_write(a1, &v3, 2LL);\nserial_write(a1, a2 + ((__int64)i << 8), *(unsigned __int8 *)(a2 + ((__int64)i << 8) + 255));\n}\nv3 = 63;\nv4 = 28;\nserial_write(a1, &v3, 2LL);\nserial_readchar(a1, &v3);\nserial_readchar(a1, &v3);\nif ( v3 != 48 )\nwarnx(\"write failed\");\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func17(unsigned int a1, __int64 a2)\n{\nchar v3; // [rsp+18h] [rbp-8h] BYREF\nchar v4; // [rsp+19h] [rbp-7h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nfunc0(a1, 119);\nv3 = 27;\nv4 = 115;\nserial_write(a1, &v3, 2LL);\nfor ( i = 0; i <= 2; ++i )\n{\nv3 = 27;\nv4 = i + 1;\nserial_write(a1, &v3, 2LL);\nserial_write(a1, a2 + ((__int64)i << 8), *(unsigned __int8 *)(a2 + ((__int64)i << 8) + 255));\n}\nv3 = 63;\nv4 = 28;\nserial_write(a1, &v3, 2LL);\nserial_readchar(a1, &v3);\nserial_readchar(a1, &v3);\nif ( v3 != 48 )\nwarnx(\"write failed\");\nreturn 0LL;\n}",
"original_code": "int\nmsr_iso_write(int fd, msr_tracks_t * tracks)\n{\n int i;\n uint8_t buf[4];\n msr_cmd (fd, 0x77);\n buf[0] = 0x1B;\n buf[1] = 0x73;\n serial_write (fd, buf, 2);\n for (i = 0; i < 3; i++) {\n buf[0] = 0x1B;\n buf[1] = i + 1;\n serial_write (fd, buf, 2);\n serial_write (fd, tracks->msr_tracks[i].msr_tk_data,\n tracks->msr_tracks[i].msr_tk_len);\n }\n buf[0] = 0x3F;\n buf[1] = 0x1C;\n serial_write (fd, buf, 2);\n serial_readchar (fd, &buf[0]);\n serial_readchar (fd, &buf[0]);\n if (buf[0] != 0x30)\n warnx(\"write failed\");\n return (0);\n}",
"canonical_original_code": "int msr_iso_write(int fd, struct msr_tracks *tracks)\n{\n int i;\n unsigned char buf[4];\n msr_cmd (fd, 0x77);\n buf[0] = 0x1B;\n buf[1] = 0x73;\n serial_write (fd, buf, 2);\n for (i = 0; i < 3; i++) {\n buf[0] = 0x1B;\n buf[1] = i + 1;\n serial_write (fd, buf, 2);\n serial_write (fd, tracks->msr_tracks[i].msr_tk_data,\n tracks->msr_tracks[i].msr_tk_len);\n }\n buf[0] = 0x3F;\n buf[1] = 0x1C;\n serial_write (fd, buf, 2);\n serial_readchar (fd, &buf[0]);\n serial_readchar (fd, &buf[0]);\n if (buf[0] != 0x30)\n warnx(\"write failed\");\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"tracks",
"struct msr_tracks { struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; } msr_tracks[3]; } *"
],
[
"i",
"int"
],
[
"buf",
"unsigned char [4]"
]
],
"return_type": "int",
"user_defined_types": [
"struct msr_tracks { struct msr_track msr_tracks[3]; }",
"struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; }"
],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_raw_read",
"canonical_name": "func18",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_raw_read(unsigned int a1, __int64 a2)\n{\nint i; // [rsp+1Ch] [rbp-4h]\n\nif ( (unsigned int)msr_cmd(a1, 109) == -1 )\nerr(1, \"Command write failed\");\nif ( (unsigned int)getstart(a1) == -1 )\nerr(1, \"get start delimiter failed\");\nfor ( i = 0; i <= 2; ++i )\ngettrack_raw(a1, i + 1, a2 + ((__int64)i << 8), (_BYTE *)(((__int64)i << 8) + 240 + a2 + 15));\nif ( (unsigned int)getend(a1) == -1 )\nerr(1, \"read failed\");\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func18(unsigned int a1, __int64 a2)\n{\nint i; // [rsp+1Ch] [rbp-4h]\n\nif ( (unsigned int)func0(a1, 109) == -1 )\nerr(1, \"Command write failed\");\nif ( (unsigned int)func2(a1) == -1 )\nerr(1, \"get start delimiter failed\");\nfor ( i = 0; i <= 2; ++i )\nfunc9(a1, i + 1, a2 + ((__int64)i << 8), (_BYTE *)(((__int64)i << 8) + 240 + a2 + 15));\nif ( (unsigned int)func3(a1) == -1 )\nerr(1, \"read failed\");\nreturn 0LL;\n}",
"original_code": "int\nmsr_raw_read(int fd, msr_tracks_t * tracks)\n{\n int r;\n int i;\n r = msr_cmd (fd, 0x6D);\n if (r == -1)\n err(1, \"Command write failed\");\n if (getstart (fd) == -1)\n err(1, \"get start delimiter failed\");\n for (i = 0; i < 3; i++)\n gettrack_raw (fd, i + 1, tracks->msr_tracks[i].msr_tk_data,\n &tracks->msr_tracks[i].msr_tk_len);\n if (getend (fd) == -1)\n err(1, \"read failed\");\n return (0);\n}",
"canonical_original_code": "int msr_raw_read(int fd, struct msr_tracks *tracks)\n{\n int r;\n int i;\n r = msr_cmd (fd, 0x6D);\n if (r == -1)\n err(1, \"Command write failed\");\n if (getstart (fd) == -1)\n err(1, \"get start delimiter failed\");\n for (i = 0; i < 3; i++)\n gettrack_raw (fd, i + 1, tracks->msr_tracks[i].msr_tk_data,\n &tracks->msr_tracks[i].msr_tk_len);\n if (getend (fd) == -1)\n err(1, \"read failed\");\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"tracks",
"struct msr_tracks { struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; } msr_tracks[3]; } *"
],
[
"r",
"int"
],
[
"i",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct msr_tracks { struct msr_track msr_tracks[3]; }",
"struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; }"
],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_raw_write",
"canonical_name": "func19",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_raw_write(unsigned int a1, __int64 a2)\n{\nchar v3; // [rsp+18h] [rbp-8h] BYREF\nchar v4; // [rsp+19h] [rbp-7h]\nchar v5; // [rsp+1Ah] [rbp-6h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nmsr_cmd(a1, 110);\nv3 = 27;\nv4 = 115;\nserial_write(a1, &v3, 2LL);\nfor ( i = 0; i <= 2; ++i )\n{\nv3 = 27;\nv4 = i + 1;\nv5 = *(_BYTE *)(a2 + ((__int64)i << 8) + 255);\nserial_write(a1, &v3, 3LL);\nserial_write(a1, a2 + ((__int64)i << 8), *(unsigned __int8 *)(a2 + ((__int64)i << 8) + 255));\n}\nv3 = 63;\nv4 = 28;\nserial_write(a1, &v3, 2LL);\nserial_readchar(a1, &v3);\nserial_readchar(a1, &v3);\nif ( v3 != 48 )\nwarnx(\"raw write failed\");\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func19(unsigned int a1, __int64 a2)\n{\nchar v3; // [rsp+18h] [rbp-8h] BYREF\nchar v4; // [rsp+19h] [rbp-7h]\nchar v5; // [rsp+1Ah] [rbp-6h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nfunc0(a1, 110);\nv3 = 27;\nv4 = 115;\nserial_write(a1, &v3, 2LL);\nfor ( i = 0; i <= 2; ++i )\n{\nv3 = 27;\nv4 = i + 1;\nv5 = *(_BYTE *)(a2 + ((__int64)i << 8) + 255);\nserial_write(a1, &v3, 3LL);\nserial_write(a1, a2 + ((__int64)i << 8), *(unsigned __int8 *)(a2 + ((__int64)i << 8) + 255));\n}\nv3 = 63;\nv4 = 28;\nserial_write(a1, &v3, 2LL);\nserial_readchar(a1, &v3);\nserial_readchar(a1, &v3);\nif ( v3 != 48 )\nwarnx(\"raw write failed\");\nreturn 0LL;\n}",
"original_code": "int\nmsr_raw_write(int fd, msr_tracks_t * tracks)\n{\n int i;\n uint8_t buf[4];\n msr_cmd (fd, 0x6E);\n buf[0] = 0x1B;\n buf[1] = 0x73;\n serial_write (fd, buf, 2);\n for (i = 0; i < 3; i++) {\n buf[0] = 0x1B;\n buf[1] = i + 1;\n buf[2] = tracks->msr_tracks[i].msr_tk_len;\n serial_write (fd, buf, 3);\n serial_write (fd, tracks->msr_tracks[i].msr_tk_data,\n tracks->msr_tracks[i].msr_tk_len);\n }\n buf[0] = 0x3F;\n buf[1] = 0x1C;\n serial_write (fd, buf, 2);\n serial_readchar (fd, &buf[0]);\n serial_readchar (fd, &buf[0]);\n if (buf[0] != 0x30)\n warnx(\"raw write failed\");\n return (0);\n}",
"canonical_original_code": "int msr_raw_write(int fd, struct msr_tracks *tracks)\n{\n int i;\n unsigned char buf[4];\n msr_cmd (fd, 0x6E);\n buf[0] = 0x1B;\n buf[1] = 0x73;\n serial_write (fd, buf, 2);\n for (i = 0; i < 3; i++) {\n buf[0] = 0x1B;\n buf[1] = i + 1;\n buf[2] = tracks->msr_tracks[i].msr_tk_len;\n serial_write (fd, buf, 3);\n serial_write (fd, tracks->msr_tracks[i].msr_tk_data,\n tracks->msr_tracks[i].msr_tk_len);\n }\n buf[0] = 0x3F;\n buf[1] = 0x1C;\n serial_write (fd, buf, 2);\n serial_readchar (fd, &buf[0]);\n serial_readchar (fd, &buf[0]);\n if (buf[0] != 0x30)\n warnx(\"raw write failed\");\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"tracks",
"struct msr_tracks { struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; } msr_tracks[3]; } *"
],
[
"i",
"int"
],
[
"buf",
"unsigned char [4]"
]
],
"return_type": "int",
"user_defined_types": [
"struct msr_tracks { struct msr_track msr_tracks[3]; }",
"struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; }"
],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_init",
"canonical_name": "func20",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_init(unsigned int a1)\n{\nmsr_reset(a1);\nif ( (unsigned int)msr_commtest(a1) == -1 )\nreturn 0xFFFFFFFFLL;\nmsr_reset(a1);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func20(unsigned int a1)\n{\nfunc14(a1);\nif ( (unsigned int)func4(a1) == -1 )\nreturn 0xFFFFFFFFLL;\nfunc14(a1);\nreturn 0LL;\n}",
"original_code": "int\nmsr_init(int fd)\n{\n msr_reset (fd);\n if (msr_commtest (fd) == -1)\n return (-1);\n msr_reset (fd);\n return (0);\n}",
"canonical_original_code": "int msr_init(int fd)\n{\n msr_reset (fd);\n if (msr_commtest (fd) == -1)\n return (-1);\n msr_reset (fd);\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_set_bpi",
"canonical_name": "func21",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_set_bpi(unsigned int a1, unsigned __int8 a2)\n{\n__int64 result; // rax\nchar v3[4]; // [rsp+8h] [rbp-18h] BYREF\nunsigned int v4; // [rsp+Ch] [rbp-14h]\nchar v5[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nv4 = a1;\nv3[0] = a2;\nmsr_cmd(a1, 98);\nserial_write(a1, v3, 1LL);\nserial_read(v4, v5, 2LL);\nif ( v5[0] == 27 && v5[1] == 48 )\n{\nprintf(\"Set bits per inch to: %d\\n\", (unsigned __int8)v3[0]);\nresult = 0LL;\n}\nelse\n{\nwarnx(\"Set bpi failed\\n\");\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func21(unsigned int a1, unsigned __int8 a2)\n{\n__int64 result; // rax\nchar v3[4]; // [rsp+8h] [rbp-18h] BYREF\nunsigned int v4; // [rsp+Ch] [rbp-14h]\nchar v5[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nv4 = a1;\nv3[0] = a2;\nfunc0(a1, 98);\nserial_write(a1, v3, 1LL);\nserial_read(v4, v5, 2LL);\nif ( v5[0] == 27 && v5[1] == 48 )\n{\nprintf(\"Set bits per inch to: %d\\n\", (unsigned __int8)v3[0]);\nresult = 0LL;\n}\nelse\n{\nwarnx(\"Set bpi failed\\n\");\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}",
"original_code": "int\nmsr_set_bpi (int fd, uint8_t bpi)\n{\n uint8_t b[2];\n msr_cmd (fd, 0x62);\n serial_write (fd, &bpi, 1);\n serial_read (fd, &b, 2);\n if (b[0] == 0x1B && b[1] == 0x30) {\n printf(\"Set bits per inch to: %d\\n\", bpi);\n return (0);\n }\n warnx (\"Set bpi failed\\n\");\n return (-1);\n}",
"canonical_original_code": "int msr_set_bpi(int fd, unsigned char bpi)\n{\n unsigned char b[2];\n msr_cmd (fd, 0x62);\n serial_write (fd, &bpi, 1);\n serial_read (fd, &b, 2);\n if (b[0] == 0x1B && b[1] == 0x30) {\n printf(\"Set bits per inch to: %d\\n\", bpi);\n return (0);\n }\n warnx (\"Set bpi failed\\n\");\n return (-1);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"bpi",
"unsigned char"
],
[
"b",
"unsigned char [2]"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
},
{
"name": "msr_set_bpc",
"canonical_name": "func22",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_set_bpc(unsigned int a1, unsigned __int8 a2, unsigned __int8 a3, unsigned __int8 a4)\n{\n__int64 result; // rax\nunsigned __int8 v5; // [rsp+1Bh] [rbp-5h] BYREF\nunsigned __int8 v6; // [rsp+1Ch] [rbp-4h]\nunsigned __int8 v7; // [rsp+1Dh] [rbp-3h]\nchar v8[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nv5 = a2;\nv6 = a3;\nv7 = a4;\nmsr_cmd(a1, 111);\nserial_write(a1, &v5, 3LL);\nserial_read(a1, v8, 2LL);\nif ( v8[0] == 27 && v8[1] == 48 )\n{\nserial_read(a1, &v5, 3LL);\nprintf(\"Set bpc... %d %d %d\\n\", v5, v6, v7);\nresult = 0LL;\n}\nelse\n{\nwarnx(\"failed to set bpc\");\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func22(unsigned int a1, unsigned __int8 a2, unsigned __int8 a3, unsigned __int8 a4)\n{\n__int64 result; // rax\nunsigned __int8 v5; // [rsp+1Bh] [rbp-5h] BYREF\nunsigned __int8 v6; // [rsp+1Ch] [rbp-4h]\nunsigned __int8 v7; // [rsp+1Dh] [rbp-3h]\nchar v8[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nv5 = a2;\nv6 = a3;\nv7 = a4;\nfunc0(a1, 111);\nserial_write(a1, &v5, 3LL);\nserial_read(a1, v8, 2LL);\nif ( v8[0] == 27 && v8[1] == 48 )\n{\nserial_read(a1, &v5, 3LL);\nprintf(\"Set bpc... %d %d %d\\n\", v5, v6, v7);\nresult = 0LL;\n}\nelse\n{\nwarnx(\"failed to set bpc\");\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}",
"original_code": "int\nmsr_set_bpc (int fd, uint8_t bpc1, uint8_t bpc2, uint8_t bpc3)\n{\n uint8_t b[2];\n msr_bpc_t bpc;\n bpc.msr_bpctk1 = bpc1;\n bpc.msr_bpctk2 = bpc2;\n bpc.msr_bpctk3 = bpc3;\n msr_cmd (fd, 0x6F);\n serial_write (fd, &bpc, sizeof(bpc));\n serial_read (fd, &b, 2);\n if (b[0] == 0x1B && b[1] == 0x30) {\n serial_read (fd, &bpc, sizeof(bpc));\n printf (\"Set bpc... %d %d %d\\n\", bpc.msr_bpctk1,\n bpc.msr_bpctk2, bpc.msr_bpctk3);\n return (0);\n }\n warnx(\"failed to set bpc\");\n return (-1);\n}",
"canonical_original_code": "int msr_set_bpc(int fd, unsigned char bpc1, unsigned char bpc2, unsigned char bpc3)\n{\n unsigned char b[2];\n struct msr_bpc bpc;\n bpc.msr_bpctk1 = bpc1;\n bpc.msr_bpctk2 = bpc2;\n bpc.msr_bpctk3 = bpc3;\n msr_cmd (fd, 0x6F);\n serial_write (fd, &bpc, sizeof(bpc));\n serial_read (fd, &b, 2);\n if (b[0] == 0x1B && b[1] == 0x30) {\n serial_read (fd, &bpc, sizeof(bpc));\n printf (\"Set bpc... %d %d %d\\n\", bpc.msr_bpctk1,\n bpc.msr_bpctk2, bpc.msr_bpctk3);\n return (0);\n }\n warnx(\"failed to set bpc\");\n return (-1);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"bpc1",
"unsigned char"
],
[
"bpc2",
"unsigned char"
],
[
"bpc3",
"unsigned char"
],
[
"b",
"unsigned char [2]"
],
[
"bpc",
"struct msr_bpc { unsigned char msr_bpctk1; unsigned char msr_bpctk2; unsigned char msr_bpctk3; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct msr_bpc { unsigned char msr_bpctk1; unsigned char msr_bpctk2; unsigned char msr_bpctk3; }"
],
"binary_hash": "66d4f4c5f467894a809fc82b2154b85956ea72389eea02513c1ba8ca4ac28c9a"
}
] |
6917885823cc0a795801e1fdd0bcd59c1f39a90103133d562763c348184bca35 | ioerror/libmsr | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"main",
"->",
"serial_open",
"mak_successful_read",
"mak_successful_clone",
"serial_close"
],
[
"serial_readchar",
"->",
"serial_read"
],
[
"serial_read",
"->",
"serial_readchar",
"mak_reset",
"mak_flush",
"mak_read",
"mak_clone"
],
[
"serial_write",
"->",
"mak_cmd",
"mak_reset",
"mak_clone"
],
[
"serial_setup",
"->",
"serial_open"
],
[
"serial_open",
"->",
"main",
"serial_setup"
],
[
"serial_close",
"->",
"main"
],
[
"mak_cmd",
"->",
"serial_write",
"mak_read"
],
[
"mak_reset",
"->",
"serial_write",
"serial_read",
"mak_successful_read"
],
[
"mak_flush",
"->",
"serial_read"
],
[
"mak_read",
"->",
"mak_cmd",
"serial_read",
"mak_successful_read"
],
[
"mak_successful_read",
"->",
"main",
"mak_reset",
"mak_read"
],
[
"mak_clone",
"->",
"serial_write",
"serial_read",
"mak_successful_clone"
],
[
"mak_successful_clone",
"->",
"main",
"mak_clone"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_404010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"char *func3()\n{\nreturn &_bss_start;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"char *func5()\n{\nchar *result; // rax\n\nif ( !_bss_start )\n{\nresult = func3();\n_bss_start = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"main",
"int __cdecl __noreturn main(int argc, const char **argv, const char **envp)\n{\nunsigned int v3; // [rsp+1Ch] [rbp-14h] BYREF\nint status; // [rsp+20h] [rbp-10h]\nint v5; // [rsp+24h] [rbp-Ch]\nconst char *v6; // [rsp+28h] [rbp-8h]\n\nv3 = -1;\nv6 = \"/dev/ttyUSB0\";\nif ( argv[1] )\nv6 = argv[1];\nelse\nprintf(\"no device specified, defaulting to %s\\n\", v6);\nv5 = func11(v6, &v3, 2048LL, 15LL);\nif ( v5 == -1 )\nerr(1, \"Serial open of %s failed\", v6);\nputs(\"Ready to populate MAKStripe buffer...\");\nstatus = func17(v3, 7LL);\nif ( status )\n{\nputs(\"Unable to populate MAKStripe buffer!\");\nexit(status);\n}\nputs(\"Ready to clone buffer onto blank card...\");\nstatus = func19(v3);\nif ( status )\n{\nputs(\"Unable to clone buffer onto blank card!\");\nexit(status);\n}\nfunc12(v3);\nexit(status);\n}"
],
[
"mak_flush",
"__int64 __fastcall func15(int a1)\n{\nchar v2; // [rsp+1Bh] [rbp-5h] BYREF\n\nwhile ( (unsigned int)func8(a1, (__int64)&v2, 1uLL) )\n;\nreturn 0LL;\n}"
],
[
"_libc_csu_init",
"void __fastcall func20(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func21(void)\n{\n;\n}"
]
] | [
{
"name": "serial_readchar",
"canonical_name": "func7",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall serial_readchar(int a1, _BYTE *a2)\n{\nchar buf; // [rsp+1Bh] [rbp-5h] BYREF\nunsigned int v4; // [rsp+1Ch] [rbp-4h]\n\ndo\nv4 = read(a1, &buf, 1uLL);\nwhile ( v4 == -1 );\n*a2 = buf;\nreturn v4;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(int a1, _BYTE *a2)\n{\nchar buf; // [rsp+1Bh] [rbp-5h] BYREF\nunsigned int v4; // [rsp+1Ch] [rbp-4h]\n\ndo\nv4 = read(a1, &buf, 1uLL);\nwhile ( v4 == -1 );\n*a2 = buf;\nreturn v4;\n}",
"original_code": "int\nserial_readchar (int fd, uint8_t * c)\n{\n char b;\n int r;\n while ((r = read (fd, &b, 1)) == -1)\n ;\n if (r != -1) {\n *c = b;\n }\n return (r);\n}",
"canonical_original_code": "int serial_readchar(int fd, unsigned char *c)\n{\n char b;\n int r;\n while ((r = read (fd, &b, 1)) == -1)\n ;\n if (r != -1) {\n *c = b;\n }\n return (r);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"c",
"unsigned char *"
],
[
"b",
"char"
],
[
"r",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "6917885823cc0a795801e1fdd0bcd59c1f39a90103133d562763c348184bca35"
},
{
"name": "serial_read",
"canonical_name": "func8",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall serial_read(int a1, __int64 a2, unsigned __int64 a3)\n{\nchar v5; // [rsp+2Fh] [rbp-11h] BYREF\n__int64 v6; // [rsp+30h] [rbp-10h]\nunsigned __int64 i; // [rsp+38h] [rbp-8h]\n\nv6 = a2;\nfor ( i = 0LL; i < a3; ++i )\n{\nserial_readchar(a1, &v5);\n*(_BYTE *)(i + v6) = v5;\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func8(int a1, __int64 a2, unsigned __int64 a3)\n{\nchar v5; // [rsp+2Fh] [rbp-11h] BYREF\n__int64 v6; // [rsp+30h] [rbp-10h]\nunsigned __int64 i; // [rsp+38h] [rbp-8h]\n\nv6 = a2;\nfor ( i = 0LL; i < a3; ++i )\n{\nfunc7(a1, &v5);\n*(_BYTE *)(i + v6) = v5;\n}\nreturn 0LL;\n}",
"original_code": "int\nserial_read (int fd, void * buf, size_t len)\n{\n size_t i;\n uint8_t b, *p;\n p = buf;\n for (i = 0; i < len; i++) {\n serial_readchar (fd, &b);\n p[i] = b;\n }\n return (0);\n}",
"canonical_original_code": "int serial_read(int fd, void *buf, unsigned long len)\n{\n unsigned long i;\n unsigned char b; unsigned char *p;\n p = buf;\n for (i = 0; i < len; i++) {\n serial_readchar (fd, &b);\n p[i] = b;\n }\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"buf",
"void *"
],
[
"len",
"unsigned long"
],
[
"i",
"unsigned long"
],
[
"b",
"unsigned char"
],
[
"p",
"unsigned char *"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "6917885823cc0a795801e1fdd0bcd59c1f39a90103133d562763c348184bca35"
},
{
"name": "serial_write",
"canonical_name": "func9",
"repo": "ioerror/libmsr",
"decompiled_code": "ssize_t __fastcall serial_write(int a1, const void *a2, size_t a3)\n{\nreturn write(a1, a2, a3);\n}\n",
"canonical_decompiled_code": "ssize_t __fastcall func9(int a1, const void *a2, size_t a3)\n{\nreturn write(a1, a2, a3);\n}",
"original_code": "int\nserial_write (int fd, void * buf, size_t len)\n{\n return (write (fd, buf, len));\n}",
"canonical_original_code": "int serial_write(int fd, void *buf, unsigned long len)\n{\n return (write (fd, buf, len));\n}",
"variable_types": [
[
"fd",
"int"
],
[
"buf",
"void *"
],
[
"len",
"unsigned long"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "6917885823cc0a795801e1fdd0bcd59c1f39a90103133d562763c348184bca35"
},
{
"name": "serial_setup",
"canonical_name": "func10",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall serial_setup(int a1, speed_t a2)\n{\n__int64 result; // rax\ntcflag_t v3; // eax\ntcflag_t v4; // eax\ntcflag_t v5; // eax\nstruct termios termios_p; // [rsp+10h] [rbp-40h] BYREF\n\nif ( tcgetattr(a1, &termios_p) == -1 )\nreturn 0xFFFFFFFFLL;\ncfsetispeed(&termios_p, a2);\ncfsetospeed(&termios_p, a2);\ntermios_p.c_cflag |= 0x880u;\nv3 = termios_p.c_cflag;\nBYTE1(v3) = BYTE1(termios_p.c_cflag) & 0xFE;\ntermios_p.c_cflag = v3 & 0xFFFFFF8F | 0x30;\ntermios_p.c_lflag &= 0xFFFFFFFD;\ntermios_p.c_lflag &= 0xFFFFFFF7;\ntermios_p.c_lflag &= 0xFFFFFFBF;\ntermios_p.c_lflag &= 0xFFFFFFFE;\nv4 = termios_p.c_lflag;\nBYTE1(v4) = BYTE1(termios_p.c_lflag) & 0x7F;\ntermios_p.c_lflag = v4;\nv5 = termios_p.c_iflag;\nBYTE1(v5) = BYTE1(termios_p.c_iflag) & 0xE2;\ntermios_p.c_iflag = v5 | 5;\ntermios_p.c_oflag &= 0xFFFFFFFE;\nif ( tcsetattr(a1, 0, &termios_p) == -1 )\nresult = 0xFFFFFFFFLL;\nelse\nresult = 0LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func10(int a1, speed_t a2)\n{\n__int64 result; // rax\ntcflag_t v3; // eax\ntcflag_t v4; // eax\ntcflag_t v5; // eax\nstruct termios termios_p; // [rsp+10h] [rbp-40h] BYREF\n\nif ( tcgetattr(a1, &termios_p) == -1 )\nreturn 0xFFFFFFFFLL;\ncfsetispeed(&termios_p, a2);\ncfsetospeed(&termios_p, a2);\ntermios_p.c_cflag |= 0x880u;\nv3 = termios_p.c_cflag;\nBYTE1(v3) = BYTE1(termios_p.c_cflag) & 0xFE;\ntermios_p.c_cflag = v3 & 0xFFFFFF8F | 0x30;\ntermios_p.c_lflag &= 0xFFFFFFFD;\ntermios_p.c_lflag &= 0xFFFFFFF7;\ntermios_p.c_lflag &= 0xFFFFFFBF;\ntermios_p.c_lflag &= 0xFFFFFFFE;\nv4 = termios_p.c_lflag;\nBYTE1(v4) = BYTE1(termios_p.c_lflag) & 0x7F;\ntermios_p.c_lflag = v4;\nv5 = termios_p.c_iflag;\nBYTE1(v5) = BYTE1(termios_p.c_iflag) & 0xE2;\ntermios_p.c_iflag = v5 | 5;\ntermios_p.c_oflag &= 0xFFFFFFFE;\nif ( tcsetattr(a1, 0, &termios_p) == -1 )\nresult = 0xFFFFFFFFLL;\nelse\nresult = 0LL;\nreturn result;\n}",
"original_code": "static int\nserial_setup (int fd, speed_t baud)\n{\n struct termios options;\n if (tcgetattr(fd, &options) == -1)\n return (-1);\n cfsetispeed(&options, baud);\n cfsetospeed(&options, baud);\n options.c_cflag |= (0004000 | 0000200);\n options.c_cflag &= ~0000400;\n options.c_cflag &= ~0000100;\n options.c_cflag &= ~0000060;\n options.c_cflag |= 0000060;\n options.c_lflag &= ~0000002;\n options.c_lflag &= ~0000010;\n options.c_lflag &= ~0000100;\n options.c_lflag &= ~0000001;\n options.c_lflag &= ~0100000;\n options.c_iflag &= ~0000400;\n options.c_iflag &= ~0002000;\n options.c_iflag &= ~0010000;\n options.c_iflag &= ~0004000;\n options.c_iflag |= 0000001;\n options.c_iflag |= 0000004;\n options.c_oflag &= ~0000001;\n if (tcsetattr(fd, 0, &options) == -1)\n return (-1);\n return (0);\n}",
"canonical_original_code": "static int serial_setup(int fd, unsigned int baud)\n{\n struct termios options;\n if (tcgetattr(fd, &options) == -1)\n return (-1);\n cfsetispeed(&options, baud);\n cfsetospeed(&options, baud);\n options.c_cflag |= (0004000 | 0000200);\n options.c_cflag &= ~0000400;\n options.c_cflag &= ~0000100;\n options.c_cflag &= ~0000060;\n options.c_cflag |= 0000060;\n options.c_lflag &= ~0000002;\n options.c_lflag &= ~0000010;\n options.c_lflag &= ~0000100;\n options.c_lflag &= ~0000001;\n options.c_lflag &= ~0100000;\n options.c_iflag &= ~0000400;\n options.c_iflag &= ~0002000;\n options.c_iflag &= ~0010000;\n options.c_iflag &= ~0004000;\n options.c_iflag |= 0000001;\n options.c_iflag |= 0000004;\n options.c_oflag &= ~0000001;\n if (tcsetattr(fd, 0, &options) == -1)\n return (-1);\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"baud",
"unsigned int"
],
[
"options",
"struct termios { unsigned int c_iflag; unsigned int c_oflag; unsigned int c_cflag; unsigned int c_lflag; unsigned char c_line; unsigned char c_cc[32]; unsigned int c_ispeed; unsigned int c_ospeed; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct termios { unsigned int c_iflag; unsigned int c_oflag; unsigned int c_cflag; unsigned int c_lflag; unsigned char c_line; unsigned char c_cc[32]; unsigned int c_ispeed; unsigned int c_ospeed; }"
],
"binary_hash": "6917885823cc0a795801e1fdd0bcd59c1f39a90103133d562763c348184bca35"
},
{
"name": "serial_open",
"canonical_name": "func11",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall serial_open(const char *a1, int *a2, int a3, speed_t a4)\n{\n__int64 result; // rax\nint fd; // [rsp+2Ch] [rbp-4h]\n\nfd = open(a1, a3 | 0x101002);\nif ( fd == -1 )\nreturn 0xFFFFFFFFLL;\nif ( (unsigned int)serial_setup(fd, a4) )\n{\nclose(fd);\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\n*a2 = fd;\nresult = 0LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func11(const char *a1, int *a2, int a3, speed_t a4)\n{\n__int64 result; // rax\nint fd; // [rsp+2Ch] [rbp-4h]\n\nfd = open(a1, a3 | 0x101002);\nif ( fd == -1 )\nreturn 0xFFFFFFFFLL;\nif ( (unsigned int)func10(fd, a4) )\n{\nclose(fd);\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\n*a2 = fd;\nresult = 0LL;\n}\nreturn result;\n}",
"original_code": "int\nserial_open(char *path, int * fd, int blocking, speed_t baud)\n{\n int f;\n f = open(path, blocking | 02 | 04010000);\n if (f == -1)\n return (-1);\n if (serial_setup (f, baud) != 0) {\n close (f);\n return (-1);\n }\n *fd = f;\n return (0);\n}",
"canonical_original_code": "int serial_open(char *path, int *fd, int blocking, unsigned int baud)\n{\n int f;\n f = open(path, blocking | 02 | 04010000);\n if (f == -1)\n return (-1);\n if (serial_setup (f, baud) != 0) {\n close (f);\n return (-1);\n }\n *fd = f;\n return (0);\n}",
"variable_types": [
[
"path",
"char *"
],
[
"fd",
"int *"
],
[
"blocking",
"int"
],
[
"baud",
"unsigned int"
],
[
"f",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "6917885823cc0a795801e1fdd0bcd59c1f39a90103133d562763c348184bca35"
},
{
"name": "serial_close",
"canonical_name": "func12",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall serial_close(int a1)\n{\nclose(a1);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func12(int a1)\n{\nclose(a1);\nreturn 0LL;\n}",
"original_code": "int\nserial_close(int fd)\n{\n close (fd);\n return (0);\n}",
"canonical_original_code": "int serial_close(int fd)\n{\n close (fd);\n return (0);\n}",
"variable_types": [
[
"fd",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "6917885823cc0a795801e1fdd0bcd59c1f39a90103133d562763c348184bca35"
},
{
"name": "mak_cmd",
"canonical_name": "func13",
"repo": "ioerror/libmsr",
"decompiled_code": "ssize_t __fastcall mak_cmd(int a1, unsigned __int8 a2, char a3)\n{\nchar v4[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nv4[0] = a2;\nv4[1] = a3;\nprintf(\"Attempting to send command: %c\\n\", a2);\nreturn serial_write(a1, v4, 2uLL);\n}\n",
"canonical_decompiled_code": "ssize_t __fastcall func13(int a1, unsigned __int8 a2, char a3)\n{\nchar v4[2]; // [rsp+1Eh] [rbp-2h] BYREF\n\nv4[0] = a2;\nv4[1] = a3;\nprintf(\"Attempting to send command: %c\\n\", a2);\nreturn func9(a1, v4, 2uLL);\n}",
"original_code": "int\nmak_cmd(int fd, uint8_t c, uint8_t tracks)\n{\n mak_generic_cmd_t cmd;\n cmd.mak_cmd = c;\n cmd.mak_track_mask = tracks;\n printf(\"Attempting to send command: %c\\n\", cmd.mak_cmd);\n return (serial_write(fd,&cmd, sizeof(cmd)));\n}",
"canonical_original_code": "int mak_cmd(int fd, unsigned char c, unsigned char tracks)\n{\n struct mak_cmd cmd;\n cmd.mak_cmd = c;\n cmd.mak_track_mask = tracks;\n printf(\"Attempting to send command: %c\\n\", cmd.mak_cmd);\n return (serial_write(fd,&cmd, sizeof(cmd)));\n}",
"variable_types": [
[
"fd",
"int"
],
[
"c",
"unsigned char"
],
[
"tracks",
"unsigned char"
],
[
"cmd",
"struct mak_cmd { unsigned char mak_cmd; unsigned char mak_track_mask; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct mak_cmd { unsigned char mak_cmd; unsigned char mak_track_mask; }"
],
"binary_hash": "6917885823cc0a795801e1fdd0bcd59c1f39a90103133d562763c348184bca35"
},
{
"name": "mak_reset",
"canonical_name": "func14",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall mak_reset(int a1)\n{\nvoid *v1; // rsp\n_BYTE v3[12]; // [rsp+0h] [rbp-40h] BYREF\nint v4; // [rsp+Ch] [rbp-34h]\nunsigned int v5; // [rsp+1Ch] [rbp-24h]\nvoid *s; // [rsp+20h] [rbp-20h]\n__int64 v7; // [rsp+28h] [rbp-18h]\n\nv4 = a1;\nv7 = 15LL;\nv1 = alloca(16LL);\ns = v3;\nmemset(v3, 0, 0xFuLL);\n*(_BYTE *)s = 63;\nprintf(\"Sending reset command: %c\\n\", 63LL);\nserial_write(v4, s, 4uLL);\nprintf(\"We expect: %s\\n\", \"MSUSB CI.270209\");\nprintf(\"We got \");\nv5 = serial_read(v4, (__int64)s, 0xFuLL);\n*((_BYTE *)s + 15) = 0;\nprintf(\"buf: %s\\n\", (const char *)s);\nprintf(\"Reset status: %d\\n\", v5);\nreturn v5;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func14(int a1)\n{\nvoid *v1; // rsp\n_BYTE v3[12]; // [rsp+0h] [rbp-40h] BYREF\nint v4; // [rsp+Ch] [rbp-34h]\nunsigned int v5; // [rsp+1Ch] [rbp-24h]\nvoid *s; // [rsp+20h] [rbp-20h]\n__int64 v7; // [rsp+28h] [rbp-18h]\n\nv4 = a1;\nv7 = 15LL;\nv1 = alloca(16LL);\ns = v3;\nmemset(v3, 0, 0xFuLL);\n*(_BYTE *)s = 63;\nprintf(\"Sending reset command: %c\\n\", 63LL);\nfunc9(v4, s, 4uLL);\nprintf(\"We expect: %s\\n\", \"MSUSB CI.270209\");\nprintf(\"We got \");\nv5 = func8(v4, (__int64)s, 0xFuLL);\n*((_BYTE *)s + 15) = 0;\nprintf(\"buf: %s\\n\", (const char *)s);\nprintf(\"Reset status: %d\\n\", v5);\nreturn v5;\n}",
"original_code": "int mak_reset(int fd)\n{\n int r;\n int i;\n char buf[strlen(\"MSUSB CI.270209\") + 1];\n memset(buf, 0, strlen(\"MSUSB CI.270209\"));\n buf[0] = '?';\n printf(\"Sending reset command: %c\\n\", '?');\n serial_write(fd, buf, sizeof('?'));\n printf(\"We expect: %s\\n\", \"MSUSB CI.270209\");\n printf(\"We got \");\n r = serial_read(fd, buf, strlen(\"MSUSB CI.270209\"));\n buf[strlen(\"MSUSB CI.270209\")] = '\\0';\n printf(\"buf: %s\\n\", buf);\n printf(\"Reset status: %d\\n\", r);\n return r;\n}",
"canonical_original_code": "int mak_reset(int fd)\n{\n int r;\n int i;\n char buf[-1];\n memset(buf, 0, strlen(\"MSUSB CI.270209\"));\n buf[0] = '?';\n printf(\"Sending reset command: %c\\n\", '?');\n serial_write(fd, buf, sizeof('?'));\n printf(\"We expect: %s\\n\", \"MSUSB CI.270209\");\n printf(\"We got \");\n r = serial_read(fd, buf, strlen(\"MSUSB CI.270209\"));\n buf[strlen(\"MSUSB CI.270209\")] = '\\0';\n printf(\"buf: %s\\n\", buf);\n printf(\"Reset status: %d\\n\", r);\n return r;\n}",
"variable_types": [
[
"fd",
"int"
],
[
"r",
"int"
],
[
"i",
"int"
],
[
"buf",
"char [-1]"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "6917885823cc0a795801e1fdd0bcd59c1f39a90103133d562763c348184bca35"
},
{
"name": "mak_read",
"canonical_name": "func16",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall mak_read(int a1, char a2)\n{\n__int64 result; // rax\nuint16_t v3; // ax\nuint16_t v4; // [rsp+1Ah] [rbp-16h] BYREF\nchar v5[2]; // [rsp+1Dh] [rbp-13h] BYREF\nchar s1[5]; // [rsp+1Fh] [rbp-11h] BYREF\nint v7; // [rsp+24h] [rbp-Ch]\nint v8; // [rsp+28h] [rbp-8h]\nunsigned int i; // [rsp+2Ch] [rbp-4h]\n\nputs(\"Attempting to perform a read...\");\nv8 = mak_cmd(a1, 0x52u, a2);\nputs(\"Command sent!\");\nserial_read(a1, (__int64)s1, 5uLL);\nprintf(\"We got: %s\\n\", s1);\nprintf(\"We expected: %s\\n\", \"Ready \");\nif ( !memcmp(s1, \"Ready \", 6uLL) )\n{\nputs(\"Doh!\");\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\nputs(\"Please swipe a card for read...\");\nmemset(s1, 0, 3uLL);\nserial_read(a1, (__int64)s1, 3uLL);\nprintf(\"We expect: %s\\n\", \"RD \");\nprintf(\"We expect it to be of len: %d\\n\", 3LL);\nprintf(\"We got: %s\\n\", s1);\nv8 = memcmp(s1, \"RD \", 3uLL);\nif ( v8 )\n{\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\nserial_read(a1, (__int64)&v4, 2uLL);\nprintf(\"Sample count appears to be: %d\\n\", v4);\nv3 = ntohs(v4);\nv7 = v3;\nprintf(\"Sample count appears to be: %d\\n\", v3);\nfor ( i = 0; (int)i < v7; ++i )\n{\nserial_read(a1, (__int64)v5, 2uLL);\nprintf(\"%d %02x %02x\\n\", i, (unsigned __int8)v5[0], (unsigned __int8)v5[1]);\n}\nputs(\"In theory, we have dumped the full sample data now...\");\nserial_read(a1, (__int64)s1, 5uLL);\nprintf(\"Sample read returned status: %s\\n\", s1);\nv8 = memcmp(s1, \"RD=OK\", 5uLL);\nif ( v8 )\nresult = 0xFFFFFFFFLL;\nelse\nresult = 0LL;\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func16(int a1, char a2)\n{\n__int64 result; // rax\nuint16_t v3; // ax\nuint16_t v4; // [rsp+1Ah] [rbp-16h] BYREF\nchar v5[2]; // [rsp+1Dh] [rbp-13h] BYREF\nchar s1[5]; // [rsp+1Fh] [rbp-11h] BYREF\nint v7; // [rsp+24h] [rbp-Ch]\nint v8; // [rsp+28h] [rbp-8h]\nunsigned int i; // [rsp+2Ch] [rbp-4h]\n\nputs(\"Attempting to perform a read...\");\nv8 = func13(a1, 0x52u, a2);\nputs(\"Command sent!\");\nfunc8(a1, (__int64)s1, 5uLL);\nprintf(\"We got: %s\\n\", s1);\nprintf(\"We expected: %s\\n\", \"Ready \");\nif ( !memcmp(s1, \"Ready \", 6uLL) )\n{\nputs(\"Doh!\");\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\nputs(\"Please swipe a card for read...\");\nmemset(s1, 0, 3uLL);\nfunc8(a1, (__int64)s1, 3uLL);\nprintf(\"We expect: %s\\n\", \"RD \");\nprintf(\"We expect it to be of len: %d\\n\", 3LL);\nprintf(\"We got: %s\\n\", s1);\nv8 = memcmp(s1, \"RD \", 3uLL);\nif ( v8 )\n{\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\nfunc8(a1, (__int64)&v4, 2uLL);\nprintf(\"Sample count appears to be: %d\\n\", v4);\nv3 = ntohs(v4);\nv7 = v3;\nprintf(\"Sample count appears to be: %d\\n\", v3);\nfor ( i = 0; (int)i < v7; ++i )\n{\nfunc8(a1, (__int64)v5, 2uLL);\nprintf(\"%d %02x %02x\\n\", i, (unsigned __int8)v5[0], (unsigned __int8)v5[1]);\n}\nputs(\"In theory, we have dumped the full sample data now...\");\nfunc8(a1, (__int64)s1, 5uLL);\nprintf(\"Sample read returned status: %s\\n\", s1);\nv8 = memcmp(s1, \"RD=OK\", 5uLL);\nif ( v8 )\nresult = 0xFFFFFFFFLL;\nelse\nresult = 0LL;\n}\n}\nreturn result;\n}",
"original_code": "int\nmak_read(int fd, uint8_t tracks)\n{\n int r;\n int i;\n char buf[5];\n unsigned char sample_tmp[2];\n uint16_t sample_count;\n int sample_count_guessing;\n printf(\"Attempting to perform a read...\\n\");\n r = mak_cmd(fd, 'R', tracks);\n printf(\"Command sent!\\n\");\n serial_read(fd, buf, strlen(\"Ready \") -1);\n printf(\"We got: %s\\n\", buf);\n printf(\"We expected: %s\\n\", \"Ready \");\n if (!memcmp(buf, \"Ready \", strlen(\"Ready \"))) {\n printf(\"Doh!\\n\");\n return -1;\n }\n printf(\"Please swipe a card for read...\\n\");\n memset(buf, 0, 3);\n serial_read(fd, buf, 3);\n printf(\"We expect: %s\\n\", \"RD \");\n printf(\"We expect it to be of len: %d\\n\", strlen(\"RD \"));\n printf(\"We got: %s\\n\", buf);\n r = memcmp(buf, \"RD \", strlen(\"RD \"));\n if (r != 0) {\n return -1;\n }\n serial_read(fd, &sample_count, 2);\n printf(\"Sample count appears to be: %d\\n\", sample_count);\n sample_count_guessing = ntohs(sample_count);\n printf(\"Sample count appears to be: %d\\n\", sample_count_guessing);\n for (i = 0; i < sample_count_guessing ; i++) {\n serial_read(fd, sample_tmp, 2);\n printf(\"%d %02x %02x\\n\", i, sample_tmp[0], sample_tmp[1]);\n }\n printf(\"In theory, we have dumped the full sample data now...\\n\");\n serial_read(fd, buf, 5);\n printf(\"Sample read returned status: %s\\n\", buf);\n r = memcmp(buf, \"RD=OK\", 5);\n if (r != 0)\n return -1;\n return r;\n}",
"canonical_original_code": "int mak_read(int fd, unsigned char tracks)\n{\n int r;\n int i;\n char buf[5];\n unsigned char sample_tmp[2];\n unsigned short sample_count;\n int sample_count_guessing;\n printf(\"Attempting to perform a read...\\n\");\n r = mak_cmd(fd, 'R', tracks);\n printf(\"Command sent!\\n\");\n serial_read(fd, buf, strlen(\"Ready \") -1);\n printf(\"We got: %s\\n\", buf);\n printf(\"We expected: %s\\n\", \"Ready \");\n if (!memcmp(buf, \"Ready \", strlen(\"Ready \"))) {\n printf(\"Doh!\\n\");\n return -1;\n }\n printf(\"Please swipe a card for read...\\n\");\n memset(buf, 0, 3);\n serial_read(fd, buf, 3);\n printf(\"We expect: %s\\n\", \"RD \");\n printf(\"We expect it to be of len: %d\\n\", strlen(\"RD \"));\n printf(\"We got: %s\\n\", buf);\n r = memcmp(buf, \"RD \", strlen(\"RD \"));\n if (r != 0) {\n return -1;\n }\n serial_read(fd, &sample_count, 2);\n printf(\"Sample count appears to be: %d\\n\", sample_count);\n sample_count_guessing = ntohs(sample_count);\n printf(\"Sample count appears to be: %d\\n\", sample_count_guessing);\n for (i = 0; i < sample_count_guessing ; i++) {\n serial_read(fd, sample_tmp, 2);\n printf(\"%d %02x %02x\\n\", i, sample_tmp[0], sample_tmp[1]);\n }\n printf(\"In theory, we have dumped the full sample data now...\\n\");\n serial_read(fd, buf, 5);\n printf(\"Sample read returned status: %s\\n\", buf);\n r = memcmp(buf, \"RD=OK\", 5);\n if (r != 0)\n return -1;\n return r;\n}",
"variable_types": [
[
"fd",
"int"
],
[
"tracks",
"unsigned char"
],
[
"r",
"int"
],
[
"i",
"int"
],
[
"buf",
"char [5]"
],
[
"sample_tmp",
"unsigned char [2]"
],
[
"sample_count",
"unsigned short"
],
[
"sample_count_guessing",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "6917885823cc0a795801e1fdd0bcd59c1f39a90103133d562763c348184bca35"
},
{
"name": "mak_successful_read",
"canonical_name": "func17",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall mak_successful_read(int a1, char a2)\n{\ndo\nmak_reset(a1);\nwhile ( (unsigned int)mak_read(a1, a2) );\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func17(int a1, char a2)\n{\ndo\nfunc14(a1);\nwhile ( (unsigned int)func16(a1, a2) );\nreturn 0LL;\n}",
"original_code": "int\nmak_successful_read(int fd, uint8_t tracks)\n{\n int r;\n do {\n mak_reset(fd);\n r = mak_read(fd, tracks);\n } while (r != 0);\n return r;\n}",
"canonical_original_code": "int mak_successful_read(int fd, unsigned char tracks)\n{\n int r;\n do {\n mak_reset(fd);\n r = mak_read(fd, tracks);\n } while (r != 0);\n return r;\n}",
"variable_types": [
[
"fd",
"int"
],
[
"tracks",
"unsigned char"
],
[
"r",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "6917885823cc0a795801e1fdd0bcd59c1f39a90103133d562763c348184bca35"
},
{
"name": "mak_clone",
"canonical_name": "func18",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall mak_clone(int a1)\n{\nvoid *v1; // rsp\n__int64 result; // rax\n_BYTE v3[12]; // [rsp+0h] [rbp-40h] BYREF\nint v4; // [rsp+Ch] [rbp-34h]\nunsigned int v5; // [rsp+1Ch] [rbp-24h]\nvoid *s1; // [rsp+20h] [rbp-20h]\n__int64 v7; // [rsp+28h] [rbp-18h]\n\nv4 = a1;\nv7 = 4LL;\nv1 = alloca(16LL);\ns1 = v3;\nv3[0] = 67;\nv3[1] = 7;\nv5 = serial_write(a1, v3, 2uLL);\nprintf(\"Serial write status: %i\\n\", v5);\nv5 = serial_read(v4, (__int64)s1, 3uLL);\nif ( !memcmp(s1, \"CP \", 3uLL) )\n{\nputs(\"Ready to clone from Makstripe buffer to card.\");\nputs(\"Please swipe blank card\");\nv5 = serial_read(v4, (__int64)s1, 5uLL);\nif ( !memcmp(s1, \"CP=OK\", 5uLL) )\n{\nprintf(\"Clone succesfull: %i\\n\", v5);\nresult = v5;\n}\nelse\n{\nprintf(\"We expect a string of length: %i\\n\", 5LL);\nprintf(\"buf was unequal to MAKSTRIPE_CLONE_STS_OK: %s\\n\", \"CP=OK\");\nprintf(\n\"%c%c%c%c%c\\n\",\n(unsigned int)*(char *)s1,\n(unsigned int)*((char *)s1 + 1),\n(unsigned int)*((char *)s1 + 2),\n(unsigned int)*((char *)s1 + 3),\n(unsigned int)*((char *)s1 + 4));\nresult = 0xFFFFFFFFLL;\n}\n}\nelse\n{\nprintf(\"buf should be: %s\\n\", \"CP \");\nprintf(\n\"%c%c%c%c%c\\n\",\n(unsigned int)*(char *)s1,\n(unsigned int)*((char *)s1 + 1),\n(unsigned int)*((char *)s1 + 2),\n(unsigned int)*((char *)s1 + 3),\n(unsigned int)*((char *)s1 + 4));\nputs(\"buf was unequal to MAKSTRIPE_CLONE_RESP.\");\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func18(int a1)\n{\nvoid *v1; // rsp\n__int64 result; // rax\n_BYTE v3[12]; // [rsp+0h] [rbp-40h] BYREF\nint v4; // [rsp+Ch] [rbp-34h]\nunsigned int v5; // [rsp+1Ch] [rbp-24h]\nvoid *s1; // [rsp+20h] [rbp-20h]\n__int64 v7; // [rsp+28h] [rbp-18h]\n\nv4 = a1;\nv7 = 4LL;\nv1 = alloca(16LL);\ns1 = v3;\nv3[0] = 67;\nv3[1] = 7;\nv5 = func9(a1, v3, 2uLL);\nprintf(\"Serial write status: %i\\n\", v5);\nv5 = func8(v4, (__int64)s1, 3uLL);\nif ( !memcmp(s1, \"CP \", 3uLL) )\n{\nputs(\"Ready to clone from Makstripe buffer to card.\");\nputs(\"Please swipe blank card\");\nv5 = func8(v4, (__int64)s1, 5uLL);\nif ( !memcmp(s1, \"CP=OK\", 5uLL) )\n{\nprintf(\"Clone succesfull: %i\\n\", v5);\nresult = v5;\n}\nelse\n{\nprintf(\"We expect a string of length: %i\\n\", 5LL);\nprintf(\"buf was unequal to MAKSTRIPE_CLONE_STS_OK: %s\\n\", \"CP=OK\");\nprintf(\n\"%c%c%c%c%c\\n\",\n(unsigned int)*(char *)s1,\n(unsigned int)*((char *)s1 + 1),\n(unsigned int)*((char *)s1 + 2),\n(unsigned int)*((char *)s1 + 3),\n(unsigned int)*((char *)s1 + 4));\nresult = 0xFFFFFFFFLL;\n}\n}\nelse\n{\nprintf(\"buf should be: %s\\n\", \"CP \");\nprintf(\n\"%c%c%c%c%c\\n\",\n(unsigned int)*(char *)s1,\n(unsigned int)*((char *)s1 + 1),\n(unsigned int)*((char *)s1 + 2),\n(unsigned int)*((char *)s1 + 3),\n(unsigned int)*((char *)s1 + 4));\nputs(\"buf was unequal to MAKSTRIPE_CLONE_RESP.\");\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}",
"original_code": "int\nmak_clone(int fd)\n{\n int c;\n char buf[strlen(\"CP=OK\")];\n buf[0] = 'C';\n buf[1] = 0x7;\n c = serial_write(fd, buf, 2);\n printf(\"Serial write status: %i\\n\", c);\n c = serial_read(fd, buf, strlen(\"CP \"));\n if (memcmp(buf, \"CP \", strlen(\"CP \")) != 0) {\n printf(\"buf should be: %s\\n\", \"CP \");\n printf(\"%c%c%c%c%c\\n\", buf[0], buf[1], buf[2], buf[3], buf[4]);\n printf(\"buf was unequal to MAKSTRIPE_CLONE_RESP.\\n\");\n return -1;\n }\n printf(\"Ready to clone from Makstripe buffer to card.\\n\");\n printf(\"Please swipe blank card\\n\");\n c = serial_read(fd, buf, strlen(\"CP=OK\"));\n if (memcmp(buf, \"CP=OK\", strlen(\"CP=OK\")) != 0) {\n printf(\"We expect a string of length: %i\\n\", strlen(\"CP=OK\"));\n printf(\"buf was unequal to MAKSTRIPE_CLONE_STS_OK: %s\\n\", \"CP=OK\");\n printf(\"%c%c%c%c%c\\n\", buf[0], buf[1], buf[2], buf[3], buf[4]);\n return -1;\n }\n printf(\"Clone succesfull: %i\\n\", c);\n return c;\n}",
"canonical_original_code": "int mak_clone(int fd)\n{\n int c;\n char buf[-1];\n buf[0] = 'C';\n buf[1] = 0x7;\n c = serial_write(fd, buf, 2);\n printf(\"Serial write status: %i\\n\", c);\n c = serial_read(fd, buf, strlen(\"CP \"));\n if (memcmp(buf, \"CP \", strlen(\"CP \")) != 0) {\n printf(\"buf should be: %s\\n\", \"CP \");\n printf(\"%c%c%c%c%c\\n\", buf[0], buf[1], buf[2], buf[3], buf[4]);\n printf(\"buf was unequal to MAKSTRIPE_CLONE_RESP.\\n\");\n return -1;\n }\n printf(\"Ready to clone from Makstripe buffer to card.\\n\");\n printf(\"Please swipe blank card\\n\");\n c = serial_read(fd, buf, strlen(\"CP=OK\"));\n if (memcmp(buf, \"CP=OK\", strlen(\"CP=OK\")) != 0) {\n printf(\"We expect a string of length: %i\\n\", strlen(\"CP=OK\"));\n printf(\"buf was unequal to MAKSTRIPE_CLONE_STS_OK: %s\\n\", \"CP=OK\");\n printf(\"%c%c%c%c%c\\n\", buf[0], buf[1], buf[2], buf[3], buf[4]);\n return -1;\n }\n printf(\"Clone succesfull: %i\\n\", c);\n return c;\n}",
"variable_types": [
[
"fd",
"int"
],
[
"c",
"int"
],
[
"buf",
"char [-1]"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "6917885823cc0a795801e1fdd0bcd59c1f39a90103133d562763c348184bca35"
},
{
"name": "mak_successful_clone",
"canonical_name": "func19",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall mak_successful_clone(int a1)\n{\nwhile ( (unsigned int)mak_clone(a1) )\n;\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func19(int a1)\n{\nwhile ( (unsigned int)func18(a1) )\n;\nreturn 0LL;\n}",
"original_code": "int\nmak_successful_clone(int fd)\n{\n int r;\n do {\n r = mak_clone(fd);\n } while (r != 0);\n return r;\n}",
"canonical_original_code": "int mak_successful_clone(int fd)\n{\n int r;\n do {\n r = mak_clone(fd);\n } while (r != 0);\n return r;\n}",
"variable_types": [
[
"fd",
"int"
],
[
"r",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "6917885823cc0a795801e1fdd0bcd59c1f39a90103133d562763c348184bca35"
}
] |
9f55e616ae6b248d7ddcb8a4c62ff94c7088566002be2d6cd81572c8029da3c4 | ioerror/libmsr | [
[
"msr_dumpbits",
"->"
],
[
"msr_getbit",
"->",
"msr_decode"
],
[
"msr_setbit",
"->"
],
[
"msr_decode",
"->",
"msr_getbit"
],
[
"msr_reverse_tracks",
"->",
"msr_reverse_track"
],
[
"msr_reverse_track",
"->",
"msr_reverse_tracks",
"msr_reverse_byte"
],
[
"msr_pretty_printer_hex",
"->"
],
[
"msr_pretty_printer_string",
"->"
],
[
"msr_reverse_byte",
"->",
"msr_reverse_track"
]
] | [] | [
{
"name": "msr_dumpbits",
"canonical_name": "func0",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_dumpbits(__int64 a1, int a2)\n{\nint j; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i < a2; ++i )\n{\nfor ( j = 7; j >= 0; --j )\n{\nif ( (((int)*(unsigned __int8 *)(i + a1) >> j) & 1) != 0 )\nputchar(49);\nelse\nputchar(48);\n}\n}\nputchar(10);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, int a2)\n{\nint j; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i < a2; ++i )\n{\nfor ( j = 7; j >= 0; --j )\n{\nif ( (((int)*(unsigned __int8 *)(i + a1) >> j) & 1) != 0 )\nputchar(49);\nelse\nputchar(48);\n}\n}\nputchar(10);\nreturn 0LL;\n}",
"original_code": "int\nmsr_dumpbits (uint8_t * buf, int len)\n{\n int bytes, i;\n for (bytes = 0; bytes < len; bytes++) {\n for (i = 7; i > -1; i--) {\n if (buf[bytes] & (1 << i))\n printf(\"1\");\n else\n printf(\"0\");\n }\n }\n printf (\"\\n\");\n return (0);\n}",
"canonical_original_code": "int msr_dumpbits(unsigned char *buf, int len)\n{\n int bytes; int i;\n for (bytes = 0; bytes < len; bytes++) {\n for (i = 7; i > -1; i--) {\n if (buf[bytes] & (1 << i))\n printf(\"1\");\n else\n printf(\"0\");\n }\n }\n printf (\"\\n\");\n return (0);\n}",
"variable_types": [
[
"buf",
"unsigned char *"
],
[
"len",
"int"
],
[
"bytes",
"int"
],
[
"i",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "9f55e616ae6b248d7ddcb8a4c62ff94c7088566002be2d6cd81572c8029da3c4"
},
{
"name": "msr_getbit",
"canonical_name": "func1",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_getbit(__int64 a1, unsigned __int8 a2, int a3)\n{\nif ( a3 <= 8 * a2 )\nreturn (((int)*(unsigned __int8 *)(a3 / 8 + a1) >> (7 - a3 % 8)) & 1) != 0;\nprintf(\"%d > %d\\n\", (unsigned int)a3, 8 * (unsigned int)a2);\nreturn 0xFFFFFFFFLL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1, unsigned __int8 a2, int a3)\n{\nif ( a3 <= 8 * a2 )\nreturn (((int)*(unsigned __int8 *)(a3 / 8 + a1) >> (7 - a3 % 8)) & 1) != 0;\nprintf(\"%d > %d\\n\", (unsigned int)a3, 8 * (unsigned int)a2);\nreturn 0xFFFFFFFFLL;\n}",
"original_code": "int\nmsr_getbit (uint8_t * buf, uint8_t len, int bit)\n{\n int byte;\n int b;\n if (bit > (len * 8)) {\n printf (\"%d > %d\\n\", bit, len * 8);\n return (-1);\n }\n byte = bit / 8;\n b = 7 - (bit % 8);\n if (buf[byte] & (1 << b))\n return (1);\n return (0);\n}",
"canonical_original_code": "int msr_getbit(unsigned char *buf, unsigned char len, int bit)\n{\n int byte;\n int b;\n if (bit > (len * 8)) {\n printf (\"%d > %d\\n\", bit, len * 8);\n return (-1);\n }\n byte = bit / 8;\n b = 7 - (bit % 8);\n if (buf[byte] & (1 << b))\n return (1);\n return (0);\n}",
"variable_types": [
[
"buf",
"unsigned char *"
],
[
"len",
"unsigned char"
],
[
"bit",
"int"
],
[
"byte",
"int"
],
[
"b",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "9f55e616ae6b248d7ddcb8a4c62ff94c7088566002be2d6cd81572c8029da3c4"
},
{
"name": "msr_setbit",
"canonical_name": "func2",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_setbit(__int64 a1, unsigned __int8 a2, int a3, int a4)\n{\n__int64 result; // rax\nint v5; // eax\nint v6; // edx\nint v7; // [rsp+10h] [rbp-20h]\nint v8; // [rsp+28h] [rbp-8h]\nint v9; // [rsp+2Ch] [rbp-4h]\n\nv7 = a3;\nif ( a3 <= 8 * a2 )\n{\nv5 = a3;\nv6 = a3 + 7;\nif ( v7 < 0 )\nv5 = v6;\nv9 = v5 >> 3;\nv8 = 7 - v7 % 8;\nif ( a4 )\n*(_BYTE *)(v9 + a1) |= 1 << v8;\nelse\n*(_BYTE *)(v9 + a1) &= ~(1 << v8);\nresult = 0LL;\n}\nelse\n{\nprintf(\"%d > %d\\n\", (unsigned int)a3, 8 * (unsigned int)a2);\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, unsigned __int8 a2, int a3, int a4)\n{\n__int64 result; // rax\nint v5; // eax\nint v6; // edx\nint v7; // [rsp+10h] [rbp-20h]\nint v8; // [rsp+28h] [rbp-8h]\nint v9; // [rsp+2Ch] [rbp-4h]\n\nv7 = a3;\nif ( a3 <= 8 * a2 )\n{\nv5 = a3;\nv6 = a3 + 7;\nif ( v7 < 0 )\nv5 = v6;\nv9 = v5 >> 3;\nv8 = 7 - v7 % 8;\nif ( a4 )\n*(_BYTE *)(v9 + a1) |= 1 << v8;\nelse\n*(_BYTE *)(v9 + a1) &= ~(1 << v8);\nresult = 0LL;\n}\nelse\n{\nprintf(\"%d > %d\\n\", (unsigned int)a3, 8 * (unsigned int)a2);\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}",
"original_code": "int\nmsr_setbit (uint8_t * buf, uint8_t len, int bit, int val)\n{\n int byte;\n int b;\n if (bit > (len * 8)) {\n printf (\"%d > %d\\n\", bit, len * 8);\n return (-1);\n }\n byte = bit / 8;\n b = 7 - (bit % 8);\n if (val)\n buf[byte] |= 1 << b;\n else\n buf[byte] &= ~(1 << b);\n return (0);\n}",
"canonical_original_code": "int msr_setbit(unsigned char *buf, unsigned char len, int bit, int val)\n{\n int byte;\n int b;\n if (bit > (len * 8)) {\n printf (\"%d > %d\\n\", bit, len * 8);\n return (-1);\n }\n byte = bit / 8;\n b = 7 - (bit % 8);\n if (val)\n buf[byte] |= 1 << b;\n else\n buf[byte] &= ~(1 << b);\n return (0);\n}",
"variable_types": [
[
"buf",
"unsigned char *"
],
[
"len",
"unsigned char"
],
[
"bit",
"int"
],
[
"val",
"int"
],
[
"byte",
"int"
],
[
"b",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "9f55e616ae6b248d7ddcb8a4c62ff94c7088566002be2d6cd81572c8029da3c4"
},
{
"name": "msr_decode",
"canonical_name": "func3",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_decode(__int64 a1, unsigned __int8 a2, __int64 a3, _BYTE *a4, int a5)\n{\nint v9; // [rsp+30h] [rbp-10h]\nint i; // [rsp+34h] [rbp-Ch]\nchar v11; // [rsp+3Bh] [rbp-5h]\nchar v12; // [rsp+3Bh] [rbp-5h]\nchar v13; // [rsp+3Bh] [rbp-5h]\nint v14; // [rsp+3Ch] [rbp-4h]\n\nv14 = 0;\nv11 = 0;\nv9 = 0;\nfor ( i = 0; i < 8 * a2; ++i )\n{\nv11 |= (unsigned int)msr_getbit(a1, a2, i) << v14;\nif ( v14 == a5 - 1 )\n{\nv12 = ~(1 << v14) & v11;\nif ( a5 > 6 )\n{\nif ( v12 > 31 )\nv13 = (v12 | 0x40) - 32;\nelse\nv13 = v12 | 0x20;\n}\nelse\n{\nv13 = v12 | 0x30;\n}\n*(_BYTE *)(a3 + v9++) = v13;\nif ( v9 == (unsigned __int8)*a4 )\nbreak;\nv14 = 0;\nv11 = 0;\n}\nelse\n{\n++v14;\n}\n}\nif ( v9 == (unsigned __int8)*a4 )\nreturn 0xFFFFFFFFLL;\n*a4 = v9;\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1, unsigned __int8 a2, __int64 a3, _BYTE *a4, int a5)\n{\nint v9; // [rsp+30h] [rbp-10h]\nint i; // [rsp+34h] [rbp-Ch]\nchar v11; // [rsp+3Bh] [rbp-5h]\nchar v12; // [rsp+3Bh] [rbp-5h]\nchar v13; // [rsp+3Bh] [rbp-5h]\nint v14; // [rsp+3Ch] [rbp-4h]\n\nv14 = 0;\nv11 = 0;\nv9 = 0;\nfor ( i = 0; i < 8 * a2; ++i )\n{\nv11 |= (unsigned int)func1(a1, a2, i) << v14;\nif ( v14 == a5 - 1 )\n{\nv12 = ~(1 << v14) & v11;\nif ( a5 > 6 )\n{\nif ( v12 > 31 )\nv13 = (v12 | 0x40) - 32;\nelse\nv13 = v12 | 0x20;\n}\nelse\n{\nv13 = v12 | 0x30;\n}\n*(_BYTE *)(a3 + v9++) = v13;\nif ( v9 == (unsigned __int8)*a4 )\nbreak;\nv14 = 0;\nv11 = 0;\n}\nelse\n{\n++v14;\n}\n}\nif ( v9 == (unsigned __int8)*a4 )\nreturn 0xFFFFFFFFLL;\n*a4 = v9;\nreturn 0LL;\n}",
"original_code": "int\nmsr_decode(uint8_t * inbuf, uint8_t inlen,\n uint8_t * outbuf, uint8_t * outlen, int bpc)\n{\n uint8_t * b;\n uint8_t len;\n int ch = 0;\n char byte = 0;\n int i, x;\n len = inlen;\n b = inbuf;\n x = 0;\n for (i = 0; i < len * 8; i++) {\n byte |= msr_getbit (b, len, i) << ch;\n if (ch == (bpc - 1)) {\n byte &= ~(1 << ch);\n if (bpc < 7)\n byte |= 0x30;\n else {\n if (byte < 0x20)\n byte |= 0x20;\n else {\n byte |= 0x40;\n byte -= 0x20;\n }\n }\n outbuf[x] = byte;\n x++;\n if (x == *outlen)\n break;\n ch = 0;\n byte = 0;\n } else\n ch++;\n }\n if (x == *outlen)\n return (-1);\n *outlen = x;\n return (0);\n}",
"canonical_original_code": "int msr_decode(unsigned char *inbuf, unsigned char inlen, unsigned char *outbuf, unsigned char *outlen, int bpc)\n{\n unsigned char *b;\n unsigned char len;\n int ch = 0;\n char byte = 0;\n int i; int x;\n len = inlen;\n b = inbuf;\n x = 0;\n for (i = 0; i < len * 8; i++) {\n byte |= msr_getbit (b, len, i) << ch;\n if (ch == (bpc - 1)) {\n byte &= ~(1 << ch);\n if (bpc < 7)\n byte |= 0x30;\n else {\n if (byte < 0x20)\n byte |= 0x20;\n else {\n byte |= 0x40;\n byte -= 0x20;\n }\n }\n outbuf[x] = byte;\n x++;\n if (x == *outlen)\n break;\n ch = 0;\n byte = 0;\n } else\n ch++;\n }\n if (x == *outlen)\n return (-1);\n *outlen = x;\n return (0);\n}",
"variable_types": [
[
"inbuf",
"unsigned char *"
],
[
"inlen",
"unsigned char"
],
[
"outbuf",
"unsigned char *"
],
[
"outlen",
"unsigned char *"
],
[
"bpc",
"int"
],
[
"b",
"unsigned char *"
],
[
"len",
"unsigned char"
],
[
"ch",
"int"
],
[
"byte",
"char"
],
[
"i",
"int"
],
[
"x",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "9f55e616ae6b248d7ddcb8a4c62ff94c7088566002be2d6cd81572c8029da3c4"
},
{
"name": "msr_reverse_tracks",
"canonical_name": "func4",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_reverse_tracks(__int64 a1)\n{\nunsigned int v2; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i <= 2; ++i )\n{\nv2 = msr_reverse_track((unsigned int)i, a1);\nif ( v2 )\n{\nprintf(\"Unable to reverse track: %i\\n\", (unsigned int)i);\nreturn (unsigned int)-1;\n}\n}\nreturn v2;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1)\n{\nunsigned int v2; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i <= 2; ++i )\n{\nv2 = func5((unsigned int)i, a1);\nif ( v2 )\n{\nprintf(\"Unable to reverse track: %i\\n\", (unsigned int)i);\nreturn (unsigned int)-1;\n}\n}\nreturn v2;\n}",
"original_code": "int\nmsr_reverse_tracks (msr_tracks_t * tracks)\n{\n int i, status;\n for (i = 0; i < 3; i++) {\n status = msr_reverse_track(i, tracks);\n if (status != 0) {\n printf(\"Unable to reverse track: %i\\n\", i);\n status = -1;\n break;\n }\n }\n return status;\n}",
"canonical_original_code": "int msr_reverse_tracks(struct msr_tracks *tracks)\n{\n int i; int status;\n for (i = 0; i < 3; i++) {\n status = msr_reverse_track(i, tracks);\n if (status != 0) {\n printf(\"Unable to reverse track: %i\\n\", i);\n status = -1;\n break;\n }\n }\n return status;\n}",
"variable_types": [
[
"tracks",
"struct msr_tracks { struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; } msr_tracks[3]; } *"
],
[
"i",
"int"
],
[
"status",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct msr_tracks { struct msr_track msr_tracks[3]; }",
"struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; }"
],
"binary_hash": "9f55e616ae6b248d7ddcb8a4c62ff94c7088566002be2d6cd81572c8029da3c4"
},
{
"name": "msr_reverse_track",
"canonical_name": "func5",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_reverse_track(int a1, __int64 a2)\n{\nchar v3; // [rsp+1Fh] [rbp-21h]\n_BYTE *v4; // [rsp+20h] [rbp-20h]\nint v5; // [rsp+34h] [rbp-Ch]\nint i; // [rsp+3Ch] [rbp-4h]\n\nv5 = *(unsigned __int8 *)(a2 + ((__int64)a1 << 8) + 255);\nfor ( i = 0; i <= v5 / 2; ++i )\n{\nv4 = (_BYTE *)(((__int64)a1 << 8) + v5 - 1 - i + a2);\nv3 = msr_reverse_byte(*(unsigned __int8 *)(((__int64)a1 << 8) + i + a2));\n*(_BYTE *)(((__int64)a1 << 8) + i + a2) = msr_reverse_byte((unsigned __int8)*v4);\n*v4 = v3;\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(int a1, __int64 a2)\n{\nchar v3; // [rsp+1Fh] [rbp-21h]\n_BYTE *v4; // [rsp+20h] [rbp-20h]\nint v5; // [rsp+34h] [rbp-Ch]\nint i; // [rsp+3Ch] [rbp-4h]\n\nv5 = *(unsigned __int8 *)(a2 + ((__int64)a1 << 8) + 255);\nfor ( i = 0; i <= v5 / 2; ++i )\n{\nv4 = (_BYTE *)(((__int64)a1 << 8) + v5 - 1 - i + a2);\nv3 = func8(*(unsigned __int8 *)(((__int64)a1 << 8) + i + a2));\n*(_BYTE *)(((__int64)a1 << 8) + i + a2) = func8((unsigned __int8)*v4);\n*v4 = v3;\n}\nreturn 0LL;\n}",
"original_code": "int\nmsr_reverse_track (int track_number, msr_tracks_t * tracks)\n{\n int i;\n int status = 0;\n int bytes_to_shuffle;\n char first_byte;\n char last_byte;\n unsigned char * head;\n unsigned char * tail;\n bytes_to_shuffle = tracks->msr_tracks[track_number].msr_tk_len;\n for (i=0; i <= bytes_to_shuffle / 2; i++) {\n head = &tracks->msr_tracks[track_number].msr_tk_data[i];\n tail = &tracks->msr_tracks[track_number].msr_tk_data[(bytes_to_shuffle -1) -i];\n first_byte = msr_reverse_byte(*head);\n last_byte = msr_reverse_byte(*tail);\n *head = last_byte;\n *tail = first_byte;\n }\n return status;\n}",
"canonical_original_code": "int msr_reverse_track(int track_number, struct msr_tracks *tracks)\n{\n int i;\n int status = 0;\n int bytes_to_shuffle;\n char first_byte;\n char last_byte;\n unsigned char *head;\n unsigned char *tail;\n bytes_to_shuffle = tracks->msr_tracks[track_number].msr_tk_len;\n for (i=0; i <= bytes_to_shuffle / 2; i++) {\n head = &tracks->msr_tracks[track_number].msr_tk_data[i];\n tail = &tracks->msr_tracks[track_number].msr_tk_data[(bytes_to_shuffle -1) -i];\n first_byte = msr_reverse_byte(*head);\n last_byte = msr_reverse_byte(*tail);\n *head = last_byte;\n *tail = first_byte;\n }\n return status;\n}",
"variable_types": [
[
"track_number",
"int"
],
[
"tracks",
"struct msr_tracks { struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; } msr_tracks[3]; } *"
],
[
"i",
"int"
],
[
"status",
"int"
],
[
"bytes_to_shuffle",
"int"
],
[
"first_byte",
"char"
],
[
"last_byte",
"char"
],
[
"head",
"unsigned char *"
],
[
"tail",
"unsigned char *"
]
],
"return_type": "int",
"user_defined_types": [
"struct msr_tracks { struct msr_track msr_tracks[3]; }",
"struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; }"
],
"binary_hash": "9f55e616ae6b248d7ddcb8a4c62ff94c7088566002be2d6cd81572c8029da3c4"
},
{
"name": "msr_pretty_printer_hex",
"canonical_name": "func6",
"repo": "ioerror/libmsr",
"decompiled_code": "int __fastcall msr_pretty_printer_hex(__int64 a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, char a7)\n{\nint result; // eax\nint j; // [rsp+8h] [rbp-8h]\nint i; // [rsp+Ch] [rbp-4h]\n\nfor ( i = 0; i <= 2; ++i )\n{\nprintf(\"Track %d: \\n\", (unsigned int)i);\nfor ( j = 0; j < (unsigned __int8)*(&a7 + 256 * (__int64)i + 255); ++j )\nprintf(\"%02x \", (unsigned __int8)*(&a7 + 256 * (__int64)i + j));\nresult = putchar(10);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func6(__int64 a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, char a7)\n{\nint result; // eax\nint j; // [rsp+8h] [rbp-8h]\nint i; // [rsp+Ch] [rbp-4h]\n\nfor ( i = 0; i <= 2; ++i )\n{\nprintf(\"Track %d: \\n\", (unsigned int)i);\nfor ( j = 0; j < (unsigned __int8)*(&a7 + 256 * (__int64)i + 255); ++j )\nprintf(\"%02x \", (unsigned __int8)*(&a7 + 256 * (__int64)i + j));\nresult = putchar(10);\n}\nreturn result;\n}",
"original_code": "void\nmsr_pretty_printer_hex (msr_tracks_t tracks)\n{\n int track_number;\n for (track_number = 0; track_number < 3; track_number++) {\n int x;\n printf(\"Track %d: \\n\", track_number);\n for (x = 0; x < tracks.msr_tracks[track_number].msr_tk_len; x++)\n printf(\"%02x \", tracks.msr_tracks[track_number].msr_tk_data[x]);\n printf(\"\\n\");\n }\n}",
"canonical_original_code": "void msr_pretty_printer_hex(struct msr_tracks tracks)\n{\n int track_number;\n for (track_number = 0; track_number < 3; track_number++) {\n int x;\n printf(\"Track %d: \\n\", track_number);\n for (x = 0; x < tracks.msr_tracks[track_number].msr_tk_len; x++)\n printf(\"%02x \", tracks.msr_tracks[track_number].msr_tk_data[x]);\n printf(\"\\n\");\n }\n}",
"variable_types": [
[
"tracks",
"struct msr_tracks { struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; } msr_tracks[3]; }"
],
[
"track_number",
"int"
],
[
"x",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct msr_tracks { struct msr_track msr_tracks[3]; }",
"struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; }"
],
"binary_hash": "9f55e616ae6b248d7ddcb8a4c62ff94c7088566002be2d6cd81572c8029da3c4"
},
{
"name": "msr_pretty_printer_string",
"canonical_name": "func7",
"repo": "ioerror/libmsr",
"decompiled_code": "int __fastcall msr_pretty_printer_string(__int64 a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, char a7)\n{\nint result; // eax\nint i; // [rsp+Ch] [rbp-4h]\n\nfor ( i = 0; i <= 2; ++i )\n{\nresult = (unsigned __int8)*(&a7 + 256 * (__int64)i + 255);\nif ( (_BYTE)result )\nresult = printf(\"Track %d: \\n[%s]\\n\", (unsigned int)i, &a7 + 256 * (__int64)i);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func7(__int64 a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, char a7)\n{\nint result; // eax\nint i; // [rsp+Ch] [rbp-4h]\n\nfor ( i = 0; i <= 2; ++i )\n{\nresult = (unsigned __int8)*(&a7 + 256 * (__int64)i + 255);\nif ( (_BYTE)result )\nresult = printf(\"Track %d: \\n[%s]\\n\", (unsigned int)i, &a7 + 256 * (__int64)i);\n}\nreturn result;\n}",
"original_code": "void\nmsr_pretty_printer_string (msr_tracks_t tracks)\n{\n int track_number;\n for (track_number = 0; track_number < 3; track_number++) {\n if (tracks.msr_tracks[track_number].msr_tk_len)\n printf (\"Track %d: \\n[%s]\\n\", track_number,\n tracks.msr_tracks[track_number].msr_tk_data);\n }\n}",
"canonical_original_code": "void msr_pretty_printer_string(struct msr_tracks tracks)\n{\n int track_number;\n for (track_number = 0; track_number < 3; track_number++) {\n if (tracks.msr_tracks[track_number].msr_tk_len)\n printf (\"Track %d: \\n[%s]\\n\", track_number,\n tracks.msr_tracks[track_number].msr_tk_data);\n }\n}",
"variable_types": [
[
"tracks",
"struct msr_tracks { struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; } msr_tracks[3]; }"
],
[
"track_number",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct msr_tracks { struct msr_track msr_tracks[3]; }",
"struct msr_track { unsigned char msr_tk_data[255]; unsigned char msr_tk_len; }"
],
"binary_hash": "9f55e616ae6b248d7ddcb8a4c62ff94c7088566002be2d6cd81572c8029da3c4"
},
{
"name": "msr_reverse_byte",
"canonical_name": "func8",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall msr_reverse_byte(unsigned __int8 a1)\n{\nreturn (32 * a1) & 0x40 | (8 * a1) & 0x20 | (2 * a1) & 0x10 | ((int)a1 >> 1) & 8 | ((int)a1 >> 3) & 4 | ((int)a1 >> 5) & 2 | (a1 >> 7) | (a1 << 7);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func8(unsigned __int8 a1)\n{\nreturn (32 * a1) & 0x40 | (8 * a1) & 0x20 | (2 * a1) & 0x10 | ((int)a1 >> 1) & 8 | ((int)a1 >> 3) & 4 | ((int)a1 >> 5) & 2 | (a1 >> 7) | (a1 << 7);\n}",
"original_code": "const unsigned char\nmsr_reverse_byte(const unsigned char byte)\n{\n return\n ((byte & 1<<7) >> 7) |\n ((byte & 1<<6) >> 5) |\n ((byte & 1<<5) >> 3) |\n ((byte & 1<<4) >> 1) |\n ((byte & 1<<3) << 1) |\n ((byte & 1<<2) << 3) |\n ((byte & 1<<1) << 5) |\n ((byte & 1<<0) << 7);\n}",
"canonical_original_code": "unsigned char msr_reverse_byte(unsigned char byte)\n{\n return\n ((byte & 1<<7) >> 7) |\n ((byte & 1<<6) >> 5) |\n ((byte & 1<<5) >> 3) |\n ((byte & 1<<4) >> 1) |\n ((byte & 1<<3) << 1) |\n ((byte & 1<<2) << 3) |\n ((byte & 1<<1) << 5) |\n ((byte & 1<<0) << 7);\n}",
"variable_types": [
[
"byte",
"unsigned char"
]
],
"return_type": "unsigned char",
"user_defined_types": [],
"binary_hash": "9f55e616ae6b248d7ddcb8a4c62ff94c7088566002be2d6cd81572c8029da3c4"
}
] |
b054ab9196d001b583c108a2edb336acbfcd0c74a4fed12f1355717b51591f0b | ioerror/libmsr | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"rshift",
"->",
"main"
],
[
"main",
"->",
"rshift"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_404010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"char *func3()\n{\nreturn &_bss_start;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"char *func5()\n{\nchar *result; // rax\n\nif ( !_bss_start )\n{\nresult = func3();\n_bss_start = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"_libc_csu_init",
"void __fastcall func8(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func9(void)\n{\n;\n}"
]
] | [
{
"name": "rshift",
"canonical_name": "func7",
"repo": "ioerror/libmsr",
"decompiled_code": "__int64 __fastcall rshift(unsigned __int8 a1, unsigned __int8 a2, char a3)\n{\nreturn (int)(unsigned __int16)((a1 << 8) | a2) >> (8 - a3);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(unsigned __int8 a1, unsigned __int8 a2, char a3)\n{\nreturn (int)(unsigned __int16)((a1 << 8) | a2) >> (8 - a3);\n}",
"original_code": "unsigned char rshift(unsigned char a, unsigned char b, int shift)\n{\n return (((unsigned short)(a<<8 | b) >> (8 - shift)) & 0x00ff);\n}",
"canonical_original_code": "unsigned char rshift(unsigned char a, unsigned char b, int shift)\n{\n return (((unsigned short)(a<<8 | b) >> (8 - shift)) & 0x00ff);\n}",
"variable_types": [
[
"a",
"unsigned char"
],
[
"b",
"unsigned char"
],
[
"shift",
"int"
]
],
"return_type": "unsigned char",
"user_defined_types": [],
"binary_hash": "b054ab9196d001b583c108a2edb336acbfcd0c74a4fed12f1355717b51591f0b"
},
{
"name": "main",
"canonical_name": "main",
"repo": "ioerror/libmsr",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nint v4; // [rsp+18h] [rbp-18h] BYREF\nchar v5; // [rsp+1Dh] [rbp-13h] BYREF\nunsigned __int8 v6; // [rsp+1Eh] [rbp-12h] BYREF\nunsigned __int8 buf; // [rsp+1Fh] [rbp-11h] BYREF\nssize_t v8; // [rsp+20h] [rbp-10h]\nint fd; // [rsp+2Ch] [rbp-4h]\n\nfd = -1;\nv8 = 0LL;\nif ( argc <= 2 )\n{\nprintf(\"Usage: %s [file] [offset]\\n\", *argv);\nexit(1);\n}\nsscanf(argv[2], \"%d\", &v4);\nif ( v4 < 0 || v4 > 7 )\n{\nputs(\"Error: Offset must be between 0 and 7 (inclusive).\");\nexit(1);\n}\nprintf(\"Offset: %d bits.\\n\", (unsigned int)v4);\nfd = open(argv[1], 0);\nread(fd, &buf, 1uLL);\ndo\n{\nv8 = read(fd, &v6, 1uLL);\nv5 = rshift(buf, v6, v4);\nwrite(2, &v5, 1uLL);\nbuf = v6;\n}\nwhile ( v8 );\nclose(fd);\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nint v4; // [rsp+18h] [rbp-18h] BYREF\nchar v5; // [rsp+1Dh] [rbp-13h] BYREF\nunsigned __int8 v6; // [rsp+1Eh] [rbp-12h] BYREF\nunsigned __int8 buf; // [rsp+1Fh] [rbp-11h] BYREF\nssize_t v8; // [rsp+20h] [rbp-10h]\nint fd; // [rsp+2Ch] [rbp-4h]\n\nfd = -1;\nv8 = 0LL;\nif ( argc <= 2 )\n{\nprintf(\"Usage: %s [file] [offset]\\n\", *argv);\nexit(1);\n}\nsscanf(argv[2], \"%d\", &v4);\nif ( v4 < 0 || v4 > 7 )\n{\nputs(\"Error: Offset must be between 0 and 7 (inclusive).\");\nexit(1);\n}\nprintf(\"Offset: %d bits.\\n\", (unsigned int)v4);\nfd = open(argv[1], 0);\nread(fd, &buf, 1uLL);\ndo\n{\nv8 = read(fd, &v6, 1uLL);\nv5 = func7(buf, v6, v4);\nwrite(2, &v5, 1uLL);\nbuf = v6;\n}\nwhile ( v8 );\nclose(fd);\nreturn 0;\n}",
"original_code": "int main(int argc, char **argv)\n{\n int fd = -1;\n ssize_t bytes_read = 0;\n unsigned char a, b, byte;\n int offset;\n if (argc < 3)\n {\n printf(\"Usage: %s [file] [offset]\\n\", argv[0]);\n exit(1);\n }\n sscanf(argv[2], \"%d\", &offset);\n if (offset < 0 || offset > 7)\n {\n printf(\"Error: Offset must be between 0 and 7 (inclusive).\\n\");\n exit(1);\n }\n printf(\"Offset: %d bits.\\n\", offset);\n fd = open(argv[1], 00);\n read(fd, &a, 1);\n do\n {\n bytes_read = read(fd, &b, 1);\n byte = rshift(a, b, offset);\n write(2, &byte, 1);\n a = b;\n }\n while (bytes_read != 0);\n close(fd);\n return 0;\n}",
"canonical_original_code": "int main(int argc, char **argv)\n{\n int fd = -1;\n long bytes_read = 0;\n unsigned char a; unsigned char b; unsigned char byte;\n int offset;\n if (argc < 3)\n {\n printf(\"Usage: %s [file] [offset]\\n\", argv[0]);\n exit(1);\n }\n sscanf(argv[2], \"%d\", &offset);\n if (offset < 0 || offset > 7)\n {\n printf(\"Error: Offset must be between 0 and 7 (inclusive).\\n\");\n exit(1);\n }\n printf(\"Offset: %d bits.\\n\", offset);\n fd = open(argv[1], 00);\n read(fd, &a, 1);\n do\n {\n bytes_read = read(fd, &b, 1);\n byte = rshift(a, b, offset);\n write(2, &byte, 1);\n a = b;\n }\n while (bytes_read != 0);\n close(fd);\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char **"
],
[
"fd",
"int"
],
[
"bytes_read",
"long"
],
[
"a",
"unsigned char"
],
[
"b",
"unsigned char"
],
[
"byte",
"unsigned char"
],
[
"offset",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "b054ab9196d001b583c108a2edb336acbfcd0c74a4fed12f1355717b51591f0b"
}
] |
0351b4a4c5d62acf590fd37076e04876e9486d7d7844115b92bf35e7bd06f9f6 | pbasista/stc | [
[
"st_slli_bp_simulate_suffix_link_bottom_up",
"->",
"st_slli_bp_mccreight_insert_suffix",
"st_slli_bp_ukkonen_prolong_suffix"
],
[
"st_slli_bp_mccreight_insert_suffix",
"->",
"st_slli_bp_simulate_suffix_link_bottom_up",
"st_slli_bp_create_mccreight"
],
[
"st_slli_bp_ukkonen_prolong_suffix",
"->",
"st_slli_bp_simulate_suffix_link_bottom_up",
"st_slli_bp_ukkonen_prolong_suffixes"
],
[
"st_slli_bp_ukkonen_prolong_suffixes",
"->",
"st_slli_bp_ukkonen_prolong_suffix",
"st_slli_bp_create_ukkonen"
],
[
"st_slli_bp_create_mccreight",
"->",
"st_slli_bp_mccreight_insert_suffix"
],
[
"st_slli_bp_create_ukkonen",
"->",
"st_slli_bp_ukkonen_prolong_suffixes"
]
] | [] | [
{
"name": "st_slli_bp_simulate_suffix_link_bottom_up",
"canonical_name": "func0",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall st_slli_bp_simulate_suffix_link_bottom_up(int *a1, int a2, unsigned int a3, __int64 a4)\n{\n__int64 result; // rax\nint v6; // [rsp+14h] [rbp-1Ch] BYREF\nint *v7; // [rsp+18h] [rbp-18h]\nint v8; // [rsp+28h] [rbp-8h]\nint v9; // [rsp+2Ch] [rbp-4h]\n\nv7 = a1;\nv6 = a2;\nv9 = *a1;\nv8 = 0;\nif ( a2 )\n{\nif ( v6 <= 0 )\n--v6;\nelse\nv6 = *(_DWORD *)(*(_QWORD *)(a4 + 24) + 24LL * v6 + 12);\n*v7 = 0;\nv8 = st_slli_bp_go_up(v7, &v6, a3, a4);\nif ( v8 )\n{\nif ( v8 == -1 )\n{\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\nfwrite(\"Error: Suffix link simulation failed permanently!\\n\", 1uLL, 0x32uLL, stderr);\nresult = 2LL;\n}\n}\nelse\n{\n*(_DWORD *)(*(_QWORD *)(a4 + 24) + 24LL * v9 + 12) = *v7;\nresult = 0LL;\n}\n}\nelse\n{\nfwrite(\"Error: Invalid number of child (0)!\\n\", 1uLL, 0x24uLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(int *a1, int a2, unsigned int a3, __int64 a4)\n{\n__int64 result; // rax\nint v6; // [rsp+14h] [rbp-1Ch] BYREF\nint *v7; // [rsp+18h] [rbp-18h]\nint v8; // [rsp+28h] [rbp-8h]\nint v9; // [rsp+2Ch] [rbp-4h]\n\nv7 = a1;\nv6 = a2;\nv9 = *a1;\nv8 = 0;\nif ( a2 )\n{\nif ( v6 <= 0 )\n--v6;\nelse\nv6 = *(_DWORD *)(*(_QWORD *)(a4 + 24) + 24LL * v6 + 12);\n*v7 = 0;\nv8 = st_slli_bp_go_up(v7, &v6, a3, a4);\nif ( v8 )\n{\nif ( v8 == -1 )\n{\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\nfwrite(\"Error: Suffix link simulation failed permanently!\\n\", 1uLL, 0x32uLL, stderr);\nresult = 2LL;\n}\n}\nelse\n{\n*(_DWORD *)(*(_QWORD *)(a4 + 24) + 24LL * v9 + 12) = *v7;\nresult = 0LL;\n}\n}\nelse\n{\nfwrite(\"Error: Invalid number of child (0)!\\n\", 1uLL, 0x24uLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}",
"original_code": "int st_slli_bp_simulate_suffix_link_bottom_up (signed_integral_type *parent,\n signed_integral_type child,\n unsigned_integral_type target_depth,\n suffix_tree_slli_bp *stree) {\n signed_integral_type starting_from = (*parent);\n int tmp = 0;\n if (child == 0) {\n fprintf(stderr, \"Error: Invalid number of child (0)!\\n\");\n return (1);\n } else if (child > 0) {\n child = stree->tbranch[child].suffix_link;\n } else {\n child = child - 1;\n }\n (*parent) = 0;\n if ((tmp = st_slli_bp_go_up(parent, &child, target_depth,\n stree)) == 0) {\n stree->tbranch[starting_from].suffix_link = (*parent);\n return (0);\n } else if (tmp == (-1)) {\n return (-1);\n } else {\n fprintf(stderr, \"Error: Suffix link simulation \"\n \"failed permanently!\\n\");\n return (2);\n }\n}",
"canonical_original_code": "int st_slli_bp_simulate_suffix_link_bottom_up(int *parent, int child, unsigned int target_depth, struct suffix_tree_slli_bp_struct *stree) {\n int starting_from = (*parent);\n int tmp = 0;\n if (child == 0) {\n fprintf(stderr, \"Error: Invalid number of child (0)!\\n\");\n return (1);\n } else if (child > 0) {\n child = stree->tbranch[child].suffix_link;\n } else {\n child = child - 1;\n }\n (*parent) = 0;\n if ((tmp = st_slli_bp_go_up(parent, &child, target_depth,\n stree)) == 0) {\n stree->tbranch[starting_from].suffix_link = (*parent);\n return (0);\n } else if (tmp == (-1)) {\n return (-1);\n } else {\n fprintf(stderr, \"Error: Suffix link simulation \"\n \"failed permanently!\\n\");\n return (2);\n }\n}",
"variable_types": [
[
"parent",
"int *"
],
[
"child",
"int"
],
[
"target_depth",
"unsigned int"
],
[
"stree",
"struct suffix_tree_slli_bp_struct { unsigned long lr_size; unsigned long br_size; struct leaf_record_slli_bp_struct { int parent; int next_brother; } *tleaf; struct branch_record_slli_bp_struct { int parent; int first_child; int branch_brother; int suffix_link; unsigned int depth; unsigned int head_position; } *tbranch; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; } *"
],
[
"starting_from",
"int"
],
[
"tmp",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct suffix_tree_slli_bp_struct { unsigned long lr_size; unsigned long br_size; struct leaf_record_slli_bp_struct *tleaf; struct branch_record_slli_bp_struct *tbranch; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; }",
"struct leaf_record_slli_bp_struct { int parent; int next_brother; }",
"struct branch_record_slli_bp_struct { int parent; int first_child; int branch_brother; int suffix_link; unsigned int depth; unsigned int head_position; }"
],
"binary_hash": "0351b4a4c5d62acf590fd37076e04876e9486d7d7844115b92bf35e7bd06f9f6"
},
{
"name": "st_slli_bp_mccreight_insert_suffix",
"canonical_name": "func1",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall st_slli_bp_mccreight_insert_suffix(int *a1, unsigned int *a2, unsigned int *a3, __int64 a4, __int64 a5, unsigned __int64 a6, _QWORD *a7)\n{\n__int64 result; // rax\n__int64 v12; // [rsp+38h] [rbp-28h] BYREF\nunsigned int v13; // [rsp+40h] [rbp-20h] BYREF\nunsigned int v14; // [rsp+44h] [rbp-1Ch] BYREF\nunsigned int v15; // [rsp+48h] [rbp-18h] BYREF\nint v16; // [rsp+4Ch] [rbp-14h]\nunsigned __int64 v17; // [rsp+50h] [rbp-10h]\nint v18; // [rsp+5Ch] [rbp-4h]\n\nv18 = 0;\nv15 = 0;\nv14 = 0;\nv13 = 0;\nv12 = *(unsigned int *)(a7[3] + 24LL * *a1 + 16) + a4;\nv17 = a7[5];\nv16 = 0;\nif ( v17 == a7[4] && v17 < a6 && (int)st_slli_bp_reallocate(0LL, a6, a7) > 0 )\n{\nfwrite(\"Error: Could not reallocate memory!\\n\", 1uLL, 0x24uLL, stderr);\nresult = 1LL;\n}\nelse\n{\nwhile ( 1 )\n{\nv16 = st_slli_bp_branch_once((unsigned int)*a1, &v15, &v14, v12, a5, a7);\nif ( v16 )\n{\nif ( v16 == 1 )\n{\nfprintf(stderr, \"Error: Insertion of the suffix number %zu failed!\\n\", a4);\nresult = 4LL;\n}\nelse\n{\nif ( v16 == 2 )\n{\nfwrite(\n\"Information: Creating the first child of the parent.\\nThis should not happen more than once!\\n\",\n1uLL,\n0x5CuLL,\nstderr);\n*(_DWORD *)(a7[3] + 24LL * *a1 + 4) = -(int)a4;\n*(_DWORD *)(8 * a4 + a7[2]) = *a1;\n*(_DWORD *)(a7[2] + 8 * a4 + 4) = 0;\n}\nelse\n{\nst_slli_bp_create_leaf((unsigned int)*a1, v15, v14, (unsigned int)-(int)a4, a7);\n}\nif ( *a1 > 1 )\n*a1 = *(_DWORD *)(a7[3] + 24LL * *a1 + 12);\nresult = 0LL;\n}\nreturn result;\n}\nif ( (unsigned int)st_slli_bp_edge_slowscan((unsigned int)*a1, v15, v12, &v13, a5, a6 + 1, a7) )\nbreak;\nst_slli_bp_edge_descend(a1, &v15, &v14, &v12, a6 + 1, a7);\nif ( *a1 < 0 )\n{\nfwrite(\n\"Error: The newly inserted suffix already has the corresponding leaf node\\npresent in the suffix tree!\\n\",\n1uLL,\n0x65uLL,\nstderr);\nreturn 2LL;\n}\n}\nv18 = v15;\nst_slli_bp_split_edge(a1, &v15, &v14, &v12, v13, (unsigned int)a4, a7);\nst_slli_bp_create_leaf((unsigned int)*a1, v15, v14, (unsigned int)-(int)a4, a7);\nif ( *a2 )\n{\nif ( a4 + *a3 != v12 )\n{\nfprintf(\nstderr,\n\"Error! The last opportunity to set the target of a suffix link missed! (suffix link source = %d)\\n\",\n*a2);\nreturn 3LL;\n}\n*(_DWORD *)(a7[3] + 24LL * (int)*a2 + 12) = *a1;\n}\n*a2 = *a1;\n*a3 = *(_DWORD *)(a7[3] + 24LL * *a1 + 16) - 1;\nif ( !(unsigned int)st_slli_bp_simulate_suffix_link_bottom_up(a1, v18, *a3, (__int64)a7) )\n{\n*a2 = 0;\n*a3 = 0;\n}\nresult = 0LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(int *a1, unsigned int *a2, unsigned int *a3, __int64 a4, __int64 a5, unsigned __int64 a6, _QWORD *a7)\n{\n__int64 result; // rax\n__int64 v12; // [rsp+38h] [rbp-28h] BYREF\nunsigned int v13; // [rsp+40h] [rbp-20h] BYREF\nunsigned int v14; // [rsp+44h] [rbp-1Ch] BYREF\nunsigned int v15; // [rsp+48h] [rbp-18h] BYREF\nint v16; // [rsp+4Ch] [rbp-14h]\nunsigned __int64 v17; // [rsp+50h] [rbp-10h]\nint v18; // [rsp+5Ch] [rbp-4h]\n\nv18 = 0;\nv15 = 0;\nv14 = 0;\nv13 = 0;\nv12 = *(unsigned int *)(a7[3] + 24LL * *a1 + 16) + a4;\nv17 = a7[5];\nv16 = 0;\nif ( v17 == a7[4] && v17 < a6 && (int)st_slli_bp_reallocate(0LL, a6, a7) > 0 )\n{\nfwrite(\"Error: Could not reallocate memory!\\n\", 1uLL, 0x24uLL, stderr);\nresult = 1LL;\n}\nelse\n{\nwhile ( 1 )\n{\nv16 = st_slli_bp_branch_once((unsigned int)*a1, &v15, &v14, v12, a5, a7);\nif ( v16 )\n{\nif ( v16 == 1 )\n{\nfprintf(stderr, \"Error: Insertion of the suffix number %zu failed!\\n\", a4);\nresult = 4LL;\n}\nelse\n{\nif ( v16 == 2 )\n{\nfwrite(\n\"Information: Creating the first child of the parent.\\nThis should not happen more than once!\\n\",\n1uLL,\n0x5CuLL,\nstderr);\n*(_DWORD *)(a7[3] + 24LL * *a1 + 4) = -(int)a4;\n*(_DWORD *)(8 * a4 + a7[2]) = *a1;\n*(_DWORD *)(a7[2] + 8 * a4 + 4) = 0;\n}\nelse\n{\nst_slli_bp_create_leaf((unsigned int)*a1, v15, v14, (unsigned int)-(int)a4, a7);\n}\nif ( *a1 > 1 )\n*a1 = *(_DWORD *)(a7[3] + 24LL * *a1 + 12);\nresult = 0LL;\n}\nreturn result;\n}\nif ( (unsigned int)st_slli_bp_edge_slowscan((unsigned int)*a1, v15, v12, &v13, a5, a6 + 1, a7) )\nbreak;\nst_slli_bp_edge_descend(a1, &v15, &v14, &v12, a6 + 1, a7);\nif ( *a1 < 0 )\n{\nfwrite(\n\"Error: The newly inserted suffix already has the corresponding leaf node\\npresent in the suffix tree!\\n\",\n1uLL,\n0x65uLL,\nstderr);\nreturn 2LL;\n}\n}\nv18 = v15;\nst_slli_bp_split_edge(a1, &v15, &v14, &v12, v13, (unsigned int)a4, a7);\nst_slli_bp_create_leaf((unsigned int)*a1, v15, v14, (unsigned int)-(int)a4, a7);\nif ( *a2 )\n{\nif ( a4 + *a3 != v12 )\n{\nfprintf(\nstderr,\n\"Error! The last opportunity to set the target of a suffix link missed! (suffix link source = %d)\\n\",\n*a2);\nreturn 3LL;\n}\n*(_DWORD *)(a7[3] + 24LL * (int)*a2 + 12) = *a1;\n}\n*a2 = *a1;\n*a3 = *(_DWORD *)(a7[3] + 24LL * *a1 + 16) - 1;\nif ( !(unsigned int)func0(a1, v18, *a3, (__int64)a7) )\n{\n*a2 = 0;\n*a3 = 0;\n}\nresult = 0LL;\n}\nreturn result;\n}",
"original_code": "int st_slli_bp_mccreight_insert_suffix (signed_integral_type *parent,\n signed_integral_type *sl_source,\n unsigned_integral_type *sl_targets_depth,\n size_t starting_position,\n const character_type *text,\n size_t length,\n suffix_tree_slli_bp *stree) {\n signed_integral_type latest_child = 0;\n signed_integral_type child = 0;\n signed_integral_type prev_child = 0;\n signed_integral_type last_match_position = 0;\n size_t position = starting_position +\n stree->tbranch[(*parent)].depth;\n size_t tbranch_size = (size_t)(stree->tbranch_size);\n int tmp = 0;\n if ((tbranch_size == stree->branching_nodes) &&\n (tbranch_size < length)) {\n if (st_slli_bp_reallocate((size_t)(0), length, stree) > 0) {\n fprintf(stderr, \"Error: Could not \"\n \"reallocate memory!\\n\");\n return (1);\n }\n }\n while ((tmp = st_slli_bp_branch_once((*parent), &child, &prev_child,\n position, text, stree)) == 0) {\n if (st_slli_bp_edge_slowscan((*parent), child, position,\n &last_match_position, text, length + 1, stree) == 0) {\n st_slli_bp_edge_descend(parent, &child, &prev_child,\n &position, length + 1, stree);\n if ((*parent) < 0) {\n fprintf(stderr, \"Error: The newly inserted \"\n \"suffix already has the \"\n \"corresponding leaf node\\n\"\n \"present in the \"\n \"suffix tree!\\n\");\n return (2);\n }\n } else {\n latest_child = child;\n st_slli_bp_split_edge(parent, &child, &prev_child,\n &position, last_match_position,\n (unsigned_integral_type)(starting_position),\n stree);\n st_slli_bp_create_leaf((*parent), child, prev_child,\n (-(signed_integral_type)(starting_position)),\n stree);\n if ((*sl_source) != 0) {\n if (position == starting_position +\n (*sl_targets_depth)) {\n stree->tbranch[(*sl_source)].\n suffix_link = (*parent);\n } else {\n fprintf(stderr, \"Error! The last \"\n \"opportunity to \"\n \"set the target \"\n \"of a suffix link \"\n \"missed! (suffix \"\n \"link source = %d)\\n\",\n (*sl_source));\n return (3);\n }\n }\n (*sl_source) = (*parent);\n (*sl_targets_depth) =\n stree->tbranch[(*parent)].depth - 1;\n if (st_slli_bp_simulate_suffix_link_bottom_up(parent,\n latest_child, (*sl_targets_depth),\n stree) == 0) {\n (*sl_source) = 0;\n (*sl_targets_depth) = 0;\n }\n return (0);\n }\n }\n if (tmp == 1) {\n fprintf(stderr, \"Error: Insertion of the suffix number \"\n \"%zu failed!\\n\", starting_position);\n return (4);\n } else if (tmp == 2) {\n fprintf(stderr, \"Information: Creating the first child \"\n \"of the parent.\\nThis should not happen \"\n \"more than once!\\n\");\n stree->tbranch[(*parent)].first_child =\n (-(signed_integral_type)(starting_position));\n stree->tleaf[starting_position].parent = (*parent);\n stree->tleaf[starting_position].next_brother = 0;\n } else {\n st_slli_bp_create_leaf((*parent), child, prev_child,\n (-(signed_integral_type)(starting_position)),\n stree);\n }\n if ((*parent) > 1) {\n (*parent) = stree->tbranch[(*parent)].suffix_link;\n }\n return (0);\n}",
"canonical_original_code": "int st_slli_bp_mccreight_insert_suffix(int *parent, int *sl_source, unsigned int *sl_targets_depth, unsigned long starting_position, char *text, unsigned long length, struct suffix_tree_slli_bp_struct *stree) {\n int latest_child = 0;\n int child = 0;\n int prev_child = 0;\n int last_match_position = 0;\n unsigned long position = starting_position +\n stree->tbranch[(*parent)].depth;\n unsigned long tbranch_size = (size_t)(stree->tbranch_size);\n int tmp = 0;\n if ((tbranch_size == stree->branching_nodes) &&\n (tbranch_size < length)) {\n if (st_slli_bp_reallocate((unsigned long)(0), length, stree) > 0) {\n fprintf(stderr, \"Error: Could not \"\n \"reallocate memory!\\n\");\n return (1);\n }\n }\n while ((tmp = st_slli_bp_branch_once((*parent), &child, &prev_child,\n position, text, stree)) == 0) {\n if (st_slli_bp_edge_slowscan((*parent), child, position,\n &last_match_position, text, length + 1, stree) == 0) {\n st_slli_bp_edge_descend(parent, &child, &prev_child,\n &position, length + 1, stree);\n if ((*parent) < 0) {\n fprintf(stderr, \"Error: The newly inserted \"\n \"suffix already has the \"\n \"corresponding leaf node\\n\"\n \"present in the \"\n \"suffix tree!\\n\");\n return (2);\n }\n } else {\n latest_child = child;\n st_slli_bp_split_edge(parent, &child, &prev_child,\n &position, last_match_position,\n (unsigned_integral_type)(starting_position),\n stree);\n st_slli_bp_create_leaf((*parent), child, prev_child,\n (-(signed_integral_type)(starting_position)),\n stree);\n if ((*sl_source) != 0) {\n if (position == starting_position +\n (*sl_targets_depth)) {\n stree->tbranch[(*sl_source)].\n suffix_link = (*parent);\n } else {\n fprintf(stderr, \"Error! The last \"\n \"opportunity to \"\n \"set the target \"\n \"of a suffix link \"\n \"missed! (suffix \"\n \"link source = %d)\\n\",\n (*sl_source));\n return (3);\n }\n }\n (*sl_source) = (*parent);\n (*sl_targets_depth) =\n stree->tbranch[(*parent)].depth - 1;\n if (st_slli_bp_simulate_suffix_link_bottom_up(parent,\n latest_child, (*sl_targets_depth),\n stree) == 0) {\n (*sl_source) = 0;\n (*sl_targets_depth) = 0;\n }\n return (0);\n }\n }\n if (tmp == 1) {\n fprintf(stderr, \"Error: Insertion of the suffix number \"\n \"%zu failed!\\n\", starting_position);\n return (4);\n } else if (tmp == 2) {\n fprintf(stderr, \"Information: Creating the first child \"\n \"of the parent.\\nThis should not happen \"\n \"more than once!\\n\");\n stree->tbranch[(*parent)].first_child =\n (-(signed_integral_type)(starting_position));\n stree->tleaf[starting_position].parent = (*parent);\n stree->tleaf[starting_position].next_brother = 0;\n } else {\n st_slli_bp_create_leaf((*parent), child, prev_child,\n (-(signed_integral_type)(starting_position)),\n stree);\n }\n if ((*parent) > 1) {\n (*parent) = stree->tbranch[(*parent)].suffix_link;\n }\n return (0);\n}",
"variable_types": [
[
"parent",
"int *"
],
[
"sl_source",
"int *"
],
[
"sl_targets_depth",
"unsigned int *"
],
[
"starting_position",
"unsigned long"
],
[
"text",
"char *"
],
[
"length",
"unsigned long"
],
[
"stree",
"struct suffix_tree_slli_bp_struct { unsigned long lr_size; unsigned long br_size; struct leaf_record_slli_bp_struct { int parent; int next_brother; } *tleaf; struct branch_record_slli_bp_struct { int parent; int first_child; int branch_brother; int suffix_link; unsigned int depth; unsigned int head_position; } *tbranch; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; } *"
],
[
"latest_child",
"int"
],
[
"child",
"int"
],
[
"prev_child",
"int"
],
[
"last_match_position",
"int"
],
[
"position",
"unsigned long"
],
[
"tbranch_size",
"unsigned long"
],
[
"tmp",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct suffix_tree_slli_bp_struct { unsigned long lr_size; unsigned long br_size; struct leaf_record_slli_bp_struct *tleaf; struct branch_record_slli_bp_struct *tbranch; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; }",
"struct leaf_record_slli_bp_struct { int parent; int next_brother; }",
"struct branch_record_slli_bp_struct { int parent; int first_child; int branch_brother; int suffix_link; unsigned int depth; unsigned int head_position; }"
],
"binary_hash": "0351b4a4c5d62acf590fd37076e04876e9486d7d7844115b92bf35e7bd06f9f6"
},
{
"name": "st_slli_bp_ukkonen_prolong_suffix",
"canonical_name": "func2",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall st_slli_bp_ukkonen_prolong_suffix(__int64 a1, __int64 a2, __int64 *a3, int *a4, unsigned int *a5, unsigned int *a6, __int64 a7, __int64 a8)\n{\n__int64 result; // rax\n__int64 v13; // [rsp+38h] [rbp-28h] BYREF\nunsigned int v14; // [rsp+44h] [rbp-1Ch] BYREF\nunsigned int v15; // [rsp+48h] [rbp-18h] BYREF\nunsigned int v16; // [rsp+4Ch] [rbp-14h] BYREF\nint v17; // [rsp+50h] [rbp-10h]\nint v18; // [rsp+54h] [rbp-Ch]\nint v19; // [rsp+58h] [rbp-8h]\nint v20; // [rsp+5Ch] [rbp-4h]\n\nv20 = 0;\nv19 = 0;\nv16 = 0;\nv15 = 0;\nv14 = 0;\nv13 = *a3;\nv18 = 0;\nv17 = 0;\nif ( a1 == a2 )\nreturn 0xFFFFFFFFLL;\nwhile ( 1 )\n{\nv18 = st_slli_bp_branch_once((unsigned int)*a4, &v16, &v15, v13, a7, a8);\nif ( v18 )\n{\nif ( v18 == 1 )\n{\nfprintf(stderr, \"Error: Prolonging of the suffix number %zu to the length of %zu failed!\\n\", a1, a2 - a1);\nresult = 2LL;\n}\nelse\n{\nif ( v18 == 2 )\n{\nfwrite(\n\"Information: Creating the first child of the parent.\\nThis should not happen more than once!\\n\",\n1uLL,\n0x5CuLL,\nstderr);\n*(_DWORD *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 4) = -(int)a1;\n*(_DWORD *)(8 * a1 + *(_QWORD *)(a8 + 16)) = *a4;\n*(_DWORD *)(*(_QWORD *)(a8 + 16) + 8 * a1 + 4) = 0;\n}\nelse\n{\nst_slli_bp_create_leaf((unsigned int)*a4, v16, v15, (unsigned int)-(int)a1, a8);\n}\nif ( *a4 > 1 )\n*a4 = *(_DWORD *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 12);\n*a3 = *(unsigned int *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16) + a1 + 1;\nresult = 0LL;\n}\nreturn result;\n}\nv17 = st_slli_bp_edge_slowscan((unsigned int)*a4, v16, v13, &v14, a7, a2 - 1, a8);\nif ( v17 )\nbreak;\nv19 = *a4;\nst_slli_bp_edge_descend(a4, &v16, &v15, &v13, a2 - 1, a8);\nif ( *a4 < 0 )\n{\n*a4 = v19;\nif ( *a4 != 1 )\n*a4 = *(_DWORD *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 12);\n*a3 = *(unsigned int *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16) + a1 + 1;\nreturn 4294967294LL;\n}\nif ( a2 == *(unsigned int *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16) + a1 )\n{\n*a3 = a1 + *(unsigned int *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16);\nreturn 4294967293LL;\n}\n}\nif ( v17 == 2 )\n{\n*a3 = a1 + *(unsigned int *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16);\nreturn 4294967292LL;\n}\nv20 = v16;\nst_slli_bp_split_edge(a4, &v16, &v15, &v13, v14, (unsigned int)a1, a8);\nst_slli_bp_create_leaf((unsigned int)*a4, v16, v15, (unsigned int)-(int)a1, a8);\nif ( *a5 )\n{\nif ( a1 + *a6 != v13 )\n{\nfprintf(\nstderr,\n\"Error! The last opportunity to set the target of a suffix link missed! (suffix link source = %d)\\n\",\n*a5);\nreturn 1LL;\n}\n*(_DWORD *)(*(_QWORD *)(a8 + 24) + 24LL * (int)*a5 + 12) = *a4;\n}\n*a5 = *a4;\n*a6 = *(_DWORD *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16) - 1;\nif ( !(unsigned int)st_slli_bp_simulate_suffix_link_bottom_up(a4, v20, *a6, a8) )\n{\n*a5 = 0;\n*a6 = 0;\n}\n*a3 = *(unsigned int *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16) + a1 + 1;\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, __int64 a2, __int64 *a3, int *a4, unsigned int *a5, unsigned int *a6, __int64 a7, __int64 a8)\n{\n__int64 result; // rax\n__int64 v13; // [rsp+38h] [rbp-28h] BYREF\nunsigned int v14; // [rsp+44h] [rbp-1Ch] BYREF\nunsigned int v15; // [rsp+48h] [rbp-18h] BYREF\nunsigned int v16; // [rsp+4Ch] [rbp-14h] BYREF\nint v17; // [rsp+50h] [rbp-10h]\nint v18; // [rsp+54h] [rbp-Ch]\nint v19; // [rsp+58h] [rbp-8h]\nint v20; // [rsp+5Ch] [rbp-4h]\n\nv20 = 0;\nv19 = 0;\nv16 = 0;\nv15 = 0;\nv14 = 0;\nv13 = *a3;\nv18 = 0;\nv17 = 0;\nif ( a1 == a2 )\nreturn 0xFFFFFFFFLL;\nwhile ( 1 )\n{\nv18 = st_slli_bp_branch_once((unsigned int)*a4, &v16, &v15, v13, a7, a8);\nif ( v18 )\n{\nif ( v18 == 1 )\n{\nfprintf(stderr, \"Error: Prolonging of the suffix number %zu to the length of %zu failed!\\n\", a1, a2 - a1);\nresult = 2LL;\n}\nelse\n{\nif ( v18 == 2 )\n{\nfwrite(\n\"Information: Creating the first child of the parent.\\nThis should not happen more than once!\\n\",\n1uLL,\n0x5CuLL,\nstderr);\n*(_DWORD *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 4) = -(int)a1;\n*(_DWORD *)(8 * a1 + *(_QWORD *)(a8 + 16)) = *a4;\n*(_DWORD *)(*(_QWORD *)(a8 + 16) + 8 * a1 + 4) = 0;\n}\nelse\n{\nst_slli_bp_create_leaf((unsigned int)*a4, v16, v15, (unsigned int)-(int)a1, a8);\n}\nif ( *a4 > 1 )\n*a4 = *(_DWORD *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 12);\n*a3 = *(unsigned int *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16) + a1 + 1;\nresult = 0LL;\n}\nreturn result;\n}\nv17 = st_slli_bp_edge_slowscan((unsigned int)*a4, v16, v13, &v14, a7, a2 - 1, a8);\nif ( v17 )\nbreak;\nv19 = *a4;\nst_slli_bp_edge_descend(a4, &v16, &v15, &v13, a2 - 1, a8);\nif ( *a4 < 0 )\n{\n*a4 = v19;\nif ( *a4 != 1 )\n*a4 = *(_DWORD *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 12);\n*a3 = *(unsigned int *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16) + a1 + 1;\nreturn 4294967294LL;\n}\nif ( a2 == *(unsigned int *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16) + a1 )\n{\n*a3 = a1 + *(unsigned int *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16);\nreturn 4294967293LL;\n}\n}\nif ( v17 == 2 )\n{\n*a3 = a1 + *(unsigned int *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16);\nreturn 4294967292LL;\n}\nv20 = v16;\nst_slli_bp_split_edge(a4, &v16, &v15, &v13, v14, (unsigned int)a1, a8);\nst_slli_bp_create_leaf((unsigned int)*a4, v16, v15, (unsigned int)-(int)a1, a8);\nif ( *a5 )\n{\nif ( a1 + *a6 != v13 )\n{\nfprintf(\nstderr,\n\"Error! The last opportunity to set the target of a suffix link missed! (suffix link source = %d)\\n\",\n*a5);\nreturn 1LL;\n}\n*(_DWORD *)(*(_QWORD *)(a8 + 24) + 24LL * (int)*a5 + 12) = *a4;\n}\n*a5 = *a4;\n*a6 = *(_DWORD *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16) - 1;\nif ( !(unsigned int)func0(a4, v20, *a6, a8) )\n{\n*a5 = 0;\n*a6 = 0;\n}\n*a3 = *(unsigned int *)(*(_QWORD *)(a8 + 24) + 24LL * *a4 + 16) + a1 + 1;\nreturn 0LL;\n}",
"original_code": "int st_slli_bp_ukkonen_prolong_suffix (size_t starting_position,\n size_t ending_position,\n size_t *active_index,\n signed_integral_type *parent,\n signed_integral_type *sl_source,\n unsigned_integral_type *sl_targets_depth,\n const character_type *text,\n suffix_tree_slli_bp *stree) {\n signed_integral_type latest_child = 0;\n signed_integral_type grandpa = 0;\n signed_integral_type child = 0;\n signed_integral_type prev_child = 0;\n signed_integral_type last_match_position = 0;\n size_t position = (*active_index);\n int tmp = 0;\n int slowscan_return = 0;\n if (starting_position == ending_position) {\n return (-1);\n }\n while ((tmp = st_slli_bp_branch_once((*parent), &child, &prev_child,\n position, text, stree)) == 0) {\n if ((slowscan_return = st_slli_bp_edge_slowscan((*parent),\n child, position, &last_match_position, text,\n ending_position - 1, stree)) == 0) {\n grandpa = (*parent);\n st_slli_bp_edge_descend(parent, &child, &prev_child,\n &position, ending_position - 1, stree);\n if ((*parent) < 0) {\n (*parent) = grandpa;\n if ((*parent) != 1) {\n (*parent) = stree->tbranch[(*parent)].\n suffix_link;\n }\n (*active_index) = starting_position + 1 +\n (size_t)(stree->tbranch[(*parent)].depth);\n return (-2);\n } else if (starting_position +\n stree->tbranch[(*parent)].depth ==\n ending_position) {\n (*active_index) = starting_position +\n stree->tbranch[(*parent)].depth;\n return (-3);\n }\n } else if (slowscan_return == 2) {\n (*active_index) = starting_position +\n stree->tbranch[(*parent)].depth;\n return (-4);\n } else {\n latest_child = child;\n st_slli_bp_split_edge(parent, &child, &prev_child,\n &position, last_match_position,\n (unsigned_integral_type)(starting_position),\n stree);\n st_slli_bp_create_leaf((*parent), child, prev_child,\n (-(signed_integral_type)(starting_position)),\n stree);\n if ((*sl_source) != 0) {\n if (position == starting_position +\n (*sl_targets_depth)) {\n stree->tbranch[(*sl_source)].\n suffix_link = (*parent);\n } else {\n fprintf(stderr, \"Error! The last \"\n \"opportunity to \"\n \"set the target \"\n \"of a suffix link \"\n \"missed! (suffix \"\n \"link source = %d)\\n\",\n (*sl_source));\n return (1);\n }\n }\n (*sl_source) = (*parent);\n (*sl_targets_depth) =\n stree->tbranch[(*parent)].depth - 1;\n if (st_slli_bp_simulate_suffix_link_bottom_up(parent,\n latest_child, (*sl_targets_depth),\n stree) == 0) {\n (*sl_source) = 0;\n (*sl_targets_depth) = 0;\n }\n (*active_index) = starting_position + 1 +\n stree->tbranch[(*parent)].depth;\n return (0);\n }\n }\n if (tmp == 1) {\n fprintf(stderr, \"Error: Prolonging of the suffix number \"\n \"%zu to the length of %zu failed!\\n\",\n starting_position,\n ending_position - starting_position);\n return (2);\n } else if (tmp == 2) {\n fprintf(stderr, \"Information: Creating the first child \"\n \"of the parent.\\nThis should not happen \"\n \"more than once!\\n\");\n stree->tbranch[(*parent)].first_child =\n (-(signed_integral_type)(starting_position));\n stree->tleaf[starting_position].parent = (*parent);\n stree->tleaf[starting_position].next_brother = 0;\n } else {\n st_slli_bp_create_leaf((*parent), child, prev_child,\n (-(signed_integral_type)(starting_position)),\n stree);\n }\n if ((*parent) > 1) {\n (*parent) = stree->tbranch[(*parent)].suffix_link;\n }\n (*active_index) = starting_position + 1 +\n stree->tbranch[(*parent)].depth;\n return (0);\n}",
"canonical_original_code": "int st_slli_bp_ukkonen_prolong_suffix(unsigned long starting_position, unsigned long ending_position, unsigned long *active_index, int *parent, int *sl_source, unsigned int *sl_targets_depth, char *text, struct suffix_tree_slli_bp_struct *stree) {\n int latest_child = 0;\n int grandpa = 0;\n int child = 0;\n int prev_child = 0;\n int last_match_position = 0;\n unsigned long position = (*active_index);\n int tmp = 0;\n int slowscan_return = 0;\n if (starting_position == ending_position) {\n return (-1);\n }\n while ((tmp = st_slli_bp_branch_once((*parent), &child, &prev_child,\n position, text, stree)) == 0) {\n if ((slowscan_return = st_slli_bp_edge_slowscan((*parent),\n child, position, &last_match_position, text,\n ending_position - 1, stree)) == 0) {\n grandpa = (*parent);\n st_slli_bp_edge_descend(parent, &child, &prev_child,\n &position, ending_position - 1, stree);\n if ((*parent) < 0) {\n (*parent) = grandpa;\n if ((*parent) != 1) {\n (*parent) = stree->tbranch[(*parent)].\n suffix_link;\n }\n (*active_index) = starting_position + 1 +\n (unsigned long)(stree->tbranch[(*parent)].depth);\n return (-2);\n } else if (starting_position +\n stree->tbranch[(*parent)].depth ==\n ending_position) {\n (*active_index) = starting_position +\n stree->tbranch[(*parent)].depth;\n return (-3);\n }\n } else if (slowscan_return == 2) {\n (*active_index) = starting_position +\n stree->tbranch[(*parent)].depth;\n return (-4);\n } else {\n latest_child = child;\n st_slli_bp_split_edge(parent, &child, &prev_child,\n &position, last_match_position,\n (unsigned_integral_type)(starting_position),\n stree);\n st_slli_bp_create_leaf((*parent), child, prev_child,\n (-(signed_integral_type)(starting_position)),\n stree);\n if ((*sl_source) != 0) {\n if (position == starting_position +\n (*sl_targets_depth)) {\n stree->tbranch[(*sl_source)].\n suffix_link = (*parent);\n } else {\n fprintf(stderr, \"Error! The last \"\n \"opportunity to \"\n \"set the target \"\n \"of a suffix link \"\n \"missed! (suffix \"\n \"link source = %d)\\n\",\n (*sl_source));\n return (1);\n }\n }\n (*sl_source) = (*parent);\n (*sl_targets_depth) =\n stree->tbranch[(*parent)].depth - 1;\n if (st_slli_bp_simulate_suffix_link_bottom_up(parent,\n latest_child, (*sl_targets_depth),\n stree) == 0) {\n (*sl_source) = 0;\n (*sl_targets_depth) = 0;\n }\n (*active_index) = starting_position + 1 +\n stree->tbranch[(*parent)].depth;\n return (0);\n }\n }\n if (tmp == 1) {\n fprintf(stderr, \"Error: Prolonging of the suffix number \"\n \"%zu to the length of %zu failed!\\n\",\n starting_position,\n ending_position - starting_position);\n return (2);\n } else if (tmp == 2) {\n fprintf(stderr, \"Information: Creating the first child \"\n \"of the parent.\\nThis should not happen \"\n \"more than once!\\n\");\n stree->tbranch[(*parent)].first_child =\n (-(signed_integral_type)(starting_position));\n stree->tleaf[starting_position].parent = (*parent);\n stree->tleaf[starting_position].next_brother = 0;\n } else {\n st_slli_bp_create_leaf((*parent), child, prev_child,\n (-(signed_integral_type)(starting_position)),\n stree);\n }\n if ((*parent) > 1) {\n (*parent) = stree->tbranch[(*parent)].suffix_link;\n }\n (*active_index) = starting_position + 1 +\n stree->tbranch[(*parent)].depth;\n return (0);\n}",
"variable_types": [
[
"starting_position",
"unsigned long"
],
[
"ending_position",
"unsigned long"
],
[
"active_index",
"unsigned long *"
],
[
"parent",
"int *"
],
[
"sl_source",
"int *"
],
[
"sl_targets_depth",
"unsigned int *"
],
[
"text",
"char *"
],
[
"stree",
"struct suffix_tree_slli_bp_struct { unsigned long lr_size; unsigned long br_size; struct leaf_record_slli_bp_struct { int parent; int next_brother; } *tleaf; struct branch_record_slli_bp_struct { int parent; int first_child; int branch_brother; int suffix_link; unsigned int depth; unsigned int head_position; } *tbranch; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; } *"
],
[
"latest_child",
"int"
],
[
"grandpa",
"int"
],
[
"child",
"int"
],
[
"prev_child",
"int"
],
[
"last_match_position",
"int"
],
[
"position",
"unsigned long"
],
[
"tmp",
"int"
],
[
"slowscan_return",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct suffix_tree_slli_bp_struct { unsigned long lr_size; unsigned long br_size; struct leaf_record_slli_bp_struct *tleaf; struct branch_record_slli_bp_struct *tbranch; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; }",
"struct leaf_record_slli_bp_struct { int parent; int next_brother; }",
"struct branch_record_slli_bp_struct { int parent; int first_child; int branch_brother; int suffix_link; unsigned int depth; unsigned int head_position; }"
],
"binary_hash": "0351b4a4c5d62acf590fd37076e04876e9486d7d7844115b92bf35e7bd06f9f6"
},
{
"name": "st_slli_bp_ukkonen_prolong_suffixes",
"canonical_name": "func3",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall st_slli_bp_ukkonen_prolong_suffixes(__int64 *a1, __int64 a2, __int64 *a3, int *a4, __int64 a5, unsigned __int64 a6, __int64 a7)\n{\n__int64 result; // rax\nunsigned int v11; // [rsp+30h] [rbp-20h] BYREF\nunsigned int v12; // [rsp+34h] [rbp-1Ch] BYREF\nunsigned __int64 v13; // [rsp+38h] [rbp-18h]\nunsigned __int64 v14; // [rsp+40h] [rbp-10h]\nint v15; // [rsp+4Ch] [rbp-4h]\n\nv12 = 0;\nv11 = 0;\nv14 = a2 + *(_QWORD *)(a7 + 32) - *a1 - 1;\nv15 = 0;\nv13 = *(_QWORD *)(a7 + 40);\nif ( v13 >= v14 || v13 >= a6 || (int)st_slli_bp_reallocate(v14, a6, a7) <= 0 )\n{\nwhile ( 1 )\n{\nv15 = st_slli_bp_ukkonen_prolong_suffix(*a1, a2, a3, a4, &v12, &v11, a5, a7);\nif ( v15 != -1 )\nbreak;\n++*a1;\n}\nwhile ( !v15 )\nv15 = st_slli_bp_ukkonen_prolong_suffix(++*a1, a2, a3, a4, &v12, &v11, a5, a7);\nif ( v15 <= 0 )\n{\nresult = 0LL;\n}\nelse\n{\nfprintf(stderr, \"Error: Could not prolong suffixes to the ending position %zu!\\n\", a2);\nresult = 2LL;\n}\n}\nelse\n{\nfwrite(\"Error: Could not reallocate memory!\\n\", 1uLL, 0x24uLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 *a1, __int64 a2, __int64 *a3, int *a4, __int64 a5, unsigned __int64 a6, __int64 a7)\n{\n__int64 result; // rax\nunsigned int v11; // [rsp+30h] [rbp-20h] BYREF\nunsigned int v12; // [rsp+34h] [rbp-1Ch] BYREF\nunsigned __int64 v13; // [rsp+38h] [rbp-18h]\nunsigned __int64 v14; // [rsp+40h] [rbp-10h]\nint v15; // [rsp+4Ch] [rbp-4h]\n\nv12 = 0;\nv11 = 0;\nv14 = a2 + *(_QWORD *)(a7 + 32) - *a1 - 1;\nv15 = 0;\nv13 = *(_QWORD *)(a7 + 40);\nif ( v13 >= v14 || v13 >= a6 || (int)st_slli_bp_reallocate(v14, a6, a7) <= 0 )\n{\nwhile ( 1 )\n{\nv15 = func2(*a1, a2, a3, a4, &v12, &v11, a5, a7);\nif ( v15 != -1 )\nbreak;\n++*a1;\n}\nwhile ( !v15 )\nv15 = func2(++*a1, a2, a3, a4, &v12, &v11, a5, a7);\nif ( v15 <= 0 )\n{\nresult = 0LL;\n}\nelse\n{\nfprintf(stderr, \"Error: Could not prolong suffixes to the ending position %zu!\\n\", a2);\nresult = 2LL;\n}\n}\nelse\n{\nfwrite(\"Error: Could not reallocate memory!\\n\", 1uLL, 0x24uLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}",
"original_code": "int st_slli_bp_ukkonen_prolong_suffixes (size_t *starting_position,\n size_t ending_position,\n size_t *active_index,\n signed_integral_type *active_node,\n const character_type *text,\n size_t length,\n suffix_tree_slli_bp *stree) {\n signed_integral_type sl_source = 0;\n unsigned_integral_type sl_targets_depth = 0;\n size_t maximum_possible_size = stree->branching_nodes +\n ending_position - (*starting_position) - 1;\n int tmp = 0;\n size_t tbranch_size = (size_t)(stree->tbranch_size);\n if ((tbranch_size < maximum_possible_size) &&\n (tbranch_size < length)) {\n if (st_slli_bp_reallocate(maximum_possible_size,\n length, stree) > 0) {\n fprintf(stderr, \"Error: Could not \"\n \"reallocate memory!\\n\");\n return (1);\n }\n }\n while ((tmp = st_slli_bp_ukkonen_prolong_suffix((*starting_position),\n ending_position, active_index,\n active_node, &sl_source,\n &sl_targets_depth, text,\n stree)) == (-1)) {\n ++(*starting_position);\n }\n while (tmp == 0) {\n ++(*starting_position);\n tmp = st_slli_bp_ukkonen_prolong_suffix((*starting_position),\n ending_position, active_index, active_node, &sl_source,\n &sl_targets_depth, text, stree);\n }\n if (tmp > 0) {\n fprintf(stderr, \"Error: Could not prolong suffixes \"\n \"to the ending position %zu!\\n\",\n ending_position);\n return (2);\n }\n return (0);\n}",
"canonical_original_code": "int st_slli_bp_ukkonen_prolong_suffixes(unsigned long *starting_position, unsigned long ending_position, unsigned long *active_index, int *active_node, char *text, unsigned long length, struct suffix_tree_slli_bp_struct *stree) {\n int sl_source = 0;\n unsigned int sl_targets_depth = 0;\n unsigned long maximum_possible_size = stree->branching_nodes +\n ending_position - (*starting_position) - 1;\n int tmp = 0;\n unsigned long tbranch_size = (size_t)(stree->tbranch_size);\n if ((tbranch_size < maximum_possible_size) &&\n (tbranch_size < length)) {\n if (st_slli_bp_reallocate(maximum_possible_size,\n length, stree) > 0) {\n fprintf(stderr, \"Error: Could not \"\n \"reallocate memory!\\n\");\n return (1);\n }\n }\n while ((tmp = st_slli_bp_ukkonen_prolong_suffix((*starting_position),\n ending_position, active_index,\n active_node, &sl_source,\n &sl_targets_depth, text,\n stree)) == (-1)) {\n ++(*starting_position);\n }\n while (tmp == 0) {\n ++(*starting_position);\n tmp = st_slli_bp_ukkonen_prolong_suffix((*starting_position),\n ending_position, active_index, active_node, &sl_source,\n &sl_targets_depth, text, stree);\n }\n if (tmp > 0) {\n fprintf(stderr, \"Error: Could not prolong suffixes \"\n \"to the ending position %zu!\\n\",\n ending_position);\n return (2);\n }\n return (0);\n}",
"variable_types": [
[
"starting_position",
"unsigned long *"
],
[
"ending_position",
"unsigned long"
],
[
"active_index",
"unsigned long *"
],
[
"active_node",
"int *"
],
[
"text",
"char *"
],
[
"length",
"unsigned long"
],
[
"stree",
"struct suffix_tree_slli_bp_struct { unsigned long lr_size; unsigned long br_size; struct leaf_record_slli_bp_struct { int parent; int next_brother; } *tleaf; struct branch_record_slli_bp_struct { int parent; int first_child; int branch_brother; int suffix_link; unsigned int depth; unsigned int head_position; } *tbranch; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; } *"
],
[
"sl_source",
"int"
],
[
"sl_targets_depth",
"unsigned int"
],
[
"maximum_possible_size",
"unsigned long"
],
[
"tmp",
"int"
],
[
"tbranch_size",
"unsigned long"
]
],
"return_type": "int",
"user_defined_types": [
"struct suffix_tree_slli_bp_struct { unsigned long lr_size; unsigned long br_size; struct leaf_record_slli_bp_struct *tleaf; struct branch_record_slli_bp_struct *tbranch; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; }",
"struct leaf_record_slli_bp_struct { int parent; int next_brother; }",
"struct branch_record_slli_bp_struct { int parent; int first_child; int branch_brother; int suffix_link; unsigned int depth; unsigned int head_position; }"
],
"binary_hash": "0351b4a4c5d62acf590fd37076e04876e9486d7d7844115b92bf35e7bd06f9f6"
},
{
"name": "st_slli_bp_create_mccreight",
"canonical_name": "func4",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall st_slli_bp_create_mccreight(__int64 a1, unsigned __int64 a2, _QWORD *a3)\n{\n__int64 result; // rax\nunsigned int v5; // [rsp+2Ch] [rbp-14h] BYREF\nunsigned int v6; // [rsp+30h] [rbp-10h] BYREF\nint v7; // [rsp+34h] [rbp-Ch] BYREF\nunsigned __int64 i; // [rsp+38h] [rbp-8h]\n\nv7 = 1;\nv6 = 0;\nv5 = 0;\ni = 1LL;\nputs(\"Creating suffix tree using McCright's algorithm\\n\");\nif ( (int)st_slli_bp_allocate(a2, a3) <= 0 )\n{\nfor ( i = 1LL; i < a2 + 2; ++i )\n{\nif ( (int)st_slli_bp_mccreight_insert_suffix(&v7, &v6, &v5, i, a1, a2, a3) > 0 )\n{\nfprintf(stderr, \"Could not insert suffix number %zu. Exiting.\\n\", i);\nreturn 2LL;\n}\n}\nputs(\"\\nThe suffix tree has been successfully created.\");\nst_print_stats(a2, 0LL, a3[4], 0LL, 0LL, a3[5], 0LL, *a3, 0LL, a3[1], 0LL, 0LL, 0LL);\nresult = 0LL;\n}\nelse\n{\nfwrite(\"Allocation error. Exiting.\\n\", 1uLL, 0x1BuLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1, unsigned __int64 a2, _QWORD *a3)\n{\n__int64 result; // rax\nunsigned int v5; // [rsp+2Ch] [rbp-14h] BYREF\nunsigned int v6; // [rsp+30h] [rbp-10h] BYREF\nint v7; // [rsp+34h] [rbp-Ch] BYREF\nunsigned __int64 i; // [rsp+38h] [rbp-8h]\n\nv7 = 1;\nv6 = 0;\nv5 = 0;\ni = 1LL;\nputs(\"Creating suffix tree using McCright's algorithm\\n\");\nif ( (int)st_slli_bp_allocate(a2, a3) <= 0 )\n{\nfor ( i = 1LL; i < a2 + 2; ++i )\n{\nif ( (int)func1(&v7, &v6, &v5, i, a1, a2, a3) > 0 )\n{\nfprintf(stderr, \"Could not insert suffix number %zu. Exiting.\\n\", i);\nreturn 2LL;\n}\n}\nputs(\"\\nThe suffix tree has been successfully created.\");\nst_print_stats(a2, 0LL, a3[4], 0LL, 0LL, a3[5], 0LL, *a3, 0LL, a3[1], 0LL, 0LL, 0LL);\nresult = 0LL;\n}\nelse\n{\nfwrite(\"Allocation error. Exiting.\\n\", 1uLL, 0x1BuLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}",
"original_code": "int st_slli_bp_create_mccreight (const character_type *text,\n size_t length,\n suffix_tree_slli_bp *stree) {\n signed_integral_type starting_node = 1;\n signed_integral_type sl_source = 0;\n unsigned_integral_type sl_targets_depth = 0;\n size_t i = 1;\n printf(\"Creating suffix tree using McCright's algorithm\\n\\n\");\n if (st_slli_bp_allocate(length, stree) > 0) {\n fprintf(stderr, \"Allocation error. Exiting.\\n\");\n return (1);\n }\n for (i = 1; i < length + 2; ++i) {\n if (st_slli_bp_mccreight_insert_suffix(&starting_node,\n &sl_source, &sl_targets_depth, i,\n text, length, stree) > 0) {\n fprintf(stderr, \"Could not insert suffix number \"\n \"%zu. Exiting.\\n\", i);\n return (2);\n }\n }\n printf(\"\\nThe suffix tree has been successfully created.\\n\");\n st_print_stats(length, (size_t)(0), stree->branching_nodes,\n (size_t)(0), (size_t)(0), stree->tbranch_size,\n (size_t)(0), stree->lr_size, (size_t)(0),\n stree->br_size, (size_t)(0),\n (size_t)(0), (size_t)(0));\n return (0);\n}",
"canonical_original_code": "int st_slli_bp_create_mccreight(char *text, unsigned long length, struct suffix_tree_slli_bp_struct *stree) {\n int starting_node = 1;\n int sl_source = 0;\n unsigned int sl_targets_depth = 0;\n unsigned long i = 1;\n printf(\"Creating suffix tree using McCright's algorithm\\n\\n\");\n if (st_slli_bp_allocate(length, stree) > 0) {\n fprintf(stderr, \"Allocation error. Exiting.\\n\");\n return (1);\n }\n for (i = 1; i < length + 2; ++i) {\n if (st_slli_bp_mccreight_insert_suffix(&starting_node,\n &sl_source, &sl_targets_depth, i,\n text, length, stree) > 0) {\n fprintf(stderr, \"Could not insert suffix number \"\n \"%zu. Exiting.\\n\", i);\n return (2);\n }\n }\n printf(\"\\nThe suffix tree has been successfully created.\\n\");\n st_print_stats(length, (unsigned long)(0), stree->branching_nodes,\n (unsigned long)(0), (unsigned long)(0), stree->tbranch_size,\n (unsigned long)(0), stree->lr_size, (unsigned long)(0),\n stree->br_size, (unsigned long)(0),\n (unsigned long)(0), (unsigned long)(0));\n return (0);\n}",
"variable_types": [
[
"text",
"char *"
],
[
"length",
"unsigned long"
],
[
"stree",
"struct suffix_tree_slli_bp_struct { unsigned long lr_size; unsigned long br_size; struct leaf_record_slli_bp_struct { int parent; int next_brother; } *tleaf; struct branch_record_slli_bp_struct { int parent; int first_child; int branch_brother; int suffix_link; unsigned int depth; unsigned int head_position; } *tbranch; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; } *"
],
[
"starting_node",
"int"
],
[
"sl_source",
"int"
],
[
"sl_targets_depth",
"unsigned int"
],
[
"i",
"unsigned long"
]
],
"return_type": "int",
"user_defined_types": [
"struct suffix_tree_slli_bp_struct { unsigned long lr_size; unsigned long br_size; struct leaf_record_slli_bp_struct *tleaf; struct branch_record_slli_bp_struct *tbranch; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; }",
"struct leaf_record_slli_bp_struct { int parent; int next_brother; }",
"struct branch_record_slli_bp_struct { int parent; int first_child; int branch_brother; int suffix_link; unsigned int depth; unsigned int head_position; }"
],
"binary_hash": "0351b4a4c5d62acf590fd37076e04876e9486d7d7844115b92bf35e7bd06f9f6"
},
{
"name": "st_slli_bp_create_ukkonen",
"canonical_name": "func5",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall st_slli_bp_create_ukkonen(__int64 a1, unsigned __int64 a2, _QWORD *a3)\n{\n__int64 result; // rax\n__int64 v5; // [rsp+20h] [rbp-20h] BYREF\n__int64 v6; // [rsp+28h] [rbp-18h] BYREF\nint v7; // [rsp+34h] [rbp-Ch] BYREF\nunsigned __int64 i; // [rsp+38h] [rbp-8h]\n\nv7 = 1;\nv6 = 1LL;\nv5 = 1LL;\ni = 1LL;\nputs(\"Creating suffix tree using Ukkonen's algorithm\\n\");\nif ( (int)st_slli_bp_allocate(a2, a3) <= 0 )\n{\nfor ( i = 2LL; i <= a2 + 2; ++i )\n{\nif ( (int)st_slli_bp_ukkonen_prolong_suffixes(&v5, i, &v6, &v7, a1, a2, (__int64)a3) > 0 )\n{\nfprintf(stderr, \"Could not create the intermediate tree number %zu. Exiting.\\n\", i - 1);\nreturn 2LL;\n}\n}\nputs(\"\\nThe suffix tree has been successfully created.\");\nst_print_stats(a2, 0LL, a3[4], 0LL, 0LL, a3[5], 0LL, *a3, 0LL, a3[1], 0LL, 0LL, 0LL);\nresult = 0LL;\n}\nelse\n{\nfwrite(\"Allocation error. Exiting.\\n\", 1uLL, 0x1BuLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1, unsigned __int64 a2, _QWORD *a3)\n{\n__int64 result; // rax\n__int64 v5; // [rsp+20h] [rbp-20h] BYREF\n__int64 v6; // [rsp+28h] [rbp-18h] BYREF\nint v7; // [rsp+34h] [rbp-Ch] BYREF\nunsigned __int64 i; // [rsp+38h] [rbp-8h]\n\nv7 = 1;\nv6 = 1LL;\nv5 = 1LL;\ni = 1LL;\nputs(\"Creating suffix tree using Ukkonen's algorithm\\n\");\nif ( (int)st_slli_bp_allocate(a2, a3) <= 0 )\n{\nfor ( i = 2LL; i <= a2 + 2; ++i )\n{\nif ( (int)func3(&v5, i, &v6, &v7, a1, a2, (__int64)a3) > 0 )\n{\nfprintf(stderr, \"Could not create the intermediate tree number %zu. Exiting.\\n\", i - 1);\nreturn 2LL;\n}\n}\nputs(\"\\nThe suffix tree has been successfully created.\");\nst_print_stats(a2, 0LL, a3[4], 0LL, 0LL, a3[5], 0LL, *a3, 0LL, a3[1], 0LL, 0LL, 0LL);\nresult = 0LL;\n}\nelse\n{\nfwrite(\"Allocation error. Exiting.\\n\", 1uLL, 0x1BuLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}",
"original_code": "int st_slli_bp_create_ukkonen (const character_type *text,\n size_t length,\n suffix_tree_slli_bp *stree) {\n signed_integral_type active_node = 1;\n size_t active_index = 1;\n size_t starting_position = 1;\n size_t i = 1;\n printf(\"Creating suffix tree using Ukkonen's algorithm\\n\\n\");\n if (st_slli_bp_allocate(length, stree) > 0) {\n fprintf(stderr, \"Allocation error. Exiting.\\n\");\n return (1);\n }\n for (i = 2; i <= length + 2; ++i) {\n if (st_slli_bp_ukkonen_prolong_suffixes(&starting_position, i,\n &active_index, &active_node, text,\n length, stree) > 0) {\n fprintf(stderr, \"Could not create the intermediate \"\n \"tree number %zu. Exiting.\\n\", i - 1);\n return (2);\n }\n }\n printf(\"\\nThe suffix tree has been successfully created.\\n\");\n st_print_stats(length, (size_t)(0), stree->branching_nodes,\n (size_t)(0), (size_t)(0), stree->tbranch_size,\n (size_t)(0), stree->lr_size, (size_t)(0),\n stree->br_size, (size_t)(0),\n (size_t)(0), (size_t)(0));\n return (0);\n}",
"canonical_original_code": "int st_slli_bp_create_ukkonen(char *text, unsigned long length, struct suffix_tree_slli_bp_struct *stree) {\n int active_node = 1;\n unsigned long active_index = 1;\n unsigned long starting_position = 1;\n unsigned long i = 1;\n printf(\"Creating suffix tree using Ukkonen's algorithm\\n\\n\");\n if (st_slli_bp_allocate(length, stree) > 0) {\n fprintf(stderr, \"Allocation error. Exiting.\\n\");\n return (1);\n }\n for (i = 2; i <= length + 2; ++i) {\n if (st_slli_bp_ukkonen_prolong_suffixes(&starting_position, i,\n &active_index, &active_node, text,\n length, stree) > 0) {\n fprintf(stderr, \"Could not create the intermediate \"\n \"tree number %zu. Exiting.\\n\", i - 1);\n return (2);\n }\n }\n printf(\"\\nThe suffix tree has been successfully created.\\n\");\n st_print_stats(length, (unsigned long)(0), stree->branching_nodes,\n (unsigned long)(0), (unsigned long)(0), stree->tbranch_size,\n (unsigned long)(0), stree->lr_size, (unsigned long)(0),\n stree->br_size, (unsigned long)(0),\n (unsigned long)(0), (unsigned long)(0));\n return (0);\n}",
"variable_types": [
[
"text",
"char *"
],
[
"length",
"unsigned long"
],
[
"stree",
"struct suffix_tree_slli_bp_struct { unsigned long lr_size; unsigned long br_size; struct leaf_record_slli_bp_struct { int parent; int next_brother; } *tleaf; struct branch_record_slli_bp_struct { int parent; int first_child; int branch_brother; int suffix_link; unsigned int depth; unsigned int head_position; } *tbranch; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; } *"
],
[
"active_node",
"int"
],
[
"active_index",
"unsigned long"
],
[
"starting_position",
"unsigned long"
],
[
"i",
"unsigned long"
]
],
"return_type": "int",
"user_defined_types": [
"struct suffix_tree_slli_bp_struct { unsigned long lr_size; unsigned long br_size; struct leaf_record_slli_bp_struct *tleaf; struct branch_record_slli_bp_struct *tbranch; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; }",
"struct leaf_record_slli_bp_struct { int parent; int next_brother; }",
"struct branch_record_slli_bp_struct { int parent; int first_child; int branch_brother; int suffix_link; unsigned int depth; unsigned int head_position; }"
],
"binary_hash": "0351b4a4c5d62acf590fd37076e04876e9486d7d7844115b92bf35e7bd06f9f6"
}
] |
2020aa2cef7ca9e95bd5a146be7fd85ddf03f727bff186df5fef0f10de58132b | pbasista/stc | [
[
"st_shti_bp_simulate_suffix_link_bottom_up",
"->",
"st_shti_bp_mccreight_insert_suffix",
"st_shti_bp_ukkonen_prolong_suffix"
],
[
"st_shti_bp_mccreight_insert_suffix",
"->",
"st_shti_bp_simulate_suffix_link_bottom_up",
"st_shti_bp_create_mccreight"
],
[
"st_shti_bp_ukkonen_prolong_suffix",
"->",
"st_shti_bp_simulate_suffix_link_bottom_up",
"st_shti_bp_ukkonen_prolong_suffixes"
],
[
"st_shti_bp_ukkonen_prolong_suffixes",
"->",
"st_shti_bp_ukkonen_prolong_suffix",
"st_shti_bp_create_ukkonen"
],
[
"st_shti_bp_create_mccreight",
"->",
"st_shti_bp_mccreight_insert_suffix"
],
[
"st_shti_bp_create_ukkonen",
"->",
"st_shti_bp_ukkonen_prolong_suffixes"
]
] | [] | [
{
"name": "st_shti_bp_simulate_suffix_link_bottom_up",
"canonical_name": "func0",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall st_shti_bp_simulate_suffix_link_bottom_up(int *a1, int a2, unsigned int a3, __int64 a4)\n{\n__int64 result; // rax\nint v6; // [rsp+14h] [rbp-1Ch] BYREF\nint *v7; // [rsp+18h] [rbp-18h]\nint v8; // [rsp+28h] [rbp-8h]\nint v9; // [rsp+2Ch] [rbp-4h]\n\nv7 = a1;\nv6 = a2;\nv9 = *a1;\nv8 = 0;\nif ( a2 )\n{\nif ( v6 <= 0 )\n--v6;\nelse\nv6 = *(_DWORD *)(*(_QWORD *)(a4 + 72) + 16LL * v6 + 12);\n*v7 = 0;\nv8 = st_shti_bp_go_up(v7, &v6, a3, a4);\nif ( v8 )\n{\nif ( v8 == -1 )\n{\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\nfwrite(\"Error: Suffix link simulation failed permanently!\\n\", 1uLL, 0x32uLL, stderr);\nresult = 2LL;\n}\n}\nelse\n{\n*(_DWORD *)(16LL * v9 + *(_QWORD *)(a4 + 72) + 12) = *v7;\nresult = 0LL;\n}\n}\nelse\n{\nfwrite(\"Error: Invalid number of child (0)!\\n\", 1uLL, 0x24uLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(int *a1, int a2, unsigned int a3, __int64 a4)\n{\n__int64 result; // rax\nint v6; // [rsp+14h] [rbp-1Ch] BYREF\nint *v7; // [rsp+18h] [rbp-18h]\nint v8; // [rsp+28h] [rbp-8h]\nint v9; // [rsp+2Ch] [rbp-4h]\n\nv7 = a1;\nv6 = a2;\nv9 = *a1;\nv8 = 0;\nif ( a2 )\n{\nif ( v6 <= 0 )\n--v6;\nelse\nv6 = *(_DWORD *)(*(_QWORD *)(a4 + 72) + 16LL * v6 + 12);\n*v7 = 0;\nv8 = st_shti_bp_go_up(v7, &v6, a3, a4);\nif ( v8 )\n{\nif ( v8 == -1 )\n{\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\nfwrite(\"Error: Suffix link simulation failed permanently!\\n\", 1uLL, 0x32uLL, stderr);\nresult = 2LL;\n}\n}\nelse\n{\n*(_DWORD *)(16LL * v9 + *(_QWORD *)(a4 + 72) + 12) = *v7;\nresult = 0LL;\n}\n}\nelse\n{\nfwrite(\"Error: Invalid number of child (0)!\\n\", 1uLL, 0x24uLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}",
"original_code": "int st_shti_bp_simulate_suffix_link_bottom_up (signed_integral_type *parent,\n signed_integral_type child,\n unsigned_integral_type target_depth,\n suffix_tree_shti_bp *stree) {\n signed_integral_type starting_from = (*parent);\n int tmp = 0;\n if (child == 0) {\n fprintf(stderr, \"Error: Invalid number of child (0)!\\n\");\n return (1);\n } else if (child > 0) {\n child = stree->tbranch[child].suffix_link;\n } else {\n child = child - 1;\n }\n (*parent) = 0;\n if ((tmp = st_shti_bp_go_up(parent, &child, target_depth,\n stree)) == 0) {\n stree->tbranch[starting_from].suffix_link = (*parent);\n return (0);\n } else if (tmp == (-1)) {\n return (-1);\n } else {\n fprintf(stderr, \"Error: Suffix link simulation \"\n \"failed permanently!\\n\");\n return (2);\n }\n}",
"canonical_original_code": "int st_shti_bp_simulate_suffix_link_bottom_up(int *parent, int child, unsigned int target_depth, struct suffix_tree_shti_bp_struct *stree) {\n int starting_from = (*parent);\n int tmp = 0;\n if (child == 0) {\n fprintf(stderr, \"Error: Invalid number of child (0)!\\n\");\n return (1);\n } else if (child > 0) {\n child = stree->tbranch[child].suffix_link;\n } else {\n child = child - 1;\n }\n (*parent) = 0;\n if ((tmp = st_shti_bp_go_up(parent, &child, target_depth,\n stree)) == 0) {\n stree->tbranch[starting_from].suffix_link = (*parent);\n return (0);\n } else if (tmp == (-1)) {\n return (-1);\n } else {\n fprintf(stderr, \"Error: Suffix link simulation \"\n \"failed permanently!\\n\");\n return (2);\n }\n}",
"variable_types": [
[
"parent",
"int *"
],
[
"child",
"int"
],
[
"target_depth",
"unsigned int"
],
[
"stree",
"struct suffix_tree_shti_bp_struct { unsigned long hs_size; unsigned long lr_size; unsigned long er_size; unsigned long br_size; int crt_type; unsigned long chf_number; struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; } *hs; struct leaf_record_shti_bp_struct { int parent; } *tleaf; struct edge_record_struct { int source_node; int target_node; } *tedge; struct branch_record_shti_bp_struct { int parent; unsigned int depth; unsigned int head_position; int suffix_link; } *tbranch; unsigned long edges; unsigned long tedge_size; unsigned long tesize_increase; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; } *"
],
[
"starting_from",
"int"
],
[
"tmp",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct suffix_tree_shti_bp_struct { unsigned long hs_size; unsigned long lr_size; unsigned long er_size; unsigned long br_size; int crt_type; unsigned long chf_number; struct hash_settings_struct *hs; struct leaf_record_shti_bp_struct *tleaf; struct edge_record_struct *tedge; struct branch_record_shti_bp_struct *tbranch; unsigned long edges; unsigned long tedge_size; unsigned long tesize_increase; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; }",
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; }",
"struct leaf_record_shti_bp_struct { int parent; }",
"struct edge_record_struct { int source_node; int target_node; }",
"struct branch_record_shti_bp_struct { int parent; unsigned int depth; unsigned int head_position; int suffix_link; }"
],
"binary_hash": "2020aa2cef7ca9e95bd5a146be7fd85ddf03f727bff186df5fef0f10de58132b"
},
{
"name": "st_shti_bp_mccreight_insert_suffix",
"canonical_name": "func1",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall st_shti_bp_mccreight_insert_suffix(int *a1, unsigned int *a2, unsigned int *a3, __int64 a4, __int64 a5, unsigned __int64 a6, _QWORD *a7)\n{\n__int64 result; // rax\n__int64 v12; // [rsp+38h] [rbp-28h] BYREF\nunsigned int v13; // [rsp+40h] [rbp-20h] BYREF\nint v14; // [rsp+44h] [rbp-1Ch] BYREF\nunsigned int v15; // [rsp+48h] [rbp-18h] BYREF\nint v16; // [rsp+4Ch] [rbp-14h]\nunsigned __int64 v17; // [rsp+50h] [rbp-10h]\nint v18; // [rsp+58h] [rbp-8h]\nchar v19; // [rsp+5Fh] [rbp-1h]\n\nv19 = 0;\nv18 = 0;\nv15 = 0;\nv14 = 0;\nv13 = 0;\nv12 = *(unsigned int *)(a7[9] + 16LL * *a1 + 4) + a4;\nv17 = a7[14];\nv16 = 0;\nif ( v17 == a7[13] && v17 < a6 && (int)st_shti_bp_reallocate(v17 + 1, 0LL, a5, a6, a7) > 0 )\n{\nfwrite(\"Error: Could not reallocate memory!\\n\", 1uLL, 0x24uLL, stderr);\nresult = 1LL;\n}\nelse\n{\nwhile ( 1 )\n{\nv16 = st_shti_bp_branch_once((unsigned int)*a1, &v15, v12, a5, a7);\nif ( v16 )\n{\nif ( v16 == 1 )\n{\nfprintf(stderr, \"Error: Insertion of the suffix number %zu failed!\\n\", a4);\nresult = 6LL;\n}\nelse\n{\nv19 = *(_BYTE *)(a4 + *(unsigned int *)(a7[9] + 16LL * *a1 + 4) + a5);\nif ( (unsigned int)st_shti_bp_create_leaf(\n(unsigned int)*a1,\n(unsigned int)v19,\n(unsigned int)-(int)a4,\na5,\na7) )\n{\nfwrite(\"Error: Could not create a new leaf of the parent!\\n\", 1uLL, 0x32uLL, stderr);\nresult = 7LL;\n}\nelse\n{\nif ( *a1 > 1 )\n*a1 = *(_DWORD *)(a7[9] + 16LL * *a1 + 12);\nresult = 0LL;\n}\n}\nreturn result;\n}\nif ( (unsigned int)st_shti_bp_edge_slowscan((unsigned int)*a1, v15, v12, &v13, a5, a6 + 1, a7) )\nbreak;\nst_shti_bp_edge_descend(a1, &v15, &v14, &v12, a6 + 1, a7);\nif ( *a1 < 0 )\n{\nfwrite(\n\"Error: The newly inserted suffix already has the corresponding leaf node\\npresent in the suffix tree!\\n\",\n1uLL,\n0x65uLL,\nstderr);\nreturn 2LL;\n}\n}\nv18 = v15;\nv19 = *(_BYTE *)(v12 + a5);\nif ( (unsigned int)st_shti_bp_split_edge(a1, (unsigned int)v19, &v15, &v12, v13, (unsigned int)a4, a5, a7) )\n{\nfwrite(\"Error: Could not split the parent->child edge!\\n\", 1uLL, 0x2FuLL, stderr);\nreturn 3LL;\n}\nv19 = *(_BYTE *)(v12 + a5);\nif ( (unsigned int)st_shti_bp_create_leaf((unsigned int)*a1, (unsigned int)v19, (unsigned int)-(int)a4, a5, a7) )\n{\nfwrite(\"Error: Could not create a new leaf of the parent!\\n\", 1uLL, 0x32uLL, stderr);\nreturn 4LL;\n}\nif ( *a2 )\n{\nif ( a4 + *a3 != v12 )\n{\nfprintf(\nstderr,\n\"Error! The last opportunity to set the target of a suffix link missed! (suffix link source = %d)\\n\",\n*a2);\nreturn 5LL;\n}\n*(_DWORD *)(16LL * (int)*a2 + a7[9] + 12) = *a1;\n}\n*a2 = *a1;\n*a3 = *(_DWORD *)(a7[9] + 16LL * *a1 + 4) - 1;\nif ( !(unsigned int)st_shti_bp_simulate_suffix_link_bottom_up(a1, v18, *a3, (__int64)a7) )\n{\n*a2 = 0;\n*a3 = 0;\n}\nresult = 0LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(int *a1, unsigned int *a2, unsigned int *a3, __int64 a4, __int64 a5, unsigned __int64 a6, _QWORD *a7)\n{\n__int64 result; // rax\n__int64 v12; // [rsp+38h] [rbp-28h] BYREF\nunsigned int v13; // [rsp+40h] [rbp-20h] BYREF\nint v14; // [rsp+44h] [rbp-1Ch] BYREF\nunsigned int v15; // [rsp+48h] [rbp-18h] BYREF\nint v16; // [rsp+4Ch] [rbp-14h]\nunsigned __int64 v17; // [rsp+50h] [rbp-10h]\nint v18; // [rsp+58h] [rbp-8h]\nchar v19; // [rsp+5Fh] [rbp-1h]\n\nv19 = 0;\nv18 = 0;\nv15 = 0;\nv14 = 0;\nv13 = 0;\nv12 = *(unsigned int *)(a7[9] + 16LL * *a1 + 4) + a4;\nv17 = a7[14];\nv16 = 0;\nif ( v17 == a7[13] && v17 < a6 && (int)st_shti_bp_reallocate(v17 + 1, 0LL, a5, a6, a7) > 0 )\n{\nfwrite(\"Error: Could not reallocate memory!\\n\", 1uLL, 0x24uLL, stderr);\nresult = 1LL;\n}\nelse\n{\nwhile ( 1 )\n{\nv16 = st_shti_bp_branch_once((unsigned int)*a1, &v15, v12, a5, a7);\nif ( v16 )\n{\nif ( v16 == 1 )\n{\nfprintf(stderr, \"Error: Insertion of the suffix number %zu failed!\\n\", a4);\nresult = 6LL;\n}\nelse\n{\nv19 = *(_BYTE *)(a4 + *(unsigned int *)(a7[9] + 16LL * *a1 + 4) + a5);\nif ( (unsigned int)st_shti_bp_create_leaf(\n(unsigned int)*a1,\n(unsigned int)v19,\n(unsigned int)-(int)a4,\na5,\na7) )\n{\nfwrite(\"Error: Could not create a new leaf of the parent!\\n\", 1uLL, 0x32uLL, stderr);\nresult = 7LL;\n}\nelse\n{\nif ( *a1 > 1 )\n*a1 = *(_DWORD *)(a7[9] + 16LL * *a1 + 12);\nresult = 0LL;\n}\n}\nreturn result;\n}\nif ( (unsigned int)st_shti_bp_edge_slowscan((unsigned int)*a1, v15, v12, &v13, a5, a6 + 1, a7) )\nbreak;\nst_shti_bp_edge_descend(a1, &v15, &v14, &v12, a6 + 1, a7);\nif ( *a1 < 0 )\n{\nfwrite(\n\"Error: The newly inserted suffix already has the corresponding leaf node\\npresent in the suffix tree!\\n\",\n1uLL,\n0x65uLL,\nstderr);\nreturn 2LL;\n}\n}\nv18 = v15;\nv19 = *(_BYTE *)(v12 + a5);\nif ( (unsigned int)st_shti_bp_split_edge(a1, (unsigned int)v19, &v15, &v12, v13, (unsigned int)a4, a5, a7) )\n{\nfwrite(\"Error: Could not split the parent->child edge!\\n\", 1uLL, 0x2FuLL, stderr);\nreturn 3LL;\n}\nv19 = *(_BYTE *)(v12 + a5);\nif ( (unsigned int)st_shti_bp_create_leaf((unsigned int)*a1, (unsigned int)v19, (unsigned int)-(int)a4, a5, a7) )\n{\nfwrite(\"Error: Could not create a new leaf of the parent!\\n\", 1uLL, 0x32uLL, stderr);\nreturn 4LL;\n}\nif ( *a2 )\n{\nif ( a4 + *a3 != v12 )\n{\nfprintf(\nstderr,\n\"Error! The last opportunity to set the target of a suffix link missed! (suffix link source = %d)\\n\",\n*a2);\nreturn 5LL;\n}\n*(_DWORD *)(16LL * (int)*a2 + a7[9] + 12) = *a1;\n}\n*a2 = *a1;\n*a3 = *(_DWORD *)(a7[9] + 16LL * *a1 + 4) - 1;\nif ( !(unsigned int)func0(a1, v18, *a3, (__int64)a7) )\n{\n*a2 = 0;\n*a3 = 0;\n}\nresult = 0LL;\n}\nreturn result;\n}",
"original_code": "int st_shti_bp_mccreight_insert_suffix (signed_integral_type *parent,\n signed_integral_type *sl_source,\n unsigned_integral_type *sl_targets_depth,\n size_t starting_position,\n const character_type *text,\n size_t length,\n suffix_tree_shti_bp *stree) {\n character_type letter = 0;\n signed_integral_type latest_child = 0;\n signed_integral_type child = 0;\n signed_integral_type prev_child = 0;\n signed_integral_type last_match_position = 0;\n size_t position = starting_position +\n stree->tbranch[(*parent)].depth;\n size_t tbranch_size = stree->tbranch_size;\n int tmp = 0;\n if ((tbranch_size == stree->branching_nodes) &&\n (tbranch_size < length)) {\n if (st_shti_bp_reallocate(tbranch_size + 1, (size_t)(0),\n text, length, stree) > 0) {\n fprintf(stderr, \"Error: Could not \"\n \"reallocate memory!\\n\");\n return (1);\n }\n }\n while ((tmp = st_shti_bp_branch_once((*parent), &child,\n position, text, stree)) == 0) {\n if (st_shti_bp_edge_slowscan((*parent), child, position,\n &last_match_position, text, length + 1, stree) == 0) {\n st_shti_bp_edge_descend(parent, &child, &prev_child,\n &position, length + 1, stree);\n if ((*parent) < 0) {\n fprintf(stderr, \"Error: The newly inserted \"\n \"suffix already has the \"\n \"corresponding leaf node\\n\"\n \"present in the \"\n \"suffix tree!\\n\");\n return (2);\n }\n } else {\n latest_child = child;\n letter = text[position];\n if (st_shti_bp_split_edge(parent, letter, &child,\n &position, last_match_position,\n (unsigned_integral_type)(starting_position),\n text, stree) != 0) {\n fprintf(stderr, \"Error: Could not split \"\n \"the parent->child edge!\\n\");\n return (3);\n }\n letter = text[position];\n if (st_shti_bp_create_leaf((*parent), letter,\n (-(signed_integral_type)(starting_position)),\n text, stree)) {\n fprintf(stderr, \"Error: Could not create \"\n \"a new leaf of the parent!\\n\");\n return (4);\n }\n if ((*sl_source) != 0) {\n if (position == starting_position +\n (*sl_targets_depth)) {\n stree->tbranch[(*sl_source)].\n suffix_link = (*parent);\n } else {\n fprintf(stderr, \"Error! The last \"\n \"opportunity to \"\n \"set the target \"\n \"of a suffix link \"\n \"missed! (suffix \"\n \"link source = %d)\\n\",\n (*sl_source));\n return (5);\n }\n }\n (*sl_source) = (*parent);\n (*sl_targets_depth) =\n stree->tbranch[(*parent)].depth - 1;\n if (st_shti_bp_simulate_suffix_link_bottom_up(parent,\n latest_child, (*sl_targets_depth),\n stree) == 0) {\n (*sl_source) = 0;\n (*sl_targets_depth) = 0;\n }\n return (0);\n }\n }\n if (tmp == 1) {\n fprintf(stderr, \"Error: Insertion of the suffix number \"\n \"%zu failed!\\n\", starting_position);\n return (6);\n } else {\n letter = text[starting_position +\n stree->tbranch[(*parent)].depth];\n if (st_shti_bp_create_leaf((*parent), letter,\n (-(signed_integral_type)(starting_position)),\n text, stree)) {\n fprintf(stderr, \"Error: Could not create \"\n \"a new leaf of the parent!\\n\");\n return (7);\n }\n }\n if ((*parent) > 1) {\n (*parent) = stree->tbranch[(*parent)].suffix_link;\n }\n return (0);\n}",
"canonical_original_code": "int st_shti_bp_mccreight_insert_suffix(int *parent, int *sl_source, unsigned int *sl_targets_depth, unsigned long starting_position, char *text, unsigned long length, struct suffix_tree_shti_bp_struct *stree) {\n char letter = 0;\n int latest_child = 0;\n int child = 0;\n int prev_child = 0;\n int last_match_position = 0;\n unsigned long position = starting_position +\n stree->tbranch[(*parent)].depth;\n unsigned long tbranch_size = stree->tbranch_size;\n int tmp = 0;\n if ((tbranch_size == stree->branching_nodes) &&\n (tbranch_size < length)) {\n if (st_shti_bp_reallocate(tbranch_size + 1, (unsigned long)(0),\n text, length, stree) > 0) {\n fprintf(stderr, \"Error: Could not \"\n \"reallocate memory!\\n\");\n return (1);\n }\n }\n while ((tmp = st_shti_bp_branch_once((*parent), &child,\n position, text, stree)) == 0) {\n if (st_shti_bp_edge_slowscan((*parent), child, position,\n &last_match_position, text, length + 1, stree) == 0) {\n st_shti_bp_edge_descend(parent, &child, &prev_child,\n &position, length + 1, stree);\n if ((*parent) < 0) {\n fprintf(stderr, \"Error: The newly inserted \"\n \"suffix already has the \"\n \"corresponding leaf node\\n\"\n \"present in the \"\n \"suffix tree!\\n\");\n return (2);\n }\n } else {\n latest_child = child;\n letter = text[position];\n if (st_shti_bp_split_edge(parent, letter, &child,\n &position, last_match_position,\n (unsigned_integral_type)(starting_position),\n text, stree) != 0) {\n fprintf(stderr, \"Error: Could not split \"\n \"the parent->child edge!\\n\");\n return (3);\n }\n letter = text[position];\n if (st_shti_bp_create_leaf((*parent), letter,\n (-(signed_integral_type)(starting_position)),\n text, stree)) {\n fprintf(stderr, \"Error: Could not create \"\n \"a new leaf of the parent!\\n\");\n return (4);\n }\n if ((*sl_source) != 0) {\n if (position == starting_position +\n (*sl_targets_depth)) {\n stree->tbranch[(*sl_source)].\n suffix_link = (*parent);\n } else {\n fprintf(stderr, \"Error! The last \"\n \"opportunity to \"\n \"set the target \"\n \"of a suffix link \"\n \"missed! (suffix \"\n \"link source = %d)\\n\",\n (*sl_source));\n return (5);\n }\n }\n (*sl_source) = (*parent);\n (*sl_targets_depth) =\n stree->tbranch[(*parent)].depth - 1;\n if (st_shti_bp_simulate_suffix_link_bottom_up(parent,\n latest_child, (*sl_targets_depth),\n stree) == 0) {\n (*sl_source) = 0;\n (*sl_targets_depth) = 0;\n }\n return (0);\n }\n }\n if (tmp == 1) {\n fprintf(stderr, \"Error: Insertion of the suffix number \"\n \"%zu failed!\\n\", starting_position);\n return (6);\n } else {\n letter = text[starting_position +\n stree->tbranch[(*parent)].depth];\n if (st_shti_bp_create_leaf((*parent), letter,\n (-(signed_integral_type)(starting_position)),\n text, stree)) {\n fprintf(stderr, \"Error: Could not create \"\n \"a new leaf of the parent!\\n\");\n return (7);\n }\n }\n if ((*parent) > 1) {\n (*parent) = stree->tbranch[(*parent)].suffix_link;\n }\n return (0);\n}",
"variable_types": [
[
"parent",
"int *"
],
[
"sl_source",
"int *"
],
[
"sl_targets_depth",
"unsigned int *"
],
[
"starting_position",
"unsigned long"
],
[
"text",
"char *"
],
[
"length",
"unsigned long"
],
[
"stree",
"struct suffix_tree_shti_bp_struct { unsigned long hs_size; unsigned long lr_size; unsigned long er_size; unsigned long br_size; int crt_type; unsigned long chf_number; struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; } *hs; struct leaf_record_shti_bp_struct { int parent; } *tleaf; struct edge_record_struct { int source_node; int target_node; } *tedge; struct branch_record_shti_bp_struct { int parent; unsigned int depth; unsigned int head_position; int suffix_link; } *tbranch; unsigned long edges; unsigned long tedge_size; unsigned long tesize_increase; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; } *"
],
[
"letter",
"char"
],
[
"latest_child",
"int"
],
[
"child",
"int"
],
[
"prev_child",
"int"
],
[
"last_match_position",
"int"
],
[
"position",
"unsigned long"
],
[
"tbranch_size",
"unsigned long"
],
[
"tmp",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct suffix_tree_shti_bp_struct { unsigned long hs_size; unsigned long lr_size; unsigned long er_size; unsigned long br_size; int crt_type; unsigned long chf_number; struct hash_settings_struct *hs; struct leaf_record_shti_bp_struct *tleaf; struct edge_record_struct *tedge; struct branch_record_shti_bp_struct *tbranch; unsigned long edges; unsigned long tedge_size; unsigned long tesize_increase; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; }",
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; }",
"struct leaf_record_shti_bp_struct { int parent; }",
"struct edge_record_struct { int source_node; int target_node; }",
"struct branch_record_shti_bp_struct { int parent; unsigned int depth; unsigned int head_position; int suffix_link; }"
],
"binary_hash": "2020aa2cef7ca9e95bd5a146be7fd85ddf03f727bff186df5fef0f10de58132b"
},
{
"name": "st_shti_bp_ukkonen_prolong_suffix",
"canonical_name": "func2",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall st_shti_bp_ukkonen_prolong_suffix(__int64 a1, __int64 a2, __int64 *a3, int *a4, unsigned int *a5, unsigned int *a6, __int64 a7, __int64 a8)\n{\n__int64 result; // rax\n__int64 v13; // [rsp+38h] [rbp-28h] BYREF\nunsigned int v14; // [rsp+40h] [rbp-20h] BYREF\nint v15; // [rsp+44h] [rbp-1Ch] BYREF\nunsigned int v16; // [rsp+48h] [rbp-18h] BYREF\nint v17; // [rsp+4Ch] [rbp-14h]\nint v18; // [rsp+50h] [rbp-10h]\nint v19; // [rsp+54h] [rbp-Ch]\nint v20; // [rsp+58h] [rbp-8h]\nchar v21; // [rsp+5Fh] [rbp-1h]\n\nv21 = 0;\nv20 = 0;\nv19 = 0;\nv16 = 0;\nv15 = 0;\nv14 = 0;\nv13 = *a3;\nv18 = 0;\nv17 = 0;\nif ( a1 == a2 )\nreturn 0xFFFFFFFFLL;\nwhile ( 1 )\n{\nv18 = st_shti_bp_branch_once((unsigned int)*a4, &v16, v13, a7, a8);\nif ( v18 )\n{\nif ( v18 == 1 )\n{\nfprintf(stderr, \"Error: Prolonging of the suffix number %zu to the length of %zu failed!\\n\", a1, a2 - a1);\nresult = 4LL;\n}\nelse\n{\nv21 = *(_BYTE *)(a1 + *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4) + a7);\nif ( (unsigned int)st_shti_bp_create_leaf((unsigned int)*a4, (unsigned int)v21, (unsigned int)-(int)a1, a7, a8) )\n{\nfwrite(\"Error: Could not create a new leaf of the parent!\\n\", 1uLL, 0x32uLL, stderr);\nresult = 5LL;\n}\nelse\n{\nif ( *a4 > 1 )\n*a4 = *(_DWORD *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 12);\n*a3 = *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4) + a1 + 1;\nresult = 0LL;\n}\n}\nreturn result;\n}\nv17 = st_shti_bp_edge_slowscan((unsigned int)*a4, v16, v13, &v14, a7, a2 - 1, a8);\nif ( v17 )\nbreak;\nv19 = *a4;\nst_shti_bp_edge_descend(a4, &v16, &v15, &v13, a2 - 1, a8);\nif ( *a4 < 0 )\n{\n*a4 = v19;\nif ( *a4 != 1 )\n*a4 = *(_DWORD *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 12);\n*a3 = *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4) + a1 + 1;\nreturn 4294967294LL;\n}\nif ( a2 == *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4) + a1 )\n{\n*a3 = a1 + *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4);\nreturn 4294967293LL;\n}\n}\nif ( v17 == 2 )\n{\n*a3 = a1 + *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4);\nreturn 4294967292LL;\n}\nv20 = v16;\nv21 = *(_BYTE *)(v13 + a7);\nif ( (unsigned int)st_shti_bp_split_edge(a4, (unsigned int)v21, &v16, &v13, v14, (unsigned int)a1, a7, a8) )\n{\nfwrite(\"Error: Could not split the parent->child edge!\\n\", 1uLL, 0x2FuLL, stderr);\nreturn 1LL;\n}\nv21 = *(_BYTE *)(v13 + a7);\nif ( (unsigned int)st_shti_bp_create_leaf((unsigned int)*a4, (unsigned int)v21, (unsigned int)-(int)a1, a7, a8) )\n{\nfwrite(\"Error: Could not create a new leaf of the parent!\\n\", 1uLL, 0x32uLL, stderr);\nreturn 2LL;\n}\nif ( *a5 )\n{\nif ( a1 + *a6 != v13 )\n{\nfprintf(\nstderr,\n\"Error! The last opportunity to set the target of a suffix link missed! (suffix link source = %d)\\n\",\n*a5);\nreturn 3LL;\n}\n*(_DWORD *)(16LL * (int)*a5 + *(_QWORD *)(a8 + 72) + 12) = *a4;\n}\n*a5 = *a4;\n*a6 = *(_DWORD *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4) - 1;\nif ( !(unsigned int)st_shti_bp_simulate_suffix_link_bottom_up(a4, v20, *a6, a8) )\n{\n*a5 = 0;\n*a6 = 0;\n}\n*a3 = *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4) + a1 + 1;\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, __int64 a2, __int64 *a3, int *a4, unsigned int *a5, unsigned int *a6, __int64 a7, __int64 a8)\n{\n__int64 result; // rax\n__int64 v13; // [rsp+38h] [rbp-28h] BYREF\nunsigned int v14; // [rsp+40h] [rbp-20h] BYREF\nint v15; // [rsp+44h] [rbp-1Ch] BYREF\nunsigned int v16; // [rsp+48h] [rbp-18h] BYREF\nint v17; // [rsp+4Ch] [rbp-14h]\nint v18; // [rsp+50h] [rbp-10h]\nint v19; // [rsp+54h] [rbp-Ch]\nint v20; // [rsp+58h] [rbp-8h]\nchar v21; // [rsp+5Fh] [rbp-1h]\n\nv21 = 0;\nv20 = 0;\nv19 = 0;\nv16 = 0;\nv15 = 0;\nv14 = 0;\nv13 = *a3;\nv18 = 0;\nv17 = 0;\nif ( a1 == a2 )\nreturn 0xFFFFFFFFLL;\nwhile ( 1 )\n{\nv18 = st_shti_bp_branch_once((unsigned int)*a4, &v16, v13, a7, a8);\nif ( v18 )\n{\nif ( v18 == 1 )\n{\nfprintf(stderr, \"Error: Prolonging of the suffix number %zu to the length of %zu failed!\\n\", a1, a2 - a1);\nresult = 4LL;\n}\nelse\n{\nv21 = *(_BYTE *)(a1 + *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4) + a7);\nif ( (unsigned int)st_shti_bp_create_leaf((unsigned int)*a4, (unsigned int)v21, (unsigned int)-(int)a1, a7, a8) )\n{\nfwrite(\"Error: Could not create a new leaf of the parent!\\n\", 1uLL, 0x32uLL, stderr);\nresult = 5LL;\n}\nelse\n{\nif ( *a4 > 1 )\n*a4 = *(_DWORD *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 12);\n*a3 = *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4) + a1 + 1;\nresult = 0LL;\n}\n}\nreturn result;\n}\nv17 = st_shti_bp_edge_slowscan((unsigned int)*a4, v16, v13, &v14, a7, a2 - 1, a8);\nif ( v17 )\nbreak;\nv19 = *a4;\nst_shti_bp_edge_descend(a4, &v16, &v15, &v13, a2 - 1, a8);\nif ( *a4 < 0 )\n{\n*a4 = v19;\nif ( *a4 != 1 )\n*a4 = *(_DWORD *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 12);\n*a3 = *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4) + a1 + 1;\nreturn 4294967294LL;\n}\nif ( a2 == *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4) + a1 )\n{\n*a3 = a1 + *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4);\nreturn 4294967293LL;\n}\n}\nif ( v17 == 2 )\n{\n*a3 = a1 + *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4);\nreturn 4294967292LL;\n}\nv20 = v16;\nv21 = *(_BYTE *)(v13 + a7);\nif ( (unsigned int)st_shti_bp_split_edge(a4, (unsigned int)v21, &v16, &v13, v14, (unsigned int)a1, a7, a8) )\n{\nfwrite(\"Error: Could not split the parent->child edge!\\n\", 1uLL, 0x2FuLL, stderr);\nreturn 1LL;\n}\nv21 = *(_BYTE *)(v13 + a7);\nif ( (unsigned int)st_shti_bp_create_leaf((unsigned int)*a4, (unsigned int)v21, (unsigned int)-(int)a1, a7, a8) )\n{\nfwrite(\"Error: Could not create a new leaf of the parent!\\n\", 1uLL, 0x32uLL, stderr);\nreturn 2LL;\n}\nif ( *a5 )\n{\nif ( a1 + *a6 != v13 )\n{\nfprintf(\nstderr,\n\"Error! The last opportunity to set the target of a suffix link missed! (suffix link source = %d)\\n\",\n*a5);\nreturn 3LL;\n}\n*(_DWORD *)(16LL * (int)*a5 + *(_QWORD *)(a8 + 72) + 12) = *a4;\n}\n*a5 = *a4;\n*a6 = *(_DWORD *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4) - 1;\nif ( !(unsigned int)func0(a4, v20, *a6, a8) )\n{\n*a5 = 0;\n*a6 = 0;\n}\n*a3 = *(unsigned int *)(*(_QWORD *)(a8 + 72) + 16LL * *a4 + 4) + a1 + 1;\nreturn 0LL;\n}",
"original_code": "int st_shti_bp_ukkonen_prolong_suffix (size_t starting_position,\n size_t ending_position,\n size_t *active_index,\n signed_integral_type *parent,\n signed_integral_type *sl_source,\n unsigned_integral_type *sl_targets_depth,\n const character_type *text,\n suffix_tree_shti_bp *stree) {\n character_type letter = 0;\n signed_integral_type latest_child = 0;\n signed_integral_type grandpa = 0;\n signed_integral_type child = 0;\n signed_integral_type prev_child = 0;\n signed_integral_type last_match_position = 0;\n size_t position = (*active_index);\n int tmp = 0;\n int slowscan_return = 0;\n if (starting_position == ending_position) {\n return (-1);\n }\n while ((tmp = st_shti_bp_branch_once((*parent), &child,\n position, text, stree)) == 0) {\n if ((slowscan_return = st_shti_bp_edge_slowscan((*parent),\n child, position, &last_match_position, text,\n ending_position - 1, stree)) == 0) {\n grandpa = (*parent);\n st_shti_bp_edge_descend(parent, &child, &prev_child,\n &position, ending_position - 1, stree);\n if ((*parent) < 0) {\n (*parent) = grandpa;\n if ((*parent) != 1) {\n (*parent) = stree->tbranch[(*parent)].\n suffix_link;\n }\n (*active_index) = starting_position + 1 +\n stree->tbranch[(*parent)].depth;\n return (-2);\n } else if (starting_position +\n stree->tbranch[(*parent)].depth ==\n ending_position) {\n (*active_index) = starting_position +\n stree->tbranch[(*parent)].depth;\n return (-3);\n }\n } else if (slowscan_return == 2) {\n (*active_index) = starting_position +\n stree->tbranch[(*parent)].depth;\n return (-4);\n } else {\n latest_child = child;\n letter = text[position];\n if (st_shti_bp_split_edge(parent, letter, &child,\n &position, last_match_position,\n (unsigned_integral_type)(starting_position),\n text, stree) != 0) {\n fprintf(stderr, \"Error: Could not split \"\n \"the parent->child edge!\\n\");\n return (1);\n }\n letter = text[position];\n if (st_shti_bp_create_leaf((*parent), letter,\n (-(signed_integral_type)(starting_position)),\n text, stree)) {\n fprintf(stderr, \"Error: Could not create \"\n \"a new leaf of the parent!\\n\");\n return (2);\n }\n if ((*sl_source) != 0) {\n if (position == starting_position +\n (*sl_targets_depth)) {\n stree->tbranch[(*sl_source)].\n suffix_link = (*parent);\n } else {\n fprintf(stderr, \"Error! The last \"\n \"opportunity to \"\n \"set the target \"\n \"of a suffix link \"\n \"missed! (suffix \"\n \"link source = %d)\\n\",\n (*sl_source));\n return (3);\n }\n }\n (*sl_source) = (*parent);\n (*sl_targets_depth) =\n stree->tbranch[(*parent)].depth - 1;\n if (st_shti_bp_simulate_suffix_link_bottom_up(parent,\n latest_child, (*sl_targets_depth),\n stree) == 0) {\n (*sl_source) = 0;\n (*sl_targets_depth) = 0;\n }\n (*active_index) = starting_position + 1 +\n stree->tbranch[(*parent)].depth;\n return (0);\n }\n }\n if (tmp == 1) {\n fprintf(stderr, \"Error: Prolonging of the suffix number \"\n \"%zu to the length of %zu failed!\\n\",\n starting_position,\n ending_position - starting_position);\n return (4);\n } else {\n letter = text[starting_position +\n stree->tbranch[(*parent)].depth];\n if (st_shti_bp_create_leaf((*parent), letter,\n (-(signed_integral_type)(starting_position)),\n text, stree)) {\n fprintf(stderr, \"Error: Could not create \"\n \"a new leaf of the parent!\\n\");\n return (5);\n }\n }\n if ((*parent) > 1) {\n (*parent) = stree->tbranch[(*parent)].suffix_link;\n }\n (*active_index) = starting_position + 1 +\n stree->tbranch[(*parent)].depth;\n return (0);\n}",
"canonical_original_code": "int st_shti_bp_ukkonen_prolong_suffix(unsigned long starting_position, unsigned long ending_position, unsigned long *active_index, int *parent, int *sl_source, unsigned int *sl_targets_depth, char *text, struct suffix_tree_shti_bp_struct *stree) {\n char letter = 0;\n int latest_child = 0;\n int grandpa = 0;\n int child = 0;\n int prev_child = 0;\n int last_match_position = 0;\n unsigned long position = (*active_index);\n int tmp = 0;\n int slowscan_return = 0;\n if (starting_position == ending_position) {\n return (-1);\n }\n while ((tmp = st_shti_bp_branch_once((*parent), &child,\n position, text, stree)) == 0) {\n if ((slowscan_return = st_shti_bp_edge_slowscan((*parent),\n child, position, &last_match_position, text,\n ending_position - 1, stree)) == 0) {\n grandpa = (*parent);\n st_shti_bp_edge_descend(parent, &child, &prev_child,\n &position, ending_position - 1, stree);\n if ((*parent) < 0) {\n (*parent) = grandpa;\n if ((*parent) != 1) {\n (*parent) = stree->tbranch[(*parent)].\n suffix_link;\n }\n (*active_index) = starting_position + 1 +\n stree->tbranch[(*parent)].depth;\n return (-2);\n } else if (starting_position +\n stree->tbranch[(*parent)].depth ==\n ending_position) {\n (*active_index) = starting_position +\n stree->tbranch[(*parent)].depth;\n return (-3);\n }\n } else if (slowscan_return == 2) {\n (*active_index) = starting_position +\n stree->tbranch[(*parent)].depth;\n return (-4);\n } else {\n latest_child = child;\n letter = text[position];\n if (st_shti_bp_split_edge(parent, letter, &child,\n &position, last_match_position,\n (unsigned_integral_type)(starting_position),\n text, stree) != 0) {\n fprintf(stderr, \"Error: Could not split \"\n \"the parent->child edge!\\n\");\n return (1);\n }\n letter = text[position];\n if (st_shti_bp_create_leaf((*parent), letter,\n (-(signed_integral_type)(starting_position)),\n text, stree)) {\n fprintf(stderr, \"Error: Could not create \"\n \"a new leaf of the parent!\\n\");\n return (2);\n }\n if ((*sl_source) != 0) {\n if (position == starting_position +\n (*sl_targets_depth)) {\n stree->tbranch[(*sl_source)].\n suffix_link = (*parent);\n } else {\n fprintf(stderr, \"Error! The last \"\n \"opportunity to \"\n \"set the target \"\n \"of a suffix link \"\n \"missed! (suffix \"\n \"link source = %d)\\n\",\n (*sl_source));\n return (3);\n }\n }\n (*sl_source) = (*parent);\n (*sl_targets_depth) =\n stree->tbranch[(*parent)].depth - 1;\n if (st_shti_bp_simulate_suffix_link_bottom_up(parent,\n latest_child, (*sl_targets_depth),\n stree) == 0) {\n (*sl_source) = 0;\n (*sl_targets_depth) = 0;\n }\n (*active_index) = starting_position + 1 +\n stree->tbranch[(*parent)].depth;\n return (0);\n }\n }\n if (tmp == 1) {\n fprintf(stderr, \"Error: Prolonging of the suffix number \"\n \"%zu to the length of %zu failed!\\n\",\n starting_position,\n ending_position - starting_position);\n return (4);\n } else {\n letter = text[starting_position +\n stree->tbranch[(*parent)].depth];\n if (st_shti_bp_create_leaf((*parent), letter,\n (-(signed_integral_type)(starting_position)),\n text, stree)) {\n fprintf(stderr, \"Error: Could not create \"\n \"a new leaf of the parent!\\n\");\n return (5);\n }\n }\n if ((*parent) > 1) {\n (*parent) = stree->tbranch[(*parent)].suffix_link;\n }\n (*active_index) = starting_position + 1 +\n stree->tbranch[(*parent)].depth;\n return (0);\n}",
"variable_types": [
[
"starting_position",
"unsigned long"
],
[
"ending_position",
"unsigned long"
],
[
"active_index",
"unsigned long *"
],
[
"parent",
"int *"
],
[
"sl_source",
"int *"
],
[
"sl_targets_depth",
"unsigned int *"
],
[
"text",
"char *"
],
[
"stree",
"struct suffix_tree_shti_bp_struct { unsigned long hs_size; unsigned long lr_size; unsigned long er_size; unsigned long br_size; int crt_type; unsigned long chf_number; struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; } *hs; struct leaf_record_shti_bp_struct { int parent; } *tleaf; struct edge_record_struct { int source_node; int target_node; } *tedge; struct branch_record_shti_bp_struct { int parent; unsigned int depth; unsigned int head_position; int suffix_link; } *tbranch; unsigned long edges; unsigned long tedge_size; unsigned long tesize_increase; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; } *"
],
[
"letter",
"char"
],
[
"latest_child",
"int"
],
[
"grandpa",
"int"
],
[
"child",
"int"
],
[
"prev_child",
"int"
],
[
"last_match_position",
"int"
],
[
"position",
"unsigned long"
],
[
"tmp",
"int"
],
[
"slowscan_return",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct suffix_tree_shti_bp_struct { unsigned long hs_size; unsigned long lr_size; unsigned long er_size; unsigned long br_size; int crt_type; unsigned long chf_number; struct hash_settings_struct *hs; struct leaf_record_shti_bp_struct *tleaf; struct edge_record_struct *tedge; struct branch_record_shti_bp_struct *tbranch; unsigned long edges; unsigned long tedge_size; unsigned long tesize_increase; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; }",
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; }",
"struct leaf_record_shti_bp_struct { int parent; }",
"struct edge_record_struct { int source_node; int target_node; }",
"struct branch_record_shti_bp_struct { int parent; unsigned int depth; unsigned int head_position; int suffix_link; }"
],
"binary_hash": "2020aa2cef7ca9e95bd5a146be7fd85ddf03f727bff186df5fef0f10de58132b"
},
{
"name": "st_shti_bp_ukkonen_prolong_suffixes",
"canonical_name": "func3",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall st_shti_bp_ukkonen_prolong_suffixes(__int64 *a1, __int64 a2, __int64 *a3, int *a4, __int64 a5, unsigned __int64 a6, __int64 a7)\n{\n__int64 result; // rax\nunsigned int v11; // [rsp+30h] [rbp-20h] BYREF\nunsigned int v12; // [rsp+34h] [rbp-1Ch] BYREF\nunsigned __int64 v13; // [rsp+38h] [rbp-18h]\nunsigned __int64 v14; // [rsp+40h] [rbp-10h]\nint v15; // [rsp+4Ch] [rbp-4h]\n\nv12 = 0;\nv11 = 0;\nv14 = a2 + *(_QWORD *)(a7 + 104) - *a1 - 1;\nv15 = 0;\nv13 = *(_QWORD *)(a7 + 112);\nif ( v13 >= v14 || v13 >= a6 || (int)st_shti_bp_reallocate(v14, 0LL, a5, a6, a7) <= 0 )\n{\nwhile ( 1 )\n{\nv15 = st_shti_bp_ukkonen_prolong_suffix(*a1, a2, a3, a4, &v12, &v11, a5, a7);\nif ( v15 != -1 )\nbreak;\n++*a1;\n}\nwhile ( !v15 )\nv15 = st_shti_bp_ukkonen_prolong_suffix(++*a1, a2, a3, a4, &v12, &v11, a5, a7);\nif ( v15 <= 0 )\n{\nresult = 0LL;\n}\nelse\n{\nfprintf(stderr, \"Error: Could not prolong suffixes to the ending position %zu!\\n\", a2);\nresult = 2LL;\n}\n}\nelse\n{\nfwrite(\"Error: Could not reallocate memory!\\n\", 1uLL, 0x24uLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 *a1, __int64 a2, __int64 *a3, int *a4, __int64 a5, unsigned __int64 a6, __int64 a7)\n{\n__int64 result; // rax\nunsigned int v11; // [rsp+30h] [rbp-20h] BYREF\nunsigned int v12; // [rsp+34h] [rbp-1Ch] BYREF\nunsigned __int64 v13; // [rsp+38h] [rbp-18h]\nunsigned __int64 v14; // [rsp+40h] [rbp-10h]\nint v15; // [rsp+4Ch] [rbp-4h]\n\nv12 = 0;\nv11 = 0;\nv14 = a2 + *(_QWORD *)(a7 + 104) - *a1 - 1;\nv15 = 0;\nv13 = *(_QWORD *)(a7 + 112);\nif ( v13 >= v14 || v13 >= a6 || (int)st_shti_bp_reallocate(v14, 0LL, a5, a6, a7) <= 0 )\n{\nwhile ( 1 )\n{\nv15 = func2(*a1, a2, a3, a4, &v12, &v11, a5, a7);\nif ( v15 != -1 )\nbreak;\n++*a1;\n}\nwhile ( !v15 )\nv15 = func2(++*a1, a2, a3, a4, &v12, &v11, a5, a7);\nif ( v15 <= 0 )\n{\nresult = 0LL;\n}\nelse\n{\nfprintf(stderr, \"Error: Could not prolong suffixes to the ending position %zu!\\n\", a2);\nresult = 2LL;\n}\n}\nelse\n{\nfwrite(\"Error: Could not reallocate memory!\\n\", 1uLL, 0x24uLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}",
"original_code": "int st_shti_bp_ukkonen_prolong_suffixes (size_t *starting_position,\n size_t ending_position,\n size_t *active_index,\n signed_integral_type *active_node,\n const character_type *text,\n size_t length,\n suffix_tree_shti_bp *stree) {\n signed_integral_type sl_source = 0;\n unsigned_integral_type sl_targets_depth = 0;\n size_t maximum_possible_size = stree->branching_nodes +\n ending_position - (*starting_position) - 1;\n int tmp = 0;\n size_t tbranch_size = (size_t)(stree->tbranch_size);\n if ((tbranch_size < maximum_possible_size) &&\n (tbranch_size < length)) {\n if (st_shti_bp_reallocate(maximum_possible_size, (size_t)(0),\n text, length, stree) > 0) {\n fprintf(stderr, \"Error: Could not \"\n \"reallocate memory!\\n\");\n return (1);\n }\n }\n while ((tmp = st_shti_bp_ukkonen_prolong_suffix((*starting_position),\n ending_position, active_index,\n active_node, &sl_source,\n &sl_targets_depth, text,\n stree)) == (-1)) {\n ++(*starting_position);\n }\n while (tmp == 0) {\n ++(*starting_position);\n tmp = st_shti_bp_ukkonen_prolong_suffix((*starting_position),\n ending_position, active_index, active_node, &sl_source,\n &sl_targets_depth, text, stree);\n }\n if (tmp > 0) {\n fprintf(stderr, \"Error: Could not prolong suffixes \"\n \"to the ending position %zu!\\n\",\n ending_position);\n return (2);\n }\n return (0);\n}",
"canonical_original_code": "int st_shti_bp_ukkonen_prolong_suffixes(unsigned long *starting_position, unsigned long ending_position, unsigned long *active_index, int *active_node, char *text, unsigned long length, struct suffix_tree_shti_bp_struct *stree) {\n int sl_source = 0;\n unsigned int sl_targets_depth = 0;\n unsigned long maximum_possible_size = stree->branching_nodes +\n ending_position - (*starting_position) - 1;\n int tmp = 0;\n unsigned long tbranch_size = (size_t)(stree->tbranch_size);\n if ((tbranch_size < maximum_possible_size) &&\n (tbranch_size < length)) {\n if (st_shti_bp_reallocate(maximum_possible_size, (unsigned long)(0),\n text, length, stree) > 0) {\n fprintf(stderr, \"Error: Could not \"\n \"reallocate memory!\\n\");\n return (1);\n }\n }\n while ((tmp = st_shti_bp_ukkonen_prolong_suffix((*starting_position),\n ending_position, active_index,\n active_node, &sl_source,\n &sl_targets_depth, text,\n stree)) == (-1)) {\n ++(*starting_position);\n }\n while (tmp == 0) {\n ++(*starting_position);\n tmp = st_shti_bp_ukkonen_prolong_suffix((*starting_position),\n ending_position, active_index, active_node, &sl_source,\n &sl_targets_depth, text, stree);\n }\n if (tmp > 0) {\n fprintf(stderr, \"Error: Could not prolong suffixes \"\n \"to the ending position %zu!\\n\",\n ending_position);\n return (2);\n }\n return (0);\n}",
"variable_types": [
[
"starting_position",
"unsigned long *"
],
[
"ending_position",
"unsigned long"
],
[
"active_index",
"unsigned long *"
],
[
"active_node",
"int *"
],
[
"text",
"char *"
],
[
"length",
"unsigned long"
],
[
"stree",
"struct suffix_tree_shti_bp_struct { unsigned long hs_size; unsigned long lr_size; unsigned long er_size; unsigned long br_size; int crt_type; unsigned long chf_number; struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; } *hs; struct leaf_record_shti_bp_struct { int parent; } *tleaf; struct edge_record_struct { int source_node; int target_node; } *tedge; struct branch_record_shti_bp_struct { int parent; unsigned int depth; unsigned int head_position; int suffix_link; } *tbranch; unsigned long edges; unsigned long tedge_size; unsigned long tesize_increase; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; } *"
],
[
"sl_source",
"int"
],
[
"sl_targets_depth",
"unsigned int"
],
[
"maximum_possible_size",
"unsigned long"
],
[
"tmp",
"int"
],
[
"tbranch_size",
"unsigned long"
]
],
"return_type": "int",
"user_defined_types": [
"struct suffix_tree_shti_bp_struct { unsigned long hs_size; unsigned long lr_size; unsigned long er_size; unsigned long br_size; int crt_type; unsigned long chf_number; struct hash_settings_struct *hs; struct leaf_record_shti_bp_struct *tleaf; struct edge_record_struct *tedge; struct branch_record_shti_bp_struct *tbranch; unsigned long edges; unsigned long tedge_size; unsigned long tesize_increase; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; }",
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; }",
"struct leaf_record_shti_bp_struct { int parent; }",
"struct edge_record_struct { int source_node; int target_node; }",
"struct branch_record_shti_bp_struct { int parent; unsigned int depth; unsigned int head_position; int suffix_link; }"
],
"binary_hash": "2020aa2cef7ca9e95bd5a146be7fd85ddf03f727bff186df5fef0f10de58132b"
},
{
"name": "st_shti_bp_create_mccreight",
"canonical_name": "func4",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall st_shti_bp_create_mccreight(__int64 a1, unsigned __int64 a2, _QWORD *a3)\n{\n__int64 result; // rax\nunsigned int v5; // [rsp+2Ch] [rbp-24h] BYREF\nunsigned int v6; // [rsp+30h] [rbp-20h] BYREF\nint v7; // [rsp+34h] [rbp-1Ch] BYREF\nunsigned __int64 i; // [rsp+38h] [rbp-18h]\n\nv7 = 1;\nv6 = 0;\nv5 = 0;\ni = 1LL;\nputs(\"Creating suffix tree using McCright's algorithm\\n\");\nif ( (int)st_shti_bp_allocate(a2, a3) <= 0 )\n{\nfor ( i = 1LL; i < a2 + 2; ++i )\n{\nif ( (int)st_shti_bp_mccreight_insert_suffix(&v7, &v6, &v5, i, a1, a2, a3) > 0 )\n{\nfprintf(stderr, \"Could not insert suffix number %zu. Exiting.\\n\", i);\nreturn 2LL;\n}\n}\nputs(\"\\nThe suffix tree has been successfully created.\");\nst_print_stats(\na2,\na3[10],\na3[13],\n0LL,\na3[11],\na3[14],\n0LL,\na3[1],\na3[2],\na3[3],\n0LL,\n*(_QWORD *)(a3[6] + 64LL),\n*(_QWORD *)(a3[6] + 64LL));\nresult = 0LL;\n}\nelse\n{\nfwrite(\"Allocation error. Exiting.\\n\", 1uLL, 0x1BuLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1, unsigned __int64 a2, _QWORD *a3)\n{\n__int64 result; // rax\nunsigned int v5; // [rsp+2Ch] [rbp-24h] BYREF\nunsigned int v6; // [rsp+30h] [rbp-20h] BYREF\nint v7; // [rsp+34h] [rbp-1Ch] BYREF\nunsigned __int64 i; // [rsp+38h] [rbp-18h]\n\nv7 = 1;\nv6 = 0;\nv5 = 0;\ni = 1LL;\nputs(\"Creating suffix tree using McCright's algorithm\\n\");\nif ( (int)st_shti_bp_allocate(a2, a3) <= 0 )\n{\nfor ( i = 1LL; i < a2 + 2; ++i )\n{\nif ( (int)func1(&v7, &v6, &v5, i, a1, a2, a3) > 0 )\n{\nfprintf(stderr, \"Could not insert suffix number %zu. Exiting.\\n\", i);\nreturn 2LL;\n}\n}\nputs(\"\\nThe suffix tree has been successfully created.\");\nst_print_stats(\na2,\na3[10],\na3[13],\n0LL,\na3[11],\na3[14],\n0LL,\na3[1],\na3[2],\na3[3],\n0LL,\n*(_QWORD *)(a3[6] + 64LL),\n*(_QWORD *)(a3[6] + 64LL));\nresult = 0LL;\n}\nelse\n{\nfwrite(\"Allocation error. Exiting.\\n\", 1uLL, 0x1BuLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}",
"original_code": "int st_shti_bp_create_mccreight (const character_type *text,\n size_t length,\n suffix_tree_shti_bp *stree) {\n signed_integral_type starting_node = 1;\n signed_integral_type sl_source = 0;\n unsigned_integral_type sl_targets_depth = 0;\n size_t i = 1;\n printf(\"Creating suffix tree using McCright's algorithm\\n\\n\");\n if (st_shti_bp_allocate(length, stree) > 0) {\n fprintf(stderr, \"Allocation error. Exiting.\\n\");\n return (1);\n }\n for (i = 1; i < length + 2; ++i) {\n if (st_shti_bp_mccreight_insert_suffix(&starting_node,\n &sl_source, &sl_targets_depth, i,\n text, length, stree) > 0) {\n fprintf(stderr, \"Could not insert suffix number \"\n \"%zu. Exiting.\\n\", i);\n return (2);\n }\n }\n printf(\"\\nThe suffix tree has been successfully created.\\n\");\n st_print_stats(length, stree->edges, stree->branching_nodes,\n (size_t)(0), stree->tedge_size, stree->tbranch_size,\n (size_t)(0), stree->lr_size, stree->er_size,\n stree->br_size, (size_t)(0),\n stree->hs->allocated_size, stree->hs->allocated_size);\n return (0);\n}",
"canonical_original_code": "int st_shti_bp_create_mccreight(char *text, unsigned long length, struct suffix_tree_shti_bp_struct *stree) {\n int starting_node = 1;\n int sl_source = 0;\n unsigned int sl_targets_depth = 0;\n unsigned long i = 1;\n printf(\"Creating suffix tree using McCright's algorithm\\n\\n\");\n if (st_shti_bp_allocate(length, stree) > 0) {\n fprintf(stderr, \"Allocation error. Exiting.\\n\");\n return (1);\n }\n for (i = 1; i < length + 2; ++i) {\n if (st_shti_bp_mccreight_insert_suffix(&starting_node,\n &sl_source, &sl_targets_depth, i,\n text, length, stree) > 0) {\n fprintf(stderr, \"Could not insert suffix number \"\n \"%zu. Exiting.\\n\", i);\n return (2);\n }\n }\n printf(\"\\nThe suffix tree has been successfully created.\\n\");\n st_print_stats(length, stree->edges, stree->branching_nodes,\n (unsigned long)(0), stree->tedge_size, stree->tbranch_size,\n (unsigned long)(0), stree->lr_size, stree->er_size,\n stree->br_size, (unsigned long)(0),\n stree->hs->allocated_size, stree->hs->allocated_size);\n return (0);\n}",
"variable_types": [
[
"text",
"char *"
],
[
"length",
"unsigned long"
],
[
"stree",
"struct suffix_tree_shti_bp_struct { unsigned long hs_size; unsigned long lr_size; unsigned long er_size; unsigned long br_size; int crt_type; unsigned long chf_number; struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; } *hs; struct leaf_record_shti_bp_struct { int parent; } *tleaf; struct edge_record_struct { int source_node; int target_node; } *tedge; struct branch_record_shti_bp_struct { int parent; unsigned int depth; unsigned int head_position; int suffix_link; } *tbranch; unsigned long edges; unsigned long tedge_size; unsigned long tesize_increase; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; } *"
],
[
"starting_node",
"int"
],
[
"sl_source",
"int"
],
[
"sl_targets_depth",
"unsigned int"
],
[
"i",
"unsigned long"
]
],
"return_type": "int",
"user_defined_types": [
"struct suffix_tree_shti_bp_struct { unsigned long hs_size; unsigned long lr_size; unsigned long er_size; unsigned long br_size; int crt_type; unsigned long chf_number; struct hash_settings_struct *hs; struct leaf_record_shti_bp_struct *tleaf; struct edge_record_struct *tedge; struct branch_record_shti_bp_struct *tbranch; unsigned long edges; unsigned long tedge_size; unsigned long tesize_increase; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; }",
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; }",
"struct leaf_record_shti_bp_struct { int parent; }",
"struct edge_record_struct { int source_node; int target_node; }",
"struct branch_record_shti_bp_struct { int parent; unsigned int depth; unsigned int head_position; int suffix_link; }"
],
"binary_hash": "2020aa2cef7ca9e95bd5a146be7fd85ddf03f727bff186df5fef0f10de58132b"
},
{
"name": "st_shti_bp_create_ukkonen",
"canonical_name": "func5",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall st_shti_bp_create_ukkonen(__int64 a1, unsigned __int64 a2, _QWORD *a3)\n{\n__int64 result; // rax\n__int64 v5; // [rsp+20h] [rbp-30h] BYREF\n__int64 v6; // [rsp+28h] [rbp-28h] BYREF\nint v7; // [rsp+34h] [rbp-1Ch] BYREF\nunsigned __int64 i; // [rsp+38h] [rbp-18h]\n\nv7 = 1;\nv6 = 1LL;\nv5 = 1LL;\ni = 1LL;\nputs(\"Creating suffix tree using Ukkonen's algorithm\\n\");\nif ( (int)st_shti_bp_allocate(a2, a3) <= 0 )\n{\nfor ( i = 2LL; i <= a2 + 2; ++i )\n{\nif ( (int)st_shti_bp_ukkonen_prolong_suffixes(&v5, i, &v6, &v7, a1, a2, (__int64)a3) > 0 )\n{\nfprintf(stderr, \"Could not create the intermediate tree number %zu. Exiting.\\n\", i - 1);\nreturn 2LL;\n}\n}\nputs(\"\\nThe suffix tree has been successfully created.\");\nst_print_stats(\na2,\na3[10],\na3[13],\n0LL,\na3[11],\na3[14],\n0LL,\na3[1],\na3[2],\na3[3],\n0LL,\n*(_QWORD *)(a3[6] + 64LL),\n*(_QWORD *)(a3[6] + 64LL));\nresult = 0LL;\n}\nelse\n{\nfwrite(\"Allocation error. Exiting.\\n\", 1uLL, 0x1BuLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1, unsigned __int64 a2, _QWORD *a3)\n{\n__int64 result; // rax\n__int64 v5; // [rsp+20h] [rbp-30h] BYREF\n__int64 v6; // [rsp+28h] [rbp-28h] BYREF\nint v7; // [rsp+34h] [rbp-1Ch] BYREF\nunsigned __int64 i; // [rsp+38h] [rbp-18h]\n\nv7 = 1;\nv6 = 1LL;\nv5 = 1LL;\ni = 1LL;\nputs(\"Creating suffix tree using Ukkonen's algorithm\\n\");\nif ( (int)st_shti_bp_allocate(a2, a3) <= 0 )\n{\nfor ( i = 2LL; i <= a2 + 2; ++i )\n{\nif ( (int)func3(&v5, i, &v6, &v7, a1, a2, (__int64)a3) > 0 )\n{\nfprintf(stderr, \"Could not create the intermediate tree number %zu. Exiting.\\n\", i - 1);\nreturn 2LL;\n}\n}\nputs(\"\\nThe suffix tree has been successfully created.\");\nst_print_stats(\na2,\na3[10],\na3[13],\n0LL,\na3[11],\na3[14],\n0LL,\na3[1],\na3[2],\na3[3],\n0LL,\n*(_QWORD *)(a3[6] + 64LL),\n*(_QWORD *)(a3[6] + 64LL));\nresult = 0LL;\n}\nelse\n{\nfwrite(\"Allocation error. Exiting.\\n\", 1uLL, 0x1BuLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}",
"original_code": "int st_shti_bp_create_ukkonen (const character_type *text,\n size_t length,\n suffix_tree_shti_bp *stree) {\n signed_integral_type active_node = 1;\n size_t active_index = 1;\n size_t starting_position = 1;\n size_t i = 1;\n printf(\"Creating suffix tree using Ukkonen's algorithm\\n\\n\");\n if (st_shti_bp_allocate(length, stree) > 0) {\n fprintf(stderr, \"Allocation error. Exiting.\\n\");\n return (1);\n }\n for (i = 2; i <= length + 2; ++i) {\n if (st_shti_bp_ukkonen_prolong_suffixes(&starting_position, i,\n &active_index, &active_node, text,\n length, stree) > 0) {\n fprintf(stderr, \"Could not create the intermediate \"\n \"tree number %zu. Exiting.\\n\", i - 1);\n return (2);\n }\n }\n printf(\"\\nThe suffix tree has been successfully created.\\n\");\n st_print_stats(length, stree->edges, stree->branching_nodes,\n (size_t)(0), stree->tedge_size, stree->tbranch_size,\n (size_t)(0), stree->lr_size, stree->er_size,\n stree->br_size, (size_t)(0),\n stree->hs->allocated_size, stree->hs->allocated_size);\n return (0);\n}",
"canonical_original_code": "int st_shti_bp_create_ukkonen(char *text, unsigned long length, struct suffix_tree_shti_bp_struct *stree) {\n int active_node = 1;\n unsigned long active_index = 1;\n unsigned long starting_position = 1;\n unsigned long i = 1;\n printf(\"Creating suffix tree using Ukkonen's algorithm\\n\\n\");\n if (st_shti_bp_allocate(length, stree) > 0) {\n fprintf(stderr, \"Allocation error. Exiting.\\n\");\n return (1);\n }\n for (i = 2; i <= length + 2; ++i) {\n if (st_shti_bp_ukkonen_prolong_suffixes(&starting_position, i,\n &active_index, &active_node, text,\n length, stree) > 0) {\n fprintf(stderr, \"Could not create the intermediate \"\n \"tree number %zu. Exiting.\\n\", i - 1);\n return (2);\n }\n }\n printf(\"\\nThe suffix tree has been successfully created.\\n\");\n st_print_stats(length, stree->edges, stree->branching_nodes,\n (unsigned long)(0), stree->tedge_size, stree->tbranch_size,\n (unsigned long)(0), stree->lr_size, stree->er_size,\n stree->br_size, (unsigned long)(0),\n stree->hs->allocated_size, stree->hs->allocated_size);\n return (0);\n}",
"variable_types": [
[
"text",
"char *"
],
[
"length",
"unsigned long"
],
[
"stree",
"struct suffix_tree_shti_bp_struct { unsigned long hs_size; unsigned long lr_size; unsigned long er_size; unsigned long br_size; int crt_type; unsigned long chf_number; struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; } *hs; struct leaf_record_shti_bp_struct { int parent; } *tleaf; struct edge_record_struct { int source_node; int target_node; } *tedge; struct branch_record_shti_bp_struct { int parent; unsigned int depth; unsigned int head_position; int suffix_link; } *tbranch; unsigned long edges; unsigned long tedge_size; unsigned long tesize_increase; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; } *"
],
[
"active_node",
"int"
],
[
"active_index",
"unsigned long"
],
[
"starting_position",
"unsigned long"
],
[
"i",
"unsigned long"
]
],
"return_type": "int",
"user_defined_types": [
"struct suffix_tree_shti_bp_struct { unsigned long hs_size; unsigned long lr_size; unsigned long er_size; unsigned long br_size; int crt_type; unsigned long chf_number; struct hash_settings_struct *hs; struct leaf_record_shti_bp_struct *tleaf; struct edge_record_struct *tedge; struct branch_record_shti_bp_struct *tbranch; unsigned long edges; unsigned long tedge_size; unsigned long tesize_increase; unsigned long branching_nodes; unsigned long tbranch_size; unsigned long tbsize_increase; }",
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; }",
"struct leaf_record_shti_bp_struct { int parent; }",
"struct edge_record_struct { int source_node; int target_node; }",
"struct branch_record_shti_bp_struct { int parent; unsigned int depth; unsigned int head_position; int suffix_link; }"
],
"binary_hash": "2020aa2cef7ca9e95bd5a146be7fd85ddf03f727bff186df5fef0f10de58132b"
}
] |
2169b752b337b736a4304e483717fdaaf9d00d4c859f3ccde17b046e01fedc9d | pbasista/stc | [
[
"ullrandom",
"->",
"fermat_test",
"mr_test"
],
[
"mul_modular",
"->",
"pow_modular"
],
[
"pow_modular",
"->",
"mul_modular",
"fermat_test",
"mr_test"
],
[
"fermat_test",
"->",
"ullrandom",
"pow_modular"
],
[
"mr_test",
"->",
"ullrandom",
"pow_modular",
"next_prime"
],
[
"next_prime",
"->",
"mr_test"
]
] | [] | [
{
"name": "ullrandom",
"canonical_name": "func0",
"repo": "pbasista/stc",
"decompiled_code": "unsigned __int64 __fastcall ullrandom(unsigned __int64 a1)\n{\n__int64 v2; // [rsp+20h] [rbp-10h]\n\nv2 = random();\nreturn ((random() << 32) | (unsigned __int64)v2) % a1;\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func0(unsigned __int64 a1)\n{\n__int64 v2; // [rsp+20h] [rbp-10h]\n\nv2 = random();\nreturn ((random() << 32) | (unsigned __int64)v2) % a1;\n}",
"original_code": "ull ullrandom (ull upper_bound) {\n ull result = 0;\n long int low_bits = random();\n long int high_bits = random();\n result = (((ull)(high_bits) << 32) | (ull)(low_bits)) % upper_bound;\n return (result);\n}",
"canonical_original_code": "unsigned long long ullrandom(unsigned long long upper_bound) {\n unsigned long long result = 0;\n long low_bits = random();\n long high_bits = random();\n result = (((ull)(high_bits) << 32) | (ull)(low_bits)) % upper_bound;\n return (result);\n}",
"variable_types": [
[
"upper_bound",
"unsigned long long"
],
[
"result",
"unsigned long long"
],
[
"low_bits",
"long"
],
[
"high_bits",
"long"
]
],
"return_type": "unsigned long long",
"user_defined_types": [],
"binary_hash": "2169b752b337b736a4304e483717fdaaf9d00d4c859f3ccde17b046e01fedc9d"
},
{
"name": "mul_modular",
"canonical_name": "func1",
"repo": "pbasista/stc",
"decompiled_code": "unsigned __int64 __fastcall mul_modular(unsigned __int64 a1, unsigned __int64 a2, unsigned __int64 a3)\n{\nunsigned __int64 v5; // [rsp+18h] [rbp-10h]\nunsigned __int64 v6; // [rsp+20h] [rbp-8h]\n\nv6 = 0LL;\nv5 = a1 % a3;\nwhile ( a2 )\n{\nif ( (a2 & 1) != 0 )\nv6 = (v6 + v5) % a3;\nv5 = 2 * v5 % a3;\na2 >>= 1;\n}\nreturn v6;\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func1(unsigned __int64 a1, unsigned __int64 a2, unsigned __int64 a3)\n{\nunsigned __int64 v5; // [rsp+18h] [rbp-10h]\nunsigned __int64 v6; // [rsp+20h] [rbp-8h]\n\nv6 = 0LL;\nv5 = a1 % a3;\nwhile ( a2 )\n{\nif ( (a2 & 1) != 0 )\nv6 = (v6 + v5) % a3;\nv5 = 2 * v5 % a3;\na2 >>= 1;\n}\nreturn v6;\n}",
"original_code": "ull mul_modular (ull a, ull b, ull c) {\n ull result = 0;\n ull add = a % c;\n while (b > 0) {\n if (b % 2 == 1) {\n result = (result + add) % c;\n }\n add = add * 2 % c;\n b /= 2;\n }\n return (result);\n}",
"canonical_original_code": "unsigned long long mul_modular(unsigned long long a, unsigned long long b, unsigned long long c) {\n unsigned long long result = 0;\n unsigned long long add = a % c;\n while (b > 0) {\n if (b % 2 == 1) {\n result = (result + add) % c;\n }\n add = add * 2 % c;\n b /= 2;\n }\n return (result);\n}",
"variable_types": [
[
"a",
"unsigned long long"
],
[
"b",
"unsigned long long"
],
[
"c",
"unsigned long long"
],
[
"result",
"unsigned long long"
],
[
"add",
"unsigned long long"
]
],
"return_type": "unsigned long long",
"user_defined_types": [],
"binary_hash": "2169b752b337b736a4304e483717fdaaf9d00d4c859f3ccde17b046e01fedc9d"
},
{
"name": "pow_modular",
"canonical_name": "func2",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall pow_modular(unsigned __int64 a1, unsigned __int64 a2, unsigned __int64 a3)\n{\n__int64 v7; // [rsp+20h] [rbp-8h]\n\nv7 = 1LL;\nwhile ( a2 )\n{\nif ( (a2 & 1) != 0 )\nv7 = mul_modular(v7, a1, a3);\na1 = mul_modular(a1, a1, a3);\na2 >>= 1;\n}\nreturn v7;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(unsigned __int64 a1, unsigned __int64 a2, unsigned __int64 a3)\n{\n__int64 v7; // [rsp+20h] [rbp-8h]\n\nv7 = 1LL;\nwhile ( a2 )\n{\nif ( (a2 & 1) != 0 )\nv7 = func1(v7, a1, a3);\na1 = func1(a1, a1, a3);\na2 >>= 1;\n}\nreturn v7;\n}",
"original_code": "ull pow_modular (ull a, ull b, ull c) {\n ull result = 1;\n ull mul = a;\n while (b > 0) {\n if (b % 2 == 1) {\n result = mul_modular(result, mul, c);\n }\n mul = mul_modular(mul, mul, c);\n b /= 2;\n }\n return (result);\n}",
"canonical_original_code": "unsigned long long pow_modular(unsigned long long a, unsigned long long b, unsigned long long c) {\n unsigned long long result = 1;\n unsigned long long mul = a;\n while (b > 0) {\n if (b % 2 == 1) {\n result = mul_modular(result, mul, c);\n }\n mul = mul_modular(mul, mul, c);\n b /= 2;\n }\n return (result);\n}",
"variable_types": [
[
"a",
"unsigned long long"
],
[
"b",
"unsigned long long"
],
[
"c",
"unsigned long long"
],
[
"result",
"unsigned long long"
],
[
"mul",
"unsigned long long"
]
],
"return_type": "unsigned long long",
"user_defined_types": [],
"binary_hash": "2169b752b337b736a4304e483717fdaaf9d00d4c859f3ccde17b046e01fedc9d"
},
{
"name": "fermat_test",
"canonical_name": "func3",
"repo": "pbasista/stc",
"decompiled_code": "unsigned __int64 __fastcall fermat_test(unsigned __int64 a1, unsigned __int64 a2)\n{\nunsigned __int64 v3; // [rsp+18h] [rbp-18h]\nunsigned __int64 v4; // [rsp+20h] [rbp-10h]\nunsigned __int64 i; // [rsp+28h] [rbp-8h]\n\nv4 = a1 - 1;\nfor ( i = 0LL; i < a2; ++i )\n{\nv3 = ullrandom(v4) + 1;\nif ( pow_modular(v3, v4, a1) != 1 )\nreturn v3;\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func3(unsigned __int64 a1, unsigned __int64 a2)\n{\nunsigned __int64 v3; // [rsp+18h] [rbp-18h]\nunsigned __int64 v4; // [rsp+20h] [rbp-10h]\nunsigned __int64 i; // [rsp+28h] [rbp-8h]\n\nv4 = a1 - 1;\nfor ( i = 0LL; i < a2; ++i )\n{\nv3 = func0(v4) + 1;\nif ( func2(v3, v4, a1) != 1 )\nreturn v3;\n}\nreturn 0LL;\n}",
"original_code": "ull fermat_test (ull number, ull repeats) {\n ull i = 0;\n ull nd1 = number - 1;\n ull witness = 0;\n for (i = 0; i < repeats; ++i) {\n witness = ullrandom(nd1) + 1;\n if (pow_modular(witness, nd1, number) != 1) {\n return (witness);\n }\n }\n return (0);\n}",
"canonical_original_code": "unsigned long long fermat_test(unsigned long long number, unsigned long long repeats) {\n unsigned long long i = 0;\n unsigned long long nd1 = number - 1;\n unsigned long long witness = 0;\n for (i = 0; i < repeats; ++i) {\n witness = ullrandom(nd1) + 1;\n if (pow_modular(witness, nd1, number) != 1) {\n return (witness);\n }\n }\n return (0);\n}",
"variable_types": [
[
"number",
"unsigned long long"
],
[
"repeats",
"unsigned long long"
],
[
"i",
"unsigned long long"
],
[
"nd1",
"unsigned long long"
],
[
"witness",
"unsigned long long"
]
],
"return_type": "unsigned long long",
"user_defined_types": [],
"binary_hash": "2169b752b337b736a4304e483717fdaaf9d00d4c859f3ccde17b046e01fedc9d"
},
{
"name": "mr_test",
"canonical_name": "func4",
"repo": "pbasista/stc",
"decompiled_code": "unsigned __int64 __fastcall mr_test(unsigned __int64 a1, unsigned __int64 a2)\n{\n__int64 v3; // [rsp+18h] [rbp-28h]\nunsigned __int64 v4; // [rsp+20h] [rbp-20h]\nunsigned __int64 v5; // [rsp+28h] [rbp-18h]\nunsigned __int64 v6; // [rsp+30h] [rbp-10h]\nunsigned __int64 i; // [rsp+38h] [rbp-8h]\n\nv4 = a1 - 1;\nfor ( i = 0LL; i < a2; ++i )\n{\nv5 = ullrandom(v4) + 1;\nif ( pow_modular(v5, v4, a1) != 1 )\nreturn v5;\nv6 = a1 - 1;\nwhile ( (v6 & 1) == 0 )\n{\nv6 >>= 1;\nv3 = pow_modular(v5, v6, a1);\nif ( v3 == v4 )\nbreak;\nif ( v3 != 1 )\nreturn v5;\n}\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func4(unsigned __int64 a1, unsigned __int64 a2)\n{\n__int64 v3; // [rsp+18h] [rbp-28h]\nunsigned __int64 v4; // [rsp+20h] [rbp-20h]\nunsigned __int64 v5; // [rsp+28h] [rbp-18h]\nunsigned __int64 v6; // [rsp+30h] [rbp-10h]\nunsigned __int64 i; // [rsp+38h] [rbp-8h]\n\nv4 = a1 - 1;\nfor ( i = 0LL; i < a2; ++i )\n{\nv5 = func0(v4) + 1;\nif ( func2(v5, v4, a1) != 1 )\nreturn v5;\nv6 = a1 - 1;\nwhile ( (v6 & 1) == 0 )\n{\nv6 >>= 1;\nv3 = func2(v5, v6, a1);\nif ( v3 == v4 )\nbreak;\nif ( v3 != 1 )\nreturn v5;\n}\n}\nreturn 0LL;\n}",
"original_code": "ull mr_test (ull number, ull repeats) {\n ull i = 0;\n ull witness = 0;\n ull nd1 = number - 1;\n ull rex = 0;\n ull mod = 0;\n for (i = 0; i < repeats; ++i) {\n witness = ullrandom(nd1) + 1;\n if (pow_modular(witness, nd1, number) == 1) {\n rex = nd1;\n while (rex % 2 == 0) {\n rex /= 2;\n mod = pow_modular(witness, rex, number);\n if (mod == nd1) {\n break;\n } else if (mod != 1) {\n return (witness);\n }\n }\n } else {\n return (witness);\n }\n }\n return (0);\n}",
"canonical_original_code": "unsigned long long mr_test(unsigned long long number, unsigned long long repeats) {\n unsigned long long i = 0;\n unsigned long long witness = 0;\n unsigned long long nd1 = number - 1;\n unsigned long long rex = 0;\n unsigned long long mod = 0;\n for (i = 0; i < repeats; ++i) {\n witness = ullrandom(nd1) + 1;\n if (pow_modular(witness, nd1, number) == 1) {\n rex = nd1;\n while (rex % 2 == 0) {\n rex /= 2;\n mod = pow_modular(witness, rex, number);\n if (mod == nd1) {\n break;\n } else if (mod != 1) {\n return (witness);\n }\n }\n } else {\n return (witness);\n }\n }\n return (0);\n}",
"variable_types": [
[
"number",
"unsigned long long"
],
[
"repeats",
"unsigned long long"
],
[
"i",
"unsigned long long"
],
[
"witness",
"unsigned long long"
],
[
"nd1",
"unsigned long long"
],
[
"rex",
"unsigned long long"
],
[
"mod",
"unsigned long long"
]
],
"return_type": "unsigned long long",
"user_defined_types": [],
"binary_hash": "2169b752b337b736a4304e483717fdaaf9d00d4c859f3ccde17b046e01fedc9d"
},
{
"name": "next_prime",
"canonical_name": "func5",
"repo": "pbasista/stc",
"decompiled_code": "unsigned __int64 __fastcall next_prime(unsigned __int64 a1)\n{\ndo\n++a1;\nwhile ( mr_test(a1, 0x64uLL) );\nreturn a1;\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func5(unsigned __int64 a1)\n{\ndo\n++a1;\nwhile ( func4(a1, 0x64uLL) );\nreturn a1;\n}",
"original_code": "ull next_prime (ull number) {\n while (mr_test(++number, (ull)(100)) != 0) {\n }\n return (number);\n}",
"canonical_original_code": "unsigned long long next_prime(unsigned long long number) {\n while (mr_test(++number, (ull)(100)) != 0) {\n }\n return (number);\n}",
"variable_types": [
[
"number",
"unsigned long long"
]
],
"return_type": "unsigned long long",
"user_defined_types": [],
"binary_hash": "2169b752b337b736a4304e483717fdaaf9d00d4c859f3ccde17b046e01fedc9d"
}
] |
6d1adfaa13dfef6f43703f4053de46ad464fdbba86a284f1601b0a73c39fe972 | pbasista/stc | [
[
"st_slai_create_pwotd",
"->"
]
] | [] | [
{
"name": "st_slai_create_pwotd",
"canonical_name": "func0",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall st_slai_create_pwotd(__int64 a1, __int64 a2, __int64 a3, _QWORD *a4)\n{\n__int64 result; // rax\n_QWORD *v7; // [rsp+20h] [rbp-30h]\n__int64 v8; // [rsp+28h] [rbp-28h]\n__int64 v9; // [rsp+30h] [rbp-20h]\n__int64 v10; // [rsp+38h] [rbp-18h]\nunsigned __int64 v11; // [rsp+40h] [rbp-10h]\nunsigned __int64 i; // [rsp+40h] [rbp-10h]\n__int64 v13; // [rsp+48h] [rbp-8h]\n\nv13 = 0LL;\nv10 = a3 + 1;\nv11 = a3 + 1;\nputs(\"Creating the suffix tree using the PWOTD algorithm\\n\");\nif ( v11 > 0x100000 )\n{\nv13 = 1LL;\nfor ( i = v11 >> 25; i; i >>= 5 )\n++v13;\n}\nif ( a1 >= 0 )\n{\nprintf(\"Abandoning the automatically determined prefix length: %zu\\n\", v13);\nv13 = a1;\n}\nprintf(\"The selected prefix length: %zu\\n\\n\", v13);\nif ( (int)st_slai_allocate(a3, a4) > 0 )\n{\nfwrite(\"Suffix tree allocation error. Exiting.\\n\", 1uLL, 0x27uLL, stderr);\nreturn 1LL;\n}\nif ( (int)pwotd_cdata_allocate(a3, a4 + 5) > 0 )\n{\nfwrite(\"Auxiliary data structures allocation error. Exiting.\\n\", 1uLL, 0x35uLL, stderr);\nreturn 2LL;\n}\npwotd_initialize_suffixes(a4 + 5);\nif ( v13 )\n{\nif ( (int)pwotd_partition_suffixes(v13, a2, a3, a4 + 5) > 0 )\n{\nfwrite(\"Error: Could not perform the partitioning phase! Exiting.\\n\", 1uLL, 0x3AuLL, stderr);\nreturn 3LL;\n}\n}\nelse\n{\nif ( (int)pwotd_cdata_tsuffixes_tmp_reallocate(v10, a3, a4 + 5) > 0 )\n{\nfwrite(\n\"Error: Could not allocate the memory for the temporary table of suffixes! Exiting.\\n\",\n1uLL,\n0x53uLL,\nstderr);\nreturn 4LL;\n}\nif ( (int)pwotd_cdata_partitions_reallocate(1LL, a3, a4 + 5) > 0 )\n{\nfwrite(\"Error: Could not allocate the memory for the table of partitions! Exiting.\\n\", 1uLL, 0x4BuLL, stderr);\nreturn 5LL;\n}\na4[32] = 0LL;\nputs(\"Creating a single partition!\");\npwotd_insert_partition(1LL, v10 + 1, 0LL, a3, a4 + 5);\nputs(\"The partition has been created!\");\n}\nif ( (int)pwotd_cdata_partitions_tbp_reallocate(a4[20], a3, a4 + 5) <= 0 )\n{\nif ( (int)pwotd_cdata_partitions_stack_reallocate(a4[32] << 8, a3, a4 + 5) <= 0 )\n{\nst_slai_process_partitions_range(0LL, a4[20], 0LL, 0LL, a2, a3, a4);\nif ( (int)st_slai_empty_partitions_stack(a2, a3, a4) <= 0 )\n{\nwhile ( a4[23] )\n{\n--a4[23];\nv7 = (_QWORD *)(a4[13] + 24LL * a4[23]);\nst_slai_process_partition(*v7, v7[1], v7[2], a2, a3, a4);\n}\npwotd_print_memory_usage_stats(stdout, a3, a4 + 5);\nv9 = a4[34];\nv8 = a4[33];\nif ( (int)pwotd_cdata_deallocate(a4 + 5) <= 0 )\n{\nputs(\"\\nThe suffix tree has been successfully created.\");\nst_print_stats(a3, 0LL, a4[1], a4[2] - 1LL, 0LL, 0LL, a4[3], 0LL, 0LL, 0LL, 4LL, v9, v8);\nresult = 0LL;\n}\nelse\n{\nfwrite(\"Deallocation error. Exiting.\\n\", 1uLL, 0x1DuLL, stderr);\nresult = 9LL;\n}\n}\nelse\n{\nfwrite(\"Error: Could not successfully empty the partitions stack Exiting.\\n\", 1uLL, 0x42uLL, stderr);\nresult = 8LL;\n}\n}\nelse\n{\nfwrite(\"Error: Could not reallocate the memory for the partitions stack. Exiting.\\n\", 1uLL, 0x4AuLL, stderr);\nresult = 7LL;\n}\n}\nelse\n{\nfwrite(\n\"Error: st_slai_create_pwotd:\\nCould not reallocate the memory\\nfor the table of partitions to be processed.\\n\",\n1uLL,\n0x6AuLL,\nstderr);\nresult = 6LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, __int64 a2, __int64 a3, _QWORD *a4)\n{\n__int64 result; // rax\n_QWORD *v7; // [rsp+20h] [rbp-30h]\n__int64 v8; // [rsp+28h] [rbp-28h]\n__int64 v9; // [rsp+30h] [rbp-20h]\n__int64 v10; // [rsp+38h] [rbp-18h]\nunsigned __int64 v11; // [rsp+40h] [rbp-10h]\nunsigned __int64 i; // [rsp+40h] [rbp-10h]\n__int64 v13; // [rsp+48h] [rbp-8h]\n\nv13 = 0LL;\nv10 = a3 + 1;\nv11 = a3 + 1;\nputs(\"Creating the suffix tree using the PWOTD algorithm\\n\");\nif ( v11 > 0x100000 )\n{\nv13 = 1LL;\nfor ( i = v11 >> 25; i; i >>= 5 )\n++v13;\n}\nif ( a1 >= 0 )\n{\nprintf(\"Abandoning the automatically determined prefix length: %zu\\n\", v13);\nv13 = a1;\n}\nprintf(\"The selected prefix length: %zu\\n\\n\", v13);\nif ( (int)st_slai_allocate(a3, a4) > 0 )\n{\nfwrite(\"Suffix tree allocation error. Exiting.\\n\", 1uLL, 0x27uLL, stderr);\nreturn 1LL;\n}\nif ( (int)pwotd_cdata_allocate(a3, a4 + 5) > 0 )\n{\nfwrite(\"Auxiliary data structures allocation error. Exiting.\\n\", 1uLL, 0x35uLL, stderr);\nreturn 2LL;\n}\npwotd_initialize_suffixes(a4 + 5);\nif ( v13 )\n{\nif ( (int)pwotd_partition_suffixes(v13, a2, a3, a4 + 5) > 0 )\n{\nfwrite(\"Error: Could not perform the partitioning phase! Exiting.\\n\", 1uLL, 0x3AuLL, stderr);\nreturn 3LL;\n}\n}\nelse\n{\nif ( (int)pwotd_cdata_tsuffixes_tmp_reallocate(v10, a3, a4 + 5) > 0 )\n{\nfwrite(\n\"Error: Could not allocate the memory for the temporary table of suffixes! Exiting.\\n\",\n1uLL,\n0x53uLL,\nstderr);\nreturn 4LL;\n}\nif ( (int)pwotd_cdata_partitions_reallocate(1LL, a3, a4 + 5) > 0 )\n{\nfwrite(\"Error: Could not allocate the memory for the table of partitions! Exiting.\\n\", 1uLL, 0x4BuLL, stderr);\nreturn 5LL;\n}\na4[32] = 0LL;\nputs(\"Creating a single partition!\");\npwotd_insert_partition(1LL, v10 + 1, 0LL, a3, a4 + 5);\nputs(\"The partition has been created!\");\n}\nif ( (int)pwotd_cdata_partitions_tbp_reallocate(a4[20], a3, a4 + 5) <= 0 )\n{\nif ( (int)pwotd_cdata_partitions_stack_reallocate(a4[32] << 8, a3, a4 + 5) <= 0 )\n{\nst_slai_process_partitions_range(0LL, a4[20], 0LL, 0LL, a2, a3, a4);\nif ( (int)st_slai_empty_partitions_stack(a2, a3, a4) <= 0 )\n{\nwhile ( a4[23] )\n{\n--a4[23];\nv7 = (_QWORD *)(a4[13] + 24LL * a4[23]);\nst_slai_process_partition(*v7, v7[1], v7[2], a2, a3, a4);\n}\npwotd_print_memory_usage_stats(stdout, a3, a4 + 5);\nv9 = a4[34];\nv8 = a4[33];\nif ( (int)pwotd_cdata_deallocate(a4 + 5) <= 0 )\n{\nputs(\"\\nThe suffix tree has been successfully created.\");\nst_print_stats(a3, 0LL, a4[1], a4[2] - 1LL, 0LL, 0LL, a4[3], 0LL, 0LL, 0LL, 4LL, v9, v8);\nresult = 0LL;\n}\nelse\n{\nfwrite(\"Deallocation error. Exiting.\\n\", 1uLL, 0x1DuLL, stderr);\nresult = 9LL;\n}\n}\nelse\n{\nfwrite(\"Error: Could not successfully empty the partitions stack Exiting.\\n\", 1uLL, 0x42uLL, stderr);\nresult = 8LL;\n}\n}\nelse\n{\nfwrite(\"Error: Could not reallocate the memory for the partitions stack. Exiting.\\n\", 1uLL, 0x4AuLL, stderr);\nresult = 7LL;\n}\n}\nelse\n{\nfwrite(\n\"Error: st_slai_create_pwotd:\\nCould not reallocate the memory\\nfor the table of partitions to be processed.\\n\",\n1uLL,\n0x6AuLL,\nstderr);\nresult = 6LL;\n}\nreturn result;\n}",
"original_code": "int st_slai_create_pwotd (long int desired_prefix_length,\n const character_type *text,\n size_t length,\n suffix_tree_slai *stree) {\n size_t prefix_length = 0;\n size_t text_length = length + 1;\n size_t tmp_text_length = text_length;\n size_t extra_allocated_memory_size = 0;\n size_t extra_used_memory_size = 0;\n partition_process_record_pwotd *ppr = ((void *)0);\n printf(\"Creating the suffix tree using the PWOTD algorithm\\n\\n\");\n if (tmp_text_length > 1048576) {\n prefix_length = 1;\n tmp_text_length = tmp_text_length >> 25;\n while (tmp_text_length > 0) {\n ++prefix_length;\n tmp_text_length = tmp_text_length >> 5;\n }\n }\n if (desired_prefix_length >= 0) {\n printf(\"Abandoning the automatically determined \"\n \"prefix length: %zu\\n\", prefix_length);\n prefix_length = (size_t)(desired_prefix_length);\n }\n printf(\"The selected prefix length: %zu\\n\\n\",\n prefix_length);\n if (st_slai_allocate(length, stree) > 0) {\n fprintf(stderr, \"Suffix tree allocation error. Exiting.\\n\");\n return (1);\n }\n if (pwotd_cdata_allocate(length, &stree->cdata) > 0) {\n fprintf(stderr, \"Auxiliary data structures \"\n \"allocation error. Exiting.\\n\");\n return (2);\n }\n pwotd_initialize_suffixes(&stree->cdata);\n if (prefix_length > 0) {\n if (pwotd_partition_suffixes(prefix_length, text,\n length, &stree->cdata) > 0) {\n fprintf(stderr, \"Error: Could not perform \"\n \"the partitioning phase! Exiting.\\n\");\n return (3);\n }\n } else {\n if (pwotd_cdata_tsuffixes_tmp_reallocate(text_length,\n length, &stree->cdata) > 0) {\n fprintf(stderr, \"Error: Could not allocate \"\n \"the memory for the temporary \"\n \"table of suffixes! Exiting.\\n\");\n return (4);\n }\n if (pwotd_cdata_partitions_reallocate((size_t)(1),\n length, &stree->cdata) > 0) {\n fprintf(stderr, \"Error: Could not allocate \"\n \"the memory for the table \"\n \"of partitions! Exiting.\\n\");\n return (5);\n }\n stree->cdata.prefix_length = 0;\n printf(\"Creating a single partition!\\n\");\n pwotd_insert_partition((size_t)(1), text_length + 1,\n (size_t)(0), length, &stree->cdata);\n printf(\"The partition has been created!\\n\");\n }\n if (pwotd_cdata_partitions_tbp_reallocate(\n stree->cdata.partitions_number,\n length, &stree->cdata) > 0) {\n fprintf(stderr, \"Error: st_slai_create_pwotd:\\n\"\n \"Could not reallocate the memory\\n\"\n \"for the table of partitions \"\n \"to be processed.\\n\");\n return (6);\n }\n if (pwotd_cdata_partitions_stack_reallocate(\n 256 * stree->cdata.prefix_length,\n length, &stree->cdata) > 0) {\n fprintf(stderr, \"Error: Could not reallocate \"\n \"the memory for the partitions \"\n \"stack. Exiting.\\n\");\n return (7);\n }\n st_slai_process_partitions_range((size_t)(0),\n stree->cdata.partitions_number,\n (size_t)(0), (size_t)(0),\n text, length, stree);\n if (st_slai_empty_partitions_stack(text, length, stree) > 0) {\n fprintf(stderr, \"Error: Could not successfully \"\n \"empty the partitions stack \"\n \"Exiting.\\n\");\n return (8);\n }\n while (stree->cdata.partitions_tbp_number > 0) {\n --stree->cdata.partitions_tbp_number;\n ppr = stree->cdata.partitions_tbp +\n stree->cdata.partitions_tbp_number;\n st_slai_process_partition(ppr->index, ppr->tnode_offset,\n ppr->parents_depth, text, length, stree);\n }\n pwotd_print_memory_usage_stats(stdout, length, &stree->cdata);\n extra_allocated_memory_size = stree->cdata.maximum_memory_allocated;\n extra_used_memory_size = stree->cdata.total_memory_allocated;\n if (pwotd_cdata_deallocate(&stree->cdata) > 0) {\n fprintf(stderr, \"Deallocation error. Exiting.\\n\");\n return (9);\n }\n printf(\"\\nThe suffix tree has been successfully created.\\n\");\n st_print_stats(length, (size_t)(0), stree->branching_nodes,\n stree->tnode_top - 1, (size_t)(0), (size_t)(0),\n stree->tnode_size, (size_t)(0), (size_t)(0),\n (size_t)(0), sizeof (unsigned_integral_type),\n extra_allocated_memory_size,\n extra_used_memory_size);\n return (0);\n}",
"canonical_original_code": "int st_slai_create_pwotd(long desired_prefix_length, char *text, unsigned long length, struct suffix_tree_slai_struct *stree) {\n unsigned long prefix_length = 0;\n unsigned long text_length = length + 1;\n unsigned long tmp_text_length = text_length;\n unsigned long extra_allocated_memory_size = 0;\n unsigned long extra_used_memory_size = 0;\n struct partition_process_record_pwotd_struct *ppr = ((void *)0);\n printf(\"Creating the suffix tree using the PWOTD algorithm\\n\\n\");\n if (tmp_text_length > 1048576) {\n prefix_length = 1;\n tmp_text_length = tmp_text_length >> 25;\n while (tmp_text_length > 0) {\n ++prefix_length;\n tmp_text_length = tmp_text_length >> 5;\n }\n }\n if (desired_prefix_length >= 0) {\n printf(\"Abandoning the automatically determined \"\n \"prefix length: %zu\\n\", prefix_length);\n prefix_length = (unsigned long)(desired_prefix_length);\n }\n printf(\"The selected prefix length: %zu\\n\\n\",\n prefix_length);\n if (st_slai_allocate(length, stree) > 0) {\n fprintf(stderr, \"Suffix tree allocation error. Exiting.\\n\");\n return (1);\n }\n if (pwotd_cdata_allocate(length, &stree->cdata) > 0) {\n fprintf(stderr, \"Auxiliary data structures \"\n \"allocation error. Exiting.\\n\");\n return (2);\n }\n pwotd_initialize_suffixes(&stree->cdata);\n if (prefix_length > 0) {\n if (pwotd_partition_suffixes(prefix_length, text,\n length, &stree->cdata) > 0) {\n fprintf(stderr, \"Error: Could not perform \"\n \"the partitioning phase! Exiting.\\n\");\n return (3);\n }\n } else {\n if (pwotd_cdata_tsuffixes_tmp_reallocate(text_length,\n length, &stree->cdata) > 0) {\n fprintf(stderr, \"Error: Could not allocate \"\n \"the memory for the temporary \"\n \"table of suffixes! Exiting.\\n\");\n return (4);\n }\n if (pwotd_cdata_partitions_reallocate((unsigned long)(1),\n length, &stree->cdata) > 0) {\n fprintf(stderr, \"Error: Could not allocate \"\n \"the memory for the table \"\n \"of partitions! Exiting.\\n\");\n return (5);\n }\n stree->cdata.prefix_length = 0;\n printf(\"Creating a single partition!\\n\");\n pwotd_insert_partition((unsigned long)(1), text_length + 1,\n (unsigned long)(0), length, &stree->cdata);\n printf(\"The partition has been created!\\n\");\n }\n if (pwotd_cdata_partitions_tbp_reallocate(\n stree->cdata.partitions_number,\n length, &stree->cdata) > 0) {\n fprintf(stderr, \"Error: st_slai_create_pwotd:\\n\"\n \"Could not reallocate the memory\\n\"\n \"for the table of partitions \"\n \"to be processed.\\n\");\n return (6);\n }\n if (pwotd_cdata_partitions_stack_reallocate(\n 256 * stree->cdata.prefix_length,\n length, &stree->cdata) > 0) {\n fprintf(stderr, \"Error: Could not reallocate \"\n \"the memory for the partitions \"\n \"stack. Exiting.\\n\");\n return (7);\n }\n st_slai_process_partitions_range((unsigned long)(0),\n stree->cdata.partitions_number,\n (unsigned long)(0), (unsigned long)(0),\n text, length, stree);\n if (st_slai_empty_partitions_stack(text, length, stree) > 0) {\n fprintf(stderr, \"Error: Could not successfully \"\n \"empty the partitions stack \"\n \"Exiting.\\n\");\n return (8);\n }\n while (stree->cdata.partitions_tbp_number > 0) {\n --stree->cdata.partitions_tbp_number;\n ppr = stree->cdata.partitions_tbp +\n stree->cdata.partitions_tbp_number;\n st_slai_process_partition(ppr->index, ppr->tnode_offset,\n ppr->parents_depth, text, length, stree);\n }\n pwotd_print_memory_usage_stats(stdout, length, &stree->cdata);\n extra_allocated_memory_size = stree->cdata.maximum_memory_allocated;\n extra_used_memory_size = stree->cdata.total_memory_allocated;\n if (pwotd_cdata_deallocate(&stree->cdata) > 0) {\n fprintf(stderr, \"Deallocation error. Exiting.\\n\");\n return (9);\n }\n printf(\"\\nThe suffix tree has been successfully created.\\n\");\n st_print_stats(length, (unsigned long)(0), stree->branching_nodes,\n stree->tnode_top - 1, (unsigned long)(0), (unsigned long)(0),\n stree->tnode_size, (unsigned long)(0), (unsigned long)(0),\n (unsigned long)(0), sizeof (unsigned_integral_type),\n extra_allocated_memory_size,\n extra_used_memory_size);\n return (0);\n}",
"variable_types": [
[
"desired_prefix_length",
"long"
],
[
"text",
"char *"
],
[
"length",
"unsigned long"
],
[
"stree",
"struct suffix_tree_slai_struct { unsigned int *tnode; unsigned long branching_nodes; unsigned long tnode_top; unsigned long tnode_size; unsigned long tnode_size_increase; struct pwotd_construction_data_struct { unsigned long s_size; unsigned long pr_size; unsigned long ppr_size; unsigned long psr_size; unsigned long sr_size; unsigned int *tsuffixes; unsigned int *tsuffixes_tmp; struct partition_record_pwotd_struct { unsigned long begin_offset; unsigned long end_offset; unsigned long lcp_size; unsigned long text_offset; } *partitions; struct partition_process_record_pwotd_struct { unsigned long index; unsigned long tnode_offset; unsigned long parents_depth; } *partitions_tbp; unsigned int *current_partition; struct partitions_stack_record_pwotd_struct { unsigned long range_begin; unsigned long range_end; unsigned long lcp_size; unsigned long tnode_offset; } *partitions_stack; struct stack_record_pwotd_struct { unsigned long range_begin; unsigned long range_end; unsigned long lcp_size; unsigned long tnode_offset; } *stack; unsigned long tsuffixes_size; unsigned long tsuffixes_tmp_size; unsigned long cp_index; unsigned long partitions_number; unsigned long partitions_size; unsigned long partitions_size_increase; unsigned long partitions_tbp_number; unsigned long partitions_tbp_size; unsigned long partitions_tbp_size_increase; unsigned long partitions_stack_top; unsigned long partitions_stack_size; unsigned long partitions_stack_size_increase; unsigned long stack_top; unsigned long stack_size; unsigned long stack_size_increase; unsigned long prefix_length; unsigned long total_memory_allocated; unsigned long maximum_memory_allocated; } cdata; } *"
],
[
"prefix_length",
"unsigned long"
],
[
"text_length",
"unsigned long"
],
[
"tmp_text_length",
"unsigned long"
],
[
"extra_allocated_memory_size",
"unsigned long"
],
[
"extra_used_memory_size",
"unsigned long"
],
[
"ppr",
"struct partition_process_record_pwotd_struct { unsigned long index; unsigned long tnode_offset; unsigned long parents_depth; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct suffix_tree_slai_struct { unsigned int *tnode; unsigned long branching_nodes; unsigned long tnode_top; unsigned long tnode_size; unsigned long tnode_size_increase; struct pwotd_construction_data_struct cdata; }",
"struct partition_process_record_pwotd_struct { unsigned long index; unsigned long tnode_offset; unsigned long parents_depth; }",
"struct pwotd_construction_data_struct { unsigned long s_size; unsigned long pr_size; unsigned long ppr_size; unsigned long psr_size; unsigned long sr_size; unsigned int *tsuffixes; unsigned int *tsuffixes_tmp; struct partition_record_pwotd_struct *partitions; struct partition_process_record_pwotd_struct *partitions_tbp; unsigned int *current_partition; struct partitions_stack_record_pwotd_struct *partitions_stack; struct stack_record_pwotd_struct *stack; unsigned long tsuffixes_size; unsigned long tsuffixes_tmp_size; unsigned long cp_index; unsigned long partitions_number; unsigned long partitions_size; unsigned long partitions_size_increase; unsigned long partitions_tbp_number; unsigned long partitions_tbp_size; unsigned long partitions_tbp_size_increase; unsigned long partitions_stack_top; unsigned long partitions_stack_size; unsigned long partitions_stack_size_increase; unsigned long stack_top; unsigned long stack_size; unsigned long stack_size_increase; unsigned long prefix_length; unsigned long total_memory_allocated; unsigned long maximum_memory_allocated; }",
"struct partition_record_pwotd_struct { unsigned long begin_offset; unsigned long end_offset; unsigned long lcp_size; unsigned long text_offset; }",
"struct partitions_stack_record_pwotd_struct { unsigned long range_begin; unsigned long range_end; unsigned long lcp_size; unsigned long tnode_offset; }",
"struct stack_record_pwotd_struct { unsigned long range_begin; unsigned long range_end; unsigned long lcp_size; unsigned long tnode_offset; }"
],
"binary_hash": "6d1adfaa13dfef6f43703f4053de46ad464fdbba86a284f1601b0a73c39fe972"
}
] |
f480f28b58af8dbd5f5d1e5b929cc1d96bc698d9a6651242d845f7c906dc23f6 | pbasista/stc | [
[
"hs_update",
"->"
],
[
"hs_deallocate",
"->"
],
[
"er_empty",
"->",
"ht_dump"
],
[
"er_vacant",
"->"
],
[
"ht_dump",
"->",
"er_empty"
],
[
"primary_hf",
"->"
],
[
"secondary_hf",
"->"
],
[
"cuckoo_hf",
"->"
]
] | [
[
"ht_dump",
"__int64 __fastcall func4(FILE *a1, unsigned int a2, __int64 a3)\n{\nunsigned int v5; // [rsp+28h] [rbp-8h]\nunsigned int v6; // [rsp+2Ch] [rbp-4h]\n\nv6 = 0;\nv5 = 0;\nfwrite(\"Dumping the hash table contents.\\n\", 1uLL, 0x21uLL, a1);\nwhile ( v6 < a2 )\n{\nif ( !func2(*(_QWORD *)(8LL * v6 + a3)) )\n{\n++v5;\nfprintf(a1, \"{%u}[%d, %d], \", v6, *(unsigned int *)(8LL * v6 + a3), *(unsigned int *)(8LL * v6 + a3 + 4));\nif ( v5 % 0xA == 9 )\nfputc(10, a1);\n}\n++v6;\n}\nfwrite(\"\\nDump complete.\\n\", 1uLL, 0x10uLL, a1);\nreturn 0LL;\n}"
]
] | [
{
"name": "hs_update",
"canonical_name": "func0",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall hs_update(int a1, _QWORD *a2, __int64 a3)\n{\n__int64 result; // rax\n_QWORD *v4; // rbx\n_QWORD *v5; // rbx\nunsigned int i; // [rsp+2Ch] [rbp-14h]\n\nif ( a3 )\n{\nif ( !*(_DWORD *)a3 )\n*(_DWORD *)a3 = 1;\nif ( *(_DWORD *)a3 == 1 )\n{\nif ( a1 > 1 )\nputs(\"The selected collision resolution technique: Cuckoo hashing\");\nif ( !*(_QWORD *)(a3 + 16) )\n*(_QWORD *)(a3 + 16) = chf_count_default_0;\nif ( *(_QWORD *)(a3 + 16) <= 1uLL )\n{\nfprintf(\nstderr,\n\"Warning: The number of the Cuckoo hash functions\\n\"\n\"needs to be at least 2. The provided value (%zu)\\n\"\n\"will be adjusted to the default value of %zu.\\n\",\n*(_QWORD *)(a3 + 16),\nchf_count_default_0);\n*(_QWORD *)(a3 + 16) = chf_count_default_0;\n}\nfree(*(void **)(a3 + 32));\n*(_QWORD *)(a3 + 32) = calloc(*(_QWORD *)(a3 + 16), 4uLL);\nif ( *(_QWORD *)(a3 + 32) )\n{\n*_errno_location() = 0;\nfree(*(void **)(a3 + 40));\n*(_QWORD *)(a3 + 40) = calloc(*(_QWORD *)(a3 + 16), 4uLL);\nif ( *(_QWORD *)(a3 + 40) )\n{\n*_errno_location() = 0;\nfree(*(void **)(a3 + 48));\n*(_QWORD *)(a3 + 48) = calloc(*(_QWORD *)(a3 + 16), 8uLL);\nif ( *(_QWORD *)(a3 + 48) )\n{\n*_errno_location() = 0;\nfree(*(void **)(a3 + 56));\n*(_QWORD *)(a3 + 56) = calloc(*(_QWORD *)(a3 + 16), 8uLL);\nif ( *(_QWORD *)(a3 + 56) )\n{\n*_errno_location() = 0;\n*(_DWORD *)(a3 + 24) = -5;\n**(_QWORD **)(a3 + 48) = 0LL;\n**(_QWORD **)(a3 + 56) = *a2 / *(_QWORD *)(a3 + 16);\nif ( !**(_QWORD **)(a3 + 56) )\n{\nfprintf(\nstderr,\n\"\\nWarning: The requested size of the hash table (%zu) is too small.\\nIt will now be adjusted.\\n\\n\",\n*a2);\n**(_QWORD **)(a3 + 56) = 1LL;\n}\nv4 = *(_QWORD **)(a3 + 56);\n*v4 = next_prime(*v4);\n*a2 = **(_QWORD **)(a3 + 56);\n**(_DWORD **)(a3 + 32) = (unsigned int)random() % (*(_DWORD *)(a3 + 24) - 1) + 1;\n**(_DWORD **)(a3 + 40) = (unsigned int)random() % *(_DWORD *)(a3 + 24);\nif ( a1 > 1 )\n{\nputs(\"The Cuckoo hash function parameters:\");\nprintf(\n\"0: {a = %u, b = %u, offset = %zu, size = %zu}\\n\",\n**(unsigned int **)(a3 + 32),\n**(unsigned int **)(a3 + 40),\n**(_QWORD **)(a3 + 48),\n**(_QWORD **)(a3 + 56));\n}\nfor ( i = 1; (unsigned __int64)i < *(_QWORD *)(a3 + 16); ++i )\n{\n*(_QWORD *)(*(_QWORD *)(a3 + 48) + 8LL * i) = *(_QWORD *)(*(_QWORD *)(a3 + 48) + 8LL * (i - 1))\n+ *(_QWORD *)(*(_QWORD *)(a3 + 56) + 8LL * (i - 1));\nv5 = (_QWORD *)(*(_QWORD *)(a3 + 56) + 8LL * i);\n*v5 = next_prime(*(_QWORD *)(*(_QWORD *)(a3 + 56) + 8LL * (i - 1)));\n*a2 += *(_QWORD *)(*(_QWORD *)(a3 + 56) + 8LL * i);\n*(_DWORD *)(*(_QWORD *)(a3 + 32) + 4LL * i) = (unsigned int)random() % (*(_DWORD *)(a3 + 24) - 1) + 1;\n*(_DWORD *)(4LL * i + *(_QWORD *)(a3 + 40)) = (unsigned int)random() % *(_DWORD *)(a3 + 24);\nif ( a1 > 1 )\nprintf(\n\"%u: {a = %u, b = %u, offset = %zu, size = %zu}\\n\",\ni,\n*(unsigned int *)(*(_QWORD *)(a3 + 32) + 4LL * i),\n*(unsigned int *)(*(_QWORD *)(a3 + 40) + 4LL * i),\n*(_QWORD *)(*(_QWORD *)(a3 + 48) + 8LL * i),\n*(_QWORD *)(*(_QWORD *)(a3 + 56) + 8LL * i));\n}\n*(_QWORD *)(a3 + 64) = 23LL * *(_QWORD *)(a3 + 16) + 72;\nif ( a1 > 1 )\nprintf(\"The new hash table size: %zu\\n\", *a2);\nresult = 0LL;\n}\nelse\n{\nperror(\"calloc(hs->cp_sizes)\");\n*_errno_location() = 0;\nresult = 5LL;\n}\n}\nelse\n{\nperror(\"calloc(hs->cp_offsets)\");\n*_errno_location() = 0;\nresult = 4LL;\n}\n}\nelse\n{\nperror(\"calloc(hs->chf_bs)\");\n*_errno_location() = 0;\nresult = 3LL;\n}\n}\nelse\n{\nperror(\"calloc(hs->chf_as)\");\n*_errno_location() = 0;\nresult = 2LL;\n}\n}\nelse\n{\nif ( a1 > 1 )\nputs(\"The selected collision resolution technique: double hashing\");\nif ( !*a2 )\n{\nfprintf(\nstderr,\n\"\\nWarning: The requested size of the hash table (%zu) is too small.\\nIt will now be adjusted.\\n\\n\",\n*a2);\n*a2 = 1LL;\n}\n*a2 = (unsigned int)next_prime(*a2);\nif ( a1 > 1 )\nprintf(\"The new hash table size: %zu\\n\", *a2);\n*(_DWORD *)(a3 + 4) = *a2;\n*(_DWORD *)(a3 + 8) = *a2 - 2;\nresult = 0LL;\n}\n}\nelse\n{\nfwrite(\"Error: The provided hash settings pointer is NULL!\\n\", 1uLL, 0x33uLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(int a1, _QWORD *a2, __int64 a3)\n{\n__int64 result; // rax\n_QWORD *v4; // rbx\n_QWORD *v5; // rbx\nunsigned int i; // [rsp+2Ch] [rbp-14h]\n\nif ( a3 )\n{\nif ( !*(_DWORD *)a3 )\n*(_DWORD *)a3 = 1;\nif ( *(_DWORD *)a3 == 1 )\n{\nif ( a1 > 1 )\nputs(\"The selected collision resolution technique: Cuckoo hashing\");\nif ( !*(_QWORD *)(a3 + 16) )\n*(_QWORD *)(a3 + 16) = chf_count_default_0;\nif ( *(_QWORD *)(a3 + 16) <= 1uLL )\n{\nfprintf(\nstderr,\n\"Warning: The number of the Cuckoo hash functions\\n\"\n\"needs to be at least 2. The provided value (%zu)\\n\"\n\"will be adjusted to the default value of %zu.\\n\",\n*(_QWORD *)(a3 + 16),\nchf_count_default_0);\n*(_QWORD *)(a3 + 16) = chf_count_default_0;\n}\nfree(*(void **)(a3 + 32));\n*(_QWORD *)(a3 + 32) = calloc(*(_QWORD *)(a3 + 16), 4uLL);\nif ( *(_QWORD *)(a3 + 32) )\n{\n*_errno_location() = 0;\nfree(*(void **)(a3 + 40));\n*(_QWORD *)(a3 + 40) = calloc(*(_QWORD *)(a3 + 16), 4uLL);\nif ( *(_QWORD *)(a3 + 40) )\n{\n*_errno_location() = 0;\nfree(*(void **)(a3 + 48));\n*(_QWORD *)(a3 + 48) = calloc(*(_QWORD *)(a3 + 16), 8uLL);\nif ( *(_QWORD *)(a3 + 48) )\n{\n*_errno_location() = 0;\nfree(*(void **)(a3 + 56));\n*(_QWORD *)(a3 + 56) = calloc(*(_QWORD *)(a3 + 16), 8uLL);\nif ( *(_QWORD *)(a3 + 56) )\n{\n*_errno_location() = 0;\n*(_DWORD *)(a3 + 24) = -5;\n**(_QWORD **)(a3 + 48) = 0LL;\n**(_QWORD **)(a3 + 56) = *a2 / *(_QWORD *)(a3 + 16);\nif ( !**(_QWORD **)(a3 + 56) )\n{\nfprintf(\nstderr,\n\"\\nWarning: The requested size of the hash table (%zu) is too small.\\nIt will now be adjusted.\\n\\n\",\n*a2);\n**(_QWORD **)(a3 + 56) = 1LL;\n}\nv4 = *(_QWORD **)(a3 + 56);\n*v4 = next_prime(*v4);\n*a2 = **(_QWORD **)(a3 + 56);\n**(_DWORD **)(a3 + 32) = (unsigned int)random() % (*(_DWORD *)(a3 + 24) - 1) + 1;\n**(_DWORD **)(a3 + 40) = (unsigned int)random() % *(_DWORD *)(a3 + 24);\nif ( a1 > 1 )\n{\nputs(\"The Cuckoo hash function parameters:\");\nprintf(\n\"0: {a = %u, b = %u, offset = %zu, size = %zu}\\n\",\n**(unsigned int **)(a3 + 32),\n**(unsigned int **)(a3 + 40),\n**(_QWORD **)(a3 + 48),\n**(_QWORD **)(a3 + 56));\n}\nfor ( i = 1; (unsigned __int64)i < *(_QWORD *)(a3 + 16); ++i )\n{\n*(_QWORD *)(*(_QWORD *)(a3 + 48) + 8LL * i) = *(_QWORD *)(*(_QWORD *)(a3 + 48) + 8LL * (i - 1))\n+ *(_QWORD *)(*(_QWORD *)(a3 + 56) + 8LL * (i - 1));\nv5 = (_QWORD *)(*(_QWORD *)(a3 + 56) + 8LL * i);\n*v5 = next_prime(*(_QWORD *)(*(_QWORD *)(a3 + 56) + 8LL * (i - 1)));\n*a2 += *(_QWORD *)(*(_QWORD *)(a3 + 56) + 8LL * i);\n*(_DWORD *)(*(_QWORD *)(a3 + 32) + 4LL * i) = (unsigned int)random() % (*(_DWORD *)(a3 + 24) - 1) + 1;\n*(_DWORD *)(4LL * i + *(_QWORD *)(a3 + 40)) = (unsigned int)random() % *(_DWORD *)(a3 + 24);\nif ( a1 > 1 )\nprintf(\n\"%u: {a = %u, b = %u, offset = %zu, size = %zu}\\n\",\ni,\n*(unsigned int *)(*(_QWORD *)(a3 + 32) + 4LL * i),\n*(unsigned int *)(*(_QWORD *)(a3 + 40) + 4LL * i),\n*(_QWORD *)(*(_QWORD *)(a3 + 48) + 8LL * i),\n*(_QWORD *)(*(_QWORD *)(a3 + 56) + 8LL * i));\n}\n*(_QWORD *)(a3 + 64) = 23LL * *(_QWORD *)(a3 + 16) + 72;\nif ( a1 > 1 )\nprintf(\"The new hash table size: %zu\\n\", *a2);\nresult = 0LL;\n}\nelse\n{\nperror(\"calloc(hs->cp_sizes)\");\n*_errno_location() = 0;\nresult = 5LL;\n}\n}\nelse\n{\nperror(\"calloc(hs->cp_offsets)\");\n*_errno_location() = 0;\nresult = 4LL;\n}\n}\nelse\n{\nperror(\"calloc(hs->chf_bs)\");\n*_errno_location() = 0;\nresult = 3LL;\n}\n}\nelse\n{\nperror(\"calloc(hs->chf_as)\");\n*_errno_location() = 0;\nresult = 2LL;\n}\n}\nelse\n{\nif ( a1 > 1 )\nputs(\"The selected collision resolution technique: double hashing\");\nif ( !*a2 )\n{\nfprintf(\nstderr,\n\"\\nWarning: The requested size of the hash table (%zu) is too small.\\nIt will now be adjusted.\\n\\n\",\n*a2);\n*a2 = 1LL;\n}\n*a2 = (unsigned int)next_prime(*a2);\nif ( a1 > 1 )\nprintf(\"The new hash table size: %zu\\n\", *a2);\n*(_DWORD *)(a3 + 4) = *a2;\n*(_DWORD *)(a3 + 8) = *a2 - 2;\nresult = 0LL;\n}\n}\nelse\n{\nfwrite(\"Error: The provided hash settings pointer is NULL!\\n\", 1uLL, 0x33uLL, stderr);\nresult = 1LL;\n}\nreturn result;\n}",
"original_code": "int hs_update (const int verbosity_level,\n size_t *new_size,\n hash_settings *hs) {\n static const size_t chf_count_default = 8;\n unsigned_integral_type i = 0;\n if (hs == ((void *)0)) {\n fprintf(stderr, \"Error: The provided hash settings \"\n \"pointer is NULL!\\n\");\n return (1);\n }\n if (hs->crt_type == 0) {\n hs->crt_type = 1;\n }\n if (hs->crt_type == 1) {\n if (verbosity_level > 1) {\n printf(\"The selected collision resolution technique: \"\n \"Cuckoo hashing\\n\");\n }\n if (hs->chf_number == 0) {\n hs->chf_number = chf_count_default;\n }\n if (hs->chf_number < 2) {\n fprintf(stderr, \"Warning: The number of the \"\n \"Cuckoo hash functions\\n\"\n \"needs to be at least 2. \"\n \"The provided value (%zu)\\n\"\n \"will be adjusted to the \"\n \"default value of %zu.\\n\",\n hs->chf_number, chf_count_default);\n hs->chf_number = chf_count_default;\n }\n free(hs->chf_as);\n hs->chf_as = calloc(hs->chf_number,\n sizeof (unsigned_integral_type));\n if (hs->chf_as == ((void *)0)) {\n perror(\"calloc(hs->chf_as)\");\n (*__errno_location ()) = 0;\n return (2);\n } else {\n (*__errno_location ()) = 0;\n }\n free(hs->chf_bs);\n hs->chf_bs = calloc(hs->chf_number,\n sizeof (unsigned_integral_type));\n if (hs->chf_bs == ((void *)0)) {\n perror(\"calloc(hs->chf_bs)\");\n (*__errno_location ()) = 0;\n return (3);\n } else {\n (*__errno_location ()) = 0;\n }\n free(hs->cp_offsets);\n hs->cp_offsets = calloc(hs->chf_number,\n sizeof (size_t));\n if (hs->cp_offsets == ((void *)0)) {\n perror(\"calloc(hs->cp_offsets)\");\n (*__errno_location ()) = 0;\n return (4);\n } else {\n (*__errno_location ()) = 0;\n }\n free(hs->cp_sizes);\n hs->cp_sizes = calloc(hs->chf_number,\n sizeof (size_t));\n if (hs->cp_sizes == ((void *)0)) {\n perror(\"calloc(hs->cp_sizes)\");\n (*__errno_location ()) = 0;\n return (5);\n } else {\n (*__errno_location ()) = 0;\n }\n hs->npu_size = 4294967291;\n hs->cp_offsets[0] = 0;\n hs->cp_sizes[0] = (*new_size) / hs->chf_number;\n if (hs->cp_sizes[0] == 0) {\n fprintf(stderr, \"\\nWarning: The requested size of \"\n \"the hash table (%zu) is too small.\"\n \"\\nIt will now be adjusted.\\n\\n\",\n (*new_size));\n hs->cp_sizes[0] = 1;\n }\n hs->cp_sizes[0] = (size_t)\n (next_prime((ull)(hs->cp_sizes[0])));\n (*new_size) = hs->cp_sizes[0];\n hs->chf_as[0] = (unsigned_integral_type)(random()) %\n (hs->npu_size - 1) + 1;\n hs->chf_bs[0] = (unsigned_integral_type)(random()) %\n hs->npu_size;\n if (verbosity_level > 1) {\n printf(\"The Cuckoo hash function parameters:\\n\");\n printf(\"0: {a = %u, b = %u, offset = %zu, \"\n \"size = %zu}\\n\", hs->chf_as[0],\n hs->chf_bs[0], hs->cp_offsets[0],\n hs->cp_sizes[0]);\n }\n for (i = 1; i < hs->chf_number; ++i) {\n hs->cp_offsets[i] = hs->cp_offsets[i - 1]\n + hs->cp_sizes[i - 1];\n hs->cp_sizes[i] = (size_t)(\n next_prime((ull)(hs->\n cp_sizes[i - 1])));\n (*new_size) += hs->cp_sizes[i];\n hs->chf_as[i] = (unsigned_integral_type)(random()) %\n (hs->npu_size - 1) + 1;\n hs->chf_bs[i] = (unsigned_integral_type)(random()) %\n hs->npu_size;\n if (verbosity_level > 1) {\n printf(\"%u: {a = %u, b = %u, offset = %zu, \"\n \"size = %zu}\\n\", i,\n hs->chf_as[i], hs->chf_bs[i],\n hs->cp_offsets[i],\n hs->cp_sizes[i]);\n }\n }\n hs->allocated_size = sizeof (hash_settings) +\n (sizeof (unsigned_integral_type) * 2 +\n sizeof (size_t) * 2 - 1) * hs->chf_number;\n if (verbosity_level > 1) {\n printf(\"The new hash table size: %zu\\n\", (*new_size));\n }\n return (0);\n } else {\n if (verbosity_level > 1) {\n printf(\"The selected collision resolution technique: \"\n \"double hashing\\n\");\n }\n if ((*new_size) == 0) {\n fprintf(stderr, \"\\nWarning: The requested size of \"\n \"the hash table (%zu) is too small.\"\n \"\\nIt will now be adjusted.\\n\\n\",\n (*new_size));\n (*new_size) = 1;\n }\n (*new_size) = (unsigned_integral_type)(next_prime((ull)\n (*new_size)));\n if (verbosity_level > 1) {\n printf(\"The new hash table size: %zu\\n\", (*new_size));\n }\n hs->phf_max = (unsigned_integral_type)(*new_size);\n hs->shf_max = (unsigned_integral_type)((*new_size) - 2);\n return (0);\n }\n}",
"canonical_original_code": "int hs_update(int verbosity_level, unsigned long *new_size, struct hash_settings_struct *hs) {\n static unsigned long chf_count_default = 8;\n unsigned int i = 0;\n if (hs == ((void *)0)) {\n fprintf(stderr, \"Error: The provided hash settings \"\n \"pointer is NULL!\\n\");\n return (1);\n }\n if (hs->crt_type == 0) {\n hs->crt_type = 1;\n }\n if (hs->crt_type == 1) {\n if (verbosity_level > 1) {\n printf(\"The selected collision resolution technique: \"\n \"Cuckoo hashing\\n\");\n }\n if (hs->chf_number == 0) {\n hs->chf_number = chf_count_default;\n }\n if (hs->chf_number < 2) {\n fprintf(stderr, \"Warning: The number of the \"\n \"Cuckoo hash functions\\n\"\n \"needs to be at least 2. \"\n \"The provided value (%zu)\\n\"\n \"will be adjusted to the \"\n \"default value of %zu.\\n\",\n hs->chf_number, chf_count_default);\n hs->chf_number = chf_count_default;\n }\n free(hs->chf_as);\n hs->chf_as = calloc(hs->chf_number,\n sizeof (unsigned_integral_type));\n if (hs->chf_as == ((void *)0)) {\n perror(\"calloc(hs->chf_as)\");\n (*__errno_location ()) = 0;\n return (2);\n } else {\n (*__errno_location ()) = 0;\n }\n free(hs->chf_bs);\n hs->chf_bs = calloc(hs->chf_number,\n sizeof (unsigned_integral_type));\n if (hs->chf_bs == ((void *)0)) {\n perror(\"calloc(hs->chf_bs)\");\n (*__errno_location ()) = 0;\n return (3);\n } else {\n (*__errno_location ()) = 0;\n }\n free(hs->cp_offsets);\n hs->cp_offsets = calloc(hs->chf_number,\n sizeof (unsigned long));\n if (hs->cp_offsets == ((void *)0)) {\n perror(\"calloc(hs->cp_offsets)\");\n (*__errno_location ()) = 0;\n return (4);\n } else {\n (*__errno_location ()) = 0;\n }\n free(hs->cp_sizes);\n hs->cp_sizes = calloc(hs->chf_number,\n sizeof (unsigned long));\n if (hs->cp_sizes == ((void *)0)) {\n perror(\"calloc(hs->cp_sizes)\");\n (*__errno_location ()) = 0;\n return (5);\n } else {\n (*__errno_location ()) = 0;\n }\n hs->npu_size = 4294967291;\n hs->cp_offsets[0] = 0;\n hs->cp_sizes[0] = (*new_size) / hs->chf_number;\n if (hs->cp_sizes[0] == 0) {\n fprintf(stderr, \"\\nWarning: The requested size of \"\n \"the hash table (%zu) is too small.\"\n \"\\nIt will now be adjusted.\\n\\n\",\n (*new_size));\n hs->cp_sizes[0] = 1;\n }\n hs->cp_sizes[0] = (unsigned long)\n (next_prime((ull)(hs->cp_sizes[0])));\n (*new_size) = hs->cp_sizes[0];\n hs->chf_as[0] = (unsigned_integral_type)(random()) %\n (hs->npu_size - 1) + 1;\n hs->chf_bs[0] = (unsigned_integral_type)(random()) %\n hs->npu_size;\n if (verbosity_level > 1) {\n printf(\"The Cuckoo hash function parameters:\\n\");\n printf(\"0: {a = %u, b = %u, offset = %zu, \"\n \"size = %zu}\\n\", hs->chf_as[0],\n hs->chf_bs[0], hs->cp_offsets[0],\n hs->cp_sizes[0]);\n }\n for (i = 1; i < hs->chf_number; ++i) {\n hs->cp_offsets[i] = hs->cp_offsets[i - 1]\n + hs->cp_sizes[i - 1];\n hs->cp_sizes[i] = (unsigned long)(\n next_prime((ull)(hs->\n cp_sizes[i - 1])));\n (*new_size) += hs->cp_sizes[i];\n hs->chf_as[i] = (unsigned_integral_type)(random()) %\n (hs->npu_size - 1) + 1;\n hs->chf_bs[i] = (unsigned_integral_type)(random()) %\n hs->npu_size;\n if (verbosity_level > 1) {\n printf(\"%u: {a = %u, b = %u, offset = %zu, \"\n \"size = %zu}\\n\", i,\n hs->chf_as[i], hs->chf_bs[i],\n hs->cp_offsets[i],\n hs->cp_sizes[i]);\n }\n }\n hs->allocated_size = sizeof (hash_settings) +\n (sizeof (unsigned_integral_type) * 2 +\n sizeof (unsigned long) * 2 - 1) * hs->chf_number;\n if (verbosity_level > 1) {\n printf(\"The new hash table size: %zu\\n\", (*new_size));\n }\n return (0);\n } else {\n if (verbosity_level > 1) {\n printf(\"The selected collision resolution technique: \"\n \"double hashing\\n\");\n }\n if ((*new_size) == 0) {\n fprintf(stderr, \"\\nWarning: The requested size of \"\n \"the hash table (%zu) is too small.\"\n \"\\nIt will now be adjusted.\\n\\n\",\n (*new_size));\n (*new_size) = 1;\n }\n (*new_size) = (unsigned_integral_type)(next_prime((ull)\n (*new_size)));\n if (verbosity_level > 1) {\n printf(\"The new hash table size: %zu\\n\", (*new_size));\n }\n hs->phf_max = (unsigned_integral_type)(*new_size);\n hs->shf_max = (unsigned_integral_type)((*new_size) - 2);\n return (0);\n }\n}",
"variable_types": [
[
"verbosity_level",
"int"
],
[
"new_size",
"unsigned long *"
],
[
"hs",
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; } *"
],
[
"chf_count_default",
"unsigned long"
],
[
"i",
"unsigned int"
]
],
"return_type": "int",
"user_defined_types": [
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; }"
],
"binary_hash": "f480f28b58af8dbd5f5d1e5b929cc1d96bc698d9a6651242d845f7c906dc23f6"
},
{
"name": "hs_deallocate",
"canonical_name": "func1",
"repo": "pbasista/stc",
"decompiled_code": "__int64 __fastcall hs_deallocate(void **a1)\n{\nif ( !a1 )\nreturn 0xFFFFFFFFLL;\nfree(a1[4]);\na1[4] = 0LL;\nfree(a1[5]);\na1[5] = 0LL;\nfree(a1[6]);\na1[6] = 0LL;\nfree(a1[7]);\na1[7] = 0LL;\nfree(a1);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(void **a1)\n{\nif ( !a1 )\nreturn 0xFFFFFFFFLL;\nfree(a1[4]);\na1[4] = 0LL;\nfree(a1[5]);\na1[5] = 0LL;\nfree(a1[6]);\na1[6] = 0LL;\nfree(a1[7]);\na1[7] = 0LL;\nfree(a1);\nreturn 0LL;\n}",
"original_code": "int hs_deallocate (hash_settings *hs) {\n if (hs == ((void *)0)) {\n return (-1);\n } else {\n free(hs->chf_as);\n hs->chf_as = ((void *)0);\n free(hs->chf_bs);\n hs->chf_bs = ((void *)0);\n free(hs->cp_offsets);\n hs->cp_offsets = ((void *)0);\n free(hs->cp_sizes);\n hs->cp_sizes = ((void *)0);\n free(hs);\n hs = ((void *)0);\n return (0);\n }\n}",
"canonical_original_code": "int hs_deallocate(struct hash_settings_struct *hs) {\n if (hs == ((void *)0)) {\n return (-1);\n } else {\n free(hs->chf_as);\n hs->chf_as = ((void *)0);\n free(hs->chf_bs);\n hs->chf_bs = ((void *)0);\n free(hs->cp_offsets);\n hs->cp_offsets = ((void *)0);\n free(hs->cp_sizes);\n hs->cp_sizes = ((void *)0);\n free(hs);\n hs = ((void *)0);\n return (0);\n }\n}",
"variable_types": [
[
"hs",
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; }"
],
"binary_hash": "f480f28b58af8dbd5f5d1e5b929cc1d96bc698d9a6651242d845f7c906dc23f6"
},
{
"name": "er_empty",
"canonical_name": "func2",
"repo": "pbasista/stc",
"decompiled_code": "_BOOL8 __fastcall er_empty(__int64 a1)\n{\nreturn a1 == 0;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func2(__int64 a1)\n{\nreturn a1 == 0;\n}",
"original_code": "int er_empty (const edge_record er) {\n if ((er.source_node == 0) && (er.target_node == 0)) {\n return (1);\n } else {\n return (0);\n }\n}",
"canonical_original_code": "int er_empty(struct edge_record_struct er) {\n if ((er.source_node == 0) && (er.target_node == 0)) {\n return (1);\n } else {\n return (0);\n }\n}",
"variable_types": [
[
"er",
"struct edge_record_struct { int source_node; int target_node; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct edge_record_struct { int source_node; int target_node; }"
],
"binary_hash": "f480f28b58af8dbd5f5d1e5b929cc1d96bc698d9a6651242d845f7c906dc23f6"
},
{
"name": "er_vacant",
"canonical_name": "func3",
"repo": "pbasista/stc",
"decompiled_code": "_BOOL8 __fastcall er_vacant(int a1)\n{\nreturn a1 == 0;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func3(int a1)\n{\nreturn a1 == 0;\n}",
"original_code": "int er_vacant (const edge_record er) {\n if (er.source_node == 0) {\n return (1);\n } else {\n return (0);\n }\n}",
"canonical_original_code": "int er_vacant(struct edge_record_struct er) {\n if (er.source_node == 0) {\n return (1);\n } else {\n return (0);\n }\n}",
"variable_types": [
[
"er",
"struct edge_record_struct { int source_node; int target_node; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct edge_record_struct { int source_node; int target_node; }"
],
"binary_hash": "f480f28b58af8dbd5f5d1e5b929cc1d96bc698d9a6651242d845f7c906dc23f6"
},
{
"name": "primary_hf",
"canonical_name": "func5",
"repo": "pbasista/stc",
"decompiled_code": "unsigned __int64 __fastcall primary_hf(int a1, char a2, __int64 a3)\n{\nreturn (a1 ^ (unsigned __int64)((__int64)a2 << 32)) % *(unsigned int *)(a3 + 4);\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func5(int a1, char a2, __int64 a3)\n{\nreturn (a1 ^ (unsigned __int64)((__int64)a2 << 32)) % *(unsigned int *)(a3 + 4);\n}",
"original_code": "size_t primary_hf (signed_integral_type source_node,\n character_type letter,\n const hash_settings *hs) {\n unsigned long long key =\n (unsigned long long)(source_node) ^\n ((unsigned long long)(letter) << 32);\n return ((size_t)(key % hs->phf_max));\n}",
"canonical_original_code": "unsigned long primary_hf(int source_node, char letter, struct hash_settings_struct *hs) {\n unsigned long long key = (unsigned long long)(source_node) ^\n ((unsigned long long)(letter) << 32);\n return ((unsigned long)(key % hs->phf_max));\n}",
"variable_types": [
[
"source_node",
"int"
],
[
"letter",
"char"
],
[
"hs",
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; } *"
],
[
"key",
"unsigned long long"
]
],
"return_type": "unsigned long",
"user_defined_types": [
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; }"
],
"binary_hash": "f480f28b58af8dbd5f5d1e5b929cc1d96bc698d9a6651242d845f7c906dc23f6"
},
{
"name": "secondary_hf",
"canonical_name": "func6",
"repo": "pbasista/stc",
"decompiled_code": "unsigned __int64 __fastcall secondary_hf(int a1, char a2, __int64 a3)\n{\nreturn (a1 ^ (unsigned __int64)((__int64)a2 << 32)) % *(unsigned int *)(a3 + 8) + 1;\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func6(int a1, char a2, __int64 a3)\n{\nreturn (a1 ^ (unsigned __int64)((__int64)a2 << 32)) % *(unsigned int *)(a3 + 8) + 1;\n}",
"original_code": "size_t secondary_hf (signed_integral_type source_node,\n character_type letter,\n const hash_settings *hs) {\n unsigned long long key =\n (unsigned long long)(source_node) ^\n ((unsigned long long)(letter) << 32);\n return ((size_t)(key % hs->shf_max + 1));\n}",
"canonical_original_code": "unsigned long secondary_hf(int source_node, char letter, struct hash_settings_struct *hs) {\n unsigned long long key = (unsigned long long)(source_node) ^\n ((unsigned long long)(letter) << 32);\n return ((unsigned long)(key % hs->shf_max + 1));\n}",
"variable_types": [
[
"source_node",
"int"
],
[
"letter",
"char"
],
[
"hs",
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; } *"
],
[
"key",
"unsigned long long"
]
],
"return_type": "unsigned long",
"user_defined_types": [
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; }"
],
"binary_hash": "f480f28b58af8dbd5f5d1e5b929cc1d96bc698d9a6651242d845f7c906dc23f6"
},
{
"name": "cuckoo_hf",
"canonical_name": "func7",
"repo": "pbasista/stc",
"decompiled_code": "unsigned __int64 __fastcall cuckoo_hf(__int64 a1, int a2, char a3, __int64 a4)\n{\nreturn (*(unsigned int *)(*(_QWORD *)(a4 + 40) + 4 * a1)\n+ (a2 ^ (unsigned __int64)((__int64)a3 << 32)) * *(unsigned int *)(*(_QWORD *)(a4 + 32) + 4 * a1))\n% *(unsigned int *)(a4 + 24)\n% *(_QWORD *)(*(_QWORD *)(a4 + 56) + 8 * a1)\n+ *(_QWORD *)(*(_QWORD *)(a4 + 48) + 8 * a1);\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func7(__int64 a1, int a2, char a3, __int64 a4)\n{\nreturn (*(unsigned int *)(*(_QWORD *)(a4 + 40) + 4 * a1)\n+ (a2 ^ (unsigned __int64)((__int64)a3 << 32)) * *(unsigned int *)(*(_QWORD *)(a4 + 32) + 4 * a1))\n% *(unsigned int *)(a4 + 24)\n% *(_QWORD *)(*(_QWORD *)(a4 + 56) + 8 * a1)\n+ *(_QWORD *)(*(_QWORD *)(a4 + 48) + 8 * a1);\n}",
"original_code": "size_t cuckoo_hf (size_t index,\n signed_integral_type source_node,\n character_type letter,\n const hash_settings *hs) {\n unsigned long long key =\n (unsigned long long)(source_node) ^\n ((unsigned long long)(letter) << 32);\n return (size_t)(((\n (unsigned long long)(hs->chf_as[index]) *\n key +\n (unsigned long long)(hs->chf_bs[index])) %\n (unsigned long long)(hs->npu_size)) %\n (unsigned long long)(hs->cp_sizes[index]) +\n (unsigned long long)(hs->cp_offsets[index]));\n}",
"canonical_original_code": "unsigned long cuckoo_hf(unsigned long index, int source_node, char letter, struct hash_settings_struct *hs) {\n unsigned long long key = (unsigned long long)(source_node) ^\n ((unsigned long long)(letter) << 32);\n return (unsigned long)(((\n (unsigned long long)(hs->chf_as[index]) *\n key +\n (unsigned long long)(hs->chf_bs[index])) %\n (unsigned long long)(hs->npu_size)) %\n (unsigned long long)(hs->cp_sizes[index]) +\n (unsigned long long)(hs->cp_offsets[index]));\n}",
"variable_types": [
[
"index",
"unsigned long"
],
[
"source_node",
"int"
],
[
"letter",
"char"
],
[
"hs",
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; } *"
],
[
"key",
"unsigned long long"
]
],
"return_type": "unsigned long",
"user_defined_types": [
"struct hash_settings_struct { int crt_type; unsigned int phf_max; unsigned int shf_max; unsigned long chf_number; unsigned int npu_size; unsigned int *chf_as; unsigned int *chf_bs; unsigned long *cp_offsets; unsigned long *cp_sizes; unsigned long allocated_size; }"
],
"binary_hash": "f480f28b58af8dbd5f5d1e5b929cc1d96bc698d9a6651242d845f7c906dc23f6"
}
] |
1d73e1c99a98b329edea99d9c2a500fd91df0606314d609ab9f3fe7f23f35b34 | kernfel/fNEAT | [
[
"extract_links",
"->",
"build_tree",
"extract_tree",
"delete_tree"
],
[
"build_tree",
"->",
"extract_links",
"get_binleaf_variance"
],
[
"extract_tree",
"->",
"extract_links",
"get_binleaf_variance",
"get_activation_at"
],
[
"get_activation_at",
"->",
"extract_tree"
],
[
"get_binleaf_variance",
"->",
"build_tree",
"extract_tree"
],
[
"delete_tree",
"->",
"extract_links"
]
] | [] | [
{
"name": "extract_links",
"canonical_name": "func0",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall extract_links(_QWORD *a1)\n{\n__int64 v2[5]; // [rsp+10h] [rbp-30h] BYREF\nunsigned int v3; // [rsp+3Ch] [rbp-4h]\n\nv3 = 0;\nv2[0] = 0LL;\nv2[1] = 0LL;\nv2[2] = 0LL;\nv2[3] = 0LL;\nv2[4] = 0LL;\n*a1 = v2;\nv3 = build_tree(v2, a1);\nif ( !v3 )\nv3 = extract_tree(v2, a1);\ndelete_tree(v2);\n*a1 = 0LL;\nreturn v3;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(_QWORD *a1)\n{\n__int64 v2[5]; // [rsp+10h] [rbp-30h] BYREF\nunsigned int v3; // [rsp+3Ch] [rbp-4h]\n\nv3 = 0;\nv2[0] = 0LL;\nv2[1] = 0LL;\nv2[2] = 0LL;\nv2[3] = 0LL;\nv2[4] = 0LL;\n*a1 = v2;\nv3 = func1(v2, a1);\nif ( !v3 )\nv3 = func2(v2, a1);\nfunc5(v2);\n*a1 = 0LL;\nreturn v3;\n}",
"original_code": "int extract_links( struct Extraction_Params *eparams ) {\n int err=0;\n BinLeaf root = {0};\n eparams->root = &root;\n if (( err = build_tree( &root, eparams ) )) {\n goto cleanup;\n }\n if (( err = extract_tree( &root, eparams ) )) {\n goto cleanup;\n }\ncleanup:\n delete_tree( &root );\n eparams->root = 0;\n return err;\n}",
"canonical_original_code": "int extract_links(struct Extraction_Params *eparams) {\n int err = 0;\n struct BinLeaf root = {0};\n eparams->root = &root;\n if (( err = build_tree( &root, eparams ) )) {\n goto cleanup;\n }\n if (( err = extract_tree( &root, eparams ) )) {\n goto cleanup;\n }\ncleanup:\n delete_tree( &root );\n eparams->root = 0;\n return err;\n}",
"variable_types": [
[
"eparams",
"struct Extraction_Params { struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; } *root; double ref[2]; unsigned char outgoing; unsigned char create_nodes; struct CPPN { struct CPPN_Node { enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } func; double activation; } *nodes; int num_inputs; struct CPPN_Link { unsigned int innov_id; int from; double weight; int is_disabled; } *links; int num_links; } *cppn; struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; } *params; struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *net; } *"
],
[
"err",
"int"
],
[
"root",
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; }",
"struct Extraction_Params { struct BinLeaf *root; double ref[2]; unsigned char outgoing; unsigned char create_nodes; struct CPPN *cppn; struct NEAT_Params *params; struct pNetwork *net; }",
"struct CPPN { struct CPPN_Node *nodes; int num_inputs; struct CPPN_Link *links; int num_links; }",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; }",
"struct pNetwork { unsigned int num_nodes; struct pNode **p_nodes; int num_inputs; unsigned int num_links; struct pLink **p_links; }",
"struct CPPN_Node { enum CPPNFunc func; double activation; }",
"struct CPPN_Link { unsigned int innov_id; int from; double weight; int is_disabled; }",
"enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 }",
"struct pNode { double x[2]; unsigned char used; unsigned int index; }",
"struct pLink { struct pNode *from; double r[1]; unsigned char used; }"
],
"binary_hash": "1d73e1c99a98b329edea99d9c2a500fd91df0606314d609ab9f3fe7f23f35b34"
},
{
"name": "build_tree",
"canonical_name": "func1",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall build_tree(__int64 a1, __int64 a2)\n{\ndouble v3; // xmm0_8\ndouble v4; // [rsp+18h] [rbp-18h]\nunsigned int v5; // [rsp+24h] [rbp-Ch]\nunsigned int v6; // [rsp+24h] [rbp-Ch]\nint j; // [rsp+28h] [rbp-8h]\nint i; // [rsp+2Ch] [rbp-4h]\nint k; // [rsp+2Ch] [rbp-4h]\n\nv5 = Malloc_(a1, 160LL);\nif ( v5 )\nreturn v5;\nv4 = 1.0 / (double)(1 << (*(_BYTE *)(a1 + 32) + 2));\nfor ( i = 0; i < 4; ++i )\n{\n*(_QWORD *)(*(_QWORD *)a1 + 40LL * i) = 0LL;\n*(_DWORD *)(*(_QWORD *)a1 + 40LL * i + 32) = *(_DWORD *)(a1 + 32) + 1;\nfor ( j = 0; j <= 1; ++j )\n{\nif ( ((i >> j) & 1) != 0 )\nv3 = -1.0;\nelse\nv3 = 1.0;\n*(double *)(*(_QWORD *)a1 + 40LL * i + 8 * (j + 2LL)) = v3 * v4 + *(double *)(a1 + 8 * (j + 2LL));\n}\nif ( *(_BYTE *)(a2 + 24) )\nread_CPPN(\n*(_QWORD *)(a2 + 32),\n*(_QWORD *)(a2 + 40),\na2 + 8,\n*(_QWORD *)a1 + 40LL * i + 16,\n*(_QWORD *)a1 + 40LL * i + 8);\nelse\nread_CPPN(\n*(_QWORD *)(a2 + 32),\n*(_QWORD *)(a2 + 40),\n*(_QWORD *)a1 + 40LL * i + 16,\na2 + 8,\n*(_QWORD *)a1 + 40LL * i + 8);\n}\nif ( *(_DWORD *)(a1 + 32) < *(_DWORD *)(*(_QWORD *)(a2 + 40) + 4LL) - 1\n|| *(_DWORD *)(a1 + 32) < *(_DWORD *)(*(_QWORD *)(a2 + 40) + 8LL) - 1\n&& get_binleaf_variance(a1, *(_QWORD *)(a2 + 40)) > *(double *)(*(_QWORD *)(a2 + 40) + 16LL) )\n{\nfor ( k = 0; k < 4; ++k )\n{\nv6 = build_tree(*(_QWORD *)a1 + 40LL * k, a2);\nif ( v6 )\nreturn v6;\n}\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1, __int64 a2)\n{\ndouble v3; // xmm0_8\ndouble v4; // [rsp+18h] [rbp-18h]\nunsigned int v5; // [rsp+24h] [rbp-Ch]\nunsigned int v6; // [rsp+24h] [rbp-Ch]\nint j; // [rsp+28h] [rbp-8h]\nint i; // [rsp+2Ch] [rbp-4h]\nint k; // [rsp+2Ch] [rbp-4h]\n\nv5 = Malloc_(a1, 160LL);\nif ( v5 )\nreturn v5;\nv4 = 1.0 / (double)(1 << (*(_BYTE *)(a1 + 32) + 2));\nfor ( i = 0; i < 4; ++i )\n{\n*(_QWORD *)(*(_QWORD *)a1 + 40LL * i) = 0LL;\n*(_DWORD *)(*(_QWORD *)a1 + 40LL * i + 32) = *(_DWORD *)(a1 + 32) + 1;\nfor ( j = 0; j <= 1; ++j )\n{\nif ( ((i >> j) & 1) != 0 )\nv3 = -1.0;\nelse\nv3 = 1.0;\n*(double *)(*(_QWORD *)a1 + 40LL * i + 8 * (j + 2LL)) = v3 * v4 + *(double *)(a1 + 8 * (j + 2LL));\n}\nif ( *(_BYTE *)(a2 + 24) )\nread_CPPN(\n*(_QWORD *)(a2 + 32),\n*(_QWORD *)(a2 + 40),\na2 + 8,\n*(_QWORD *)a1 + 40LL * i + 16,\n*(_QWORD *)a1 + 40LL * i + 8);\nelse\nread_CPPN(\n*(_QWORD *)(a2 + 32),\n*(_QWORD *)(a2 + 40),\n*(_QWORD *)a1 + 40LL * i + 16,\na2 + 8,\n*(_QWORD *)a1 + 40LL * i + 8);\n}\nif ( *(_DWORD *)(a1 + 32) < *(_DWORD *)(*(_QWORD *)(a2 + 40) + 4LL) - 1\n|| *(_DWORD *)(a1 + 32) < *(_DWORD *)(*(_QWORD *)(a2 + 40) + 8LL) - 1\n&& func4(a1, *(_QWORD *)(a2 + 40)) > *(double *)(*(_QWORD *)(a2 + 40) + 16LL) )\n{\nfor ( k = 0; k < 4; ++k )\n{\nv6 = func1(*(_QWORD *)a1 + 40LL * k, a2);\nif ( v6 )\nreturn v6;\n}\n}\nreturn 0LL;\n}",
"original_code": "int build_tree( BinLeaf *p, struct Extraction_Params *eparams ) {\n int i, j, err=0;\n if (( err = Malloc_((void**)&p->c,CLUSTERSIZE*sizeof *p->c) ))\n return err;\n double w = 1.0 / (1 << (p->level+2));\n for ( i=0; i<CLUSTERSIZE; i++ ) {\n p->c[i].c = 0;\n p->c[i].level = p->level+1;\n for ( j=0; j<2; j++ ) {\n p->c[i].x[j] = p->x[j] + ( (i>>j & 1) ? (-1) : 1 ) * w;\n }\n if ( eparams->outgoing )\n read_CPPN( eparams->cppn, eparams->params, eparams->ref, p->c[i].x, p->c[i].r );\n else\n read_CPPN( eparams->cppn, eparams->params, p->c[i].x, eparams->ref, p->c[i].r );\n }\n if ( p->level < eparams->params->min_resolution-1 || ( p->level < eparams->params->max_resolution-1 && get_binleaf_variance(p, eparams->params) > eparams->params->variance_threshold ) ) {\n for ( i=0; i<CLUSTERSIZE; i++ ) {\n if (( err = build_tree( &p->c[i], eparams ) ))\n return err;\n }\n }\n return err;\n}",
"canonical_original_code": "int build_tree(struct BinLeaf *p, struct Extraction_Params *eparams) {\n int i; int j; int err = 0;\n if (( err = Malloc_((void **)&p->c,CLUSTERSIZE*sizeof *p->c) ))\n return err;\n double w = 1.0 / (1 << (p->level+2));\n for ( i=0; i<CLUSTERSIZE; i++ ) {\n p->c[i].c = 0;\n p->c[i].level = p->level+1;\n for ( j=0; j<2; j++ ) {\n p->c[i].x[j] = p->x[j] + ( (i>>j & 1) ? (-1) : 1 ) * w;\n }\n if ( eparams->outgoing )\n read_CPPN( eparams->cppn, eparams->params, eparams->ref, p->c[i].x, p->c[i].r );\n else\n read_CPPN( eparams->cppn, eparams->params, p->c[i].x, eparams->ref, p->c[i].r );\n }\n if ( p->level < eparams->params->min_resolution-1 || ( p->level < eparams->params->max_resolution-1 && get_binleaf_variance(p, eparams->params) > eparams->params->variance_threshold ) ) {\n for ( i=0; i<CLUSTERSIZE; i++ ) {\n if (( err = build_tree( &p->c[i], eparams ) ))\n return err;\n }\n }\n return err;\n}",
"variable_types": [
[
"p",
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; } *"
],
[
"eparams",
"struct Extraction_Params { struct BinLeaf *root; double ref[2]; unsigned char outgoing; unsigned char create_nodes; struct CPPN { struct CPPN_Node { enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } func; double activation; } *nodes; int num_inputs; struct CPPN_Link { unsigned int innov_id; int from; double weight; int is_disabled; } *links; int num_links; } *cppn; struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; } *params; struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *net; } *"
],
[
"i",
"int"
],
[
"j",
"int"
],
[
"err",
"int"
],
[
"w",
"double"
]
],
"return_type": "int",
"user_defined_types": [
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; }",
"struct Extraction_Params { struct BinLeaf *root; double ref[2]; unsigned char outgoing; unsigned char create_nodes; struct CPPN *cppn; struct NEAT_Params *params; struct pNetwork *net; }",
"struct CPPN { struct CPPN_Node *nodes; int num_inputs; struct CPPN_Link *links; int num_links; }",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; }",
"struct pNetwork { unsigned int num_nodes; struct pNode **p_nodes; int num_inputs; unsigned int num_links; struct pLink **p_links; }",
"struct CPPN_Node { enum CPPNFunc func; double activation; }",
"struct CPPN_Link { unsigned int innov_id; int from; double weight; int is_disabled; }",
"enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 }",
"struct pNode { double x[2]; unsigned char used; unsigned int index; }",
"struct pLink { struct pNode *from; double r[1]; unsigned char used; }"
],
"binary_hash": "1d73e1c99a98b329edea99d9c2a500fd91df0606314d609ab9f3fe7f23f35b34"
},
{
"name": "extract_tree",
"canonical_name": "func2",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall extract_tree(__int64 a1, __int64 a2)\n{\n__int64 v3; // rdx\ndouble v4; // xmm0_8\n__int64 v5; // [rsp+10h] [rbp-60h] BYREF\n__int64 v6; // [rsp+18h] [rbp-58h] BYREF\n__int64 v7[3]; // [rsp+20h] [rbp-50h] BYREF\ndouble v8; // [rsp+38h] [rbp-38h]\ndouble v9; // [rsp+40h] [rbp-30h]\ndouble v10; // [rsp+48h] [rbp-28h]\ndouble v11; // [rsp+50h] [rbp-20h]\ndouble v12; // [rsp+58h] [rbp-18h]\nunsigned int v13; // [rsp+64h] [rbp-Ch]\nint j; // [rsp+68h] [rbp-8h]\nint i; // [rsp+6Ch] [rbp-4h]\n\nv13 = 0;\nif ( *(_QWORD *)a1\n&& (**(_QWORD **)a1\n|| *(_DWORD *)(a1 + 32) == *(_DWORD *)(*(_QWORD *)(a2 + 40) + 8LL) - 1\n&& get_binleaf_variance(a1, *(_QWORD *)(a2 + 40)) > *(double *)(*(_QWORD *)(a2 + 40) + 16LL)) )\n{\nfor ( i = 0; i < 4; ++i )\n{\nv13 = extract_tree(*(_QWORD *)a1 + 40LL * i, a2);\nif ( v13 )\nreturn v13;\n}\n}\nelse\n{\nfor ( i = 0; i <= 0; ++i )\n{\nif ( *(double *)(*(_QWORD *)(a2 + 40) + 8 * (i + 6LL)) > fabs(*(double *)(a1 + 8LL * i + 8)) )\nreturn v13;\n}\nv9 = 1.0 / (double)(1 << *(_DWORD *)(a1 + 32));\nv12 = 0.0;\nfor ( i = 0; i <= 1; ++i )\n{\nv3 = *(_QWORD *)(a1 + 24);\nv7[0] = *(_QWORD *)(a1 + 16);\nv7[1] = v3;\n*(double *)&v7[i] = *(double *)(a1 + 8 * (i + 2LL)) - v9;\nget_activation_at(v7, &v6, a2);\n*(double *)&v7[i] = *(double *)(a1 + 8 * (i + 2LL)) + v9;\nget_activation_at(v7, &v5, a2);\nv11 = 0.0;\nv10 = 0.0;\nfor ( j = 0; j <= 0; ++j )\n{\nv11 = fabs(*(double *)(a1 + 8LL * j + 8) - *((double *)&v6 + j))\n* *(double *)(*(_QWORD *)(a2 + 40) + 8 * (j + 4LL) + 8)\n+ v11;\nv10 = fabs(*(double *)(a1 + 8LL * j + 8) - *((double *)&v5 + j))\n* *(double *)(*(_QWORD *)(a2 + 40) + 8 * (j + 4LL) + 8)\n+ v10;\n}\nif ( v10 <= v11 )\nv4 = v10;\nelse\nv4 = v11;\nv8 = v4;\nif ( v4 > v12 )\nv12 = v8;\n}\nif ( v12 > *(double *)(*(_QWORD *)(a2 + 40) + 32LL) )\n{\nv13 = connect_pNet(a1, a2);\nif ( v13 )\nreturn v13;\n}\n}\nreturn v13;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, __int64 a2)\n{\n__int64 v3; // rdx\ndouble v4; // xmm0_8\n__int64 v5; // [rsp+10h] [rbp-60h] BYREF\n__int64 v6; // [rsp+18h] [rbp-58h] BYREF\n__int64 v7[3]; // [rsp+20h] [rbp-50h] BYREF\ndouble v8; // [rsp+38h] [rbp-38h]\ndouble v9; // [rsp+40h] [rbp-30h]\ndouble v10; // [rsp+48h] [rbp-28h]\ndouble v11; // [rsp+50h] [rbp-20h]\ndouble v12; // [rsp+58h] [rbp-18h]\nunsigned int v13; // [rsp+64h] [rbp-Ch]\nint j; // [rsp+68h] [rbp-8h]\nint i; // [rsp+6Ch] [rbp-4h]\n\nv13 = 0;\nif ( *(_QWORD *)a1\n&& (**(_QWORD **)a1\n|| *(_DWORD *)(a1 + 32) == *(_DWORD *)(*(_QWORD *)(a2 + 40) + 8LL) - 1\n&& func4(a1, *(_QWORD *)(a2 + 40)) > *(double *)(*(_QWORD *)(a2 + 40) + 16LL)) )\n{\nfor ( i = 0; i < 4; ++i )\n{\nv13 = func2(*(_QWORD *)a1 + 40LL * i, a2);\nif ( v13 )\nreturn v13;\n}\n}\nelse\n{\nfor ( i = 0; i <= 0; ++i )\n{\nif ( *(double *)(*(_QWORD *)(a2 + 40) + 8 * (i + 6LL)) > fabs(*(double *)(a1 + 8LL * i + 8)) )\nreturn v13;\n}\nv9 = 1.0 / (double)(1 << *(_DWORD *)(a1 + 32));\nv12 = 0.0;\nfor ( i = 0; i <= 1; ++i )\n{\nv3 = *(_QWORD *)(a1 + 24);\nv7[0] = *(_QWORD *)(a1 + 16);\nv7[1] = v3;\n*(double *)&v7[i] = *(double *)(a1 + 8 * (i + 2LL)) - v9;\nfunc3(v7, &v6, a2);\n*(double *)&v7[i] = *(double *)(a1 + 8 * (i + 2LL)) + v9;\nfunc3(v7, &v5, a2);\nv11 = 0.0;\nv10 = 0.0;\nfor ( j = 0; j <= 0; ++j )\n{\nv11 = fabs(*(double *)(a1 + 8LL * j + 8) - *((double *)&v6 + j))\n* *(double *)(*(_QWORD *)(a2 + 40) + 8 * (j + 4LL) + 8)\n+ v11;\nv10 = fabs(*(double *)(a1 + 8LL * j + 8) - *((double *)&v5 + j))\n* *(double *)(*(_QWORD *)(a2 + 40) + 8 * (j + 4LL) + 8)\n+ v10;\n}\nif ( v10 <= v11 )\nv4 = v10;\nelse\nv4 = v11;\nv8 = v4;\nif ( v4 > v12 )\nv12 = v8;\n}\nif ( v12 > *(double *)(*(_QWORD *)(a2 + 40) + 32LL) )\n{\nv13 = connect_pNet(a1, a2);\nif ( v13 )\nreturn v13;\n}\n}\nreturn v13;\n}",
"original_code": "int extract_tree( BinLeaf *p, struct Extraction_Params *eparams ) {\n int i, j, err=0;\n if ( p->c && ( p->c[0].c || ( p->level == eparams->params->max_resolution-1 && get_binleaf_variance(p, eparams->params) > eparams->params->variance_threshold ) ) ) {\n for ( i=0; i<CLUSTERSIZE; i++ ) {\n if (( err = extract_tree( &p->c[i], eparams ) ))\n return err;\n }\n } else {\n for ( i=0; i<1; i++ )\n if ( fabs(p->r[i]) < eparams->params->expression_thresholds[i] )\n return err;\n double w = 1.0 / (1<<p->level);\n double dband=0;\n for ( i=0; i<2; i++ ) {\n double neighbour[2], left[1], right[1];\n memcpy( neighbour, p->x, 2*sizeof *neighbour );\n neighbour[i] = p->x[i] - w;\n get_activation_at( neighbour, left, eparams );\n neighbour[i] = p->x[i] + w;\n get_activation_at( neighbour, right, eparams );\n double dleft=0, dright=0;\n for ( j=0; j<1; j++ ) {\n dleft += eparams->params->output_bandpruning_weight[j] * fabs(p->r[j] - left[j]);\n dright += eparams->params->output_bandpruning_weight[j] * fabs(p->r[j] - right[j]);\n }\n double ddim = dleft < dright ? dleft : dright;\n if ( ddim > dband )\n dband = ddim;\n }\n if ( dband > eparams->params->band_threshold ) {\n if (( err = connect_pNet( p, eparams ) ))\n return err;\n }\n }\n return err;\n}",
"canonical_original_code": "int extract_tree(struct BinLeaf *p, struct Extraction_Params *eparams) {\n int i; int j; int err = 0;\n if ( p->c && ( p->c[0].c || ( p->level == eparams->params->max_resolution-1 && get_binleaf_variance(p, eparams->params) > eparams->params->variance_threshold ) ) ) {\n for ( i=0; i<CLUSTERSIZE; i++ ) {\n if (( err = extract_tree( &p->c[i], eparams ) ))\n return err;\n }\n } else {\n for ( i=0; i<1; i++ )\n if ( fabs(p->r[i]) < eparams->params->expression_thresholds[i] )\n return err;\n double w = 1.0 / (1<<p->level);\n double dband = 0;\n for ( i=0; i<2; i++ ) {\n double neighbour[2]; double left[1]; double right[1];\n memcpy( neighbour, p->x, 2*sizeof *neighbour );\n neighbour[i] = p->x[i] - w;\n get_activation_at( neighbour, left, eparams );\n neighbour[i] = p->x[i] + w;\n get_activation_at( neighbour, right, eparams );\n double dleft = 0; double dright = 0;\n for ( j=0; j<1; j++ ) {\n dleft += eparams->params->output_bandpruning_weight[j] * fabs(p->r[j] - left[j]);\n dright += eparams->params->output_bandpruning_weight[j] * fabs(p->r[j] - right[j]);\n }\n double ddim = dleft < dright ? dleft : dright;\n if ( ddim > dband )\n dband = ddim;\n }\n if ( dband > eparams->params->band_threshold ) {\n if (( err = connect_pNet( p, eparams ) ))\n return err;\n }\n }\n return err;\n}",
"variable_types": [
[
"p",
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; } *"
],
[
"eparams",
"struct Extraction_Params { struct BinLeaf *root; double ref[2]; unsigned char outgoing; unsigned char create_nodes; struct CPPN { struct CPPN_Node { enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } func; double activation; } *nodes; int num_inputs; struct CPPN_Link { unsigned int innov_id; int from; double weight; int is_disabled; } *links; int num_links; } *cppn; struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; } *params; struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *net; } *"
],
[
"i",
"int"
],
[
"j",
"int"
],
[
"err",
"int"
],
[
"w",
"double"
],
[
"dband",
"double"
],
[
"neighbour",
"double [2]"
],
[
"left",
"double [1]"
],
[
"right",
"double [1]"
],
[
"dleft",
"double"
],
[
"dright",
"double"
],
[
"ddim",
"double"
]
],
"return_type": "int",
"user_defined_types": [
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; }",
"struct Extraction_Params { struct BinLeaf *root; double ref[2]; unsigned char outgoing; unsigned char create_nodes; struct CPPN *cppn; struct NEAT_Params *params; struct pNetwork *net; }",
"struct CPPN { struct CPPN_Node *nodes; int num_inputs; struct CPPN_Link *links; int num_links; }",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; }",
"struct pNetwork { unsigned int num_nodes; struct pNode **p_nodes; int num_inputs; unsigned int num_links; struct pLink **p_links; }",
"struct CPPN_Node { enum CPPNFunc func; double activation; }",
"struct CPPN_Link { unsigned int innov_id; int from; double weight; int is_disabled; }",
"enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 }",
"struct pNode { double x[2]; unsigned char used; unsigned int index; }",
"struct pLink { struct pNode *from; double r[1]; unsigned char used; }"
],
"binary_hash": "1d73e1c99a98b329edea99d9c2a500fd91df0606314d609ab9f3fe7f23f35b34"
},
{
"name": "get_activation_at",
"canonical_name": "func3",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall get_activation_at(double *a1, _QWORD *a2, __int64 a3)\n{\n__int64 result; // rax\ndouble v5; // [rsp+20h] [rbp-20h]\nint v6; // [rsp+2Ch] [rbp-14h]\n_QWORD *v7; // [rsp+30h] [rbp-10h]\nint v8; // [rsp+38h] [rbp-8h]\nint i; // [rsp+3Ch] [rbp-4h]\nint j; // [rsp+3Ch] [rbp-4h]\n\nv8 = 0;\nv7 = *(_QWORD **)a3;\nv5 = 1.0 / (double)(1 << (*(_BYTE *)(*(_QWORD *)a3 + 32LL) + 1));\nfor ( i = 0; i <= 1; ++i )\n{\nif ( a1[i] > *(double *)&v7[i + 2] + v5 || *(double *)&v7[i + 2] - v5 > a1[i] )\n{\nv8 = 1;\nbreak;\n}\n}\nif ( v8 )\n{\nLABEL_17:\nif ( *(_BYTE *)(a3 + 24) )\nresult = read_CPPN(*(_QWORD *)(a3 + 32), *(_QWORD *)(a3 + 40), a3 + 8, a1, a2);\nelse\nresult = read_CPPN(*(_QWORD *)(a3 + 32), *(_QWORD *)(a3 + 40), a1, a3 + 8, a2);\n}\nelse\n{\nwhile ( memcmp(a1, v7 + 2, 0x10uLL) )\n{\nv6 = 0;\nfor ( j = 0; j <= 1; ++j )\n{\nif ( a1[j] > *(double *)&v7[j + 2] )\nv6 |= 1 << j;\n}\nif ( !*v7 )\ngoto LABEL_17;\nv7 = (_QWORD *)(*v7 + 40LL * v6);\n}\nresult = (__int64)a2;\n*a2 = v7[1];\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(double *a1, _QWORD *a2, __int64 a3)\n{\n__int64 result; // rax\ndouble v5; // [rsp+20h] [rbp-20h]\nint v6; // [rsp+2Ch] [rbp-14h]\n_QWORD *v7; // [rsp+30h] [rbp-10h]\nint v8; // [rsp+38h] [rbp-8h]\nint i; // [rsp+3Ch] [rbp-4h]\nint j; // [rsp+3Ch] [rbp-4h]\n\nv8 = 0;\nv7 = *(_QWORD **)a3;\nv5 = 1.0 / (double)(1 << (*(_BYTE *)(*(_QWORD *)a3 + 32LL) + 1));\nfor ( i = 0; i <= 1; ++i )\n{\nif ( a1[i] > *(double *)&v7[i + 2] + v5 || *(double *)&v7[i + 2] - v5 > a1[i] )\n{\nv8 = 1;\nbreak;\n}\n}\nif ( v8 )\n{\nLABEL_17:\nif ( *(_BYTE *)(a3 + 24) )\nresult = read_CPPN(*(_QWORD *)(a3 + 32), *(_QWORD *)(a3 + 40), a3 + 8, a1, a2);\nelse\nresult = read_CPPN(*(_QWORD *)(a3 + 32), *(_QWORD *)(a3 + 40), a1, a3 + 8, a2);\n}\nelse\n{\nwhile ( memcmp(a1, v7 + 2, 0x10uLL) )\n{\nv6 = 0;\nfor ( j = 0; j <= 1; ++j )\n{\nif ( a1[j] > *(double *)&v7[j + 2] )\nv6 |= 1 << j;\n}\nif ( !*v7 )\ngoto LABEL_17;\nv7 = (_QWORD *)(*v7 + 40LL * v6);\n}\nresult = (__int64)a2;\n*a2 = v7[1];\n}\nreturn result;\n}",
"original_code": "void get_activation_at( double x[2], double r[1], struct Extraction_Params *eparams ) {\n int i, read_new=0;\n BinLeaf *b = eparams->root;\n double w = 1.0 / (1<<(b->level+1));\n for ( i=0; i<2; i++ ) {\n if ( x[i] > b->x[i]+w || x[i] < b->x[i]-w ) {\n read_new = 1;\n break;\n }\n }\n if ( !read_new ) {\n while (1) {\n if ( ! memcmp(x, b->x, 2*sizeof *x) ) {\n memcpy( r, b->r, 1*sizeof *r );\n return;\n }\n int idx=0;\n for ( i=0; i<2; i++ ) {\n if ( x[i] > b->x[i] )\n idx |= 1 << i;\n }\n if ( b->c )\n b = &b->c[idx];\n else\n break;\n }\n }\n if ( eparams->outgoing )\n read_CPPN( eparams->cppn, eparams->params, eparams->ref, x, r );\n else\n read_CPPN( eparams->cppn, eparams->params, x, eparams->ref, r );\n}",
"canonical_original_code": "void get_activation_at(double x[2], double r[1], struct Extraction_Params *eparams) {\n int i; int read_new = 0;\n struct BinLeaf *b = eparams->root;\n double w = 1.0 / (1<<(b->level+1));\n for ( i=0; i<2; i++ ) {\n if ( x[i] > b->x[i]+w || x[i] < b->x[i]-w ) {\n read_new = 1;\n break;\n }\n }\n if ( !read_new ) {\n while (1) {\n if ( ! memcmp(x, b->x, 2*sizeof *x) ) {\n memcpy( r, b->r, 1*sizeof *r );\n return;\n }\n int idx = 0;\n for ( i=0; i<2; i++ ) {\n if ( x[i] > b->x[i] )\n idx |= 1 << i;\n }\n if ( b->c )\n b = &b->c[idx];\n else\n break;\n }\n }\n if ( eparams->outgoing )\n read_CPPN( eparams->cppn, eparams->params, eparams->ref, x, r );\n else\n read_CPPN( eparams->cppn, eparams->params, x, eparams->ref, r );\n}",
"variable_types": [
[
"x",
"double [2]"
],
[
"r",
"double [1]"
],
[
"eparams",
"struct Extraction_Params { struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; } *root; double ref[2]; unsigned char outgoing; unsigned char create_nodes; struct CPPN { struct CPPN_Node { enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } func; double activation; } *nodes; int num_inputs; struct CPPN_Link { unsigned int innov_id; int from; double weight; int is_disabled; } *links; int num_links; } *cppn; struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; } *params; struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *net; } *"
],
[
"i",
"int"
],
[
"read_new",
"int"
],
[
"b",
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; } *"
],
[
"w",
"double"
],
[
"idx",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct Extraction_Params { struct BinLeaf *root; double ref[2]; unsigned char outgoing; unsigned char create_nodes; struct CPPN *cppn; struct NEAT_Params *params; struct pNetwork *net; }",
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; }",
"struct CPPN { struct CPPN_Node *nodes; int num_inputs; struct CPPN_Link *links; int num_links; }",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; }",
"struct pNetwork { unsigned int num_nodes; struct pNode **p_nodes; int num_inputs; unsigned int num_links; struct pLink **p_links; }",
"struct CPPN_Node { enum CPPNFunc func; double activation; }",
"struct CPPN_Link { unsigned int innov_id; int from; double weight; int is_disabled; }",
"enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 }",
"struct pNode { double x[2]; unsigned char used; unsigned int index; }",
"struct pLink { struct pNode *from; double r[1]; unsigned char used; }"
],
"binary_hash": "1d73e1c99a98b329edea99d9c2a500fd91df0606314d609ab9f3fe7f23f35b34"
},
{
"name": "get_binleaf_variance",
"canonical_name": "func4",
"repo": "kernfel/fNEAT",
"decompiled_code": "double __fastcall get_binleaf_variance(_QWORD *a1, __int64 a2)\n{\ndouble v3; // [rsp+20h] [rbp-20h]\ndouble v4; // [rsp+28h] [rbp-18h]\ndouble v5; // [rsp+30h] [rbp-10h]\nint i; // [rsp+38h] [rbp-8h]\nint j; // [rsp+3Ch] [rbp-4h]\nint k; // [rsp+3Ch] [rbp-4h]\n\nv5 = 0.0;\nfor ( i = 0; i <= 0; ++i )\n{\nv4 = 0.0;\nv3 = 0.0;\nfor ( j = 0; j < 4; ++j )\nv4 = *(double *)(*a1 + 40LL * j + 8LL * i + 8) + v4;\nfor ( k = 0; k < 4; ++k )\nv3 = fabs(v4 / (double)4 - *(double *)(*a1 + 40LL * k + 8LL * i + 8)) + v3;\nv5 = *(double *)(a2 + 8 * (i + 2LL) + 8) * (v3 / (double)4) + v5;\n}\nreturn v5;\n}\n",
"canonical_decompiled_code": "double __fastcall func4(_QWORD *a1, __int64 a2)\n{\ndouble v3; // [rsp+20h] [rbp-20h]\ndouble v4; // [rsp+28h] [rbp-18h]\ndouble v5; // [rsp+30h] [rbp-10h]\nint i; // [rsp+38h] [rbp-8h]\nint j; // [rsp+3Ch] [rbp-4h]\nint k; // [rsp+3Ch] [rbp-4h]\n\nv5 = 0.0;\nfor ( i = 0; i <= 0; ++i )\n{\nv4 = 0.0;\nv3 = 0.0;\nfor ( j = 0; j < 4; ++j )\nv4 = *(double *)(*a1 + 40LL * j + 8LL * i + 8) + v4;\nfor ( k = 0; k < 4; ++k )\nv3 = fabs(v4 / (double)4 - *(double *)(*a1 + 40LL * k + 8LL * i + 8)) + v3;\nv5 = *(double *)(a2 + 8 * (i + 2LL) + 8) * (v3 / (double)4) + v5;\n}\nreturn v5;\n}",
"original_code": "double get_binleaf_variance( BinLeaf *p, struct NEAT_Params *params ) {\n int i,j;\n double sum_of_variances=0;\n for ( j=0; j<1; j++ ) {\n double sum=0, mean, sum_of_deviations=0;\n for ( i=0; i<CLUSTERSIZE; i++ ) {\n sum += p->c[i].r[j];\n }\n mean = sum/CLUSTERSIZE;\n for ( i=0; i<CLUSTERSIZE; i++ ) {\n sum_of_deviations += fabs( mean - p->c[i].r[j] );\n }\n sum_of_variances += sum_of_deviations/CLUSTERSIZE * params->output_variance_weight[j];\n }\n return sum_of_variances/1;\n}",
"canonical_original_code": "double get_binleaf_variance(struct BinLeaf *p, struct NEAT_Params *params) {\n int i; int j;\n double sum_of_variances = 0;\n for ( j=0; j<1; j++ ) {\n double sum = 0; double mean; double sum_of_deviations = 0;\n for ( i=0; i<CLUSTERSIZE; i++ ) {\n sum += p->c[i].r[j];\n }\n mean = sum/CLUSTERSIZE;\n for ( i=0; i<CLUSTERSIZE; i++ ) {\n sum_of_deviations += fabs( mean - p->c[i].r[j] );\n }\n sum_of_variances += sum_of_deviations/CLUSTERSIZE * params->output_variance_weight[j];\n }\n return sum_of_variances/1;\n}",
"variable_types": [
[
"p",
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; } *"
],
[
"params",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; } *"
],
[
"i",
"int"
],
[
"j",
"int"
],
[
"sum_of_variances",
"double"
],
[
"sum",
"double"
],
[
"mean",
"double"
],
[
"sum_of_deviations",
"double"
]
],
"return_type": "double",
"user_defined_types": [
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; }",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; }",
"enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 }"
],
"binary_hash": "1d73e1c99a98b329edea99d9c2a500fd91df0606314d609ab9f3fe7f23f35b34"
},
{
"name": "delete_tree",
"canonical_name": "func5",
"repo": "kernfel/fNEAT",
"decompiled_code": "void *__fastcall delete_tree(void **a1)\n{\nvoid *result; // rax\nint i; // [rsp+1Ch] [rbp-4h]\n\nresult = *a1;\nif ( *a1 )\n{\nfor ( i = 0; i < 4; ++i )\ndelete_tree((char *)*a1 + 40 * i);\nfree(*a1);\nresult = a1;\n*a1 = 0LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "void *__fastcall func5(void **a1)\n{\nvoid *result; // rax\nint i; // [rsp+1Ch] [rbp-4h]\n\nresult = *a1;\nif ( *a1 )\n{\nfor ( i = 0; i < 4; ++i )\nfunc5((char *)*a1 + 40 * i);\nfree(*a1);\nresult = a1;\n*a1 = 0LL;\n}\nreturn result;\n}",
"original_code": "void delete_tree( BinLeaf *p ) {\n int i;\n if ( ! p->c )\n return;\n for ( i=0; i<CLUSTERSIZE; i++ )\n delete_tree( &p->c[i] );\n free( p->c );\n p->c = 0;\n}",
"canonical_original_code": "void delete_tree(struct BinLeaf *p) {\n int i;\n if ( ! p->c )\n return;\n for ( i=0; i<CLUSTERSIZE; i++ )\n delete_tree( &p->c[i] );\n free( p->c );\n p->c = 0;\n}",
"variable_types": [
[
"p",
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; } *"
],
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; }"
],
"binary_hash": "1d73e1c99a98b329edea99d9c2a500fd91df0606314d609ab9f3fe7f23f35b34"
}
] |
7dbd6d10b93301edd99c4b4066b42971733317604ac4f4c59f53ffdb752eb045 | kernfel/fNEAT | [
[
"Malloc_",
"->"
],
[
"Calloc_",
"->"
],
[
"Realloc_",
"->"
]
] | [] | [
{
"name": "Malloc_",
"canonical_name": "func0",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall Malloc_(void **a1, size_t a2)\n{\n__int64 result; // rax\n\n*a1 = malloc(a2);\nif ( a1 )\nresult = 0LL;\nelse\nresult = 0xFFFFFFFFLL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(void **a1, size_t a2)\n{\n__int64 result; // rax\n\n*a1 = malloc(a2);\nif ( a1 )\nresult = 0LL;\nelse\nresult = 0xFFFFFFFFLL;\nreturn result;\n}",
"original_code": "int Malloc_( void **p, size_t s ) {\n *p = malloc( s );\n return p ? 0 : (-1);\n}",
"canonical_original_code": "int Malloc_(void **p, unsigned long s) {\n *p = malloc( s );\n return p ? 0 : (-1);\n}",
"variable_types": [
[
"p",
"void **"
],
[
"s",
"unsigned long"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "7dbd6d10b93301edd99c4b4066b42971733317604ac4f4c59f53ffdb752eb045"
},
{
"name": "Calloc_",
"canonical_name": "func1",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall Calloc_(void **a1, size_t a2, size_t a3)\n{\n__int64 result; // rax\n\n*a1 = calloc(a2, a3);\nif ( a1 )\nresult = 0LL;\nelse\nresult = 0xFFFFFFFFLL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(void **a1, size_t a2, size_t a3)\n{\n__int64 result; // rax\n\n*a1 = calloc(a2, a3);\nif ( a1 )\nresult = 0LL;\nelse\nresult = 0xFFFFFFFFLL;\nreturn result;\n}",
"original_code": "int Calloc_( void **p, size_t n, size_t s ) {\n *p = calloc( n, s );\n return p ? 0 : (-1);\n}",
"canonical_original_code": "int Calloc_(void **p, unsigned long n, unsigned long s) {\n *p = calloc( n, s );\n return p ? 0 : (-1);\n}",
"variable_types": [
[
"p",
"void **"
],
[
"n",
"unsigned long"
],
[
"s",
"unsigned long"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "7dbd6d10b93301edd99c4b4066b42971733317604ac4f4c59f53ffdb752eb045"
},
{
"name": "Realloc_",
"canonical_name": "func2",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall Realloc_(void **a1, size_t a2)\n{\nvoid *v3; // [rsp+18h] [rbp-8h]\n\nv3 = realloc(*a1, a2);\nif ( !v3 )\nreturn 0xFFFFFFFFLL;\n*a1 = v3;\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(void **a1, size_t a2)\n{\nvoid *v3; // [rsp+18h] [rbp-8h]\n\nv3 = realloc(*a1, a2);\nif ( !v3 )\nreturn 0xFFFFFFFFLL;\n*a1 = v3;\nreturn 0LL;\n}",
"original_code": "int Realloc_( void **p, size_t s ) {\n void *q = realloc( *p, s );\n if ( ! q )\n return (-1);\n *p = q;\n return 0;\n}",
"canonical_original_code": "int Realloc_(void **p, unsigned long s) {\n void *q = realloc( *p, s );\n if ( ! q )\n return (-1);\n *p = q;\n return 0;\n}",
"variable_types": [
[
"p",
"void **"
],
[
"s",
"unsigned long"
],
[
"q",
"void *"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "7dbd6d10b93301edd99c4b4066b42971733317604ac4f4c59f53ffdb752eb045"
}
] |
810a714d2b7b8bd314254acab419347c5abe4c792ef90da0e8b8822f9af01ec4 | kernfel/fNEAT | [
[
"adjust_heading",
"->",
"move_robot_in_room",
"move_robot_in_tilemaze"
],
[
"move_robot_in_room",
"->",
"adjust_heading"
],
[
"get_sensor_readings_in_room",
"->"
],
[
"move_robot_in_tilemaze",
"->",
"adjust_heading"
],
[
"get_sensor_readings_in_tilemaze",
"->"
]
] | [] | [
{
"name": "adjust_heading",
"canonical_name": "func0",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall adjust_heading(__int64 a1, __int64 a2, __int64 a3)\n{\n__int64 result; // rax\ndouble v4; // [rsp+28h] [rbp-8h]\ndouble v5; // [rsp+28h] [rbp-8h]\n\nv4 = *(double *)(a3 + 8) - *(double *)(a3 + 16);\nresult = a2;\nif ( fabs(*(double *)(a3 + 8) - *(double *)(a3 + 16)) > *(double *)(a2 + 32) )\n{\nif ( v4 <= 0.0 )\nv5 = *(double *)(a2 + 32) + v4;\nelse\nv5 = v4 - *(double *)(a2 + 32);\nresult = fmod(*(double *)(a1 + 16) + *(double *)(a2 + 24) * v5, 6.283185307179586);\n*(_QWORD *)(a1 + 16) = result;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, __int64 a2, __int64 a3)\n{\n__int64 result; // rax\ndouble v4; // [rsp+28h] [rbp-8h]\ndouble v5; // [rsp+28h] [rbp-8h]\n\nv4 = *(double *)(a3 + 8) - *(double *)(a3 + 16);\nresult = a2;\nif ( fabs(*(double *)(a3 + 8) - *(double *)(a3 + 16)) > *(double *)(a2 + 32) )\n{\nif ( v4 <= 0.0 )\nv5 = *(double *)(a2 + 32) + v4;\nelse\nv5 = v4 - *(double *)(a2 + 32);\nresult = fmod(*(double *)(a1 + 16) + *(double *)(a2 + 24) * v5, 6.283185307179586);\n*(_QWORD *)(a1 + 16) = result;\n}\nreturn result;\n}",
"original_code": "void adjust_heading( Robot *bot, struct Robot_Params *params, double *controller_outputs ) {\n double turn_output = controller_outputs[1] - controller_outputs[2];\n if ( fabs(turn_output) > params->turn_threshold ) {\n if ( turn_output > 0 )\n turn_output = turn_output - params->turn_threshold;\n else\n turn_output = turn_output + params->turn_threshold;\n bot->heading = fmod( bot->heading + turn_output*params->turn_sensitivity, 2*3.14159265358979323846 );\n }\n}",
"canonical_original_code": "void adjust_heading(struct Robot *bot, struct Robot_Params *params, double *controller_outputs) {\n double turn_output = controller_outputs[1] - controller_outputs[2];\n if ( fabs(turn_output) > params->turn_threshold ) {\n if ( turn_output > 0 )\n turn_output = turn_output - params->turn_threshold;\n else\n turn_output = turn_output + params->turn_threshold;\n bot->heading = fmod( bot->heading + turn_output*params->turn_sensitivity, 2*3.14159265358979323846 );\n }\n}",
"variable_types": [
[
"bot",
"struct Robot { double x; double heading; } *"
],
[
"params",
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; } *"
],
[
"controller_outputs",
"double *"
],
[
"turn_output",
"double"
]
],
"return_type": "void",
"user_defined_types": [
"struct Robot { double x; double heading; }",
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; }"
],
"binary_hash": "810a714d2b7b8bd314254acab419347c5abe4c792ef90da0e8b8822f9af01ec4"
},
{
"name": "move_robot_in_room",
"canonical_name": "func1",
"repo": "kernfel/fNEAT",
"decompiled_code": "double *__fastcall move_robot_in_room(double *a1, double *a2, double *a3, double *a4)\n{\ndouble *result; // rax\ndouble v5; // xmm0_8\ndouble v6; // xmm0_8\ndouble v9; // [rsp+28h] [rbp-38h]\ndouble v10; // [rsp+30h] [rbp-30h]\ndouble v11; // [rsp+38h] [rbp-28h]\ndouble v12; // [rsp+40h] [rbp-20h]\ndouble v13; // [rsp+48h] [rbp-18h]\ndouble v14; // [rsp+50h] [rbp-10h]\ndouble v15; // [rsp+58h] [rbp-8h]\ndouble v16; // [rsp+58h] [rbp-8h]\n\nadjust_heading((__int64)a1, (__int64)a3, (__int64)a4);\nv15 = *a4;\nresult = a3;\nif ( fabs(*a4) > a3[2] )\n{\nif ( v15 <= 0.0 )\nv16 = a3[2] + v15;\nelse\nv16 = v15 - a3[2];\nv12 = a3[1] * (cos(a1[2]) * v16);\nv11 = a3[1] * (sin(a1[2]) * v16);\nv10 = *a1 + v12;\nv9 = a1[1] + v11;\nv14 = 0.0;\nv13 = 0.0;\nif ( v10 - *a3 >= 0.0 )\n{\nif ( *a3 + v10 > *a2 )\nv14 = (*a3 + v10 - *a2) / v12;\n}\nelse\n{\nv14 = -(*a3 - v10) / v12;\n}\nif ( v9 - *a3 >= 0.0 )\n{\nif ( *a3 + v9 > a2[1] )\nv13 = (*a3 + v9 - a2[1]) / v11;\n}\nelse\n{\nv13 = -(*a3 - v9) / v11;\n}\nif ( v14 <= v13 )\nv5 = v13;\nelse\nv5 = v14;\n*a1 = (1.0 - v5) * v12 + *a1;\nif ( v14 <= v13 )\nv6 = v13;\nelse\nv6 = v14;\nresult = a1;\na1[1] = (1.0 - v6) * v11 + a1[1];\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "double *__fastcall func1(double *a1, double *a2, double *a3, double *a4)\n{\ndouble *result; // rax\ndouble v5; // xmm0_8\ndouble v6; // xmm0_8\ndouble v9; // [rsp+28h] [rbp-38h]\ndouble v10; // [rsp+30h] [rbp-30h]\ndouble v11; // [rsp+38h] [rbp-28h]\ndouble v12; // [rsp+40h] [rbp-20h]\ndouble v13; // [rsp+48h] [rbp-18h]\ndouble v14; // [rsp+50h] [rbp-10h]\ndouble v15; // [rsp+58h] [rbp-8h]\ndouble v16; // [rsp+58h] [rbp-8h]\n\nfunc0((__int64)a1, (__int64)a3, (__int64)a4);\nv15 = *a4;\nresult = a3;\nif ( fabs(*a4) > a3[2] )\n{\nif ( v15 <= 0.0 )\nv16 = a3[2] + v15;\nelse\nv16 = v15 - a3[2];\nv12 = a3[1] * (cos(a1[2]) * v16);\nv11 = a3[1] * (sin(a1[2]) * v16);\nv10 = *a1 + v12;\nv9 = a1[1] + v11;\nv14 = 0.0;\nv13 = 0.0;\nif ( v10 - *a3 >= 0.0 )\n{\nif ( *a3 + v10 > *a2 )\nv14 = (*a3 + v10 - *a2) / v12;\n}\nelse\n{\nv14 = -(*a3 - v10) / v12;\n}\nif ( v9 - *a3 >= 0.0 )\n{\nif ( *a3 + v9 > a2[1] )\nv13 = (*a3 + v9 - a2[1]) / v11;\n}\nelse\n{\nv13 = -(*a3 - v9) / v11;\n}\nif ( v14 <= v13 )\nv5 = v13;\nelse\nv5 = v14;\n*a1 = (1.0 - v5) * v12 + *a1;\nif ( v14 <= v13 )\nv6 = v13;\nelse\nv6 = v14;\nresult = a1;\na1[1] = (1.0 - v6) * v11 + a1[1];\n}\nreturn result;\n}",
"original_code": "void move_robot_in_room( Robot *bot, Room *room, struct Robot_Params *params, double *controller_outputs ) {\n adjust_heading( bot, params, controller_outputs );\n double motor_output = controller_outputs[0];\n if ( fabs(motor_output) > params->motor_threshold ) {\n if ( motor_output > 0 )\n motor_output = motor_output - params->motor_threshold;\n else\n motor_output = motor_output + params->motor_threshold;\n double m_x = cos(bot->heading) * motor_output * params->motor_sensitivity;\n double m_y = sin(bot->heading) * motor_output * params->motor_sensitivity;\n double new_x = bot->x + m_x, new_y = bot->y + m_y;\n double adjust_x=0, adjust_y=0;\n if ( new_x - params->radius < 0 ) {\n adjust_x = -(params->radius - new_x) / m_x;\n } else if ( new_x + params->radius > room->x ) {\n adjust_x = (new_x + params->radius - room->x) / m_x;\n }\n if ( new_y - params->radius < 0 ) {\n adjust_y = -(params->radius - new_y) / m_y;\n } else if ( new_y + params->radius > room->y ) {\n adjust_y = (new_y + params->radius - room->y) / m_y;\n }\n bot->x += (1-((adjust_x)>(adjust_y)?(adjust_x):(adjust_y))) * m_x;\n bot->y += (1-((adjust_x)>(adjust_y)?(adjust_x):(adjust_y))) * m_y;\n }\n}",
"canonical_original_code": "void move_robot_in_room(struct Robot *bot, struct Room *room, struct Robot_Params *params, double *controller_outputs) {\n adjust_heading( bot, params, controller_outputs );\n double motor_output = controller_outputs[0];\n if ( fabs(motor_output) > params->motor_threshold ) {\n if ( motor_output > 0 )\n motor_output = motor_output - params->motor_threshold;\n else\n motor_output = motor_output + params->motor_threshold;\n double m_x = cos(bot->heading) * motor_output * params->motor_sensitivity;\n double m_y = sin(bot->heading) * motor_output * params->motor_sensitivity;\n double new_x = bot->x + m_x; double new_y = bot->y + m_y;\n double adjust_x = 0; double adjust_y = 0;\n if ( new_x - params->radius < 0 ) {\n adjust_x = -(params->radius - new_x) / m_x;\n } else if ( new_x + params->radius > room->x ) {\n adjust_x = (new_x + params->radius - room->x) / m_x;\n }\n if ( new_y - params->radius < 0 ) {\n adjust_y = -(params->radius - new_y) / m_y;\n } else if ( new_y + params->radius > room->y ) {\n adjust_y = (new_y + params->radius - room->y) / m_y;\n }\n bot->x += (1-((adjust_x)>(adjust_y)?(adjust_x):(adjust_y))) * m_x;\n bot->y += (1-((adjust_x)>(adjust_y)?(adjust_x):(adjust_y))) * m_y;\n }\n}",
"variable_types": [
[
"bot",
"struct Robot { double x; double heading; } *"
],
[
"room",
"struct Room { double x; } *"
],
[
"params",
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; } *"
],
[
"controller_outputs",
"double *"
],
[
"motor_output",
"double"
],
[
"m_x",
"double"
],
[
"m_y",
"double"
],
[
"new_x",
"double"
],
[
"new_y",
"double"
],
[
"adjust_x",
"double"
],
[
"adjust_y",
"double"
]
],
"return_type": "void",
"user_defined_types": [
"struct Robot { double x; double heading; }",
"struct Room { double x; }",
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; }"
],
"binary_hash": "810a714d2b7b8bd314254acab419347c5abe4c792ef90da0e8b8822f9af01ec4"
},
{
"name": "get_sensor_readings_in_room",
"canonical_name": "func2",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall get_sensor_readings_in_room(double *a1, double *a2, __int64 a3, __int64 a4)\n{\ndouble v4; // xmm0_8\ndouble v5; // xmm0_8\n__int64 result; // rax\ndouble v9; // [rsp+30h] [rbp-30h]\ndouble v10; // [rsp+38h] [rbp-28h]\ndouble v11; // [rsp+40h] [rbp-20h]\ndouble v12; // [rsp+48h] [rbp-18h]\ndouble v13; // [rsp+50h] [rbp-10h]\nint i; // [rsp+5Ch] [rbp-4h]\n\nv11 = *(double *)a3 + *(double *)(a3 + 48);\nfor ( i = 0; ; ++i )\n{\nresult = *(unsigned int *)(a3 + 40);\nif ( i >= (int)result )\nbreak;\nv10 = cos(a1[2] + *(double *)(*(_QWORD *)(a3 + 56) + 8LL * i)) * v11;\nv9 = sin(a1[2] + *(double *)(*(_QWORD *)(a3 + 56) + 8LL * i)) * v11;\nv13 = 0.0;\nv12 = 0.0;\nif ( *a1 + v10 >= 0.0 )\n{\nif ( *a1 + v10 > *a2 )\nv13 = (*a1 + v10 - *a2) / v10;\n}\nelse\n{\nv13 = -(*a1 + v10) / v10;\n}\nif ( a1[1] + v9 >= 0.0 )\n{\nif ( a1[1] + v9 > a2[1] )\nv12 = (a1[1] + v9 - a2[1]) / v9;\n}\nelse\n{\nv12 = -(a1[1] + v9) / v9;\n}\nif ( v13 <= v12 )\nv4 = v12;\nelse\nv4 = v13;\nif ( *(_BYTE *)(a3 + 64) )\nv5 = 1.0 - v4 * v11 / *(double *)(a3 + 48);\nelse\nv5 = v4 * v11 / *(double *)(a3 + 48);\n*(double *)(8LL * i + a4) = v5;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(double *a1, double *a2, __int64 a3, __int64 a4)\n{\ndouble v4; // xmm0_8\ndouble v5; // xmm0_8\n__int64 result; // rax\ndouble v9; // [rsp+30h] [rbp-30h]\ndouble v10; // [rsp+38h] [rbp-28h]\ndouble v11; // [rsp+40h] [rbp-20h]\ndouble v12; // [rsp+48h] [rbp-18h]\ndouble v13; // [rsp+50h] [rbp-10h]\nint i; // [rsp+5Ch] [rbp-4h]\n\nv11 = *(double *)a3 + *(double *)(a3 + 48);\nfor ( i = 0; ; ++i )\n{\nresult = *(unsigned int *)(a3 + 40);\nif ( i >= (int)result )\nbreak;\nv10 = cos(a1[2] + *(double *)(*(_QWORD *)(a3 + 56) + 8LL * i)) * v11;\nv9 = sin(a1[2] + *(double *)(*(_QWORD *)(a3 + 56) + 8LL * i)) * v11;\nv13 = 0.0;\nv12 = 0.0;\nif ( *a1 + v10 >= 0.0 )\n{\nif ( *a1 + v10 > *a2 )\nv13 = (*a1 + v10 - *a2) / v10;\n}\nelse\n{\nv13 = -(*a1 + v10) / v10;\n}\nif ( a1[1] + v9 >= 0.0 )\n{\nif ( a1[1] + v9 > a2[1] )\nv12 = (a1[1] + v9 - a2[1]) / v9;\n}\nelse\n{\nv12 = -(a1[1] + v9) / v9;\n}\nif ( v13 <= v12 )\nv4 = v12;\nelse\nv4 = v13;\nif ( *(_BYTE *)(a3 + 64) )\nv5 = 1.0 - v4 * v11 / *(double *)(a3 + 48);\nelse\nv5 = v4 * v11 / *(double *)(a3 + 48);\n*(double *)(8LL * i + a4) = v5;\n}\nreturn result;\n}",
"original_code": "void get_sensor_readings_in_room( Robot *bot, Room *room, struct Robot_Params *params, double *sensor_inputs ) {\n int i;\n double s_length = params->dist_sensor_length + params->radius;\n for ( i=0; i<params->num_dist_sensors; i++ ) {\n double s_x = cos(bot->heading + params->dist_sensor_pos[i]) * s_length;\n double s_y = sin(bot->heading + params->dist_sensor_pos[i]) * s_length;\n double depth_x=0, depth_y=0;\n if ( bot->x + s_x < 0 )\n depth_x = -(bot->x + s_x) / s_x;\n else if ( bot->x + s_x > room->x )\n depth_x = (bot->x + s_x - room->x) / s_x;\n if ( bot->y + s_y < 0 )\n depth_y = -(bot->y + s_y) / s_y;\n else if ( bot->y + s_y > room->y )\n depth_y = (bot->y + s_y - room->y) / s_y;\n double reading = ((depth_x)>(depth_y)?(depth_x):(depth_y)) * s_length / params->dist_sensor_length;\n sensor_inputs[i] = params->invert_dist_sensors ? 1-reading : reading;\n }\n}",
"canonical_original_code": "void get_sensor_readings_in_room(struct Robot *bot, struct Room *room, struct Robot_Params *params, double *sensor_inputs) {\n int i;\n double s_length = params->dist_sensor_length + params->radius;\n for ( i=0; i<params->num_dist_sensors; i++ ) {\n double s_x = cos(bot->heading + params->dist_sensor_pos[i]) * s_length;\n double s_y = sin(bot->heading + params->dist_sensor_pos[i]) * s_length;\n double depth_x = 0; double depth_y = 0;\n if ( bot->x + s_x < 0 )\n depth_x = -(bot->x + s_x) / s_x;\n else if ( bot->x + s_x > room->x )\n depth_x = (bot->x + s_x - room->x) / s_x;\n if ( bot->y + s_y < 0 )\n depth_y = -(bot->y + s_y) / s_y;\n else if ( bot->y + s_y > room->y )\n depth_y = (bot->y + s_y - room->y) / s_y;\n double reading = ((depth_x)>(depth_y)?(depth_x):(depth_y)) * s_length / params->dist_sensor_length;\n sensor_inputs[i] = params->invert_dist_sensors ? 1-reading : reading;\n }\n}",
"variable_types": [
[
"bot",
"struct Robot { double x; double heading; } *"
],
[
"room",
"struct Room { double x; } *"
],
[
"params",
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; } *"
],
[
"sensor_inputs",
"double *"
],
[
"i",
"int"
],
[
"s_length",
"double"
],
[
"s_x",
"double"
],
[
"s_y",
"double"
],
[
"depth_x",
"double"
],
[
"depth_y",
"double"
],
[
"reading",
"double"
]
],
"return_type": "void",
"user_defined_types": [
"struct Robot { double x; double heading; }",
"struct Room { double x; }",
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; }"
],
"binary_hash": "810a714d2b7b8bd314254acab419347c5abe4c792ef90da0e8b8822f9af01ec4"
},
{
"name": "move_robot_in_tilemaze",
"canonical_name": "func3",
"repo": "kernfel/fNEAT",
"decompiled_code": "double *__fastcall move_robot_in_tilemaze(double *a1, __int64 a2, double *a3, double *a4)\n{\ndouble *result; // rax\ndouble v5; // xmm0_8\ndouble v6; // xmm0_8\ndouble v7; // xmm0_8\ndouble v8; // xmm1_8\ndouble v9; // xmm0_8\ndouble v10; // xmm0_8\ndouble v11; // xmm0_8\ndouble v14; // [rsp+38h] [rbp-C8h]\ndouble v15; // [rsp+48h] [rbp-B8h]\ndouble v16; // [rsp+50h] [rbp-B0h]\ndouble v17; // [rsp+58h] [rbp-A8h]\ndouble v18; // [rsp+60h] [rbp-A0h]\ndouble v19; // [rsp+68h] [rbp-98h]\ndouble v20; // [rsp+70h] [rbp-90h]\ndouble v21; // [rsp+78h] [rbp-88h]\ndouble v22; // [rsp+90h] [rbp-70h]\ndouble v23; // [rsp+98h] [rbp-68h]\ndouble v24; // [rsp+A0h] [rbp-60h]\ndouble v25; // [rsp+A8h] [rbp-58h]\ndouble v26; // [rsp+B0h] [rbp-50h]\ndouble v27; // [rsp+B8h] [rbp-48h]\nint v28; // [rsp+C0h] [rbp-40h]\nint v29; // [rsp+C4h] [rbp-3Ch]\nint v30; // [rsp+C8h] [rbp-38h]\nint v31; // [rsp+CCh] [rbp-34h]\ndouble v32; // [rsp+D0h] [rbp-30h]\ndouble v33; // [rsp+D8h] [rbp-28h]\ndouble v34; // [rsp+E0h] [rbp-20h]\ndouble v35; // [rsp+E8h] [rbp-18h]\ndouble v36; // [rsp+F0h] [rbp-10h]\ndouble v37; // [rsp+F8h] [rbp-8h]\ndouble v38; // [rsp+F8h] [rbp-8h]\n\nadjust_heading((__int64)a1, (__int64)a3, (__int64)a4);\nv37 = *a4;\nresult = a3;\nif ( fabs(*a4) > a3[2] )\n{\nif ( v37 <= 0.0 )\nv38 = a3[2] + v37;\nelse\nv38 = v37 - a3[2];\nv35 = a3[1] * (cos(a1[2]) * v38);\nv34 = a3[1] * (sin(a1[2]) * v38);\nif ( v35 <= 0.0 )\nv5 = v35 - *a3;\nelse\nv5 = *a3 + v35;\nv33 = v5;\nif ( v34 <= 0.0 )\nv6 = v34 - *a3;\nelse\nv6 = *a3 + v34;\nv32 = v6;\nv31 = (int)(*a1 / *(double *)a2);\nv30 = (int)(a1[1] / *(double *)a2);\nv29 = (int)((*a1 + v33) / *(double *)a2) - v31;\nv28 = (int)((a1[1] + v6) / *(double *)a2) - v30;\nif ( v29 <= 0 )\nv7 = (double)v31;\nelse\nv7 = (double)(v31 + 1);\nv27 = (*a1 + v33 - *(double *)a2 * v7) / v33;\nif ( v28 <= 0 )\nv9 = (double)v30;\nelse\nv9 = (double)(v30 + 1);\nv8 = a1[1] + v32;\nv26 = (v8 - *(double *)a2 * v9) / v32;\nv36 = 0.0;\nif ( v29\n&& !v28\n&& ((int)((*a1 + v33) / *(double *)a2) == *(_DWORD *)(a2 + 8)\n|| (int)((*a1 + v33) / *(double *)a2) == -1\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + (int)((*a1 + v33) / *(double *)a2) + v30 * *(_DWORD *)(a2 + 8))) )\n{\nv36 = v27;\n}\nelse if ( v28\n&& !v29\n&& (v28 + v30 == *(_DWORD *)(a2 + 12)\n|| v30 + v28 == -1\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + *(_DWORD *)(a2 + 8) * (v30 + v28) + v31)) )\n{\nv36 = (v8 - *(double *)a2 * v9) / v32;\n}\nelse if ( v29 && v28 )\n{\nv25 = v34 / sqrt(v35 * v35 + v34 * v34);\nv24 = -v35 / sqrt(v35 * v35 + v34 * v34);\nv23 = *(double *)a2 * (fabs(v25) + fabs(v24)) / 2.0;\nv22 = (a1[1] + v34) * v24 + (*a1 + v35) * v25;\nif ( v29 + v31 == *(_DWORD *)(a2 + 8) || v31 + v29 == -1 )\n{\nv36 = v27;\n}\nelse if ( !*(_BYTE *)(*(_QWORD *)(a2 + 16) + v29 + v31 + v30 * *(_DWORD *)(a2 + 8))\n&& *a3 + v23 > fabs(v22 - (((double)v30 + 0.5) * v24 + ((double)(v31 + v29) + 0.5) * v25) * *(double *)a2) )\n{\nv36 = v27;\n}\nif ( v28 + v30 == *(_DWORD *)(a2 + 12) || v30 + v28 == -1 )\n{\nif ( v36 <= v26 )\nv10 = v26;\nelse\nv10 = v36;\nv36 = v10;\n}\nelse if ( !*(_BYTE *)(*(_QWORD *)(a2 + 16) + *(_DWORD *)(a2 + 8) * (v30 + v28) + v31)\n&& *a3 + v23 > fabs(v22 - (((double)(v30 + v28) + 0.5) * v24 + ((double)v31 + 0.5) * v25) * *(double *)a2) )\n{\nif ( v36 <= v26 )\nv11 = v26;\nelse\nv11 = v36;\nv36 = v11;\n}\nif ( v36 == 0.0 && !*(_BYTE *)(*(_QWORD *)(a2 + 16) + v31 + v29 + (v30 + v28) * *(_DWORD *)(a2 + 8)) )\n{\nv21 = (double)((v29 > 0) + v31) * *(double *)a2;\nv20 = (double)((v28 > 0) + v30) * *(double *)a2;\nv19 = v24 * v20 + v25 * v21;\nif ( *a3 <= fabs(v22 - v19) )\n{\nif ( (v22 <= v19 || v35 >= 0.0 || v34 <= 0.0)\n&& (v19 <= v22 || v35 >= 0.0 || v34 >= 0.0)\n&& (v22 <= v19 || v35 <= 0.0 || v34 >= 0.0)\n&& (v19 <= v22 || v35 <= 0.0 || v34 <= 0.0) )\n{\nif ( v22 > v19 && v35 > 0.0 && v34 > 0.0\n|| v19 > v22 && v35 < 0.0 && v34 > 0.0\n|| v22 > v19 && v35 < 0.0 && v34 < 0.0\n|| v19 > v22 && v35 > 0.0 && v34 < 0.0 )\n{\nv36 = v26;\n}\n}\nelse\n{\nv36 = v27;\n}\n}\nelse\n{\nv18 = v21 - *a1;\nv17 = v20 - a1[1];\nv16 = sqrt(v35 * v35 + v34 * v34);\nv15 = (v17 * v34 + v18 * v35) / v16;\nv14 = sqrt(*a3 * *a3 - (v17 * v24 + v18 * v25) * (v17 * v24 + v18 * v25));\nif ( v16 > v15 - v14 )\nv36 = 1.0 - (v15 - v14) / v16;\n}\n}\n}\n*a1 = (1.0 - v36) * v35 + *a1;\nresult = a1;\na1[1] = (1.0 - v36) * v34 + a1[1];\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "double *__fastcall func3(double *a1, __int64 a2, double *a3, double *a4)\n{\ndouble *result; // rax\ndouble v5; // xmm0_8\ndouble v6; // xmm0_8\ndouble v7; // xmm0_8\ndouble v8; // xmm1_8\ndouble v9; // xmm0_8\ndouble v10; // xmm0_8\ndouble v11; // xmm0_8\ndouble v14; // [rsp+38h] [rbp-C8h]\ndouble v15; // [rsp+48h] [rbp-B8h]\ndouble v16; // [rsp+50h] [rbp-B0h]\ndouble v17; // [rsp+58h] [rbp-A8h]\ndouble v18; // [rsp+60h] [rbp-A0h]\ndouble v19; // [rsp+68h] [rbp-98h]\ndouble v20; // [rsp+70h] [rbp-90h]\ndouble v21; // [rsp+78h] [rbp-88h]\ndouble v22; // [rsp+90h] [rbp-70h]\ndouble v23; // [rsp+98h] [rbp-68h]\ndouble v24; // [rsp+A0h] [rbp-60h]\ndouble v25; // [rsp+A8h] [rbp-58h]\ndouble v26; // [rsp+B0h] [rbp-50h]\ndouble v27; // [rsp+B8h] [rbp-48h]\nint v28; // [rsp+C0h] [rbp-40h]\nint v29; // [rsp+C4h] [rbp-3Ch]\nint v30; // [rsp+C8h] [rbp-38h]\nint v31; // [rsp+CCh] [rbp-34h]\ndouble v32; // [rsp+D0h] [rbp-30h]\ndouble v33; // [rsp+D8h] [rbp-28h]\ndouble v34; // [rsp+E0h] [rbp-20h]\ndouble v35; // [rsp+E8h] [rbp-18h]\ndouble v36; // [rsp+F0h] [rbp-10h]\ndouble v37; // [rsp+F8h] [rbp-8h]\ndouble v38; // [rsp+F8h] [rbp-8h]\n\nfunc0((__int64)a1, (__int64)a3, (__int64)a4);\nv37 = *a4;\nresult = a3;\nif ( fabs(*a4) > a3[2] )\n{\nif ( v37 <= 0.0 )\nv38 = a3[2] + v37;\nelse\nv38 = v37 - a3[2];\nv35 = a3[1] * (cos(a1[2]) * v38);\nv34 = a3[1] * (sin(a1[2]) * v38);\nif ( v35 <= 0.0 )\nv5 = v35 - *a3;\nelse\nv5 = *a3 + v35;\nv33 = v5;\nif ( v34 <= 0.0 )\nv6 = v34 - *a3;\nelse\nv6 = *a3 + v34;\nv32 = v6;\nv31 = (int)(*a1 / *(double *)a2);\nv30 = (int)(a1[1] / *(double *)a2);\nv29 = (int)((*a1 + v33) / *(double *)a2) - v31;\nv28 = (int)((a1[1] + v6) / *(double *)a2) - v30;\nif ( v29 <= 0 )\nv7 = (double)v31;\nelse\nv7 = (double)(v31 + 1);\nv27 = (*a1 + v33 - *(double *)a2 * v7) / v33;\nif ( v28 <= 0 )\nv9 = (double)v30;\nelse\nv9 = (double)(v30 + 1);\nv8 = a1[1] + v32;\nv26 = (v8 - *(double *)a2 * v9) / v32;\nv36 = 0.0;\nif ( v29\n&& !v28\n&& ((int)((*a1 + v33) / *(double *)a2) == *(_DWORD *)(a2 + 8)\n|| (int)((*a1 + v33) / *(double *)a2) == -1\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + (int)((*a1 + v33) / *(double *)a2) + v30 * *(_DWORD *)(a2 + 8))) )\n{\nv36 = v27;\n}\nelse if ( v28\n&& !v29\n&& (v28 + v30 == *(_DWORD *)(a2 + 12)\n|| v30 + v28 == -1\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + *(_DWORD *)(a2 + 8) * (v30 + v28) + v31)) )\n{\nv36 = (v8 - *(double *)a2 * v9) / v32;\n}\nelse if ( v29 && v28 )\n{\nv25 = v34 / sqrt(v35 * v35 + v34 * v34);\nv24 = -v35 / sqrt(v35 * v35 + v34 * v34);\nv23 = *(double *)a2 * (fabs(v25) + fabs(v24)) / 2.0;\nv22 = (a1[1] + v34) * v24 + (*a1 + v35) * v25;\nif ( v29 + v31 == *(_DWORD *)(a2 + 8) || v31 + v29 == -1 )\n{\nv36 = v27;\n}\nelse if ( !*(_BYTE *)(*(_QWORD *)(a2 + 16) + v29 + v31 + v30 * *(_DWORD *)(a2 + 8))\n&& *a3 + v23 > fabs(v22 - (((double)v30 + 0.5) * v24 + ((double)(v31 + v29) + 0.5) * v25) * *(double *)a2) )\n{\nv36 = v27;\n}\nif ( v28 + v30 == *(_DWORD *)(a2 + 12) || v30 + v28 == -1 )\n{\nif ( v36 <= v26 )\nv10 = v26;\nelse\nv10 = v36;\nv36 = v10;\n}\nelse if ( !*(_BYTE *)(*(_QWORD *)(a2 + 16) + *(_DWORD *)(a2 + 8) * (v30 + v28) + v31)\n&& *a3 + v23 > fabs(v22 - (((double)(v30 + v28) + 0.5) * v24 + ((double)v31 + 0.5) * v25) * *(double *)a2) )\n{\nif ( v36 <= v26 )\nv11 = v26;\nelse\nv11 = v36;\nv36 = v11;\n}\nif ( v36 == 0.0 && !*(_BYTE *)(*(_QWORD *)(a2 + 16) + v31 + v29 + (v30 + v28) * *(_DWORD *)(a2 + 8)) )\n{\nv21 = (double)((v29 > 0) + v31) * *(double *)a2;\nv20 = (double)((v28 > 0) + v30) * *(double *)a2;\nv19 = v24 * v20 + v25 * v21;\nif ( *a3 <= fabs(v22 - v19) )\n{\nif ( (v22 <= v19 || v35 >= 0.0 || v34 <= 0.0)\n&& (v19 <= v22 || v35 >= 0.0 || v34 >= 0.0)\n&& (v22 <= v19 || v35 <= 0.0 || v34 >= 0.0)\n&& (v19 <= v22 || v35 <= 0.0 || v34 <= 0.0) )\n{\nif ( v22 > v19 && v35 > 0.0 && v34 > 0.0\n|| v19 > v22 && v35 < 0.0 && v34 > 0.0\n|| v22 > v19 && v35 < 0.0 && v34 < 0.0\n|| v19 > v22 && v35 > 0.0 && v34 < 0.0 )\n{\nv36 = v26;\n}\n}\nelse\n{\nv36 = v27;\n}\n}\nelse\n{\nv18 = v21 - *a1;\nv17 = v20 - a1[1];\nv16 = sqrt(v35 * v35 + v34 * v34);\nv15 = (v17 * v34 + v18 * v35) / v16;\nv14 = sqrt(*a3 * *a3 - (v17 * v24 + v18 * v25) * (v17 * v24 + v18 * v25));\nif ( v16 > v15 - v14 )\nv36 = 1.0 - (v15 - v14) / v16;\n}\n}\n}\n*a1 = (1.0 - v36) * v35 + *a1;\nresult = a1;\na1[1] = (1.0 - v36) * v34 + a1[1];\n}\nreturn result;\n}",
"original_code": "void move_robot_in_tilemaze( Robot *bot, TileMaze *maze, struct Robot_Params *params, double *controller_outputs ) {\n adjust_heading( bot, params, controller_outputs );\n double motor_output = controller_outputs[0];\n if ( fabs(motor_output) > params->motor_threshold ) {\n if ( motor_output > 0 )\n motor_output = motor_output - params->motor_threshold;\n else\n motor_output = motor_output + params->motor_threshold;\n double m_x = cos(bot->heading) * motor_output * params->motor_sensitivity;\n double m_y = sin(bot->heading) * motor_output * params->motor_sensitivity;\n double forward_x = m_x>0 ? m_x + params->radius : m_x - params->radius;\n double forward_y = m_y>0 ? m_y + params->radius : m_y - params->radius;\n int curtile_x = (int)(bot->x / maze->tile_width);\n int curtile_y = (int)(bot->y / maze->tile_width);\n int cross_x = (int)((bot->x + forward_x) / maze->tile_width) - curtile_x;\n int cross_y = (int)((bot->y + forward_y) / maze->tile_width) - curtile_y;\n double depth_x = (bot->x + forward_x - (cross_x>0 ? curtile_x+1 : curtile_x)*maze->tile_width) / forward_x;\n double depth_y = (bot->y + forward_y - (cross_y>0 ? curtile_y+1 : curtile_y)*maze->tile_width) / forward_y;\n double adjust=0;\n if ( cross_x && ! cross_y\n && ( curtile_x+cross_x == maze->x || curtile_x+cross_x == -1\n || ! maze->tiles[curtile_x+cross_x + maze->x*curtile_y]\n )\n ) {\n adjust = depth_x;\n } else if ( cross_y && ! cross_x\n && ( curtile_y+cross_y == maze->y || curtile_y+cross_y == -1\n || ! maze->tiles[curtile_x + maze->x*(curtile_y+cross_y)]\n )\n ) {\n adjust = depth_y;\n } else if ( cross_x && cross_y ) {\n double sep_axis_x = m_y / sqrt(m_x*m_x + m_y*m_y);\n double sep_axis_y = -m_x / sqrt(m_x*m_x + m_y*m_y);\n double proj_tile_halfwidth = (fabs(sep_axis_x) + fabs(sep_axis_y)) * maze->tile_width/2;\n double proj_bot = sep_axis_x*(bot->x+m_x) + sep_axis_y*(bot->y+m_y);\n if ( curtile_x+cross_x == maze->x || curtile_x+cross_x == -1 ) {\n adjust = depth_x;\n } else if ( ! maze->tiles[curtile_x+cross_x + maze->x*curtile_y] ) {\n double proj_tile_center = maze->tile_width * (sep_axis_x*(curtile_x+cross_x+0.5) + sep_axis_y*(curtile_y+0.5));\n if ( fabs(proj_bot - proj_tile_center) < params->radius + proj_tile_halfwidth ) {\n adjust = depth_x;\n }\n }\n if ( curtile_y+cross_y == maze->y || curtile_y+cross_y == -1 ) {\n adjust = ((adjust)>(depth_y)?(adjust):(depth_y));\n } else if ( ! maze->tiles[curtile_x + maze->x*(curtile_y+cross_y)] ) {\n double proj_tile_center = maze->tile_width * (sep_axis_x*(curtile_x+0.5) + sep_axis_y*(curtile_y+cross_y+0.5));\n if ( fabs(proj_bot - proj_tile_center) < params->radius + proj_tile_halfwidth ) {\n adjust = ((adjust)>(depth_y)?(adjust):(depth_y));\n }\n }\n if ( ! adjust && ! maze->tiles[curtile_x+cross_x + maze->x*(curtile_y+cross_y)] ) {\n double corner_x = maze->tile_width * (curtile_x + (cross_x>0?1:0)), corner_y = maze->tile_width * (curtile_y + (cross_y>0?1:0));\n double proj_corner = sep_axis_x*corner_x + sep_axis_y*corner_y;\n if ( fabs(proj_bot - proj_corner) < params->radius ) {\n double bc_x = corner_x - bot->x, bc_y = corner_y - bot->y;\n double norm_m = sqrt(m_x*m_x + m_y*m_y);\n double bf = (bc_x*m_x + bc_y*m_y) / norm_m;\n double fc = bc_x*sep_axis_x + bc_y*sep_axis_y;\n double fx = sqrt(params->radius*params->radius - fc*fc);\n if ( norm_m > bf - fx )\n adjust = 1 - (bf - fx)/norm_m;\n } else if ( (proj_bot > proj_corner && m_x < 0 && m_y > 0)\n || (proj_bot < proj_corner && m_x < 0 && m_y < 0)\n || (proj_bot > proj_corner && m_x > 0 && m_y < 0)\n || (proj_bot < proj_corner && m_x > 0 && m_y > 0) ) {\n adjust = depth_x;\n } else if ( (proj_bot > proj_corner && m_x > 0 && m_y > 0)\n || (proj_bot < proj_corner && m_x < 0 && m_y > 0)\n || (proj_bot > proj_corner && m_x < 0 && m_y < 0)\n || (proj_bot < proj_corner && m_x > 0 && m_y < 0) ) {\n adjust = depth_y;\n }\n }\n }\n bot->x += (1 - adjust) * m_x;\n bot->y += (1 - adjust) * m_y;\n }\n}",
"canonical_original_code": "void move_robot_in_tilemaze(struct Robot *bot, struct TileMaze *maze, struct Robot_Params *params, double *controller_outputs) {\n adjust_heading( bot, params, controller_outputs );\n double motor_output = controller_outputs[0];\n if ( fabs(motor_output) > params->motor_threshold ) {\n if ( motor_output > 0 )\n motor_output = motor_output - params->motor_threshold;\n else\n motor_output = motor_output + params->motor_threshold;\n double m_x = cos(bot->heading) * motor_output * params->motor_sensitivity;\n double m_y = sin(bot->heading) * motor_output * params->motor_sensitivity;\n double forward_x = m_x>0 ? m_x + params->radius : m_x - params->radius;\n double forward_y = m_y>0 ? m_y + params->radius : m_y - params->radius;\n int curtile_x = (int)(bot->x / maze->tile_width);\n int curtile_y = (int)(bot->y / maze->tile_width);\n int cross_x = (int)((bot->x + forward_x) / maze->tile_width) - curtile_x;\n int cross_y = (int)((bot->y + forward_y) / maze->tile_width) - curtile_y;\n double depth_x = (bot->x + forward_x - (cross_x>0 ? curtile_x+1 : curtile_x)*maze->tile_width) / forward_x;\n double depth_y = (bot->y + forward_y - (cross_y>0 ? curtile_y+1 : curtile_y)*maze->tile_width) / forward_y;\n double adjust = 0;\n if ( cross_x && ! cross_y\n && ( curtile_x+cross_x == maze->x || curtile_x+cross_x == -1\n || ! maze->tiles[curtile_x+cross_x + maze->x*curtile_y]\n )\n ) {\n adjust = depth_x;\n } else if ( cross_y && ! cross_x\n && ( curtile_y+cross_y == maze->y || curtile_y+cross_y == -1\n || ! maze->tiles[curtile_x + maze->x*(curtile_y+cross_y)]\n )\n ) {\n adjust = depth_y;\n } else if ( cross_x && cross_y ) {\n double sep_axis_x = m_y / sqrt(m_x*m_x + m_y*m_y);\n double sep_axis_y = -m_x / sqrt(m_x*m_x + m_y*m_y);\n double proj_tile_halfwidth = (fabs(sep_axis_x) + fabs(sep_axis_y)) * maze->tile_width/2;\n double proj_bot = sep_axis_x*(bot->x+m_x) + sep_axis_y*(bot->y+m_y);\n if ( curtile_x+cross_x == maze->x || curtile_x+cross_x == -1 ) {\n adjust = depth_x;\n } else if ( ! maze->tiles[curtile_x+cross_x + maze->x*curtile_y] ) {\n double proj_tile_center = maze->tile_width * (sep_axis_x*(curtile_x+cross_x+0.5) + sep_axis_y*(curtile_y+0.5));\n if ( fabs(proj_bot - proj_tile_center) < params->radius + proj_tile_halfwidth ) {\n adjust = depth_x;\n }\n }\n if ( curtile_y+cross_y == maze->y || curtile_y+cross_y == -1 ) {\n adjust = ((adjust)>(depth_y)?(adjust):(depth_y));\n } else if ( ! maze->tiles[curtile_x + maze->x*(curtile_y+cross_y)] ) {\n double proj_tile_center = maze->tile_width * (sep_axis_x*(curtile_x+0.5) + sep_axis_y*(curtile_y+cross_y+0.5));\n if ( fabs(proj_bot - proj_tile_center) < params->radius + proj_tile_halfwidth ) {\n adjust = ((adjust)>(depth_y)?(adjust):(depth_y));\n }\n }\n if ( ! adjust && ! maze->tiles[curtile_x+cross_x + maze->x*(curtile_y+cross_y)] ) {\n double corner_x = maze->tile_width * (curtile_x + (cross_x>0?1:0)); double corner_y = maze->tile_width * (curtile_y + (cross_y>0?1:0));\n double proj_corner = sep_axis_x*corner_x + sep_axis_y*corner_y;\n if ( fabs(proj_bot - proj_corner) < params->radius ) {\n double bc_x = corner_x - bot->x; double bc_y = corner_y - bot->y;\n double norm_m = sqrt(m_x*m_x + m_y*m_y);\n double bf = (bc_x*m_x + bc_y*m_y) / norm_m;\n double fc = bc_x*sep_axis_x + bc_y*sep_axis_y;\n double fx = sqrt(params->radius*params->radius - fc*fc);\n if ( norm_m > bf - fx )\n adjust = 1 - (bf - fx)/norm_m;\n } else if ( (proj_bot > proj_corner && m_x < 0 && m_y > 0)\n || (proj_bot < proj_corner && m_x < 0 && m_y < 0)\n || (proj_bot > proj_corner && m_x > 0 && m_y < 0)\n || (proj_bot < proj_corner && m_x > 0 && m_y > 0) ) {\n adjust = depth_x;\n } else if ( (proj_bot > proj_corner && m_x > 0 && m_y > 0)\n || (proj_bot < proj_corner && m_x < 0 && m_y > 0)\n || (proj_bot > proj_corner && m_x < 0 && m_y < 0)\n || (proj_bot < proj_corner && m_x > 0 && m_y < 0) ) {\n adjust = depth_y;\n }\n }\n }\n bot->x += (1 - adjust) * m_x;\n bot->y += (1 - adjust) * m_y;\n }\n}",
"variable_types": [
[
"bot",
"struct Robot { double x; double heading; } *"
],
[
"maze",
"struct TileMaze { double tile_width; int x; unsigned char *tiles; } *"
],
[
"params",
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; } *"
],
[
"controller_outputs",
"double *"
],
[
"motor_output",
"double"
],
[
"m_x",
"double"
],
[
"m_y",
"double"
],
[
"forward_x",
"double"
],
[
"forward_y",
"double"
],
[
"curtile_x",
"int"
],
[
"curtile_y",
"int"
],
[
"cross_x",
"int"
],
[
"cross_y",
"int"
],
[
"depth_x",
"double"
],
[
"depth_y",
"double"
],
[
"adjust",
"double"
],
[
"sep_axis_x",
"double"
],
[
"sep_axis_y",
"double"
],
[
"proj_tile_halfwidth",
"double"
],
[
"proj_bot",
"double"
],
[
"proj_tile_center",
"double"
],
[
"corner_x",
"double"
],
[
"corner_y",
"double"
],
[
"proj_corner",
"double"
],
[
"bc_x",
"double"
],
[
"bc_y",
"double"
],
[
"norm_m",
"double"
],
[
"bf",
"double"
],
[
"fc",
"double"
],
[
"fx",
"double"
]
],
"return_type": "void",
"user_defined_types": [
"struct Robot { double x; double heading; }",
"struct TileMaze { double tile_width; int x; unsigned char *tiles; }",
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; }"
],
"binary_hash": "810a714d2b7b8bd314254acab419347c5abe4c792ef90da0e8b8822f9af01ec4"
},
{
"name": "get_sensor_readings_in_tilemaze",
"canonical_name": "func4",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall get_sensor_readings_in_tilemaze(double *a1, __int64 a2, __int64 a3, __int64 a4)\n{\n__int64 v4; // xmm0_8\ndouble v5; // xmm0_8\ndouble v6; // xmm1_8\ndouble v7; // xmm0_8\ndouble v8; // xmm0_8\n__int64 result; // rax\ndouble v12; // [rsp+28h] [rbp-58h]\nint v13; // [rsp+30h] [rbp-50h]\nint v14; // [rsp+34h] [rbp-4Ch]\nint v15; // [rsp+38h] [rbp-48h]\nint v16; // [rsp+3Ch] [rbp-44h]\ndouble v17; // [rsp+40h] [rbp-40h]\ndouble v18; // [rsp+48h] [rbp-38h]\ndouble v19; // [rsp+50h] [rbp-30h]\ndouble v20; // [rsp+58h] [rbp-28h]\ndouble v21; // [rsp+60h] [rbp-20h]\ndouble v22; // [rsp+68h] [rbp-18h]\ndouble v23; // [rsp+70h] [rbp-10h]\nint i; // [rsp+7Ch] [rbp-4h]\n\nfor ( i = 0; ; ++i )\n{\nresult = *(unsigned int *)(a3 + 40);\nif ( i >= (int)result )\nbreak;\nv22 = cos(a1[2] + *(double *)(*(_QWORD *)(a3 + 56) + 8LL * i));\nv21 = sin(a1[2] + *(double *)(*(_QWORD *)(a3 + 56) + 8LL * i));\nv20 = *(double *)(a3 + 48) * v22;\nv19 = *(double *)(a3 + 48) * v21;\nv18 = *(double *)a3 * v22 + *a1;\nv17 = *(double *)a3 * v21 + a1[1];\nv16 = (int)(v18 / *(double *)a2);\nv15 = (int)(v17 / *(double *)a2);\nv14 = (int)((v18 + v20) / *(double *)a2) - v16;\nv13 = (int)((v17 + v19) / *(double *)a2) - v15;\nif ( *(_BYTE *)(a3 + 64) )\nv4 = 0x3FF0000000000000LL;\nelse\nv4 = 0LL;\n*(_QWORD *)(8LL * i + a4) = v4;\nif ( v14 || v13 )\n{\nv23 = 0.0;\nif ( v14 <= 0 )\nv5 = (double)v16;\nelse\nv5 = (double)(v16 + 1);\nv12 = (v18 + v20 - *(double *)a2 * v5) / v20;\nif ( v13 <= 0 )\nv7 = (double)v15;\nelse\nv7 = (double)(v15 + 1);\nv6 = v17 + v19;\nif ( v14\n&& !v13\n&& (v14 + v16 == *(_DWORD *)(a2 + 8)\n|| v16 + v14 == -1\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + v14 + v16 + v15 * *(_DWORD *)(a2 + 8))) )\n{\nv23 = v12;\n}\nelse if ( v13\n&& !v14\n&& (v13 + v15 == *(_DWORD *)(a2 + 12)\n|| v15 + v13 == -1\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + *(_DWORD *)(a2 + 8) * (v15 + v13) + v16)) )\n{\nv23 = (v6 - *(double *)a2 * v7) / v19;\n}\nelse if ( v14 && v13 )\n{\nif ( v12 <= (v17 + v19 - *(double *)a2 * v7) / v19 )\n{\nif ( v15 + v13 == -1\n|| v13 + v15 == *(_DWORD *)(a2 + 12)\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + *(_DWORD *)(a2 + 8) * (v15 + v13) + v16) )\n{\nv23 = (v6 - *(double *)a2 * v7) / v19;\n}\nelse if ( v16 + v14 == -1\n|| v14 + v16 == *(_DWORD *)(a2 + 8)\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + v16 + v14 + (v15 + v13) * *(_DWORD *)(a2 + 8)) )\n{\nv23 = v12;\n}\n}\nelse if ( v16 + v14 == -1\n|| v14 + v16 == *(_DWORD *)(a2 + 8)\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + v14 + v16 + v15 * *(_DWORD *)(a2 + 8)) )\n{\nv23 = v12;\n}\nelse if ( v15 + v13 == -1\n|| v13 + v15 == *(_DWORD *)(a2 + 12)\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + v16 + v14 + (v15 + v13) * *(_DWORD *)(a2 + 8)) )\n{\nv23 = (v6 - *(double *)a2 * v7) / v19;\n}\n}\nif ( *(_BYTE *)(a3 + 64) )\nv8 = 1.0 - v23;\nelse\nv8 = v23;\n*(double *)(8LL * i + a4) = v8;\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(double *a1, __int64 a2, __int64 a3, __int64 a4)\n{\n__int64 v4; // xmm0_8\ndouble v5; // xmm0_8\ndouble v6; // xmm1_8\ndouble v7; // xmm0_8\ndouble v8; // xmm0_8\n__int64 result; // rax\ndouble v12; // [rsp+28h] [rbp-58h]\nint v13; // [rsp+30h] [rbp-50h]\nint v14; // [rsp+34h] [rbp-4Ch]\nint v15; // [rsp+38h] [rbp-48h]\nint v16; // [rsp+3Ch] [rbp-44h]\ndouble v17; // [rsp+40h] [rbp-40h]\ndouble v18; // [rsp+48h] [rbp-38h]\ndouble v19; // [rsp+50h] [rbp-30h]\ndouble v20; // [rsp+58h] [rbp-28h]\ndouble v21; // [rsp+60h] [rbp-20h]\ndouble v22; // [rsp+68h] [rbp-18h]\ndouble v23; // [rsp+70h] [rbp-10h]\nint i; // [rsp+7Ch] [rbp-4h]\n\nfor ( i = 0; ; ++i )\n{\nresult = *(unsigned int *)(a3 + 40);\nif ( i >= (int)result )\nbreak;\nv22 = cos(a1[2] + *(double *)(*(_QWORD *)(a3 + 56) + 8LL * i));\nv21 = sin(a1[2] + *(double *)(*(_QWORD *)(a3 + 56) + 8LL * i));\nv20 = *(double *)(a3 + 48) * v22;\nv19 = *(double *)(a3 + 48) * v21;\nv18 = *(double *)a3 * v22 + *a1;\nv17 = *(double *)a3 * v21 + a1[1];\nv16 = (int)(v18 / *(double *)a2);\nv15 = (int)(v17 / *(double *)a2);\nv14 = (int)((v18 + v20) / *(double *)a2) - v16;\nv13 = (int)((v17 + v19) / *(double *)a2) - v15;\nif ( *(_BYTE *)(a3 + 64) )\nv4 = 0x3FF0000000000000LL;\nelse\nv4 = 0LL;\n*(_QWORD *)(8LL * i + a4) = v4;\nif ( v14 || v13 )\n{\nv23 = 0.0;\nif ( v14 <= 0 )\nv5 = (double)v16;\nelse\nv5 = (double)(v16 + 1);\nv12 = (v18 + v20 - *(double *)a2 * v5) / v20;\nif ( v13 <= 0 )\nv7 = (double)v15;\nelse\nv7 = (double)(v15 + 1);\nv6 = v17 + v19;\nif ( v14\n&& !v13\n&& (v14 + v16 == *(_DWORD *)(a2 + 8)\n|| v16 + v14 == -1\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + v14 + v16 + v15 * *(_DWORD *)(a2 + 8))) )\n{\nv23 = v12;\n}\nelse if ( v13\n&& !v14\n&& (v13 + v15 == *(_DWORD *)(a2 + 12)\n|| v15 + v13 == -1\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + *(_DWORD *)(a2 + 8) * (v15 + v13) + v16)) )\n{\nv23 = (v6 - *(double *)a2 * v7) / v19;\n}\nelse if ( v14 && v13 )\n{\nif ( v12 <= (v17 + v19 - *(double *)a2 * v7) / v19 )\n{\nif ( v15 + v13 == -1\n|| v13 + v15 == *(_DWORD *)(a2 + 12)\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + *(_DWORD *)(a2 + 8) * (v15 + v13) + v16) )\n{\nv23 = (v6 - *(double *)a2 * v7) / v19;\n}\nelse if ( v16 + v14 == -1\n|| v14 + v16 == *(_DWORD *)(a2 + 8)\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + v16 + v14 + (v15 + v13) * *(_DWORD *)(a2 + 8)) )\n{\nv23 = v12;\n}\n}\nelse if ( v16 + v14 == -1\n|| v14 + v16 == *(_DWORD *)(a2 + 8)\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + v14 + v16 + v15 * *(_DWORD *)(a2 + 8)) )\n{\nv23 = v12;\n}\nelse if ( v15 + v13 == -1\n|| v13 + v15 == *(_DWORD *)(a2 + 12)\n|| !*(_BYTE *)(*(_QWORD *)(a2 + 16) + v16 + v14 + (v15 + v13) * *(_DWORD *)(a2 + 8)) )\n{\nv23 = (v6 - *(double *)a2 * v7) / v19;\n}\n}\nif ( *(_BYTE *)(a3 + 64) )\nv8 = 1.0 - v23;\nelse\nv8 = v23;\n*(double *)(8LL * i + a4) = v8;\n}\n}\nreturn result;\n}",
"original_code": "void get_sensor_readings_in_tilemaze( Robot *bot, TileMaze *maze, struct Robot_Params *params, double *sensor_inputs ) {\n int i;\n for ( i=0; i<params->num_dist_sensors; i++ ) {\n double s_cos = cos(bot->heading + params->dist_sensor_pos[i]);\n double s_sin = sin(bot->heading + params->dist_sensor_pos[i]);\n double s_x = s_cos * params->dist_sensor_length;\n double s_y = s_sin * params->dist_sensor_length;\n double root_x = bot->x + s_cos * params->radius;\n double root_y = bot->y + s_sin * params->radius;\n int root_tile_x = (int)(root_x / maze->tile_width);\n int root_tile_y = (int)(root_y / maze->tile_width);\n int cross_x = (int)((root_x + s_x) / maze->tile_width) - root_tile_x;\n int cross_y = (int)((root_y + s_y) / maze->tile_width) - root_tile_y;\n sensor_inputs[i] = params->invert_dist_sensors ? 1 : 0;\n if ( ! cross_x && ! cross_y )\n continue;\n double reading=0;\n double depth_x = (root_x + s_x - (cross_x>0 ? root_tile_x+1 : root_tile_x)*maze->tile_width) / s_x;\n double depth_y = (root_y + s_y - (cross_y>0 ? root_tile_y+1 : root_tile_y)*maze->tile_width) / s_y;\n if ( cross_x && ! cross_y\n && ( root_tile_x+cross_x == maze->x || root_tile_x+cross_x == -1\n || ! maze->tiles[root_tile_x+cross_x + maze->x*root_tile_y]\n )\n ) {\n reading = depth_x;\n } else if ( cross_y && ! cross_x\n && ( root_tile_y+cross_y == maze->y || root_tile_y+cross_y == -1\n || ! maze->tiles[root_tile_x + maze->x*(root_tile_y+cross_y)]\n )\n ) {\n reading = depth_y;\n } else if ( cross_x && cross_y ) {\n if ( depth_x > depth_y ) {\n if ( root_tile_x+cross_x == -1 || root_tile_x+cross_x == maze->x || ! maze->tiles[root_tile_x+cross_x + maze->x*root_tile_y] )\n reading = depth_x;\n else if ( root_tile_y+cross_y == -1 || root_tile_y+cross_y == maze->y || ! maze->tiles[root_tile_x+cross_x + maze->x*(root_tile_y+cross_y)] )\n reading = depth_y;\n } else {\n if ( root_tile_y+cross_y == -1 || root_tile_y+cross_y == maze->y || ! maze->tiles[root_tile_x + maze->x*(root_tile_y+cross_y)] )\n reading = depth_y;\n else if ( root_tile_x+cross_x == -1 || root_tile_x+cross_x == maze->x || ! maze->tiles[root_tile_x+cross_x + maze->x*(root_tile_y+cross_y)] )\n reading = depth_x;\n }\n }\n sensor_inputs[i] = params->invert_dist_sensors ? 1-reading : reading;\n }\n}",
"canonical_original_code": "void get_sensor_readings_in_tilemaze(struct Robot *bot, struct TileMaze *maze, struct Robot_Params *params, double *sensor_inputs) {\n int i;\n for ( i=0; i<params->num_dist_sensors; i++ ) {\n double s_cos = cos(bot->heading + params->dist_sensor_pos[i]);\n double s_sin = sin(bot->heading + params->dist_sensor_pos[i]);\n double s_x = s_cos * params->dist_sensor_length;\n double s_y = s_sin * params->dist_sensor_length;\n double root_x = bot->x + s_cos * params->radius;\n double root_y = bot->y + s_sin * params->radius;\n int root_tile_x = (int)(root_x / maze->tile_width);\n int root_tile_y = (int)(root_y / maze->tile_width);\n int cross_x = (int)((root_x + s_x) / maze->tile_width) - root_tile_x;\n int cross_y = (int)((root_y + s_y) / maze->tile_width) - root_tile_y;\n sensor_inputs[i] = params->invert_dist_sensors ? 1 : 0;\n if ( ! cross_x && ! cross_y )\n continue;\n double reading = 0;\n double depth_x = (root_x + s_x - (cross_x>0 ? root_tile_x+1 : root_tile_x)*maze->tile_width) / s_x;\n double depth_y = (root_y + s_y - (cross_y>0 ? root_tile_y+1 : root_tile_y)*maze->tile_width) / s_y;\n if ( cross_x && ! cross_y\n && ( root_tile_x+cross_x == maze->x || root_tile_x+cross_x == -1\n || ! maze->tiles[root_tile_x+cross_x + maze->x*root_tile_y]\n )\n ) {\n reading = depth_x;\n } else if ( cross_y && ! cross_x\n && ( root_tile_y+cross_y == maze->y || root_tile_y+cross_y == -1\n || ! maze->tiles[root_tile_x + maze->x*(root_tile_y+cross_y)]\n )\n ) {\n reading = depth_y;\n } else if ( cross_x && cross_y ) {\n if ( depth_x > depth_y ) {\n if ( root_tile_x+cross_x == -1 || root_tile_x+cross_x == maze->x || ! maze->tiles[root_tile_x+cross_x + maze->x*root_tile_y] )\n reading = depth_x;\n else if ( root_tile_y+cross_y == -1 || root_tile_y+cross_y == maze->y || ! maze->tiles[root_tile_x+cross_x + maze->x*(root_tile_y+cross_y)] )\n reading = depth_y;\n } else {\n if ( root_tile_y+cross_y == -1 || root_tile_y+cross_y == maze->y || ! maze->tiles[root_tile_x + maze->x*(root_tile_y+cross_y)] )\n reading = depth_y;\n else if ( root_tile_x+cross_x == -1 || root_tile_x+cross_x == maze->x || ! maze->tiles[root_tile_x+cross_x + maze->x*(root_tile_y+cross_y)] )\n reading = depth_x;\n }\n }\n sensor_inputs[i] = params->invert_dist_sensors ? 1-reading : reading;\n }\n}",
"variable_types": [
[
"bot",
"struct Robot { double x; double heading; } *"
],
[
"maze",
"struct TileMaze { double tile_width; int x; unsigned char *tiles; } *"
],
[
"params",
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; } *"
],
[
"sensor_inputs",
"double *"
],
[
"i",
"int"
],
[
"s_cos",
"double"
],
[
"s_sin",
"double"
],
[
"s_x",
"double"
],
[
"s_y",
"double"
],
[
"root_x",
"double"
],
[
"root_y",
"double"
],
[
"root_tile_x",
"int"
],
[
"root_tile_y",
"int"
],
[
"cross_x",
"int"
],
[
"cross_y",
"int"
],
[
"reading",
"double"
],
[
"depth_x",
"double"
],
[
"depth_y",
"double"
]
],
"return_type": "void",
"user_defined_types": [
"struct Robot { double x; double heading; }",
"struct TileMaze { double tile_width; int x; unsigned char *tiles; }",
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; }"
],
"binary_hash": "810a714d2b7b8bd314254acab419347c5abe4c792ef90da0e8b8822f9af01ec4"
}
] |
97b1d029edbc4fb6b37a0f73c9c21d498e972fa027dbec6e4101811a75a26803 | kernfel/fNEAT | [
[
"create_pNetwork",
"->",
"delete_pNetwork"
],
[
"delete_pNetwork",
"->",
"create_pNetwork"
],
[
"dump_pNetwork",
"->"
],
[
"add_pNode",
"->",
"connect_pNet",
"build_pNetwork"
],
[
"add_pLink",
"->",
"connect_pNet"
],
[
"connect_pNet",
"->",
"add_pNode",
"add_pLink"
],
[
"build_pNetwork",
"->",
"add_pNode",
"backtrack"
],
[
"backtrack",
"->",
"build_pNetwork"
]
] | [
[
"dump_pNetwork",
"__int64 __fastcall func2(__int64 a1, FILE *a2)\n{\nconst char *v2; // rdx\nconst char *v3; // rcx\n__int64 result; // rax\nchar src[9]; // [rsp+16h] [rbp-3Ah] BYREF\nchar v6[9]; // [rsp+1Fh] [rbp-31h] BYREF\nchar s[8]; // [rsp+28h] [rbp-28h] BYREF\nchar dest[16]; // [rsp+30h] [rbp-20h] BYREF\nunsigned int v9; // [rsp+40h] [rbp-10h]\nint v10; // [rsp+44h] [rbp-Ch]\nint j; // [rsp+48h] [rbp-8h]\nunsigned int i; // [rsp+4Ch] [rbp-4h]\n\nv10 = -1;\nfor ( i = 0; i < *(_DWORD *)a1; ++i )\n{\nv9 = (unsigned __int8)i;\nif ( !(_BYTE)i )\n++v10;\ndest[0] = 0;\nfor ( j = 0; j <= 0; ++j )\n{\nsprintf(s, \"%+5.4f, \", *(double *)(*(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL * v10) + 24LL * (int)v9 + 8LL * j));\nstrcat(dest, s);\n}\nif ( i < *(_DWORD *)(a1 + 24) )\n{\nv2 = \"input\";\n}\nelse if ( i >= *(_DWORD *)(a1 + 24) + *(_DWORD *)(a1 + 28) )\n{\nv2 = \"hidden\";\n}\nelse\n{\nv2 = \"output\";\n}\nfprintf(\na2,\n\"0x%08x | %s | %d | %s\\n\",\n(unsigned int)*(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL * v10) + 24 * v9,\nv2,\n*(unsigned __int8 *)(*(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL * v10) + 24LL * (int)v9 + 16),\ndest);\n}\nv10 = -1;\nfor ( i = 0; ; ++i )\n{\nresult = *(unsigned int *)(a1 + 32);\nif ( i >= (unsigned int)result )\nbreak;\nv9 = i & 0x3FF;\nif ( (i & 0x3FF) == 0 )\n++v10;\nv6[0] = 0;\nfor ( j = 0; j <= 0; ++j )\n{\nif ( j >= 0 )\nv3 = \"%+6.4f\";\nelse\nv3 = \"%+6.4f, \";\nsprintf(src, v3, *(double *)(*(_QWORD *)(*(_QWORD *)(a1 + 48) + 8LL * v10) + 32LL * (int)v9 + 8 * (j + 2LL)));\nstrcat(v6, src);\n}\nfprintf(\na2,\n\"0x%08x | %d | 0x%08x > 0x%08x | %s\\n\",\n(unsigned int)*(_QWORD *)(*(_QWORD *)(a1 + 48) + 8LL * v10) + 32 * v9,\n*(unsigned __int8 *)(*(_QWORD *)(*(_QWORD *)(a1 + 48) + 8LL * v10) + 32LL * (int)v9 + 24),\n(unsigned int)*(_QWORD *)(*(_QWORD *)(*(_QWORD *)(a1 + 48) + 8LL * v10) + 32LL * (int)v9),\n(unsigned int)*(_QWORD *)(*(_QWORD *)(*(_QWORD *)(a1 + 48) + 8LL * v10) + 32LL * (int)v9 + 8),\nv6);\n}\nreturn result;\n}"
]
] | [
{
"name": "create_pNetwork",
"canonical_name": "func0",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall create_pNetwork(__int64 a1)\n{\n__int64 result; // rax\nunsigned int v2; // [rsp+1Ch] [rbp-4h]\nunsigned int v3; // [rsp+1Ch] [rbp-4h]\n\n*(_QWORD *)(a1 + 16) = 0LL;\n*(_QWORD *)(a1 + 48) = 0LL;\nv2 = Malloc_(a1 + 16, 8LL);\nif ( v2 || (v2 = Malloc_(a1 + 48, 8LL)) != 0 )\n{\nfree(*(void **)(a1 + 16));\nresult = v2;\n}\nelse\n{\n**(_QWORD **)(a1 + 16) = 0LL;\n*(_DWORD *)a1 = 0;\n*(_DWORD *)(a1 + 8) = 1;\n*(_DWORD *)(a1 + 24) = 0;\n*(_DWORD *)(a1 + 28) = 0;\n**(_QWORD **)(a1 + 48) = 0LL;\n*(_DWORD *)(a1 + 32) = 0;\n*(_DWORD *)(a1 + 40) = 1;\nv3 = Malloc_(*(_QWORD *)(a1 + 16), 6144LL);\nif ( v3 || (v3 = Malloc_(*(_QWORD *)(a1 + 48), 0x8000LL)) != 0 )\n{\ndelete_pNetwork(a1);\nresult = v3;\n}\nelse\n{\nresult = 0LL;\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1)\n{\n__int64 result; // rax\nunsigned int v2; // [rsp+1Ch] [rbp-4h]\nunsigned int v3; // [rsp+1Ch] [rbp-4h]\n\n*(_QWORD *)(a1 + 16) = 0LL;\n*(_QWORD *)(a1 + 48) = 0LL;\nv2 = Malloc_(a1 + 16, 8LL);\nif ( v2 || (v2 = Malloc_(a1 + 48, 8LL)) != 0 )\n{\nfree(*(void **)(a1 + 16));\nresult = v2;\n}\nelse\n{\n**(_QWORD **)(a1 + 16) = 0LL;\n*(_DWORD *)a1 = 0;\n*(_DWORD *)(a1 + 8) = 1;\n*(_DWORD *)(a1 + 24) = 0;\n*(_DWORD *)(a1 + 28) = 0;\n**(_QWORD **)(a1 + 48) = 0LL;\n*(_DWORD *)(a1 + 32) = 0;\n*(_DWORD *)(a1 + 40) = 1;\nv3 = Malloc_(*(_QWORD *)(a1 + 16), 6144LL);\nif ( v3 || (v3 = Malloc_(*(_QWORD *)(a1 + 48), 0x8000LL)) != 0 )\n{\nfunc1(a1);\nresult = v3;\n}\nelse\n{\nresult = 0LL;\n}\n}\nreturn result;\n}",
"original_code": "int create_pNetwork( pNetwork *n ) {\n int err=0;\n n->p_nodes = 0;\n n->p_links = 0;\n if (( err = Malloc_((void**)&n->p_nodes,sizeof *n->p_nodes) )\n || ( err = Malloc_((void**)&n->p_links,sizeof *n->p_links) ) ) {\n free( n->p_nodes );\n return err;\n }\n n->p_nodes[0] = 0;\n n->num_nodes = 0;\n n->num_node_blocks = 1;\n n->num_inputs = 0;\n n->num_outputs = 0;\n n->p_links[0] = 0;\n n->num_links = 0;\n n->num_link_blocks = 1;\n if (( err = Malloc_((void**)&n->p_nodes[0],256*sizeof **n->p_nodes) )\n || ( err = Malloc_((void**)&n->p_links[0],1024*sizeof **n->p_links) )) {\n delete_pNetwork( n );\n return err;\n }\n return err;\n}",
"canonical_original_code": "int create_pNetwork(struct pNetwork *n) {\n int err = 0;\n n->p_nodes = 0;\n n->p_links = 0;\n if (( err = Malloc_((void **)&n->p_nodes,sizeof *n->p_nodes) )\n || ( err = Malloc_((void **)&n->p_links,sizeof *n->p_links) ) ) {\n free( n->p_nodes );\n return err;\n }\n n->p_nodes[0] = 0;\n n->num_nodes = 0;\n n->num_node_blocks = 1;\n n->num_inputs = 0;\n n->num_outputs = 0;\n n->p_links[0] = 0;\n n->num_links = 0;\n n->num_link_blocks = 1;\n if (( err = Malloc_((void **)&n->p_nodes[0],256*sizeof **n->p_nodes) )\n || ( err = Malloc_((void **)&n->p_links[0],1024*sizeof **n->p_links) )) {\n delete_pNetwork( n );\n return err;\n }\n return err;\n}",
"variable_types": [
[
"n",
"struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *"
],
[
"err",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct pNetwork { unsigned int num_nodes; struct pNode **p_nodes; int num_inputs; unsigned int num_links; struct pLink **p_links; }",
"struct pNode { double x[2]; unsigned char used; unsigned int index; }",
"struct pLink { struct pNode *from; double r[1]; unsigned char used; }"
],
"binary_hash": "97b1d029edbc4fb6b37a0f73c9c21d498e972fa027dbec6e4101811a75a26803"
},
{
"name": "delete_pNetwork",
"canonical_name": "func1",
"repo": "kernfel/fNEAT",
"decompiled_code": "void __fastcall delete_pNetwork(__int64 a1)\n{\nunsigned int i; // [rsp+1Ch] [rbp-4h]\nunsigned int j; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; *(_DWORD *)(a1 + 8) > i; ++i )\nfree(*(void **)(*(_QWORD *)(a1 + 16) + 8LL * (int)i));\nfor ( j = 0; *(_DWORD *)(a1 + 40) > j; ++j )\nfree(*(void **)(*(_QWORD *)(a1 + 48) + 8LL * (int)j));\nfree(*(void **)(a1 + 16));\nfree(*(void **)(a1 + 48));\n}\n",
"canonical_decompiled_code": "void __fastcall func1(__int64 a1)\n{\nunsigned int i; // [rsp+1Ch] [rbp-4h]\nunsigned int j; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; *(_DWORD *)(a1 + 8) > i; ++i )\nfree(*(void **)(*(_QWORD *)(a1 + 16) + 8LL * (int)i));\nfor ( j = 0; *(_DWORD *)(a1 + 40) > j; ++j )\nfree(*(void **)(*(_QWORD *)(a1 + 48) + 8LL * (int)j));\nfree(*(void **)(a1 + 16));\nfree(*(void **)(a1 + 48));\n}",
"original_code": "void delete_pNetwork( pNetwork *n ) {\n int i;\n for ( i=0; i<n->num_node_blocks; i++ ) {\n free( n->p_nodes[i] );\n }\n for ( i=0; i<n->num_link_blocks; i++ ) {\n free( n->p_links[i] );\n }\n free( n->p_nodes );\n free( n->p_links );\n}",
"canonical_original_code": "void delete_pNetwork(struct pNetwork *n) {\n int i;\n for ( i=0; i<n->num_node_blocks; i++ ) {\n free( n->p_nodes[i] );\n }\n for ( i=0; i<n->num_link_blocks; i++ ) {\n free( n->p_links[i] );\n }\n free( n->p_nodes );\n free( n->p_links );\n}",
"variable_types": [
[
"n",
"struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *"
],
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct pNetwork { unsigned int num_nodes; struct pNode **p_nodes; int num_inputs; unsigned int num_links; struct pLink **p_links; }",
"struct pNode { double x[2]; unsigned char used; unsigned int index; }",
"struct pLink { struct pNode *from; double r[1]; unsigned char used; }"
],
"binary_hash": "97b1d029edbc4fb6b37a0f73c9c21d498e972fa027dbec6e4101811a75a26803"
},
{
"name": "add_pNode",
"canonical_name": "func3",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall add_pNode(__int64 a1, _QWORD *a2, __int64 *a3)\n{\n__int64 v4; // rdx\n__int64 v6; // [rsp+28h] [rbp-18h]\nunsigned int v7; // [rsp+3Ch] [rbp-4h]\n\nif ( *(_DWORD *)a1 == *(_DWORD *)(a1 + 8) << 8 )\n{\nv7 = Realloc_(a1 + 16, 8LL * (unsigned int)(*(_DWORD *)(a1 + 8) + 1));\nif ( v7 )\nreturn v7;\nv7 = Malloc_(*(_QWORD *)(a1 + 16) + 8LL * *(unsigned int *)(a1 + 8), 6144LL);\nif ( v7 )\nreturn v7;\n++*(_DWORD *)(a1 + 8);\n}\nv6 = *(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL * (*(_DWORD *)a1 >> 8)) + 24LL * (unsigned __int8)*(_DWORD *)a1;\n*(_BYTE *)(v6 + 16) = 0;\nv4 = a2[1];\n*(_QWORD *)v6 = *a2;\n*(_QWORD *)(v6 + 8) = v4;\n++*(_DWORD *)a1;\nif ( a3 )\n*a3 = v6;\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1, _QWORD *a2, __int64 *a3)\n{\n__int64 v4; // rdx\n__int64 v6; // [rsp+28h] [rbp-18h]\nunsigned int v7; // [rsp+3Ch] [rbp-4h]\n\nif ( *(_DWORD *)a1 == *(_DWORD *)(a1 + 8) << 8 )\n{\nv7 = Realloc_(a1 + 16, 8LL * (unsigned int)(*(_DWORD *)(a1 + 8) + 1));\nif ( v7 )\nreturn v7;\nv7 = Malloc_(*(_QWORD *)(a1 + 16) + 8LL * *(unsigned int *)(a1 + 8), 6144LL);\nif ( v7 )\nreturn v7;\n++*(_DWORD *)(a1 + 8);\n}\nv6 = *(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL * (*(_DWORD *)a1 >> 8)) + 24LL * (unsigned __int8)*(_DWORD *)a1;\n*(_BYTE *)(v6 + 16) = 0;\nv4 = a2[1];\n*(_QWORD *)v6 = *a2;\n*(_QWORD *)(v6 + 8) = v4;\n++*(_DWORD *)a1;\nif ( a3 )\n*a3 = v6;\nreturn 0LL;\n}",
"original_code": "int add_pNode( pNetwork *n, const double x[2], pNode **result ) {\n int err=0;\n if ( n->num_nodes == n->num_node_blocks * 256 ) {\n if (( err = Realloc_((void**)&n->p_nodes,(n->num_node_blocks+1)*sizeof *n->p_nodes) )\n || ( err = Malloc_((void**)&n->p_nodes[n->num_node_blocks],256*sizeof **n->p_nodes) )) {\n return err;\n }\n n->num_node_blocks++;\n }\n int block = n->num_nodes / 256;\n int index = n->num_nodes % 256;\n pNode *new = &n->p_nodes[block][index];\n new->used = 0;\n memcpy( new->x, x, 2*sizeof *x );\n n->num_nodes++;\n if ( result )\n *result = new;\n return err;\n}",
"canonical_original_code": "int add_pNode(struct pNetwork *n, double x[2], struct pNode **result) {\n int err = 0;\n if ( n->num_nodes == n->num_node_blocks * 256 ) {\n if (( err = Realloc_((void **)&n->p_nodes,(n->num_node_blocks+1)*sizeof *n->p_nodes) )\n || ( err = Malloc_((void **)&n->p_nodes[n->num_node_blocks],256*sizeof **n->p_nodes) )) {\n return err;\n }\n n->num_node_blocks++;\n }\n int block = n->num_nodes / 256;\n int index = n->num_nodes % 256;\n struct pNode *new = &n->p_nodes[block][index];\n new->used = 0;\n memcpy( new->x, x, 2*sizeof *x );\n n->num_nodes++;\n if ( result )\n *result = new;\n return err;\n}",
"variable_types": [
[
"n",
"struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *"
],
[
"x",
"double [2]"
],
[
"result",
"struct pNode **"
],
[
"err",
"int"
],
[
"block",
"int"
],
[
"index",
"int"
],
[
"new",
"struct pNode { double x[2]; unsigned char used; unsigned int index; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct pNetwork { unsigned int num_nodes; struct pNode **p_nodes; int num_inputs; unsigned int num_links; struct pLink **p_links; }",
"struct pNode { double x[2]; unsigned char used; unsigned int index; }",
"struct pLink { struct pNode *from; double r[1]; unsigned char used; }"
],
"binary_hash": "97b1d029edbc4fb6b37a0f73c9c21d498e972fa027dbec6e4101811a75a26803"
},
{
"name": "add_pLink",
"canonical_name": "func4",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall add_pLink(__int64 a1, __int64 a2, __int64 a3, __int64 *a4)\n{\n__int64 v7; // [rsp+28h] [rbp-18h]\nunsigned int v8; // [rsp+3Ch] [rbp-4h]\n\nif ( *(_DWORD *)(a1 + 32) == *(_DWORD *)(a1 + 40) << 10 )\n{\nv8 = Realloc_(a1 + 48, 8LL * (unsigned int)(*(_DWORD *)(a1 + 40) + 1));\nif ( v8 )\nreturn v8;\nv8 = Malloc_(*(_QWORD *)(a1 + 48) + 8LL * *(unsigned int *)(a1 + 40), 0x8000LL);\nif ( v8 )\nreturn v8;\n++*(_DWORD *)(a1 + 40);\n}\nv7 = *(_QWORD *)(*(_QWORD *)(a1 + 48) + 8LL * (*(_DWORD *)(a1 + 32) >> 10)) + 32LL * (*(_DWORD *)(a1 + 32) & 0x3FF);\n*(_QWORD *)v7 = a2;\n*(_QWORD *)(v7 + 8) = a3;\n*(_BYTE *)(v7 + 24) = 0;\n++*(_DWORD *)(a1 + 32);\nif ( a4 )\n*a4 = v7;\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1, __int64 a2, __int64 a3, __int64 *a4)\n{\n__int64 v7; // [rsp+28h] [rbp-18h]\nunsigned int v8; // [rsp+3Ch] [rbp-4h]\n\nif ( *(_DWORD *)(a1 + 32) == *(_DWORD *)(a1 + 40) << 10 )\n{\nv8 = Realloc_(a1 + 48, 8LL * (unsigned int)(*(_DWORD *)(a1 + 40) + 1));\nif ( v8 )\nreturn v8;\nv8 = Malloc_(*(_QWORD *)(a1 + 48) + 8LL * *(unsigned int *)(a1 + 40), 0x8000LL);\nif ( v8 )\nreturn v8;\n++*(_DWORD *)(a1 + 40);\n}\nv7 = *(_QWORD *)(*(_QWORD *)(a1 + 48) + 8LL * (*(_DWORD *)(a1 + 32) >> 10)) + 32LL * (*(_DWORD *)(a1 + 32) & 0x3FF);\n*(_QWORD *)v7 = a2;\n*(_QWORD *)(v7 + 8) = a3;\n*(_BYTE *)(v7 + 24) = 0;\n++*(_DWORD *)(a1 + 32);\nif ( a4 )\n*a4 = v7;\nreturn 0LL;\n}",
"original_code": "int add_pLink( pNetwork *n, pNode *from, pNode *to, pLink **result ) {\n int err=0;\n if ( n->num_links == n->num_link_blocks * 1024 ) {\n if (( err = Realloc_((void**)&n->p_links,(n->num_link_blocks+1)*sizeof *n->p_links) )\n || ( err = Malloc_((void**)&n->p_links[n->num_link_blocks],1024*sizeof **n->p_links) )) {\n return err;\n }\n n->num_link_blocks++;\n }\n int block = n->num_links / 1024;\n int index = n->num_links % 1024;\n pLink *new = &n->p_links[block][index];\n new->from = from;\n new->to = to;\n new->used = 0;\n n->num_links++;\n if ( result )\n *result = new;\n return err;\n}",
"canonical_original_code": "int add_pLink(struct pNetwork *n, struct pNode *from, struct pNode *to, struct pLink **result) {\n int err = 0;\n if ( n->num_links == n->num_link_blocks * 1024 ) {\n if (( err = Realloc_((void **)&n->p_links,(n->num_link_blocks+1)*sizeof *n->p_links) )\n || ( err = Malloc_((void **)&n->p_links[n->num_link_blocks],1024*sizeof **n->p_links) )) {\n return err;\n }\n n->num_link_blocks++;\n }\n int block = n->num_links / 1024;\n int index = n->num_links % 1024;\n struct pLink *new = &n->p_links[block][index];\n new->from = from;\n new->to = to;\n new->used = 0;\n n->num_links++;\n if ( result )\n *result = new;\n return err;\n}",
"variable_types": [
[
"n",
"struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *"
],
[
"from",
"struct pNode *"
],
[
"to",
"struct pNode *"
],
[
"result",
"struct pLink **"
],
[
"err",
"int"
],
[
"block",
"int"
],
[
"index",
"int"
],
[
"new",
"struct pLink { struct pNode { double x[2]; unsigned char used; unsigned int index; } *from; double r[1]; unsigned char used; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct pNetwork { unsigned int num_nodes; struct pNode **p_nodes; int num_inputs; unsigned int num_links; struct pLink **p_links; }",
"struct pLink { struct pNode *from; double r[1]; unsigned char used; }",
"struct pNode { double x[2]; unsigned char used; unsigned int index; }"
],
"binary_hash": "97b1d029edbc4fb6b37a0f73c9c21d498e972fa027dbec6e4101811a75a26803"
},
{
"name": "connect_pNet",
"canonical_name": "func5",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall connect_pNet(_QWORD *a1, __int64 a2)\n{\n__int64 v2; // rdx\n__int64 v3; // rdx\n__int64 v4; // rdx\n__int64 v6; // [rsp+18h] [rbp-68h] BYREF\nvoid *v7; // [rsp+20h] [rbp-60h] BYREF\nvoid *v8; // [rsp+28h] [rbp-58h] BYREF\n__int64 v9[2]; // [rsp+30h] [rbp-50h] BYREF\n__int64 s1; // [rsp+40h] [rbp-40h] BYREF\n__int64 v11; // [rsp+48h] [rbp-38h]\nvoid **v12; // [rsp+58h] [rbp-28h]\nvoid *s2; // [rsp+60h] [rbp-20h]\nunsigned int v14; // [rsp+6Ch] [rbp-14h]\nchar v15; // [rsp+73h] [rbp-Dh]\nint v16; // [rsp+74h] [rbp-Ch]\nunsigned int i; // [rsp+78h] [rbp-8h]\nunsigned int v18; // [rsp+7Ch] [rbp-4h]\n\nv18 = 0;\nif ( *(_BYTE *)(a2 + 24) )\n{\nv2 = *(_QWORD *)(a2 + 16);\ns1 = *(_QWORD *)(a2 + 8);\nv11 = v2;\nv3 = a1[3];\nv9[0] = a1[2];\n}\nelse\n{\nv4 = a1[3];\ns1 = a1[2];\nv11 = v4;\nv3 = *(_QWORD *)(a2 + 16);\nv9[0] = *(_QWORD *)(a2 + 8);\n}\nv9[1] = v3;\nv16 = -1;\nv8 = 0LL;\nv7 = 0LL;\nfor ( i = 0; i < **(_DWORD **)(a2 + 48); ++i )\n{\nv14 = (unsigned __int8)i;\nif ( !(_BYTE)i )\n++v16;\ns2 = (void *)(*(_QWORD *)(*(_QWORD *)(*(_QWORD *)(a2 + 48) + 16LL) + 8LL * v16) + 24LL * (int)v14);\nif ( !memcmp(&s1, s2, 0x10uLL) )\n{\nv8 = s2;\nif ( v7 )\nbreak;\n}\nif ( !memcmp(v9, s2, 0x10uLL) )\n{\nv7 = s2;\nif ( v8 )\nbreak;\n}\n}\nif ( !v8 )\n{\nif ( !*(_BYTE *)(a2 + 25) )\nreturn 0LL;\nv18 = add_pNode(*(_QWORD *)(a2 + 48), &s1, (__int64 *)&v8);\nif ( v18 )\nreturn v18;\n}\nif ( !v7 )\n{\nif ( !*(_BYTE *)(a2 + 25) )\nreturn 0LL;\nv18 = add_pNode(*(_QWORD *)(a2 + 48), v9, (__int64 *)&v7);\nif ( v18 )\nreturn v18;\n}\nif ( *(_BYTE *)(a2 + 24) )\n{\nv18 = add_pLink(*(_QWORD *)(a2 + 48), (__int64)v8, (__int64)v7, &v6);\nif ( v18 )\nreturn v18;\n}\nelse\n{\nv15 = 0;\nfor ( i = 0; i <= 1; ++i )\n{\nif ( *(double *)&v9[i] <= -0.5 || *(double *)&v9[i] >= 0.5 )\n{\nv15 = 1;\nbreak;\n}\n}\nif ( v15 )\n{\nv18 = add_pLink(*(_QWORD *)(a2 + 48), (__int64)v8, (__int64)v7, &v6);\nif ( v18 )\nreturn v18;\n}\nelse\n{\nv16 = -1;\nfor ( i = 0; i < *(_DWORD *)(*(_QWORD *)(a2 + 48) + 32LL); ++i )\n{\nv14 = i & 0x3FF;\nif ( (i & 0x3FF) == 0 )\n++v16;\nv12 = (void **)(*(_QWORD *)(*(_QWORD *)(*(_QWORD *)(a2 + 48) + 48LL) + 8LL * v16) + 32LL * (int)v14);\nif ( *v12 == v8 && v12[1] == v7 )\nreturn 0LL;\n}\nv18 = add_pLink(*(_QWORD *)(a2 + 48), (__int64)v8, (__int64)v7, &v6);\nif ( v18 )\nreturn v18;\n}\n}\n*(_QWORD *)(v6 + 16) = a1[1];\nreturn v18;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(_QWORD *a1, __int64 a2)\n{\n__int64 v2; // rdx\n__int64 v3; // rdx\n__int64 v4; // rdx\n__int64 v6; // [rsp+18h] [rbp-68h] BYREF\nvoid *v7; // [rsp+20h] [rbp-60h] BYREF\nvoid *v8; // [rsp+28h] [rbp-58h] BYREF\n__int64 v9[2]; // [rsp+30h] [rbp-50h] BYREF\n__int64 s1; // [rsp+40h] [rbp-40h] BYREF\n__int64 v11; // [rsp+48h] [rbp-38h]\nvoid **v12; // [rsp+58h] [rbp-28h]\nvoid *s2; // [rsp+60h] [rbp-20h]\nunsigned int v14; // [rsp+6Ch] [rbp-14h]\nchar v15; // [rsp+73h] [rbp-Dh]\nint v16; // [rsp+74h] [rbp-Ch]\nunsigned int i; // [rsp+78h] [rbp-8h]\nunsigned int v18; // [rsp+7Ch] [rbp-4h]\n\nv18 = 0;\nif ( *(_BYTE *)(a2 + 24) )\n{\nv2 = *(_QWORD *)(a2 + 16);\ns1 = *(_QWORD *)(a2 + 8);\nv11 = v2;\nv3 = a1[3];\nv9[0] = a1[2];\n}\nelse\n{\nv4 = a1[3];\ns1 = a1[2];\nv11 = v4;\nv3 = *(_QWORD *)(a2 + 16);\nv9[0] = *(_QWORD *)(a2 + 8);\n}\nv9[1] = v3;\nv16 = -1;\nv8 = 0LL;\nv7 = 0LL;\nfor ( i = 0; i < **(_DWORD **)(a2 + 48); ++i )\n{\nv14 = (unsigned __int8)i;\nif ( !(_BYTE)i )\n++v16;\ns2 = (void *)(*(_QWORD *)(*(_QWORD *)(*(_QWORD *)(a2 + 48) + 16LL) + 8LL * v16) + 24LL * (int)v14);\nif ( !memcmp(&s1, s2, 0x10uLL) )\n{\nv8 = s2;\nif ( v7 )\nbreak;\n}\nif ( !memcmp(v9, s2, 0x10uLL) )\n{\nv7 = s2;\nif ( v8 )\nbreak;\n}\n}\nif ( !v8 )\n{\nif ( !*(_BYTE *)(a2 + 25) )\nreturn 0LL;\nv18 = func3(*(_QWORD *)(a2 + 48), &s1, (__int64 *)&v8);\nif ( v18 )\nreturn v18;\n}\nif ( !v7 )\n{\nif ( !*(_BYTE *)(a2 + 25) )\nreturn 0LL;\nv18 = func3(*(_QWORD *)(a2 + 48), v9, (__int64 *)&v7);\nif ( v18 )\nreturn v18;\n}\nif ( *(_BYTE *)(a2 + 24) )\n{\nv18 = func4(*(_QWORD *)(a2 + 48), (__int64)v8, (__int64)v7, &v6);\nif ( v18 )\nreturn v18;\n}\nelse\n{\nv15 = 0;\nfor ( i = 0; i <= 1; ++i )\n{\nif ( *(double *)&v9[i] <= -0.5 || *(double *)&v9[i] >= 0.5 )\n{\nv15 = 1;\nbreak;\n}\n}\nif ( v15 )\n{\nv18 = func4(*(_QWORD *)(a2 + 48), (__int64)v8, (__int64)v7, &v6);\nif ( v18 )\nreturn v18;\n}\nelse\n{\nv16 = -1;\nfor ( i = 0; i < *(_DWORD *)(*(_QWORD *)(a2 + 48) + 32LL); ++i )\n{\nv14 = i & 0x3FF;\nif ( (i & 0x3FF) == 0 )\n++v16;\nv12 = (void **)(*(_QWORD *)(*(_QWORD *)(*(_QWORD *)(a2 + 48) + 48LL) + 8LL * v16) + 32LL * (int)v14);\nif ( *v12 == v8 && v12[1] == v7 )\nreturn 0LL;\n}\nv18 = func4(*(_QWORD *)(a2 + 48), (__int64)v8, (__int64)v7, &v6);\nif ( v18 )\nreturn v18;\n}\n}\n*(_QWORD *)(v6 + 16) = a1[1];\nreturn v18;\n}",
"original_code": "int connect_pNet( BinLeaf *leaf, struct Extraction_Params *eparams ) {\n int err=0;\n double source[2], target[2];\n if ( eparams->outgoing ) {\n memcpy( source, eparams->ref, 2*sizeof *source );\n memcpy( target, leaf->x, 2*sizeof *target );\n } else {\n memcpy( source, leaf->x, 2*sizeof *source );\n memcpy( target, eparams->ref, 2*sizeof *target );\n }\n unsigned int i;\n int block=-1, index;\n pNode *source_pnode=0, *target_pnode=0, *n;\n for ( i=0; i<eparams->net->num_nodes; i++ ) {\n index = i % 256;\n if ( ! index )\n block++;\n n = &eparams->net->p_nodes[block][index];\n if ( ! memcmp( source, n->x, 2*sizeof *source ) ) {\n source_pnode = n;\n if ( target_pnode )\n break;\n }\n if ( ! memcmp( target, n->x, 2*sizeof *source ) ) {\n target_pnode = n;\n if ( source_pnode )\n break;\n }\n }\n if ( ! source_pnode ) {\n if ( ! eparams->create_nodes )\n return 0;\n if (( err = add_pNode( eparams->net, source, &source_pnode ) ))\n return err;\n }\n if ( ! target_pnode ) {\n if ( ! eparams->create_nodes )\n return 0;\n if (( err = add_pNode( eparams->net, target, &target_pnode ) ))\n return err;\n }\n pLink *plink;\n if ( eparams->outgoing ) {\n if (( err = add_pLink( eparams->net, source_pnode, target_pnode, &plink ) ))\n return err;\n } else {\n unsigned char out_of_bounds=0;\n for ( i=0; i<2; i++ ) {\n if ( target[i] <= -0.5 || target[i] >= 0.5 ) {\n out_of_bounds = 1;\n break;\n }\n }\n if ( out_of_bounds ) {\n if (( err = add_pLink( eparams->net, source_pnode, target_pnode, &plink ) ))\n return err;\n } else {\n block=-1;\n pLink *l;\n for ( i=0; i<eparams->net->num_links; i++ ) {\n index = i % 1024;\n if ( ! index )\n block++;\n l = &eparams->net->p_links[block][index];\n if ( l->from == source_pnode && l->to == target_pnode ) {\n return 0;\n }\n }\n if (( err = add_pLink( eparams->net, source_pnode, target_pnode, &plink ) ))\n return err;\n }\n }\n memcpy( plink->r, leaf->r, 1*sizeof *plink->r );\n return err;\n}",
"canonical_original_code": "int connect_pNet(struct BinLeaf *leaf, struct Extraction_Params *eparams) {\n int err = 0;\n double source[2]; double target[2];\n if ( eparams->outgoing ) {\n memcpy( source, eparams->ref, 2*sizeof *source );\n memcpy( target, leaf->x, 2*sizeof *target );\n } else {\n memcpy( source, leaf->x, 2*sizeof *source );\n memcpy( target, eparams->ref, 2*sizeof *target );\n }\n unsigned int i;\n int block = -1; int index;\n struct pNode *source_pnode = 0; struct pNode *target_pnode = 0; struct pNode *n;\n for ( i=0; i<eparams->net->num_nodes; i++ ) {\n index = i % 256;\n if ( ! index )\n block++;\n n = &eparams->net->p_nodes[block][index];\n if ( ! memcmp( source, n->x, 2*sizeof *source ) ) {\n source_pnode = n;\n if ( target_pnode )\n break;\n }\n if ( ! memcmp( target, n->x, 2*sizeof *source ) ) {\n target_pnode = n;\n if ( source_pnode )\n break;\n }\n }\n if ( ! source_pnode ) {\n if ( ! eparams->create_nodes )\n return 0;\n if (( err = add_pNode( eparams->net, source, &source_pnode ) ))\n return err;\n }\n if ( ! target_pnode ) {\n if ( ! eparams->create_nodes )\n return 0;\n if (( err = add_pNode( eparams->net, target, &target_pnode ) ))\n return err;\n }\n struct pLink *plink;\n if ( eparams->outgoing ) {\n if (( err = add_pLink( eparams->net, source_pnode, target_pnode, &plink ) ))\n return err;\n } else {\n unsigned char out_of_bounds = 0;\n for ( i=0; i<2; i++ ) {\n if ( target[i] <= -0.5 || target[i] >= 0.5 ) {\n out_of_bounds = 1;\n break;\n }\n }\n if ( out_of_bounds ) {\n if (( err = add_pLink( eparams->net, source_pnode, target_pnode, &plink ) ))\n return err;\n } else {\n block=-1;\n struct pLink *l;\n for ( i=0; i<eparams->net->num_links; i++ ) {\n index = i % 1024;\n if ( ! index )\n block++;\n l = &eparams->net->p_links[block][index];\n if ( l->from == source_pnode && l->to == target_pnode ) {\n return 0;\n }\n }\n if (( err = add_pLink( eparams->net, source_pnode, target_pnode, &plink ) ))\n return err;\n }\n }\n memcpy( plink->r, leaf->r, 1*sizeof *plink->r );\n return err;\n}",
"variable_types": [
[
"leaf",
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; } *"
],
[
"eparams",
"struct Extraction_Params { struct BinLeaf *root; double ref[2]; unsigned char outgoing; unsigned char create_nodes; struct CPPN { struct CPPN_Node { enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } func; double activation; } *nodes; int num_inputs; struct CPPN_Link { unsigned int innov_id; int from; double weight; int is_disabled; } *links; int num_links; } *cppn; struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; } *params; struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *net; } *"
],
[
"err",
"int"
],
[
"source",
"double [2]"
],
[
"target",
"double [2]"
],
[
"i",
"unsigned int"
],
[
"block",
"int"
],
[
"index",
"int"
],
[
"source_pnode",
"struct pNode { double x[2]; unsigned char used; unsigned int index; } *"
],
[
"target_pnode",
"struct pNode { double x[2]; unsigned char used; unsigned int index; } *"
],
[
"n",
"struct pNode { double x[2]; unsigned char used; unsigned int index; } *"
],
[
"plink",
"struct pLink { struct pNode { double x[2]; unsigned char used; unsigned int index; } *from; double r[1]; unsigned char used; } *"
],
[
"out_of_bounds",
"unsigned char"
],
[
"l",
"struct pLink { struct pNode { double x[2]; unsigned char used; unsigned int index; } *from; double r[1]; unsigned char used; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; }",
"struct Extraction_Params { struct BinLeaf *root; double ref[2]; unsigned char outgoing; unsigned char create_nodes; struct CPPN *cppn; struct NEAT_Params *params; struct pNetwork *net; }",
"struct pNode { double x[2]; unsigned char used; unsigned int index; }",
"struct pLink { struct pNode *from; double r[1]; unsigned char used; }",
"struct CPPN { struct CPPN_Node *nodes; int num_inputs; struct CPPN_Link *links; int num_links; }",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; }",
"struct pNetwork { unsigned int num_nodes; struct pNode **p_nodes; int num_inputs; unsigned int num_links; struct pLink **p_links; }",
"struct CPPN_Node { enum CPPNFunc func; double activation; }",
"struct CPPN_Link { unsigned int innov_id; int from; double weight; int is_disabled; }",
"enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 }"
],
"binary_hash": "97b1d029edbc4fb6b37a0f73c9c21d498e972fa027dbec6e4101811a75a26803"
},
{
"name": "build_pNetwork",
"canonical_name": "func6",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall build_pNetwork(__int64 a1, __int64 a2, _DWORD *a3, unsigned int a4, __int64 a5, unsigned int a6, __int64 a7)\n{\n__int64 *v8; // rax\n__int64 v9; // rdx\n__int64 *v10; // rax\n__int64 v11; // rdx\n__int64 *v12; // rax\n__int64 v13; // rdx\n__int64 v18; // [rsp+30h] [rbp-60h] BYREF\n__int64 v19; // [rsp+38h] [rbp-58h]\n__int64 v20; // [rsp+40h] [rbp-50h]\n__int64 v21; // [rsp+48h] [rbp-48h]\n__int64 v22; // [rsp+50h] [rbp-40h]\n_DWORD *v23; // [rsp+58h] [rbp-38h]\n__int64 v24; // [rsp+60h] [rbp-30h]\n__int64 v25; // [rsp+68h] [rbp-28h] BYREF\nint v26; // [rsp+74h] [rbp-1Ch]\nunsigned int v27; // [rsp+78h] [rbp-18h]\nunsigned int v28; // [rsp+7Ch] [rbp-14h]\nint j; // [rsp+80h] [rbp-10h]\nunsigned int i; // [rsp+84h] [rbp-Ch]\nunsigned int v31; // [rsp+88h] [rbp-8h]\nint v32; // [rsp+8Ch] [rbp-4h]\n\nv31 = 0;\nfor ( i = 0; i < a4; ++i )\n{\nv31 = add_pNode(a1, (_QWORD *)(24LL * i + a5), &v25);\nif ( v31 )\nreturn v31;\n}\nfor ( i = 0; i < a6; ++i )\n{\nv31 = add_pNode(a1, (_QWORD *)(24LL * i + a7), &v25);\nif ( v31 )\nreturn v31;\n}\n*(_DWORD *)(a1 + 24) = a4;\n*(_DWORD *)(a1 + 28) = a6;\nv18 = 0LL;\nv19 = 0LL;\nv20 = 0LL;\nv21 = 0LL;\nv23 = a3;\nv22 = a2;\nv24 = a1;\nif ( a3[3] )\n{\nLOWORD(v21) = 257;\nv32 = -1;\nfor ( i = 0; i < a4; ++i )\n{\nv26 = (unsigned __int8)i;\nif ( !(_BYTE)i )\n++v32;\nv8 = (__int64 *)(*(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL * v32) + 24LL * v26);\nv9 = v8[1];\nv19 = *v8;\nv20 = v9;\nv31 = extract_links(&v18);\nif ( v31 )\nreturn v31;\n}\nv28 = a4 + a6;\nv32 = (int)(a4 + a6 - 1) / 256;\nfor ( j = 1; j < a3[3]; ++j )\n{\nv27 = *(_DWORD *)a1;\nfor ( i = v28; i < v27; ++i )\n{\nv26 = (unsigned __int8)i;\nif ( !(_BYTE)i )\n++v32;\nv10 = (__int64 *)(*(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL * v32) + 24LL * v26);\nv11 = v10[1];\nv19 = *v10;\nv20 = v11;\nv31 = extract_links(&v18);\nif ( v31 )\nreturn v31;\n}\nv28 = v27;\n}\n}\nLOWORD(v21) = 0;\nv32 = (int)(a4 - 1) / 256;\nfor ( i = a4; i < a4 + a6; ++i )\n{\nv26 = (unsigned __int8)i;\nif ( !(_BYTE)i )\n++v32;\nv12 = (__int64 *)(*(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL * v32) + 24LL * v26);\nv13 = v12[1];\nv19 = *v12;\nv20 = v13;\nv31 = extract_links(&v18);\nif ( v31 )\nreturn v31;\nif ( (*a3 & 0x400) == 0 )\nbacktrack(a1, *(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL * v32) + 24LL * v26);\n}\nreturn v31;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func6(__int64 a1, __int64 a2, _DWORD *a3, unsigned int a4, __int64 a5, unsigned int a6, __int64 a7)\n{\n__int64 *v8; // rax\n__int64 v9; // rdx\n__int64 *v10; // rax\n__int64 v11; // rdx\n__int64 *v12; // rax\n__int64 v13; // rdx\n__int64 v18; // [rsp+30h] [rbp-60h] BYREF\n__int64 v19; // [rsp+38h] [rbp-58h]\n__int64 v20; // [rsp+40h] [rbp-50h]\n__int64 v21; // [rsp+48h] [rbp-48h]\n__int64 v22; // [rsp+50h] [rbp-40h]\n_DWORD *v23; // [rsp+58h] [rbp-38h]\n__int64 v24; // [rsp+60h] [rbp-30h]\n__int64 v25; // [rsp+68h] [rbp-28h] BYREF\nint v26; // [rsp+74h] [rbp-1Ch]\nunsigned int v27; // [rsp+78h] [rbp-18h]\nunsigned int v28; // [rsp+7Ch] [rbp-14h]\nint j; // [rsp+80h] [rbp-10h]\nunsigned int i; // [rsp+84h] [rbp-Ch]\nunsigned int v31; // [rsp+88h] [rbp-8h]\nint v32; // [rsp+8Ch] [rbp-4h]\n\nv31 = 0;\nfor ( i = 0; i < a4; ++i )\n{\nv31 = func3(a1, (_QWORD *)(24LL * i + a5), &v25);\nif ( v31 )\nreturn v31;\n}\nfor ( i = 0; i < a6; ++i )\n{\nv31 = func3(a1, (_QWORD *)(24LL * i + a7), &v25);\nif ( v31 )\nreturn v31;\n}\n*(_DWORD *)(a1 + 24) = a4;\n*(_DWORD *)(a1 + 28) = a6;\nv18 = 0LL;\nv19 = 0LL;\nv20 = 0LL;\nv21 = 0LL;\nv23 = a3;\nv22 = a2;\nv24 = a1;\nif ( a3[3] )\n{\nLOWORD(v21) = 257;\nv32 = -1;\nfor ( i = 0; i < a4; ++i )\n{\nv26 = (unsigned __int8)i;\nif ( !(_BYTE)i )\n++v32;\nv8 = (__int64 *)(*(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL * v32) + 24LL * v26);\nv9 = v8[1];\nv19 = *v8;\nv20 = v9;\nv31 = extract_links(&v18);\nif ( v31 )\nreturn v31;\n}\nv28 = a4 + a6;\nv32 = (int)(a4 + a6 - 1) / 256;\nfor ( j = 1; j < a3[3]; ++j )\n{\nv27 = *(_DWORD *)a1;\nfor ( i = v28; i < v27; ++i )\n{\nv26 = (unsigned __int8)i;\nif ( !(_BYTE)i )\n++v32;\nv10 = (__int64 *)(*(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL * v32) + 24LL * v26);\nv11 = v10[1];\nv19 = *v10;\nv20 = v11;\nv31 = extract_links(&v18);\nif ( v31 )\nreturn v31;\n}\nv28 = v27;\n}\n}\nLOWORD(v21) = 0;\nv32 = (int)(a4 - 1) / 256;\nfor ( i = a4; i < a4 + a6; ++i )\n{\nv26 = (unsigned __int8)i;\nif ( !(_BYTE)i )\n++v32;\nv12 = (__int64 *)(*(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL * v32) + 24LL * v26);\nv13 = v12[1];\nv19 = *v12;\nv20 = v13;\nv31 = extract_links(&v18);\nif ( v31 )\nreturn v31;\nif ( (*a3 & 0x400) == 0 )\nfunc7(a1, *(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL * v32) + 24LL * v26);\n}\nreturn v31;\n}",
"original_code": "int build_pNetwork( pNetwork *net, CPPN *cppn, struct NEAT_Params *params, int num_inputs, const pNode *inputs, int num_outputs, const pNode *outputs ) {\n int block, index, err=0;\n unsigned int i;\n pNode *tmp;\n for ( i=0; i<num_inputs; i++ ) {\n if (( err = add_pNode( net, inputs[i].x, &tmp ) ))\n return err;\n }\n for ( i=0; i<num_outputs; i++ ) {\n if (( err = add_pNode( net, outputs[i].x, &tmp ) ))\n return err;\n }\n net->num_inputs = num_inputs;\n net->num_outputs = num_outputs;\n struct Extraction_Params eparams = {0};\n eparams.params = params;\n eparams.cppn = cppn;\n eparams.net = net;\n if ( params->max_network_depth ) {\n eparams.outgoing = 1;\n eparams.create_nodes = 1;\n block = -1;\n for ( i=0; i<num_inputs; i++ ) {\n index = i % 256;\n if ( ! index )\n block++;\n memcpy( eparams.ref, net->p_nodes[block][index].x, 2*sizeof *eparams.ref );\n if (( err = extract_links( &eparams ) ))\n return err;\n }\n int depth;\n unsigned int i_start=num_inputs+num_outputs, i_end;\n block = (num_inputs+num_outputs-1) / 256;\n for ( depth=1; depth < params->max_network_depth; depth++ ) {\n i_end = net->num_nodes;\n for ( i=i_start; i<i_end; i++ ) {\n index = i % 256;\n if ( ! index )\n block++;\n memcpy( eparams.ref, net->p_nodes[block][index].x, 2*sizeof *eparams.ref );\n if (( err = extract_links( &eparams ) ))\n return err;\n }\n i_start = i_end;\n }\n }\n eparams.outgoing = 0;\n eparams.create_nodes = 0;\n block = (num_inputs-1) / 256;\n for ( i=num_inputs; i<num_inputs+num_outputs; i++ ) {\n index = i % 256;\n if ( ! index )\n block++;\n memcpy( eparams.ref, net->p_nodes[block][index].x, 2*sizeof *eparams.ref );\n if (( err = extract_links( &eparams ) ))\n return err;\n if ( ! (params->flags & (1 << 10)) ) {\n backtrack( net, &net->p_nodes[block][index] );\n }\n }\n return err;\n}",
"canonical_original_code": "int build_pNetwork(struct pNetwork *net, struct CPPN *cppn, struct NEAT_Params *params, int num_inputs, struct pNode *inputs, int num_outputs, struct pNode *outputs) {\n int block; int index; int err = 0;\n unsigned int i;\n struct pNode *tmp;\n for ( i=0; i<num_inputs; i++ ) {\n if (( err = add_pNode( net, inputs[i].x, &tmp ) ))\n return err;\n }\n for ( i=0; i<num_outputs; i++ ) {\n if (( err = add_pNode( net, outputs[i].x, &tmp ) ))\n return err;\n }\n net->num_inputs = num_inputs;\n net->num_outputs = num_outputs;\n struct Extraction_Params eparams = {0};\n eparams.params = params;\n eparams.cppn = cppn;\n eparams.net = net;\n if ( params->max_network_depth ) {\n eparams.outgoing = 1;\n eparams.create_nodes = 1;\n block = -1;\n for ( i=0; i<num_inputs; i++ ) {\n index = i % 256;\n if ( ! index )\n block++;\n memcpy( eparams.ref, net->p_nodes[block][index].x, 2*sizeof *eparams.ref );\n if (( err = extract_links( &eparams ) ))\n return err;\n }\n int depth;\n unsigned int i_start = num_inputs+num_outputs; unsigned int i_end;\n block = (num_inputs+num_outputs-1) / 256;\n for ( depth=1; depth < params->max_network_depth; depth++ ) {\n i_end = net->num_nodes;\n for ( i=i_start; i<i_end; i++ ) {\n index = i % 256;\n if ( ! index )\n block++;\n memcpy( eparams.ref, net->p_nodes[block][index].x, 2*sizeof *eparams.ref );\n if (( err = extract_links( &eparams ) ))\n return err;\n }\n i_start = i_end;\n }\n }\n eparams.outgoing = 0;\n eparams.create_nodes = 0;\n block = (num_inputs-1) / 256;\n for ( i=num_inputs; i<num_inputs+num_outputs; i++ ) {\n index = i % 256;\n if ( ! index )\n block++;\n memcpy( eparams.ref, net->p_nodes[block][index].x, 2*sizeof *eparams.ref );\n if (( err = extract_links( &eparams ) ))\n return err;\n if ( ! (params->flags & (1 << 10)) ) {\n backtrack( net, &net->p_nodes[block][index] );\n }\n }\n return err;\n}",
"variable_types": [
[
"net",
"struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *"
],
[
"cppn",
"struct CPPN { struct CPPN_Node { enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } func; double activation; } *nodes; int num_inputs; struct CPPN_Link { unsigned int innov_id; int from; double weight; int is_disabled; } *links; int num_links; } *"
],
[
"params",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; } *"
],
[
"num_inputs",
"int"
],
[
"inputs",
"struct pNode *"
],
[
"num_outputs",
"int"
],
[
"outputs",
"struct pNode *"
],
[
"block",
"int"
],
[
"index",
"int"
],
[
"err",
"int"
],
[
"i",
"unsigned int"
],
[
"tmp",
"struct pNode { double x[2]; unsigned char used; unsigned int index; } *"
],
[
"eparams",
"struct Extraction_Params { struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; } *root; double ref[2]; unsigned char outgoing; unsigned char create_nodes; struct CPPN { struct CPPN_Node { enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } func; double activation; } *nodes; int num_inputs; struct CPPN_Link { unsigned int innov_id; int from; double weight; int is_disabled; } *links; int num_links; } *cppn; struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; } *params; struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *net; }"
],
[
"depth",
"int"
],
[
"i_start",
"unsigned int"
],
[
"i_end",
"unsigned int"
]
],
"return_type": "int",
"user_defined_types": [
"struct Extraction_Params { struct BinLeaf *root; double ref[2]; unsigned char outgoing; unsigned char create_nodes; struct CPPN *cppn; struct NEAT_Params *params; struct pNetwork *net; }",
"struct pNetwork { unsigned int num_nodes; struct pNode **p_nodes; int num_inputs; unsigned int num_links; struct pLink **p_links; }",
"struct CPPN { struct CPPN_Node *nodes; int num_inputs; struct CPPN_Link *links; int num_links; }",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; }",
"struct pNode { double x[2]; unsigned char used; unsigned int index; }",
"struct BinLeaf { struct BinLeaf *c; double r[1]; double x[2]; int level; }",
"struct CPPN_Node { enum CPPNFunc func; double activation; }",
"struct CPPN_Link { unsigned int innov_id; int from; double weight; int is_disabled; }",
"enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 }",
"struct pLink { struct pNode *from; double r[1]; unsigned char used; }"
],
"binary_hash": "97b1d029edbc4fb6b37a0f73c9c21d498e972fa027dbec6e4101811a75a26803"
},
{
"name": "backtrack",
"canonical_name": "func7",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall backtrack(__int64 a1, __int64 a2)\n{\n__int64 result; // rax\n_QWORD *v3; // [rsp+18h] [rbp-18h]\nint v4; // [rsp+28h] [rbp-8h]\nunsigned int i; // [rsp+2Ch] [rbp-4h]\n\n*(_BYTE *)(a2 + 16) = 1;\n++*(_DWORD *)(a1 + 4);\nv4 = -1;\nfor ( i = 0; ; ++i )\n{\nresult = *(unsigned int *)(a1 + 32);\nif ( i >= (unsigned int)result )\nbreak;\nif ( (i & 0x3FF) == 0 )\n++v4;\nv3 = (_QWORD *)(*(_QWORD *)(*(_QWORD *)(a1 + 48) + 8LL * v4) + 32LL * (i & 0x3FF));\nif ( a2 == v3[1] )\n{\n*((_BYTE *)v3 + 24) = 1;\n++*(_DWORD *)(a1 + 36);\nif ( !*(_BYTE *)(*v3 + 16LL) )\nbacktrack(a1, *v3);\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(__int64 a1, __int64 a2)\n{\n__int64 result; // rax\n_QWORD *v3; // [rsp+18h] [rbp-18h]\nint v4; // [rsp+28h] [rbp-8h]\nunsigned int i; // [rsp+2Ch] [rbp-4h]\n\n*(_BYTE *)(a2 + 16) = 1;\n++*(_DWORD *)(a1 + 4);\nv4 = -1;\nfor ( i = 0; ; ++i )\n{\nresult = *(unsigned int *)(a1 + 32);\nif ( i >= (unsigned int)result )\nbreak;\nif ( (i & 0x3FF) == 0 )\n++v4;\nv3 = (_QWORD *)(*(_QWORD *)(*(_QWORD *)(a1 + 48) + 8LL * v4) + 32LL * (i & 0x3FF));\nif ( a2 == v3[1] )\n{\n*((_BYTE *)v3 + 24) = 1;\n++*(_DWORD *)(a1 + 36);\nif ( !*(_BYTE *)(*v3 + 16LL) )\nfunc7(a1, *v3);\n}\n}\nreturn result;\n}",
"original_code": "void backtrack( pNetwork *net, pNode *n ) {\n n->used = 1;\n net->num_used_nodes++;\n unsigned int i;\n int index, block=-1;\n pLink *l;\n for ( i = 0; i < net->num_links; i++ ) {\n index = i % 1024;\n if ( ! index )\n block++;\n l = &net->p_links[block][index];\n if ( l->to == n ) {\n l->used = 1;\n net->num_used_links++;\n if ( ! l->from->used ) {\n backtrack( net, l->from );\n }\n }\n }\n}",
"canonical_original_code": "void backtrack(struct pNetwork *net, struct pNode *n) {\n n->used = 1;\n net->num_used_nodes++;\n unsigned int i;\n int index; int block = -1;\n struct pLink *l;\n for ( i = 0; i < net->num_links; i++ ) {\n index = i % 1024;\n if ( ! index )\n block++;\n l = &net->p_links[block][index];\n if ( l->to == n ) {\n l->used = 1;\n net->num_used_links++;\n if ( ! l->from->used ) {\n backtrack( net, l->from );\n }\n }\n }\n}",
"variable_types": [
[
"net",
"struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *"
],
[
"n",
"struct pNode *"
],
[
"i",
"unsigned int"
],
[
"index",
"int"
],
[
"block",
"int"
],
[
"l",
"struct pLink { struct pNode { double x[2]; unsigned char used; unsigned int index; } *from; double r[1]; unsigned char used; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct pNetwork { unsigned int num_nodes; struct pNode **p_nodes; int num_inputs; unsigned int num_links; struct pLink **p_links; }",
"struct pLink { struct pNode *from; double r[1]; unsigned char used; }",
"struct pNode { double x[2]; unsigned char used; unsigned int index; }"
],
"binary_hash": "97b1d029edbc4fb6b37a0f73c9c21d498e972fa027dbec6e4101811a75a26803"
}
] |
b34a50369786dc967db232ca19b40c042eac31a51d54762fb6295bb531bb8ed1 | kernfel/fNEAT | [
[
"get_neat_params",
"->",
"bots_in_a_maze"
],
[
"get_robot_params",
"->",
"bots_in_a_maze"
],
[
"run_trial",
"->",
"bots_in_a_maze"
],
[
"m_get_spread",
"->",
"bots_in_a_maze"
],
[
"analyse_maze",
"->",
"bots_in_a_maze"
],
[
"bots_in_a_maze",
"->",
"get_neat_params",
"get_robot_params",
"m_get_spread",
"run_trial",
"analyse_maze",
"main"
],
[
"main",
"->",
"bots_in_a_maze"
]
] | [
[
"bots_in_a_maze",
"void __noreturn func5()\n{\nvoid *v0; // rsp\nvoid *v1; // rsp\n__int64 v2[2]; // [rsp+0h] [rbp-430h] BYREF\n__int64 v3; // [rsp+10h] [rbp-420h]\n__int64 v4; // [rsp+18h] [rbp-418h]\nchar v5[80]; // [rsp+20h] [rbp-410h] BYREF\nchar v6[128]; // [rsp+70h] [rbp-3C0h] BYREF\nchar v7[64]; // [rsp+F0h] [rbp-340h] BYREF\nchar v8[4]; // [rsp+130h] [rbp-300h] BYREF\nint v9; // [rsp+134h] [rbp-2FCh]\nint v10; // [rsp+154h] [rbp-2DCh]\n__int64 v11[4]; // [rsp+170h] [rbp-2C0h] BYREF\nchar v12[48]; // [rsp+190h] [rbp-2A0h] BYREF\nchar v13[64]; // [rsp+1C0h] [rbp-270h] BYREF\n__int64 v14; // [rsp+200h] [rbp-230h] BYREF\nint v15; // [rsp+208h] [rbp-228h]\nint v16; // [rsp+20Ch] [rbp-224h]\nchar *v17; // [rsp+210h] [rbp-220h]\n__int64 v18[6]; // [rsp+220h] [rbp-210h] BYREF\nchar v19[40]; // [rsp+250h] [rbp-1E0h] BYREF\nint v20; // [rsp+278h] [rbp-1B8h]\n__int64 *v21; // [rsp+288h] [rbp-1A8h]\nint v22[4]; // [rsp+2A0h] [rbp-190h] BYREF\nchar v23[64]; // [rsp+2B0h] [rbp-180h] BYREF\nint *v24; // [rsp+2F0h] [rbp-140h]\nint v25; // [rsp+2F8h] [rbp-138h]\nint v26; // [rsp+300h] [rbp-130h]\nint v27; // [rsp+3CCh] [rbp-64h]\nvoid *dest; // [rsp+3D0h] [rbp-60h]\n__int64 v29; // [rsp+3D8h] [rbp-58h]\nvoid *s; // [rsp+3E0h] [rbp-50h]\n__int64 v31; // [rsp+3E8h] [rbp-48h]\nFILE *v32; // [rsp+3F0h] [rbp-40h]\nint status; // [rsp+3F8h] [rbp-38h]\nint j; // [rsp+3FCh] [rbp-34h]\nunsigned int i; // [rsp+400h] [rbp-30h]\nunsigned int v36; // [rsp+404h] [rbp-2Ch]\nint v37; // [rsp+408h] [rbp-28h]\nunsigned int v38; // [rsp+40Ch] [rbp-24h]\n\nstatus = 0;\nfunc0((__int64)v23);\nv22[0] = 0;\nv22[1] = 1;\nv22[2] = 2;\nv22[3] = 3;\nv24 = v22;\nv25 = 4;\nfunc1((__int64)v19);\nv20 = 5;\nv18[0] = 0xBFF921FB54442D18LL;\nv18[1] = 0xBFE921FB54442D18LL;\nv18[2] = 0LL;\nv18[3] = 0x3FE921FB54442D18LL;\nv18[4] = 0x3FF921FB54442D18LL;\nv21 = v18;\nv14 = 0x4000000000000000LL;\nv15 = 8;\nv16 = 8;\nv13[0] = 1;\nv13[1] = 1;\nv13[2] = 1;\nv13[3] = 0;\nv13[4] = 1;\nv13[5] = 1;\nv13[6] = 1;\nv13[7] = 1;\nv13[8] = 1;\nv13[9] = 0;\nv13[10] = 1;\nv13[11] = 0;\nv13[12] = 1;\nv13[13] = 0;\nv13[14] = 1;\nv13[15] = 0;\nv13[16] = 1;\nv13[17] = 0;\nv13[18] = 1;\nv13[19] = 0;\nv13[20] = 1;\nv13[21] = 0;\nv13[22] = 1;\nv13[23] = 1;\nv13[24] = 1;\nv13[25] = 0;\nv13[26] = 1;\nv13[27] = 0;\nv13[28] = 1;\nv13[29] = 1;\nv13[30] = 0;\nv13[31] = 1;\nv13[32] = 1;\nv13[33] = 1;\nv13[34] = 1;\nv13[35] = 0;\nv13[36] = 0;\nv13[37] = 1;\nv13[38] = 1;\nv13[39] = 1;\nv13[40] = 1;\nv13[41] = 0;\nv13[42] = 1;\nv13[43] = 1;\nv13[44] = 1;\nv13[45] = 1;\nv13[46] = 0;\nv13[47] = 1;\nv13[48] = 1;\nv13[49] = 0;\nv13[50] = 0;\nv13[51] = 0;\nv13[52] = 1;\nv13[53] = 0;\nv13[54] = 0;\nv13[55] = 1;\nv13[56] = 1;\nv13[57] = 0;\nv13[58] = 1;\nv13[59] = 1;\nv13[60] = 1;\nv13[61] = 1;\nv13[62] = 1;\nv13[63] = 1;\nv17 = v13;\nstatus = create_CPPN(v12, v23);\nif ( status )\nexit(status);\nstatus = create_Population(v11, v23, v12);\nif ( status )\nexit(status);\nrandomise_population(v11, v23);\nstatus = create_pNetwork(v8);\nif ( status )\nexit(status);\nstatus = create_eNetwork(v7);\nif ( status )\nexit(status);\nfunc3((__int64)v6, 5, -0.5);\nfunc3((__int64)v5, 3, 0.5);\nv32 = fopen(\"logs/champions.txt\", \"w\");\nv31 = v15 * v16 - 1LL;\nv3 = v15 * v16;\nv4 = 0LL;\nv2[0] = v3;\nv2[1] = 0LL;\nv0 = alloca(16 * ((4 * v3 + 15) / 0x10uLL));\ns = (void *)(4 * (((unsigned __int64)v2 + 3) >> 2));\nv29 = v31;\nv1 = alloca(16 * ((4 * v3 + 15) / 0x10uLL));\ndest = s;\nv27 = 0;\nfor ( i = 0; ; ++i )\n{\nv36 = 0;\nfor ( j = 0; j < v26; ++j )\n{\nreset_pNetwork(v8);\nstatus = build_pNetwork(v8, v11[0] + 56LL * j, v23, 5LL, v6, 3LL, v5);\nif ( status )\nexit(status);\nv38 = 0;\nif ( v10 && v9 )\n{\nmemset(s, 0, 4LL * v15 * v16);\nstatus = func2((__int64)v8, (__int64)v23, (__int64)v19, (__int64)&v14, (__int64)s);\nif ( status )\nexit(status);\nv38 = func4((__int64)&v14, (__int64)s, 0);\n*(double *)(v11[0] + 56LL * j + 40) = (double)(int)(v38 * v38);\nif ( (int)v38 > (int)v36 )\n{\nv36 = v38;\nmemcpy(dest, s, 4LL * v15 * v16);\nv37 = j;\n}\n}\nelse\n{\n*(_QWORD *)(v11[0] + 56LL * j + 40) = 0LL;\n}\nprintf(\"%2d \", v38);\nfflush(stdout);\n}\nprintf(\n\"\\n\\nGeneration %d's champion explorer, #%5x of species #%3x, had a good look at %d tiles:\",\ni,\n*(unsigned int *)(v11[0] + 56LL * v37 + 52),\n*(unsigned int *)(v11[0] + 56LL * v37 + 48),\nv36);\nfunc4((__int64)&v14, (__int64)dest, 1);\nepoch(v11, v23);\n}\n}"
]
] | [
{
"name": "get_neat_params",
"canonical_name": "func0",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall get_neat_params(__int64 a1)\n{\n__int64 result; // rax\n\n*(_DWORD *)a1 = 13;\n*(_DWORD *)(a1 + 4) = 2;\n*(_DWORD *)(a1 + 8) = 4;\n*(_DWORD *)(a1 + 12) = 2;\n*(_QWORD *)(a1 + 16) = 0x3FC999999999999ALL;\n*(_QWORD *)(a1 + 24) = 0x3FF0000000000000LL;\n*(_QWORD *)(a1 + 32) = 0x3FC999999999999ALL;\n*(_QWORD *)(a1 + 40) = 0x3FF0000000000000LL;\n*(_QWORD *)(a1 + 48) = 0x3FC999999999999ALL;\n*(_DWORD *)(a1 + 56) = 1;\n*(_DWORD *)(a1 + 60) = 1;\n*(_QWORD *)(a1 + 64) = 0LL;\n*(_DWORD *)(a1 + 72) = 0;\n*(_DWORD *)(a1 + 76) = 25;\n*(_DWORD *)(a1 + 80) = 200;\n*(_DWORD *)(a1 + 84) = 2;\n*(_DWORD *)(a1 + 88) = 1;\n*(_DWORD *)(a1 + 92) = 15;\n*(_QWORD *)(a1 + 96) = 0x3FC999999999999ALL;\n*(_QWORD *)(a1 + 104) = 0x4008000000000000LL;\n*(_QWORD *)(a1 + 112) = 0x3FB999999999999ALL;\n*(_QWORD *)(a1 + 120) = 0x4014000000000000LL;\n*(_QWORD *)(a1 + 128) = 0x3FF0000000000000LL;\n*(_QWORD *)(a1 + 136) = 0x3FF0000000000000LL;\n*(_QWORD *)(a1 + 144) = 0x3FD999999999999ALL;\n*(_DWORD *)(a1 + 152) = 15;\n*(_QWORD *)(a1 + 160) = 0x3FC999999999999ALL;\n*(_QWORD *)(a1 + 168) = 0x3FE999999999999ALL;\n*(_QWORD *)(a1 + 176) = 0x3FD999999999999ALL;\n*(_QWORD *)(a1 + 184) = 0x3F947AE147AE147BLL;\n*(_QWORD *)(a1 + 192) = 0x3F9999999999999ALL;\n*(_QWORD *)(a1 + 200) = 0x3F847AE147AE147BLL;\n*(_QWORD *)(a1 + 208) = 0x3FE0000000000000LL;\n*(_QWORD *)(a1 + 216) = 0x3F50624DD2F1A9FCLL;\n*(_QWORD *)(a1 + 224) = 0x3FE999999999999ALL;\n*(_QWORD *)(a1 + 232) = 0x3FE8000000000000LL;\n*(_QWORD *)(a1 + 240) = 0x4012000000000000LL;\n*(_QWORD *)(a1 + 248) = 0x3FD0000000000000LL;\n*(_QWORD *)(a1 + 256) = 0x4004000000000000LL;\n*(_DWORD *)(a1 + 264) = 0;\n*(_DWORD *)(a1 + 268) = 0;\nresult = a1;\n*(_DWORD *)(a1 + 272) = 0;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1)\n{\n__int64 result; // rax\n\n*(_DWORD *)a1 = 13;\n*(_DWORD *)(a1 + 4) = 2;\n*(_DWORD *)(a1 + 8) = 4;\n*(_DWORD *)(a1 + 12) = 2;\n*(_QWORD *)(a1 + 16) = 0x3FC999999999999ALL;\n*(_QWORD *)(a1 + 24) = 0x3FF0000000000000LL;\n*(_QWORD *)(a1 + 32) = 0x3FC999999999999ALL;\n*(_QWORD *)(a1 + 40) = 0x3FF0000000000000LL;\n*(_QWORD *)(a1 + 48) = 0x3FC999999999999ALL;\n*(_DWORD *)(a1 + 56) = 1;\n*(_DWORD *)(a1 + 60) = 1;\n*(_QWORD *)(a1 + 64) = 0LL;\n*(_DWORD *)(a1 + 72) = 0;\n*(_DWORD *)(a1 + 76) = 25;\n*(_DWORD *)(a1 + 80) = 200;\n*(_DWORD *)(a1 + 84) = 2;\n*(_DWORD *)(a1 + 88) = 1;\n*(_DWORD *)(a1 + 92) = 15;\n*(_QWORD *)(a1 + 96) = 0x3FC999999999999ALL;\n*(_QWORD *)(a1 + 104) = 0x4008000000000000LL;\n*(_QWORD *)(a1 + 112) = 0x3FB999999999999ALL;\n*(_QWORD *)(a1 + 120) = 0x4014000000000000LL;\n*(_QWORD *)(a1 + 128) = 0x3FF0000000000000LL;\n*(_QWORD *)(a1 + 136) = 0x3FF0000000000000LL;\n*(_QWORD *)(a1 + 144) = 0x3FD999999999999ALL;\n*(_DWORD *)(a1 + 152) = 15;\n*(_QWORD *)(a1 + 160) = 0x3FC999999999999ALL;\n*(_QWORD *)(a1 + 168) = 0x3FE999999999999ALL;\n*(_QWORD *)(a1 + 176) = 0x3FD999999999999ALL;\n*(_QWORD *)(a1 + 184) = 0x3F947AE147AE147BLL;\n*(_QWORD *)(a1 + 192) = 0x3F9999999999999ALL;\n*(_QWORD *)(a1 + 200) = 0x3F847AE147AE147BLL;\n*(_QWORD *)(a1 + 208) = 0x3FE0000000000000LL;\n*(_QWORD *)(a1 + 216) = 0x3F50624DD2F1A9FCLL;\n*(_QWORD *)(a1 + 224) = 0x3FE999999999999ALL;\n*(_QWORD *)(a1 + 232) = 0x3FE8000000000000LL;\n*(_QWORD *)(a1 + 240) = 0x4012000000000000LL;\n*(_QWORD *)(a1 + 248) = 0x3FD0000000000000LL;\n*(_QWORD *)(a1 + 256) = 0x4004000000000000LL;\n*(_DWORD *)(a1 + 264) = 0;\n*(_DWORD *)(a1 + 268) = 0;\nresult = a1;\n*(_DWORD *)(a1 + 272) = 0;\nreturn result;\n}",
"original_code": "void get_neat_params( struct NEAT_Params *params ) {\n params->flags = (1 << 2) | (1 << 0) | (1 << 3);\n params->min_resolution = 2;\n params->max_resolution = 4;\n params->max_network_depth = 2;\n params->variance_threshold = 0.2;\n params->output_variance_weight[0] = 1;\n params->band_threshold = 0.2;\n params->output_bandpruning_weight[0] = 1;\n params->expression_thresholds[0] = 0.2;\n params->output_funcs[0] = CF_SIGMOID;\n params->initially_linked_outputs[0] = 1;\n params->allowed_funcs = ((void *)0);\n params->num_allowed_funcs = 0;\n params->num_activations = 25;\n params->population_size = 200;\n params->extinction_threshold = 2;\n params->champion_threshold = 1;\n params->target_num_species = 15;\n params->survival_quota = 0.2;\n params->speciation_threshold = 3.0;\n params->d_speciation_threshold = 0.1;\n params->max_speciation_threshold = 5.0;\n params->disjoint_factor = 1.0;\n params->excess_factor = 1.0;\n params->weight_factor = 0.4;\n params->stagnation_age_threshold = 15;\n params->stagnation_score_threshold = 0.2;\n params->stagnation_penalty = 0.8;\n params->add_link_prob = 0.4;\n params->add_node_prob = 0.02;\n params->enable_link_prob = 0.025;\n params->disable_link_prob = 0.01;\n params->crossover_prob = 0.5;\n params->interspecies_mating_prob = 0.001;\n params->mutate_weights_prob = 0.8;\n params->perturb_weights_proportion = 0.75;\n params->perturb_weights_range = 4.5;\n params->reassign_weights_proportion = 0.25;\n params->random_weights_range = 2.5;\n params->innov_counter = 0;\n params->species_counter = 0;\n params->individual_counter = 0;\n}",
"canonical_original_code": "void get_neat_params(struct NEAT_Params *params) {\n params->flags = (1 << 2) | (1 << 0) | (1 << 3);\n params->min_resolution = 2;\n params->max_resolution = 4;\n params->max_network_depth = 2;\n params->variance_threshold = 0.2;\n params->output_variance_weight[0] = 1;\n params->band_threshold = 0.2;\n params->output_bandpruning_weight[0] = 1;\n params->expression_thresholds[0] = 0.2;\n params->output_funcs[0] = CF_SIGMOID;\n params->initially_linked_outputs[0] = 1;\n params->allowed_funcs = ((void *)0);\n params->num_allowed_funcs = 0;\n params->num_activations = 25;\n params->population_size = 200;\n params->extinction_threshold = 2;\n params->champion_threshold = 1;\n params->target_num_species = 15;\n params->survival_quota = 0.2;\n params->speciation_threshold = 3.0;\n params->d_speciation_threshold = 0.1;\n params->max_speciation_threshold = 5.0;\n params->disjoint_factor = 1.0;\n params->excess_factor = 1.0;\n params->weight_factor = 0.4;\n params->stagnation_age_threshold = 15;\n params->stagnation_score_threshold = 0.2;\n params->stagnation_penalty = 0.8;\n params->add_link_prob = 0.4;\n params->add_node_prob = 0.02;\n params->enable_link_prob = 0.025;\n params->disable_link_prob = 0.01;\n params->crossover_prob = 0.5;\n params->interspecies_mating_prob = 0.001;\n params->mutate_weights_prob = 0.8;\n params->perturb_weights_proportion = 0.75;\n params->perturb_weights_range = 4.5;\n params->reassign_weights_proportion = 0.25;\n params->random_weights_range = 2.5;\n params->innov_counter = 0;\n params->species_counter = 0;\n params->individual_counter = 0;\n}",
"variable_types": [
[
"params",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; }",
"enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 }"
],
"binary_hash": "b34a50369786dc967db232ca19b40c042eac31a51d54762fb6295bb531bb8ed1"
},
{
"name": "get_robot_params",
"canonical_name": "func1",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall get_robot_params(__int64 a1)\n{\n__int64 result; // rax\n\n*(_QWORD *)a1 = 0x3FF0000000000000LL;\n*(_QWORD *)(a1 + 8) = 0x3F847AE147AE147BLL;\n*(_QWORD *)(a1 + 16) = 0x3FB999999999999ALL;\n*(_QWORD *)(a1 + 24) = 0x3F847AE147AE147BLL;\n*(_QWORD *)(a1 + 32) = 0x3FB999999999999ALL;\n*(_DWORD *)(a1 + 40) = 0;\n*(_QWORD *)(a1 + 48) = 0x3FF0000000000000LL;\n*(_QWORD *)(a1 + 56) = 0LL;\nresult = a1;\n*(_BYTE *)(a1 + 64) = 1;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1)\n{\n__int64 result; // rax\n\n*(_QWORD *)a1 = 0x3FF0000000000000LL;\n*(_QWORD *)(a1 + 8) = 0x3F847AE147AE147BLL;\n*(_QWORD *)(a1 + 16) = 0x3FB999999999999ALL;\n*(_QWORD *)(a1 + 24) = 0x3F847AE147AE147BLL;\n*(_QWORD *)(a1 + 32) = 0x3FB999999999999ALL;\n*(_DWORD *)(a1 + 40) = 0;\n*(_QWORD *)(a1 + 48) = 0x3FF0000000000000LL;\n*(_QWORD *)(a1 + 56) = 0LL;\nresult = a1;\n*(_BYTE *)(a1 + 64) = 1;\nreturn result;\n}",
"original_code": "void get_robot_params( struct Robot_Params *params ) {\n params->radius = 1;\n params->motor_sensitivity = 0.01;\n params->motor_threshold = 0.1;\n params->turn_sensitivity = 0.01;\n params->turn_threshold = 0.1;\n params->num_dist_sensors = 0;\n params->dist_sensor_length = 1;\n params->dist_sensor_pos = ((void *)0);\n params->invert_dist_sensors = 1;\n}",
"canonical_original_code": "void get_robot_params(struct Robot_Params *params) {\n params->radius = 1;\n params->motor_sensitivity = 0.01;\n params->motor_threshold = 0.1;\n params->turn_sensitivity = 0.01;\n params->turn_threshold = 0.1;\n params->num_dist_sensors = 0;\n params->dist_sensor_length = 1;\n params->dist_sensor_pos = ((void *)0);\n params->invert_dist_sensors = 1;\n}",
"variable_types": [
[
"params",
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; }"
],
"binary_hash": "b34a50369786dc967db232ca19b40c042eac31a51d54762fb6295bb531bb8ed1"
},
{
"name": "run_trial",
"canonical_name": "func2",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall run_trial(__int64 a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5)\n{\n__int64 result; // rax\nchar v9[32]; // [rsp+30h] [rbp-D0h] BYREF\nchar v10[48]; // [rsp+50h] [rbp-B0h] BYREF\ndouble v11; // [rsp+80h] [rbp-80h] BYREF\ndouble v12; // [rsp+88h] [rbp-78h]\n__int64 v13; // [rsp+90h] [rbp-70h]\nchar v14[64]; // [rsp+A0h] [rbp-60h] BYREF\n__int64 v15; // [rsp+E0h] [rbp-20h] BYREF\nint v16; // [rsp+ECh] [rbp-14h]\nunsigned int v17; // [rsp+F0h] [rbp-10h]\nint v18; // [rsp+F4h] [rbp-Ch]\nint v19; // [rsp+F8h] [rbp-8h]\nint i; // [rsp+FCh] [rbp-4h]\n\nv17 = 0;\nv15 = 0x4008000000000000LL;\nv17 = create_eNetwork(v14);\nif ( v17 )\nreturn v17;\nv17 = build_eNetwork(v14, a1, a2, &v15);\nif ( v17 )\n{\ndelete_eNetwork(v14);\nresult = v17;\n}\nelse\n{\nv11 = 1.0;\nv12 = 1.0;\nv13 = 0LL;\nv19 = 0;\nv18 = 0;\nfor ( i = 0; i <= 19999 && v19 <= 399; ++i )\n{\nget_sensor_readings_in_tilemaze(&v11, a4, a3, v10);\nactivate(v14, v10, v9);\nmove_robot_in_tilemaze(&v11, a4, a3, v9);\nv16 = v18;\nv18 = (int)(v11 / *(double *)a4) + *(_DWORD *)(a4 + 8) * (int)(v12 / *(double *)a4);\n++v19;\nif ( v18 != v16 )\nv19 = 0;\n++*(_DWORD *)(4LL * v18 + a5);\n}\nif ( i == v19 && v11 == 1.0 && v12 == 1.0 )\n*(_DWORD *)(4LL * v18 + a5) = 0;\ndelete_eNetwork(v14);\nresult = v17;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5)\n{\n__int64 result; // rax\nchar v9[32]; // [rsp+30h] [rbp-D0h] BYREF\nchar v10[48]; // [rsp+50h] [rbp-B0h] BYREF\ndouble v11; // [rsp+80h] [rbp-80h] BYREF\ndouble v12; // [rsp+88h] [rbp-78h]\n__int64 v13; // [rsp+90h] [rbp-70h]\nchar v14[64]; // [rsp+A0h] [rbp-60h] BYREF\n__int64 v15; // [rsp+E0h] [rbp-20h] BYREF\nint v16; // [rsp+ECh] [rbp-14h]\nunsigned int v17; // [rsp+F0h] [rbp-10h]\nint v18; // [rsp+F4h] [rbp-Ch]\nint v19; // [rsp+F8h] [rbp-8h]\nint i; // [rsp+FCh] [rbp-4h]\n\nv17 = 0;\nv15 = 0x4008000000000000LL;\nv17 = create_eNetwork(v14);\nif ( v17 )\nreturn v17;\nv17 = build_eNetwork(v14, a1, a2, &v15);\nif ( v17 )\n{\ndelete_eNetwork(v14);\nresult = v17;\n}\nelse\n{\nv11 = 1.0;\nv12 = 1.0;\nv13 = 0LL;\nv19 = 0;\nv18 = 0;\nfor ( i = 0; i <= 19999 && v19 <= 399; ++i )\n{\nget_sensor_readings_in_tilemaze(&v11, a4, a3, v10);\nactivate(v14, v10, v9);\nmove_robot_in_tilemaze(&v11, a4, a3, v9);\nv16 = v18;\nv18 = (int)(v11 / *(double *)a4) + *(_DWORD *)(a4 + 8) * (int)(v12 / *(double *)a4);\n++v19;\nif ( v18 != v16 )\nv19 = 0;\n++*(_DWORD *)(4LL * v18 + a5);\n}\nif ( i == v19 && v11 == 1.0 && v12 == 1.0 )\n*(_DWORD *)(4LL * v18 + a5) = 0;\ndelete_eNetwork(v14);\nresult = v17;\n}\nreturn result;\n}",
"original_code": "int run_trial( pNetwork *controller_structure, struct NEAT_Params *n_params, struct Robot_Params *r_params, TileMaze *maze, int *behaviour ) {\n int err=0;\n struct Implementation_Params i_params = {3};\n eNetwork controller;\n if (( err = create_eNetwork( &controller ) ))\n return err;\n if (( err = build_eNetwork( &controller, controller_structure, n_params, &i_params ) )) {\n delete_eNetwork( &controller );\n return err;\n }\n Robot bot = { 1, 1, 0 };\n double sensors[5], motors[3];\n int i, tile_counter=0, tile=0, prev_tile;\n for ( i=0; i<20000 && tile_counter < 400; i++ ) {\n get_sensor_readings_in_tilemaze( &bot, maze, r_params, sensors );\n activate( &controller, sensors, motors );\n move_robot_in_tilemaze( &bot, maze, r_params, motors );\n prev_tile = tile;\n tile = (int)(bot.x / maze->tile_width) + maze->x*(int)(bot.y / maze->tile_width);\n tile_counter++;\n if ( tile != prev_tile )\n tile_counter = 0;\n ++behaviour[tile];\n }\n if ( i==tile_counter && bot.x == 1 && bot.y == 1 )\n behaviour[tile] = 0;\n delete_eNetwork( &controller );\n return err;\n}",
"canonical_original_code": "int run_trial(struct pNetwork *controller_structure, struct NEAT_Params *n_params, struct Robot_Params *r_params, struct TileMaze *maze, int *behaviour) {\n int err = 0;\n struct Implementation_Params i_params = {3};\n struct eNetwork controller;\n if (( err = create_eNetwork( &controller ) ))\n return err;\n if (( err = build_eNetwork( &controller, controller_structure, n_params, &i_params ) )) {\n delete_eNetwork( &controller );\n return err;\n }\n struct Robot bot = { 1, 1, 0 };\n double sensors[5]; double motors[3];\n int i; int tile_counter = 0; int tile = 0; int prev_tile;\n for ( i=0; i<20000 && tile_counter < 400; i++ ) {\n get_sensor_readings_in_tilemaze( &bot, maze, r_params, sensors );\n activate( &controller, sensors, motors );\n move_robot_in_tilemaze( &bot, maze, r_params, motors );\n prev_tile = tile;\n tile = (int)(bot.x / maze->tile_width) + maze->x*(int)(bot.y / maze->tile_width);\n tile_counter++;\n if ( tile != prev_tile )\n tile_counter = 0;\n ++behaviour[tile];\n }\n if ( i==tile_counter && bot.x == 1 && bot.y == 1 )\n behaviour[tile] = 0;\n delete_eNetwork( &controller );\n return err;\n}",
"variable_types": [
[
"controller_structure",
"struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *"
],
[
"n_params",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; } *"
],
[
"r_params",
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; } *"
],
[
"maze",
"struct TileMaze { double tile_width; int x; unsigned char *tiles; } *"
],
[
"behaviour",
"int *"
],
[
"err",
"int"
],
[
"i_params",
"struct Implementation_Params { double weight_range; }"
],
[
"controller",
"struct eNetwork { unsigned int num_nodes; struct eNode { double a; int num_inputs; } *nodes; int num_inputs; struct eNode **inputs; unsigned int num_links; struct eLink { double w; struct eNode *from; } *links; }"
],
[
"bot",
"struct Robot { double x; double heading; }"
],
[
"sensors",
"double [5]"
],
[
"motors",
"double [3]"
],
[
"i",
"int"
],
[
"tile_counter",
"int"
],
[
"tile",
"int"
],
[
"prev_tile",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct Implementation_Params { double weight_range; }",
"struct eNetwork { unsigned int num_nodes; struct eNode *nodes; int num_inputs; struct eNode **inputs; unsigned int num_links; struct eLink *links; }",
"struct Robot { double x; double heading; }",
"struct pNetwork { unsigned int num_nodes; struct pNode **p_nodes; int num_inputs; unsigned int num_links; struct pLink **p_links; }",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; }",
"struct Robot_Params { double radius; double motor_sensitivity; int num_dist_sensors; double dist_sensor_length; unsigned char invert_dist_sensors; }",
"struct TileMaze { double tile_width; int x; unsigned char *tiles; }",
"struct eNode { double a; int num_inputs; }",
"struct eLink { double w; struct eNode *from; }",
"enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 }",
"struct pNode { double x[2]; unsigned char used; unsigned int index; }",
"struct pLink { struct pNode *from; double r[1]; unsigned char used; }"
],
"binary_hash": "b34a50369786dc967db232ca19b40c042eac31a51d54762fb6295bb531bb8ed1"
},
{
"name": "m_get_spread",
"canonical_name": "func3",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall m_get_spread(__int64 a1, int a2, double a3)\n{\n__int64 result; // rax\nint i; // [rsp+24h] [rbp-4h]\n\nfor ( i = 1; ; ++i )\n{\nresult = (unsigned int)i;\nif ( i > a2 )\nbreak;\n*(double *)(24LL * i - 24 + a1) = a3;\n*(double *)(24LL * i - 24 + a1 + 8) = (double)i / ((double)a2 + 1.0) - 0.5;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1, int a2, double a3)\n{\n__int64 result; // rax\nint i; // [rsp+24h] [rbp-4h]\n\nfor ( i = 1; ; ++i )\n{\nresult = (unsigned int)i;\nif ( i > a2 )\nbreak;\n*(double *)(24LL * i - 24 + a1) = a3;\n*(double *)(24LL * i - 24 + a1 + 8) = (double)i / ((double)a2 + 1.0) - 0.5;\n}\nreturn result;\n}",
"original_code": "void m_get_spread( pNode *in, int n, double x ) {\n int i;\n for ( i=1; i<=n; i++ ) {\n in[i-1].x[0] = x;\n in[i-1].x[1] = (-0.5) + i/(1.0+n);\n }\n}",
"canonical_original_code": "void m_get_spread(struct pNode *in, int n, double x) {\n int i;\n for ( i=1; i<=n; i++ ) {\n in[i-1].x[0] = x;\n in[i-1].x[1] = (-0.5) + i/(1.0+n);\n }\n}",
"variable_types": [
[
"in",
"struct pNode { double x[2]; unsigned char used; unsigned int index; } *"
],
[
"n",
"int"
],
[
"x",
"double"
],
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct pNode { double x[2]; unsigned char used; unsigned int index; }"
],
"binary_hash": "b34a50369786dc967db232ca19b40c042eac31a51d54762fb6295bb531bb8ed1"
},
{
"name": "analyse_maze",
"canonical_name": "func4",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall analyse_maze(__int64 a1, __int64 a2, int a3)\n{\nint v3; // eax\nint v5; // [rsp+2Ch] [rbp-14h]\nunsigned int v6; // [rsp+30h] [rbp-10h]\nint v7; // [rsp+34h] [rbp-Ch]\nint j; // [rsp+38h] [rbp-8h]\nint i; // [rsp+3Ch] [rbp-4h]\nint k; // [rsp+3Ch] [rbp-4h]\n\nv7 = 0;\nv6 = 0;\nfor ( i = 0; i < *(_DWORD *)(a1 + 8) * *(_DWORD *)(a1 + 12); ++i )\n{\nv3 = *(_DWORD *)(4LL * i + a2);\nif ( v7 >= v3 )\nv3 = v7;\nv7 = v3;\nif ( *(_DWORD *)(4LL * i + a2) )\n++v6;\n}\nif ( a3 )\n{\nfor ( j = 0; j < *(_DWORD *)(a1 + 12); ++j )\n{\nputchar(10);\nfor ( k = 0; k < *(_DWORD *)(a1 + 8); ++k )\n{\nif ( *(_DWORD *)(4LL * (j * *(_DWORD *)(a1 + 8) + k) + a2) )\n{\nv5 = 34 * *(_DWORD *)(4LL * (j * *(_DWORD *)(a1 + 8) + k) + a2) / v7;\nif ( v5 > 8 )\nputchar(v5 + 56);\nelse\nputchar(v5 + 49);\n}\nelse if ( *(_BYTE *)(*(_QWORD *)(a1 + 16) + j * *(_DWORD *)(a1 + 8) + k) )\n{\nputchar(48);\n}\nelse\n{\nputchar(35);\n}\n}\n}\nputchar(10);\nfflush(stdout);\n}\nreturn v6;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1, __int64 a2, int a3)\n{\nint v3; // eax\nint v5; // [rsp+2Ch] [rbp-14h]\nunsigned int v6; // [rsp+30h] [rbp-10h]\nint v7; // [rsp+34h] [rbp-Ch]\nint j; // [rsp+38h] [rbp-8h]\nint i; // [rsp+3Ch] [rbp-4h]\nint k; // [rsp+3Ch] [rbp-4h]\n\nv7 = 0;\nv6 = 0;\nfor ( i = 0; i < *(_DWORD *)(a1 + 8) * *(_DWORD *)(a1 + 12); ++i )\n{\nv3 = *(_DWORD *)(4LL * i + a2);\nif ( v7 >= v3 )\nv3 = v7;\nv7 = v3;\nif ( *(_DWORD *)(4LL * i + a2) )\n++v6;\n}\nif ( a3 )\n{\nfor ( j = 0; j < *(_DWORD *)(a1 + 12); ++j )\n{\nputchar(10);\nfor ( k = 0; k < *(_DWORD *)(a1 + 8); ++k )\n{\nif ( *(_DWORD *)(4LL * (j * *(_DWORD *)(a1 + 8) + k) + a2) )\n{\nv5 = 34 * *(_DWORD *)(4LL * (j * *(_DWORD *)(a1 + 8) + k) + a2) / v7;\nif ( v5 > 8 )\nputchar(v5 + 56);\nelse\nputchar(v5 + 49);\n}\nelse if ( *(_BYTE *)(*(_QWORD *)(a1 + 16) + j * *(_DWORD *)(a1 + 8) + k) )\n{\nputchar(48);\n}\nelse\n{\nputchar(35);\n}\n}\n}\nputchar(10);\nfflush(stdout);\n}\nreturn v6;\n}",
"original_code": "int analyse_maze( TileMaze *m, int *behaviour, int print ) {\n int x, y, maxval=0, tiles_visited=0;\n for ( x=0; x<m->x*m->y; x++ ) {\n maxval = ((maxval)>(behaviour[x])?(maxval):(behaviour[x]));\n if ( behaviour[x] )\n tiles_visited++;\n }\n if ( print ) {\n for ( y=0; y<m->y; y++ ) {\n putchar('\\n');\n for ( x=0; x<m->x; x++ ) {\n if ( behaviour[x + m->x*y] ) {\n int track = (int)(34 * behaviour[x + m->x*y] / maxval);\n if ( track < 9 )\n putchar( '1'+track );\n else\n putchar( 'A'+(track-9) );\n } else if ( m->tiles[x + m->x*y] )\n putchar('0');\n else\n putchar('#');\n }\n }\n putchar('\\n');\n fflush(stdout);\n }\n return tiles_visited;\n}",
"canonical_original_code": "int analyse_maze(struct TileMaze *m, int *behaviour, int print) {\n int x; int y; int maxval = 0; int tiles_visited = 0;\n for ( x=0; x<m->x*m->y; x++ ) {\n maxval = ((maxval)>(behaviour[x])?(maxval):(behaviour[x]));\n if ( behaviour[x] )\n tiles_visited++;\n }\n if ( print ) {\n for ( y=0; y<m->y; y++ ) {\n putchar('\\n');\n for ( x=0; x<m->x; x++ ) {\n if ( behaviour[x + m->x*y] ) {\n int track = (int)(34 * behaviour[x + m->x*y] / maxval);\n if ( track < 9 )\n putchar( '1'+track );\n else\n putchar( 'A'+(track-9) );\n } else if ( m->tiles[x + m->x*y] )\n putchar('0');\n else\n putchar('#');\n }\n }\n putchar('\\n');\n fflush(stdout);\n }\n return tiles_visited;\n}",
"variable_types": [
[
"m",
"struct TileMaze { double tile_width; int x; unsigned char *tiles; } *"
],
[
"behaviour",
"int *"
],
[
"print",
"int"
],
[
"x",
"int"
],
[
"y",
"int"
],
[
"maxval",
"int"
],
[
"tiles_visited",
"int"
],
[
"track",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct TileMaze { double tile_width; int x; unsigned char *tiles; }"
],
"binary_hash": "b34a50369786dc967db232ca19b40c042eac31a51d54762fb6295bb531bb8ed1"
},
{
"name": "main",
"canonical_name": "main",
"repo": "kernfel/fNEAT",
"decompiled_code": "int __cdecl __noreturn main(int argc, const char **argv, const char **envp)\n{\nunsigned int v3; // eax\n__int64 v4; // rdi\n\nv3 = time(0LL);\nv4 = v3;\nsrand(v3);\nbots_in_a_maze(v4);\n}\n",
"canonical_decompiled_code": "int __cdecl __noreturn main(int argc, const char **argv, const char **envp)\n{\nunsigned int v3; // eax\n__int64 v4; // rdi\n\nv3 = time(0LL);\nv4 = v3;\nsrand(v3);\nfunc5(v4);\n}",
"original_code": "int main( int argc, char **argv ) {\n srand(time(0));\n bots_in_a_maze();\n return 0;\n}",
"canonical_original_code": "int main(int argc, char **argv) {\n srand(time(0));\n bots_in_a_maze();\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char **"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "b34a50369786dc967db232ca19b40c042eac31a51d54762fb6295bb531bb8ed1"
}
] |
e0ab289037432f74708249ce5b34b89353d646bf5b62edbee8e3f238a3e4958a | kernfel/fNEAT | [
[
"create_eNetwork",
"->"
],
[
"delete_eNetwork",
"->"
],
[
"build_eNetwork",
"->",
"flush"
],
[
"flush",
"->",
"build_eNetwork"
],
[
"activate",
"->"
],
[
"dump_eNetwork",
"->"
]
] | [
[
"dump_eNetwork",
"__int64 __fastcall func5(__int64 a1, FILE *a2)\n{\n__int64 result; // rax\nunsigned int i; // [rsp+1Ch] [rbp-4h]\nunsigned int j; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i < *(_DWORD *)a1; ++i )\nfprintf(\na2,\n\"0x%08x | %4d\\n\",\n(unsigned int)*(_QWORD *)(a1 + 8) + 16 * i,\n*(unsigned int *)(*(_QWORD *)(a1 + 8) + 16LL * i + 8));\nfor ( j = 0; ; ++j )\n{\nresult = *(unsigned int *)(a1 + 40);\nif ( j >= (unsigned int)result )\nbreak;\nfprintf(\na2,\n\"0x%08x | 0x%08x > ... | %+6.4f\\n\",\n(unsigned int)*(_QWORD *)(a1 + 48) + 16 * j,\n(unsigned int)*(_QWORD *)(*(_QWORD *)(a1 + 48) + 16LL * j + 8),\n*(double *)(*(_QWORD *)(a1 + 48) + 16LL * j));\n}\nreturn result;\n}"
]
] | [
{
"name": "create_eNetwork",
"canonical_name": "func0",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall create_eNetwork(__int64 a1)\n{\n*(_QWORD *)(a1 + 8) = 0LL;\n*(_QWORD *)(a1 + 24) = 0LL;\n*(_QWORD *)(a1 + 32) = 0LL;\n*(_QWORD *)(a1 + 48) = 0LL;\n*(_DWORD *)a1 = 0;\n*(_DWORD *)(a1 + 16) = 0;\n*(_DWORD *)(a1 + 20) = 0;\n*(_DWORD *)(a1 + 40) = 0;\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1)\n{\n*(_QWORD *)(a1 + 8) = 0LL;\n*(_QWORD *)(a1 + 24) = 0LL;\n*(_QWORD *)(a1 + 32) = 0LL;\n*(_QWORD *)(a1 + 48) = 0LL;\n*(_DWORD *)a1 = 0;\n*(_DWORD *)(a1 + 16) = 0;\n*(_DWORD *)(a1 + 20) = 0;\n*(_DWORD *)(a1 + 40) = 0;\nreturn 0LL;\n}",
"original_code": "int create_eNetwork( eNetwork *e ) {\n e->nodes = 0;\n e->inputs = 0;\n e->outputs = 0;\n e->links = 0;\n e->num_nodes = 0;\n e->num_inputs = 0;\n e->num_outputs = 0;\n e->num_links = 0;\n return 0;\n}",
"canonical_original_code": "int create_eNetwork(struct eNetwork *e) {\n e->nodes = 0;\n e->inputs = 0;\n e->outputs = 0;\n e->links = 0;\n e->num_nodes = 0;\n e->num_inputs = 0;\n e->num_outputs = 0;\n e->num_links = 0;\n return 0;\n}",
"variable_types": [
[
"e",
"struct eNetwork { unsigned int num_nodes; struct eNode { double a; int num_inputs; } *nodes; int num_inputs; struct eNode **inputs; unsigned int num_links; struct eLink { double w; struct eNode *from; } *links; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct eNetwork { unsigned int num_nodes; struct eNode *nodes; int num_inputs; struct eNode **inputs; unsigned int num_links; struct eLink *links; }",
"struct eNode { double a; int num_inputs; }",
"struct eLink { double w; struct eNode *from; }"
],
"binary_hash": "e0ab289037432f74708249ce5b34b89353d646bf5b62edbee8e3f238a3e4958a"
},
{
"name": "delete_eNetwork",
"canonical_name": "func1",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall delete_eNetwork(__int64 a1)\n{\n__int64 result; // rax\n\nfree(*(void **)(a1 + 8));\nfree(*(void **)(a1 + 24));\nfree(*(void **)(a1 + 32));\nfree(*(void **)(a1 + 48));\n*(_QWORD *)(a1 + 8) = 0LL;\n*(_QWORD *)(a1 + 24) = 0LL;\n*(_QWORD *)(a1 + 32) = 0LL;\n*(_QWORD *)(a1 + 48) = 0LL;\n*(_DWORD *)a1 = 0;\n*(_DWORD *)(a1 + 16) = 0;\n*(_DWORD *)(a1 + 20) = 0;\nresult = a1;\n*(_DWORD *)(a1 + 40) = 0;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1)\n{\n__int64 result; // rax\n\nfree(*(void **)(a1 + 8));\nfree(*(void **)(a1 + 24));\nfree(*(void **)(a1 + 32));\nfree(*(void **)(a1 + 48));\n*(_QWORD *)(a1 + 8) = 0LL;\n*(_QWORD *)(a1 + 24) = 0LL;\n*(_QWORD *)(a1 + 32) = 0LL;\n*(_QWORD *)(a1 + 48) = 0LL;\n*(_DWORD *)a1 = 0;\n*(_DWORD *)(a1 + 16) = 0;\n*(_DWORD *)(a1 + 20) = 0;\nresult = a1;\n*(_DWORD *)(a1 + 40) = 0;\nreturn result;\n}",
"original_code": "void delete_eNetwork( eNetwork *e ) {\n free( e->nodes );\n free( e->inputs );\n free( e->outputs );\n free( e->links );\n e->nodes = 0;\n e->inputs = 0;\n e->outputs = 0;\n e->links = 0;\n e->num_nodes = 0;\n e->num_inputs = 0;\n e->num_outputs = 0;\n e->num_links = 0;\n}",
"canonical_original_code": "void delete_eNetwork(struct eNetwork *e) {\n free( e->nodes );\n free( e->inputs );\n free( e->outputs );\n free( e->links );\n e->nodes = 0;\n e->inputs = 0;\n e->outputs = 0;\n e->links = 0;\n e->num_nodes = 0;\n e->num_inputs = 0;\n e->num_outputs = 0;\n e->num_links = 0;\n}",
"variable_types": [
[
"e",
"struct eNetwork { unsigned int num_nodes; struct eNode { double a; int num_inputs; } *nodes; int num_inputs; struct eNode **inputs; unsigned int num_links; struct eLink { double w; struct eNode *from; } *links; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct eNetwork { unsigned int num_nodes; struct eNode *nodes; int num_inputs; struct eNode **inputs; unsigned int num_links; struct eLink *links; }",
"struct eNode { double a; int num_inputs; }",
"struct eLink { double w; struct eNode *from; }"
],
"binary_hash": "e0ab289037432f74708249ce5b34b89353d646bf5b62edbee8e3f238a3e4958a"
},
{
"name": "build_eNetwork",
"canonical_name": "func2",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall build_eNetwork(__int64 a1, __int64 a2, __int64 a3, double *a4)\n{\n__int64 result; // rax\nint v5; // eax\n__int64 v8; // [rsp+20h] [rbp-60h]\n__int64 v9; // [rsp+30h] [rbp-50h]\n__int64 v10; // [rsp+30h] [rbp-50h]\ndouble v11; // [rsp+40h] [rbp-40h]\ndouble v12; // [rsp+48h] [rbp-38h]\nint v13; // [rsp+54h] [rbp-2Ch]\n__int64 v14; // [rsp+58h] [rbp-28h]\n__int64 v15; // [rsp+60h] [rbp-20h]\nunsigned int v16; // [rsp+6Ch] [rbp-14h]\nunsigned int k; // [rsp+70h] [rbp-10h]\nunsigned int i; // [rsp+74h] [rbp-Ch]\nunsigned int j; // [rsp+74h] [rbp-Ch]\nint v20; // [rsp+78h] [rbp-8h]\nint v21; // [rsp+78h] [rbp-8h]\nunsigned int v22; // [rsp+7Ch] [rbp-4h]\n\nv22 = Realloc_(a1 + 8, 16LL * *(unsigned int *)(a2 + 4));\nif ( v22\n|| (v22 = Realloc_(a1 + 24, 8LL * *(int *)(a2 + 24))) != 0\n|| (v22 = Realloc_(a1 + 32, 8LL * *(int *)(a2 + 28))) != 0\n|| (v22 = Realloc_(a1 + 48, 16LL * *(unsigned int *)(a2 + 36))) != 0 )\n{\nfree(*(void **)(a1 + 8));\nfree(*(void **)(a1 + 24));\nfree(*(void **)(a1 + 32));\nresult = v22;\n}\nelse\n{\n*(_DWORD *)a1 = *(_DWORD *)(a2 + 4);\n*(_DWORD *)(a1 + 16) = *(_DWORD *)(a2 + 24);\n*(_DWORD *)(a1 + 20) = *(_DWORD *)(a2 + 28);\n*(_DWORD *)(a1 + 40) = *(_DWORD *)(a2 + 36);\nv20 = -1;\nv16 = 0;\nfor ( i = 0; i < *(_DWORD *)a2; ++i )\n{\nif ( !(_BYTE)i )\n++v20;\nv9 = *(_QWORD *)(*(_QWORD *)(a2 + 16) + 8LL * v20) + 24LL * (unsigned __int8)i;\nif ( i >= *(_DWORD *)(a1 + 16) )\n{\nif ( i < *(_DWORD *)(a1 + 16) + *(_DWORD *)(a1 + 20) )\n{\nif ( *(_BYTE *)(v9 + 16) )\n*(_QWORD *)(*(_QWORD *)(a1 + 32) + 8LL * (i - *(_DWORD *)(a1 + 16))) = 16LL * v16 + *(_QWORD *)(a1 + 8);\nelse\n*(_QWORD *)(*(_QWORD *)(a1 + 32) + 8LL * (i - *(_DWORD *)(a1 + 16))) = 0LL;\n}\n}\nelse if ( *(_BYTE *)(v9 + 16) )\n{\n*(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * i) = 16LL * v16 + *(_QWORD *)(a1 + 8);\n}\nelse\n{\n*(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * i) = 0LL;\n}\nif ( *(_BYTE *)(v9 + 16) )\n{\nv5 = v16++;\n*(_DWORD *)(v9 + 20) = v5;\n}\n}\nv15 = *(_QWORD *)(a1 + 48);\nv14 = *(_QWORD *)(a1 + 8);\nv12 = *a4 / (1.0 - *(double *)(a3 + 48));\nv11 = *(double *)(a3 + 48) * v12;\nv21 = -1;\nfor ( j = 0; j < *(_DWORD *)a2; ++j )\n{\nif ( !(_BYTE)j )\n++v21;\nv10 = *(_QWORD *)(*(_QWORD *)(a2 + 16) + 8LL * v21) + 24LL * (unsigned __int8)j;\nif ( *(_BYTE *)(v10 + 16) )\n{\n*(_DWORD *)(v14 + 8) = 0;\nv13 = -1;\nfor ( k = 0; k < *(_DWORD *)(a2 + 32); ++k )\n{\nif ( (k & 0x3FF) == 0 )\n++v13;\nv8 = *(_QWORD *)(*(_QWORD *)(a2 + 48) + 8LL * v13) + 32LL * (k & 0x3FF);\nif ( *(_BYTE *)(v8 + 24) )\n{\nif ( v10 == *(_QWORD *)(v8 + 8) )\n{\n*(double *)v15 = *(double *)(v8 + 16) * v12 - v11;\n*(_QWORD *)(v15 + 8) = 16LL * *(unsigned int *)(*(_QWORD *)v8 + 20LL) + *(_QWORD *)(a1 + 8);\n++*(_DWORD *)(v14 + 8);\nv15 += 16LL;\n}\n}\n}\nv14 += 16LL;\n}\n}\nflush(a1);\nresult = 0LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, __int64 a2, __int64 a3, double *a4)\n{\n__int64 result; // rax\nint v5; // eax\n__int64 v8; // [rsp+20h] [rbp-60h]\n__int64 v9; // [rsp+30h] [rbp-50h]\n__int64 v10; // [rsp+30h] [rbp-50h]\ndouble v11; // [rsp+40h] [rbp-40h]\ndouble v12; // [rsp+48h] [rbp-38h]\nint v13; // [rsp+54h] [rbp-2Ch]\n__int64 v14; // [rsp+58h] [rbp-28h]\n__int64 v15; // [rsp+60h] [rbp-20h]\nunsigned int v16; // [rsp+6Ch] [rbp-14h]\nunsigned int k; // [rsp+70h] [rbp-10h]\nunsigned int i; // [rsp+74h] [rbp-Ch]\nunsigned int j; // [rsp+74h] [rbp-Ch]\nint v20; // [rsp+78h] [rbp-8h]\nint v21; // [rsp+78h] [rbp-8h]\nunsigned int v22; // [rsp+7Ch] [rbp-4h]\n\nv22 = Realloc_(a1 + 8, 16LL * *(unsigned int *)(a2 + 4));\nif ( v22\n|| (v22 = Realloc_(a1 + 24, 8LL * *(int *)(a2 + 24))) != 0\n|| (v22 = Realloc_(a1 + 32, 8LL * *(int *)(a2 + 28))) != 0\n|| (v22 = Realloc_(a1 + 48, 16LL * *(unsigned int *)(a2 + 36))) != 0 )\n{\nfree(*(void **)(a1 + 8));\nfree(*(void **)(a1 + 24));\nfree(*(void **)(a1 + 32));\nresult = v22;\n}\nelse\n{\n*(_DWORD *)a1 = *(_DWORD *)(a2 + 4);\n*(_DWORD *)(a1 + 16) = *(_DWORD *)(a2 + 24);\n*(_DWORD *)(a1 + 20) = *(_DWORD *)(a2 + 28);\n*(_DWORD *)(a1 + 40) = *(_DWORD *)(a2 + 36);\nv20 = -1;\nv16 = 0;\nfor ( i = 0; i < *(_DWORD *)a2; ++i )\n{\nif ( !(_BYTE)i )\n++v20;\nv9 = *(_QWORD *)(*(_QWORD *)(a2 + 16) + 8LL * v20) + 24LL * (unsigned __int8)i;\nif ( i >= *(_DWORD *)(a1 + 16) )\n{\nif ( i < *(_DWORD *)(a1 + 16) + *(_DWORD *)(a1 + 20) )\n{\nif ( *(_BYTE *)(v9 + 16) )\n*(_QWORD *)(*(_QWORD *)(a1 + 32) + 8LL * (i - *(_DWORD *)(a1 + 16))) = 16LL * v16 + *(_QWORD *)(a1 + 8);\nelse\n*(_QWORD *)(*(_QWORD *)(a1 + 32) + 8LL * (i - *(_DWORD *)(a1 + 16))) = 0LL;\n}\n}\nelse if ( *(_BYTE *)(v9 + 16) )\n{\n*(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * i) = 16LL * v16 + *(_QWORD *)(a1 + 8);\n}\nelse\n{\n*(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * i) = 0LL;\n}\nif ( *(_BYTE *)(v9 + 16) )\n{\nv5 = v16++;\n*(_DWORD *)(v9 + 20) = v5;\n}\n}\nv15 = *(_QWORD *)(a1 + 48);\nv14 = *(_QWORD *)(a1 + 8);\nv12 = *a4 / (1.0 - *(double *)(a3 + 48));\nv11 = *(double *)(a3 + 48) * v12;\nv21 = -1;\nfor ( j = 0; j < *(_DWORD *)a2; ++j )\n{\nif ( !(_BYTE)j )\n++v21;\nv10 = *(_QWORD *)(*(_QWORD *)(a2 + 16) + 8LL * v21) + 24LL * (unsigned __int8)j;\nif ( *(_BYTE *)(v10 + 16) )\n{\n*(_DWORD *)(v14 + 8) = 0;\nv13 = -1;\nfor ( k = 0; k < *(_DWORD *)(a2 + 32); ++k )\n{\nif ( (k & 0x3FF) == 0 )\n++v13;\nv8 = *(_QWORD *)(*(_QWORD *)(a2 + 48) + 8LL * v13) + 32LL * (k & 0x3FF);\nif ( *(_BYTE *)(v8 + 24) )\n{\nif ( v10 == *(_QWORD *)(v8 + 8) )\n{\n*(double *)v15 = *(double *)(v8 + 16) * v12 - v11;\n*(_QWORD *)(v15 + 8) = 16LL * *(unsigned int *)(*(_QWORD *)v8 + 20LL) + *(_QWORD *)(a1 + 8);\n++*(_DWORD *)(v14 + 8);\nv15 += 16LL;\n}\n}\n}\nv14 += 16LL;\n}\n}\nfunc3(a1);\nresult = 0LL;\n}\nreturn result;\n}",
"original_code": "int build_eNetwork( eNetwork *e, pNetwork *p, struct NEAT_Params *params, struct Implementation_Params *iparams ) {\n int err=0;\n if (( err = Realloc_((void**)&e->nodes,p->num_used_nodes*sizeof *e->nodes) )\n || ( err = Realloc_((void**)&e->inputs,p->num_inputs*sizeof *e->inputs) )\n || ( err = Realloc_((void**)&e->outputs,p->num_outputs*sizeof *e->outputs) )\n || ( err = Realloc_((void**)&e->links,p->num_used_links*sizeof *e->links) )) {\n free( e->nodes );\n free( e->inputs );\n free( e->outputs );\n return err;\n }\n e->num_nodes = p->num_used_nodes;\n e->num_inputs = p->num_inputs;\n e->num_outputs = p->num_outputs;\n e->num_links = p->num_used_links;\n int block=-1, index;\n unsigned int i, j, node_iter=0;\n pNode *n;\n for ( i=0; i<p->num_nodes; i++ ) {\n index = i % 256;\n if ( ! index )\n block++;\n n = &p->p_nodes[block][index];\n if ( i < e->num_inputs ) {\n if ( n->used )\n e->inputs[i] = e->nodes + node_iter;\n else\n e->inputs[i] = 0;\n } else if ( i < e->num_inputs+e->num_outputs ) {\n if ( n->used )\n e->outputs[i-e->num_inputs] = e->nodes + node_iter;\n else\n e->outputs[i-e->num_inputs] = 0;\n }\n if ( n->used )\n n->index = node_iter++;\n }\n pLink *l;\n eLink *next_link=e->links;\n eNode *next_node=e->nodes;\n double stretch = iparams->weight_range/(1-params->expression_thresholds[0]), offset = params->expression_thresholds[0] * stretch;\n int l_block, l_index;\n block = -1;\n for ( i=0; i<p->num_nodes; i++ ) {\n index = i % 256;\n if ( ! index )\n block++;\n n = &p->p_nodes[block][index];\n if ( n->used ) {\n next_node->num_inputs = 0;\n l_block = -1;\n for ( j=0; j<p->num_links; j++ ) {\n l_index = j % 1024;\n if ( ! l_index )\n l_block++;\n l = &p->p_links[l_block][l_index];\n if ( l->used && l->to == n) {\n next_link->w = l->r[0]*stretch - offset;\n next_link->from = e->nodes + l->from->index;\n next_node->num_inputs++;\n next_link++;\n }\n }\n next_node++;\n }\n }\n flush(e);\n return err;\n}",
"canonical_original_code": "int build_eNetwork(struct eNetwork *e, struct pNetwork *p, struct NEAT_Params *params, struct Implementation_Params *iparams) {\n int err = 0;\n if (( err = Realloc_((void **)&e->nodes,p->num_used_nodes*sizeof *e->nodes) )\n || ( err = Realloc_((void **)&e->inputs,p->num_inputs*sizeof *e->inputs) )\n || ( err = Realloc_((void **)&e->outputs,p->num_outputs*sizeof *e->outputs) )\n || ( err = Realloc_((void **)&e->links,p->num_used_links*sizeof *e->links) )) {\n free( e->nodes );\n free( e->inputs );\n free( e->outputs );\n return err;\n }\n e->num_nodes = p->num_used_nodes;\n e->num_inputs = p->num_inputs;\n e->num_outputs = p->num_outputs;\n e->num_links = p->num_used_links;\n int block = -1; int index;\n unsigned int i; unsigned int j; unsigned int node_iter = 0;\n struct pNode *n;\n for ( i=0; i<p->num_nodes; i++ ) {\n index = i % 256;\n if ( ! index )\n block++;\n n = &p->p_nodes[block][index];\n if ( i < e->num_inputs ) {\n if ( n->used )\n e->inputs[i] = e->nodes + node_iter;\n else\n e->inputs[i] = 0;\n } else if ( i < e->num_inputs+e->num_outputs ) {\n if ( n->used )\n e->outputs[i-e->num_inputs] = e->nodes + node_iter;\n else\n e->outputs[i-e->num_inputs] = 0;\n }\n if ( n->used )\n n->index = node_iter++;\n }\n struct pLink *l;\n struct eLink *next_link = e->links;\n struct eNode *next_node = e->nodes;\n double stretch = iparams->weight_range/(1-params->expression_thresholds[0]); double offset = params->expression_thresholds[0] * stretch;\n int l_block; int l_index;\n block = -1;\n for ( i=0; i<p->num_nodes; i++ ) {\n index = i % 256;\n if ( ! index )\n block++;\n n = &p->p_nodes[block][index];\n if ( n->used ) {\n next_node->num_inputs = 0;\n l_block = -1;\n for ( j=0; j<p->num_links; j++ ) {\n l_index = j % 1024;\n if ( ! l_index )\n l_block++;\n l = &p->p_links[l_block][l_index];\n if ( l->used && l->to == n) {\n next_link->w = l->r[0]*stretch - offset;\n next_link->from = e->nodes + l->from->index;\n next_node->num_inputs++;\n next_link++;\n }\n }\n next_node++;\n }\n }\n flush(e);\n return err;\n}",
"variable_types": [
[
"e",
"struct eNetwork { unsigned int num_nodes; struct eNode { double a; int num_inputs; } *nodes; int num_inputs; struct eNode **inputs; unsigned int num_links; struct eLink { double w; struct eNode *from; } *links; } *"
],
[
"p",
"struct pNetwork { unsigned int num_nodes; struct pNode { double x[2]; unsigned char used; unsigned int index; } **p_nodes; int num_inputs; unsigned int num_links; struct pLink { struct pNode *from; double r[1]; unsigned char used; } **p_links; } *"
],
[
"params",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 } *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; } *"
],
[
"iparams",
"struct Implementation_Params { double weight_range; } *"
],
[
"err",
"int"
],
[
"block",
"int"
],
[
"index",
"int"
],
[
"i",
"unsigned int"
],
[
"j",
"unsigned int"
],
[
"node_iter",
"unsigned int"
],
[
"n",
"struct pNode { double x[2]; unsigned char used; unsigned int index; } *"
],
[
"l",
"struct pLink { struct pNode { double x[2]; unsigned char used; unsigned int index; } *from; double r[1]; unsigned char used; } *"
],
[
"next_link",
"struct eLink { double w; struct eNode { double a; int num_inputs; } *from; } *"
],
[
"next_node",
"struct eNode { double a; int num_inputs; } *"
],
[
"stretch",
"double"
],
[
"offset",
"double"
],
[
"l_block",
"int"
],
[
"l_index",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct eNetwork { unsigned int num_nodes; struct eNode *nodes; int num_inputs; struct eNode **inputs; unsigned int num_links; struct eLink *links; }",
"struct pNetwork { unsigned int num_nodes; struct pNode **p_nodes; int num_inputs; unsigned int num_links; struct pLink **p_links; }",
"struct NEAT_Params { unsigned int flags; int min_resolution; double variance_threshold; enum CPPNFunc output_funcs[1]; int initially_linked_outputs[1]; enum CPPNFunc *allowed_funcs; int num_allowed_funcs; int num_activations; int population_size; double survival_quota; int stagnation_age_threshold; double stagnation_score_threshold; double add_link_prob; unsigned int innov_counter; unsigned int species_counter; unsigned int individual_counter; }",
"struct Implementation_Params { double weight_range; }",
"struct pNode { double x[2]; unsigned char used; unsigned int index; }",
"struct pLink { struct pNode *from; double r[1]; unsigned char used; }",
"struct eLink { double w; struct eNode *from; }",
"struct eNode { double a; int num_inputs; }",
"enum CPPNFunc { CF_GAUSS=0, CF_SIGMOID=1, CF_SINE=2, CF_LINEAR=3, CF_STEP=4, CF_ABS=5 }"
],
"binary_hash": "e0ab289037432f74708249ce5b34b89353d646bf5b62edbee8e3f238a3e4958a"
},
{
"name": "flush",
"canonical_name": "func3",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall flush(unsigned int *a1)\n{\n__int64 result; // rax\nunsigned int i; // [rsp+14h] [rbp-4h]\n\nfor ( i = 0; ; ++i )\n{\nresult = *a1;\nif ( i >= (unsigned int)result )\nbreak;\n*(_QWORD *)(*((_QWORD *)a1 + 1) + 16LL * i) = 0LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(unsigned int *a1)\n{\n__int64 result; // rax\nunsigned int i; // [rsp+14h] [rbp-4h]\n\nfor ( i = 0; ; ++i )\n{\nresult = *a1;\nif ( i >= (unsigned int)result )\nbreak;\n*(_QWORD *)(*((_QWORD *)a1 + 1) + 16LL * i) = 0LL;\n}\nreturn result;\n}",
"original_code": "void flush( eNetwork *net ) {\n unsigned int i;\n for ( i=0; i<net->num_nodes; i++ ) {\n net->nodes[i].a = 0;\n }\n}",
"canonical_original_code": "void flush(struct eNetwork *net) {\n unsigned int i;\n for ( i=0; i<net->num_nodes; i++ ) {\n net->nodes[i].a = 0;\n }\n}",
"variable_types": [
[
"net",
"struct eNetwork { unsigned int num_nodes; struct eNode { double a; int num_inputs; } *nodes; int num_inputs; struct eNode **inputs; unsigned int num_links; struct eLink { double w; struct eNode *from; } *links; } *"
],
[
"i",
"unsigned int"
]
],
"return_type": "void",
"user_defined_types": [
"struct eNetwork { unsigned int num_nodes; struct eNode *nodes; int num_inputs; struct eNode **inputs; unsigned int num_links; struct eLink *links; }",
"struct eNode { double a; int num_inputs; }",
"struct eLink { double w; struct eNode *from; }"
],
"binary_hash": "e0ab289037432f74708249ce5b34b89353d646bf5b62edbee8e3f238a3e4958a"
},
{
"name": "activate",
"canonical_name": "func4",
"repo": "kernfel/fNEAT",
"decompiled_code": "__int64 __fastcall activate(__int64 a1, __int64 a2, __int64 a3)\n{\n__int64 result; // rax\ndouble x; // [rsp+20h] [rbp-20h]\n__int64 v6; // [rsp+28h] [rbp-18h]\n__int64 v7; // [rsp+30h] [rbp-10h]\nunsigned int v8; // [rsp+38h] [rbp-8h]\nunsigned int k; // [rsp+38h] [rbp-8h]\nunsigned int i; // [rsp+3Ch] [rbp-4h]\nunsigned int j; // [rsp+3Ch] [rbp-4h]\nunsigned int l; // [rsp+3Ch] [rbp-4h]\n\nv8 = 0;\nv7 = *(_QWORD *)(a1 + 8);\nv6 = *(_QWORD *)(a1 + 48);\nfor ( i = 0; i < *(_DWORD *)(a1 + 16); ++i )\n{\nif ( *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * i) )\n{\n**(_QWORD **)(*(_QWORD *)(a1 + 24) + 8LL * i) = *(_QWORD *)(a2 + 8LL * i);\nv7 += 16LL;\n++v8;\nv6 += 16LL * *(int *)(*(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * i) + 8LL);\n}\n}\nfor ( j = v8; j < *(_DWORD *)a1; ++j )\n{\nx = 0.0;\nfor ( k = 0; k < *(_DWORD *)(v7 + 8); ++k )\n{\nx = **(double **)(v6 + 8) * *(double *)v6 + x;\nv6 += 16LL;\n}\n*(double *)v7 = tanh(x);\nv7 += 16LL;\n}\nfor ( l = 0; ; ++l )\n{\nresult = *(unsigned int *)(a1 + 20);\nif ( l >= (unsigned int)result )\nbreak;\nif ( *(_QWORD *)(*(_QWORD *)(a1 + 32) + 8LL * l) )\n*(_QWORD *)(8LL * l + a3) = **(_QWORD **)(*(_QWORD *)(a1 + 32) + 8LL * l);\nelse\n*(_QWORD *)(8LL * l + a3) = 0LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1, __int64 a2, __int64 a3)\n{\n__int64 result; // rax\ndouble x; // [rsp+20h] [rbp-20h]\n__int64 v6; // [rsp+28h] [rbp-18h]\n__int64 v7; // [rsp+30h] [rbp-10h]\nunsigned int v8; // [rsp+38h] [rbp-8h]\nunsigned int k; // [rsp+38h] [rbp-8h]\nunsigned int i; // [rsp+3Ch] [rbp-4h]\nunsigned int j; // [rsp+3Ch] [rbp-4h]\nunsigned int l; // [rsp+3Ch] [rbp-4h]\n\nv8 = 0;\nv7 = *(_QWORD *)(a1 + 8);\nv6 = *(_QWORD *)(a1 + 48);\nfor ( i = 0; i < *(_DWORD *)(a1 + 16); ++i )\n{\nif ( *(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * i) )\n{\n**(_QWORD **)(*(_QWORD *)(a1 + 24) + 8LL * i) = *(_QWORD *)(a2 + 8LL * i);\nv7 += 16LL;\n++v8;\nv6 += 16LL * *(int *)(*(_QWORD *)(*(_QWORD *)(a1 + 24) + 8LL * i) + 8LL);\n}\n}\nfor ( j = v8; j < *(_DWORD *)a1; ++j )\n{\nx = 0.0;\nfor ( k = 0; k < *(_DWORD *)(v7 + 8); ++k )\n{\nx = **(double **)(v6 + 8) * *(double *)v6 + x;\nv6 += 16LL;\n}\n*(double *)v7 = tanh(x);\nv7 += 16LL;\n}\nfor ( l = 0; ; ++l )\n{\nresult = *(unsigned int *)(a1 + 20);\nif ( l >= (unsigned int)result )\nbreak;\nif ( *(_QWORD *)(*(_QWORD *)(a1 + 32) + 8LL * l) )\n*(_QWORD *)(8LL * l + a3) = **(_QWORD **)(*(_QWORD *)(a1 + 32) + 8LL * l);\nelse\n*(_QWORD *)(8LL * l + a3) = 0LL;\n}\nreturn result;\n}",
"original_code": "void activate( eNetwork *net, double *inputs, double *outputs ) {\n unsigned int i, j=0;\n eNode *n = net->nodes;\n eLink *l = net->links;\n for ( i=0; i<net->num_inputs; i++ ) {\n if ( net->inputs[i] ) {\n net->inputs[i]->a = inputs[i];\n n++;\n j++;\n l += net->inputs[i]->num_inputs;\n }\n }\n for ( i=j; i<net->num_nodes; i++ ) {\n double sum=0;\n for ( j=0; j<n->num_inputs; j++ ) {\n sum += l->w * l->from->a;\n l++;\n }\n n->a = tanh(sum);\n n++;\n }\n for ( i=0; i<net->num_outputs; i++ ) {\n if ( net->outputs[i] ) {\n outputs[i] = net->outputs[i]->a;\n } else {\n outputs[i] = 0;\n }\n }\n}",
"canonical_original_code": "void activate(struct eNetwork *net, double *inputs, double *outputs) {\n unsigned int i; unsigned int j = 0;\n struct eNode *n = net->nodes;\n struct eLink *l = net->links;\n for ( i=0; i<net->num_inputs; i++ ) {\n if ( net->inputs[i] ) {\n net->inputs[i]->a = inputs[i];\n n++;\n j++;\n l += net->inputs[i]->num_inputs;\n }\n }\n for ( i=j; i<net->num_nodes; i++ ) {\n double sum = 0;\n for ( j=0; j<n->num_inputs; j++ ) {\n sum += l->w * l->from->a;\n l++;\n }\n n->a = tanh(sum);\n n++;\n }\n for ( i=0; i<net->num_outputs; i++ ) {\n if ( net->outputs[i] ) {\n outputs[i] = net->outputs[i]->a;\n } else {\n outputs[i] = 0;\n }\n }\n}",
"variable_types": [
[
"net",
"struct eNetwork { unsigned int num_nodes; struct eNode { double a; int num_inputs; } *nodes; int num_inputs; struct eNode **inputs; unsigned int num_links; struct eLink { double w; struct eNode *from; } *links; } *"
],
[
"inputs",
"double *"
],
[
"outputs",
"double *"
],
[
"i",
"unsigned int"
],
[
"j",
"unsigned int"
],
[
"n",
"struct eNode { double a; int num_inputs; } *"
],
[
"l",
"struct eLink { double w; struct eNode { double a; int num_inputs; } *from; } *"
],
[
"sum",
"double"
]
],
"return_type": "void",
"user_defined_types": [
"struct eNetwork { unsigned int num_nodes; struct eNode *nodes; int num_inputs; struct eNode **inputs; unsigned int num_links; struct eLink *links; }",
"struct eNode { double a; int num_inputs; }",
"struct eLink { double w; struct eNode *from; }"
],
"binary_hash": "e0ab289037432f74708249ce5b34b89353d646bf5b62edbee8e3f238a3e4958a"
}
] |
32d3c78d029bc565d3c2330b087ae4487493c6ed545a60fb718988bd2791e716 | LachlanGunn/oic | [
[
"identify",
"->"
],
[
"measure_callback",
"->"
],
[
"set_voltage",
"->"
],
[
"set_output",
"->"
],
[
"get_output",
"->"
],
[
"status_message",
"->"
],
[
"execute_command",
"->",
"main"
],
[
"print_command_tree",
"->",
"print_single_command",
"main"
],
[
"print_single_command",
"->",
"print_command_tree"
],
[
"main",
"->",
"print_command_tree",
"execute_command"
]
] | [] | [
{
"name": "identify",
"canonical_name": "func0",
"repo": "LachlanGunn/oic",
"decompiled_code": "__int64 __fastcall identify(__int64 a1, __int64 a2)\n{\nputs(\"OIC,0.1,SCPI Test,0\");\nscpi_free_tokens(a2);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, __int64 a2)\n{\nputs(\"OIC,0.1,SCPI Test,0\");\nscpi_free_tokens(a2);\nreturn 0LL;\n}",
"original_code": "scpi_error_t identify(struct scpi_parser_context* ctx, struct scpi_token* command)\n{\n printf(\"OIC,0.1,SCPI Test,0\\n\");\n scpi_free_tokens(command);\n return SCPI_SUCCESS;\n}",
"canonical_original_code": "enum scpi_error_codes identify(struct scpi_parser_context *ctx, struct scpi_token *command)\n{\n printf(\"OIC,0.1,SCPI Test,0\\n\");\n scpi_free_tokens(command);\n return SCPI_SUCCESS;\n}",
"variable_types": [
[
"ctx",
"struct scpi_parser_context { struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 } (*callback)(struct scpi_parser_context *, struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *); } *command_tree; struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; } *error_queue_head; struct scpi_error *error_queue_tail; } *"
],
[
"command",
"struct scpi_token *"
]
],
"return_type": "enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"user_defined_types": [
"enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error *error_queue_head; struct scpi_error *error_queue_tail; }",
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes (*callback)(struct scpi_parser_context *, struct scpi_token *); }",
"struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; }",
"struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; }"
],
"binary_hash": "32d3c78d029bc565d3c2330b087ae4487493c6ed545a60fb718988bd2791e716"
},
{
"name": "measure_callback",
"canonical_name": "func1",
"repo": "LachlanGunn/oic",
"decompiled_code": "__int64 __fastcall measure_callback(__int64 a1, __int64 a2)\n{\ndouble v2; // rax\n\nif ( voltage_on )\nv2 = *(float *)&voltage;\nelse\nv2 = 0.0;\nprintf(\"%e\\n\", v2);\nscpi_free_tokens(a2);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1, __int64 a2)\n{\ndouble v2; // rax\n\nif ( voltage_on )\nv2 = *(float *)&voltage;\nelse\nv2 = 0.0;\nprintf(\"%e\\n\", v2);\nscpi_free_tokens(a2);\nreturn 0LL;\n}",
"original_code": "scpi_error_t measure_callback(struct scpi_parser_context* ctx, struct scpi_token* command)\n{\n printf(\"%e\\n\", voltage_on ? voltage : 0.0f);\n scpi_free_tokens(command);\n return SCPI_SUCCESS;\n}",
"canonical_original_code": "enum scpi_error_codes measure_callback(struct scpi_parser_context *ctx, struct scpi_token *command)\n{\n printf(\"%e\\n\", voltage_on ? voltage : 0.0f);\n scpi_free_tokens(command);\n return SCPI_SUCCESS;\n}",
"variable_types": [
[
"ctx",
"struct scpi_parser_context { struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 } (*callback)(struct scpi_parser_context *, struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *); } *command_tree; struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; } *error_queue_head; struct scpi_error *error_queue_tail; } *"
],
[
"command",
"struct scpi_token *"
]
],
"return_type": "enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"user_defined_types": [
"enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error *error_queue_head; struct scpi_error *error_queue_tail; }",
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes (*callback)(struct scpi_parser_context *, struct scpi_token *); }",
"struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; }",
"struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; }"
],
"binary_hash": "32d3c78d029bc565d3c2330b087ae4487493c6ed545a60fb718988bd2791e716"
},
{
"name": "set_voltage",
"canonical_name": "func2",
"repo": "LachlanGunn/oic",
"decompiled_code": "__int64 __fastcall set_voltage(__int64 a1, __int64 a2)\n{\nint v3[6]; // [rsp+10h] [rbp-20h] BYREF\n__int64 i; // [rsp+28h] [rbp-8h]\n\nfor ( i = a2; i && !*(_BYTE *)i; i = *(_QWORD *)(i + 24) )\n;\nif ( i )\n{\nscpi_parse_numeric(v3, *(_QWORD *)(i + 8), *(_QWORD *)(i + 16), 0.0, 0.0, 100000.0);\nvoltage = v3[0];\n}\nelse\n{\nputs(\"ERROR: No argument.\");\n}\nscpi_free_tokens(a2);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, __int64 a2)\n{\nint v3[6]; // [rsp+10h] [rbp-20h] BYREF\n__int64 i; // [rsp+28h] [rbp-8h]\n\nfor ( i = a2; i && !*(_BYTE *)i; i = *(_QWORD *)(i + 24) )\n;\nif ( i )\n{\nscpi_parse_numeric(v3, *(_QWORD *)(i + 8), *(_QWORD *)(i + 16), 0.0, 0.0, 100000.0);\nvoltage = v3[0];\n}\nelse\n{\nputs(\"ERROR: No argument.\");\n}\nscpi_free_tokens(a2);\nreturn 0LL;\n}",
"original_code": "scpi_error_t set_voltage(struct scpi_parser_context* ctx, struct scpi_token* command)\n{\n struct scpi_token* args;\n args = command;\n while(args != ((void *)0) && args->type == 0)\n {\n args = args->next;\n }\n if(args == ((void *)0))\n {\n printf(\"ERROR: No argument.\\n\");\n }\n else\n {\n voltage = scpi_parse_numeric(args->value, args->length, 0.0f, 0.0f,1.0e5f).value;\n }\n scpi_free_tokens(command);\n return SCPI_SUCCESS;\n}",
"canonical_original_code": "enum scpi_error_codes set_voltage(struct scpi_parser_context *ctx, struct scpi_token *command)\n{\n struct scpi_token *args;\n args = command;\n while(args != ((void *)0) && args->type == 0)\n {\n args = args->next;\n }\n if(args == ((void *)0))\n {\n printf(\"ERROR: No argument.\\n\");\n }\n else\n {\n voltage = scpi_parse_numeric(args->value, args->length, 0.0f, 0.0f,1.0e5f).value;\n }\n scpi_free_tokens(command);\n return SCPI_SUCCESS;\n}",
"variable_types": [
[
"ctx",
"struct scpi_parser_context { struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 } (*callback)(struct scpi_parser_context *, struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *); } *command_tree; struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; } *error_queue_head; struct scpi_error *error_queue_tail; } *"
],
[
"command",
"struct scpi_token *"
],
[
"args",
"struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *"
]
],
"return_type": "enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"user_defined_types": [
"enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error *error_queue_head; struct scpi_error *error_queue_tail; }",
"struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; }",
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes (*callback)(struct scpi_parser_context *, struct scpi_token *); }",
"struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; }"
],
"binary_hash": "32d3c78d029bc565d3c2330b087ae4487493c6ed545a60fb718988bd2791e716"
},
{
"name": "set_output",
"canonical_name": "func3",
"repo": "LachlanGunn/oic",
"decompiled_code": "__int64 __fastcall set_output(__int64 a1, __int64 a2)\n{\nfloat v3[6]; // [rsp+10h] [rbp-20h] BYREF\n__int64 i; // [rsp+28h] [rbp-8h]\n\nfor ( i = a2; i && !*(_BYTE *)i; i = *(_QWORD *)(i + 24) )\n;\nif ( i )\n{\nif ( *(_QWORD *)(i + 16) == 2LL && **(_BYTE **)(i + 8) == 79 && *(_BYTE *)(*(_QWORD *)(i + 8) + 1LL) == 78 )\n{\nvoltage_on = 1;\n}\nelse if ( *(_QWORD *)(i + 16) == 3LL\n&& **(_BYTE **)(i + 8) == 79\n&& *(_BYTE *)(*(_QWORD *)(i + 8) + 1LL) == 70\n&& *(_BYTE *)(*(_QWORD *)(i + 8) + 2LL) == 70 )\n{\nvoltage_on = 0;\n}\nelse\n{\nscpi_parse_numeric(v3, *(_QWORD *)(i + 8), *(_QWORD *)(i + 16), 0.0, 0.0, 1.0);\nvoltage_on = (int)(v3[0] + 0.5) != 0;\n}\n}\nelse\n{\nputs(\"ERROR: No argument.\");\n}\nscpi_free_tokens(a2);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1, __int64 a2)\n{\nfloat v3[6]; // [rsp+10h] [rbp-20h] BYREF\n__int64 i; // [rsp+28h] [rbp-8h]\n\nfor ( i = a2; i && !*(_BYTE *)i; i = *(_QWORD *)(i + 24) )\n;\nif ( i )\n{\nif ( *(_QWORD *)(i + 16) == 2LL && **(_BYTE **)(i + 8) == 79 && *(_BYTE *)(*(_QWORD *)(i + 8) + 1LL) == 78 )\n{\nvoltage_on = 1;\n}\nelse if ( *(_QWORD *)(i + 16) == 3LL\n&& **(_BYTE **)(i + 8) == 79\n&& *(_BYTE *)(*(_QWORD *)(i + 8) + 1LL) == 70\n&& *(_BYTE *)(*(_QWORD *)(i + 8) + 2LL) == 70 )\n{\nvoltage_on = 0;\n}\nelse\n{\nscpi_parse_numeric(v3, *(_QWORD *)(i + 8), *(_QWORD *)(i + 16), 0.0, 0.0, 1.0);\nvoltage_on = (int)(v3[0] + 0.5) != 0;\n}\n}\nelse\n{\nputs(\"ERROR: No argument.\");\n}\nscpi_free_tokens(a2);\nreturn 0LL;\n}",
"original_code": "scpi_error_t set_output(struct scpi_parser_context* ctx, struct scpi_token* command)\n{\n struct scpi_token* args;\n args = command;\n while(args != ((void *)0) && args->type == 0)\n {\n args = args->next;\n }\n if(args == ((void *)0))\n {\n printf(\"ERROR: No argument.\\n\");\n }\n else\n {\n if(args->length == 2 && args->value[0] == 'O' && args->value[1] == 'N')\n {\n voltage_on = 1;\n }\n else if(args->length == 3 &&\n args->value[0] == 'O' && args->value[1] == 'F' && args->value[2] == 'F')\n {\n voltage_on = 0;\n }\n else\n {\n voltage_on = (int)(0.5+scpi_parse_numeric(args->value, args->length, 0.0f, 0.0f, 1.0f).value) ? 1 : 0;\n }\n }\n scpi_free_tokens(command);\n return SCPI_SUCCESS;\n}",
"canonical_original_code": "enum scpi_error_codes set_output(struct scpi_parser_context *ctx, struct scpi_token *command)\n{\n struct scpi_token *args;\n args = command;\n while(args != ((void *)0) && args->type == 0)\n {\n args = args->next;\n }\n if(args == ((void *)0))\n {\n printf(\"ERROR: No argument.\\n\");\n }\n else\n {\n if(args->length == 2 && args->value[0] == 'O' && args->value[1] == 'N')\n {\n voltage_on = 1;\n }\n else if(args->length == 3 &&\n args->value[0] == 'O' && args->value[1] == 'F' && args->value[2] == 'F')\n {\n voltage_on = 0;\n }\n else\n {\n voltage_on = (int)(0.5+scpi_parse_numeric(args->value, args->length, 0.0f, 0.0f, 1.0f).value) ? 1 : 0;\n }\n }\n scpi_free_tokens(command);\n return SCPI_SUCCESS;\n}",
"variable_types": [
[
"ctx",
"struct scpi_parser_context { struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 } (*callback)(struct scpi_parser_context *, struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *); } *command_tree; struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; } *error_queue_head; struct scpi_error *error_queue_tail; } *"
],
[
"command",
"struct scpi_token *"
],
[
"args",
"struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *"
]
],
"return_type": "enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"user_defined_types": [
"enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error *error_queue_head; struct scpi_error *error_queue_tail; }",
"struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; }",
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes (*callback)(struct scpi_parser_context *, struct scpi_token *); }",
"struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; }"
],
"binary_hash": "32d3c78d029bc565d3c2330b087ae4487493c6ed545a60fb718988bd2791e716"
},
{
"name": "get_output",
"canonical_name": "func4",
"repo": "LachlanGunn/oic",
"decompiled_code": "__int64 __fastcall get_output(__int64 a1, __int64 a2)\n{\nprintf(\"%d\\n\", (unsigned int)voltage_on);\nscpi_free_tokens(a2);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1, __int64 a2)\n{\nprintf(\"%d\\n\", (unsigned int)voltage_on);\nscpi_free_tokens(a2);\nreturn 0LL;\n}",
"original_code": "scpi_error_t get_output(struct scpi_parser_context* ctx, struct scpi_token* command)\n{\n printf(\"%d\\n\", voltage_on);\n scpi_free_tokens(command);\n return SCPI_SUCCESS;\n}",
"canonical_original_code": "enum scpi_error_codes get_output(struct scpi_parser_context *ctx, struct scpi_token *command)\n{\n printf(\"%d\\n\", voltage_on);\n scpi_free_tokens(command);\n return SCPI_SUCCESS;\n}",
"variable_types": [
[
"ctx",
"struct scpi_parser_context { struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 } (*callback)(struct scpi_parser_context *, struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *); } *command_tree; struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; } *error_queue_head; struct scpi_error *error_queue_tail; } *"
],
[
"command",
"struct scpi_token *"
]
],
"return_type": "enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"user_defined_types": [
"enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error *error_queue_head; struct scpi_error *error_queue_tail; }",
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes (*callback)(struct scpi_parser_context *, struct scpi_token *); }",
"struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; }",
"struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; }"
],
"binary_hash": "32d3c78d029bc565d3c2330b087ae4487493c6ed545a60fb718988bd2791e716"
},
{
"name": "status_message",
"canonical_name": "func5",
"repo": "LachlanGunn/oic",
"decompiled_code": "int __fastcall status_message(const char *a1)\n{\nreturn printf(\"[ %s ]\\n\", a1);\n}\n",
"canonical_decompiled_code": "int __fastcall func5(const char *a1)\n{\nreturn printf(\"[ %s ]\\n\", a1);\n}",
"original_code": "void status_message(char* str)\n{\n printf(\"[ %s ]\\n\", str);\n}",
"canonical_original_code": "void status_message(char *str)\n{\n printf(\"[ %s ]\\n\", str);\n}",
"variable_types": [
[
"str",
"char *"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "32d3c78d029bc565d3c2330b087ae4487493c6ed545a60fb718988bd2791e716"
},
{
"name": "execute_command",
"canonical_name": "func6",
"repo": "LachlanGunn/oic",
"decompiled_code": "int __fastcall execute_command(__int64 a1, const char *a2)\n{\nsize_t v2; // rax\nint result; // eax\nint v4; // [rsp+3Ch] [rbp-4h]\n\nprintf(\">> %s\\n\", a2);\nv2 = strlen(a2);\nv4 = scpi_execute_command(a1, a2, v2);\nresult = putchar(10);\nif ( v4 == -1 )\n{\nstrlen(\"Command error;Command not found\");\nscpi_queue_error(a1);\nresult = puts(\"<< Command not found.\");\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func6(__int64 a1, const char *a2)\n{\nsize_t v2; // rax\nint result; // eax\nint v4; // [rsp+3Ch] [rbp-4h]\n\nprintf(\">> %s\\n\", a2);\nv2 = strlen(a2);\nv4 = scpi_execute_command(a1, a2, v2);\nresult = putchar(10);\nif ( v4 == -1 )\n{\nstrlen(\"Command error;Command not found\");\nscpi_queue_error(a1);\nresult = puts(\"<< Command not found.\");\n}\nreturn result;\n}",
"original_code": "void execute_command(struct scpi_parser_context* ctx, char* str)\n{\n scpi_error_t error;\n printf(\">> %s\\n\", str);\n error = scpi_execute_command(ctx, str, strlen(str));\n putchar('\\n');\n if(error == SCPI_COMMAND_NOT_FOUND)\n {\n struct scpi_error notfound_error;\n notfound_error.id = -100;\n notfound_error.description = \"Command error;Command not found\";\n notfound_error.length = strlen(notfound_error.description);\n scpi_queue_error(ctx, notfound_error);\n printf(\"<< Command not found.\\n\");\n }\n}",
"canonical_original_code": "void execute_command(struct scpi_parser_context *ctx, char *str)\n{\n enum scpi_error_codes error;\n printf(\">> %s\\n\", str);\n error = scpi_execute_command(ctx, str, strlen(str));\n putchar('\\n');\n if(error == SCPI_COMMAND_NOT_FOUND)\n {\n struct scpi_error notfound_error;\n notfound_error.id = -100;\n notfound_error.description = \"Command error;Command not found\";\n notfound_error.length = strlen(notfound_error.description);\n scpi_queue_error(ctx, notfound_error);\n printf(\"<< Command not found.\\n\");\n }\n}",
"variable_types": [
[
"ctx",
"struct scpi_parser_context { struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 } (*callback)(struct scpi_parser_context *, struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *); } *command_tree; struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; } *error_queue_head; struct scpi_error *error_queue_tail; } *"
],
[
"str",
"char *"
],
[
"error",
"enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }"
],
[
"notfound_error",
"struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; }"
]
],
"return_type": "void",
"user_defined_types": [
"enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; }",
"struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error *error_queue_head; struct scpi_error *error_queue_tail; }",
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes (*callback)(struct scpi_parser_context *, struct scpi_token *); }",
"struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; }"
],
"binary_hash": "32d3c78d029bc565d3c2330b087ae4487493c6ed545a60fb718988bd2791e716"
},
{
"name": "print_command_tree",
"canonical_name": "func7",
"repo": "LachlanGunn/oic",
"decompiled_code": "__int64 __fastcall print_command_tree(__int64 a1, int a2)\n{\n__int64 result; // rax\nint i; // [rsp+1Ch] [rbp-4h]\n\nwhile ( a1 )\n{\nif ( *(_QWORD *)a1 )\n{\nfor ( i = 0; i < a2; ++i )\nputchar(9);\nfwrite(*(const void **)a1, 1uLL, *(_QWORD *)(a1 + 8), stdout);\nputchar(10);\n}\nprint_command_tree(*(_QWORD *)(a1 + 40), (unsigned int)(a2 + 1));\nresult = *(_QWORD *)(a1 + 32);\na1 = result;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(__int64 a1, int a2)\n{\n__int64 result; // rax\nint i; // [rsp+1Ch] [rbp-4h]\n\nwhile ( a1 )\n{\nif ( *(_QWORD *)a1 )\n{\nfor ( i = 0; i < a2; ++i )\nputchar(9);\nfwrite(*(const void **)a1, 1uLL, *(_QWORD *)(a1 + 8), stdout);\nputchar(10);\n}\nfunc7(*(_QWORD *)(a1 + 40), (unsigned int)(a2 + 1));\nresult = *(_QWORD *)(a1 + 32);\na1 = result;\n}\nreturn result;\n}",
"original_code": "void print_command_tree(struct scpi_command* list, int tabs)\n{\n while(list != ((void *)0))\n {\n int i;\n if(list->long_name != ((void *)0))\n {\n for(i = 0; i < tabs; i++)\n {\n putchar('\\t');\n }\n fwrite(list->long_name, 1, list->long_name_length, stdout);\n putchar('\\n');\n }\n print_command_tree(list->children, tabs+1);\n list = list->next;\n }\n}",
"canonical_original_code": "void print_command_tree(struct scpi_command *list, int tabs)\n{\n while(list != ((void *)0))\n {\n int i;\n if(list->long_name != ((void *)0))\n {\n for(i = 0; i < tabs; i++)\n {\n putchar('\\t');\n }\n fwrite(list->long_name, 1, list->long_name_length, stdout);\n putchar('\\n');\n }\n print_command_tree(list->children, tabs+1);\n list = list->next;\n }\n}",
"variable_types": [
[
"list",
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 } (*callback)(struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; } *error_queue_head; struct scpi_error *error_queue_tail; } *, struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *); } *"
],
[
"tabs",
"int"
],
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes (*callback)(struct scpi_parser_context *, struct scpi_token *); }",
"enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error *error_queue_head; struct scpi_error *error_queue_tail; }",
"struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; }",
"struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; }"
],
"binary_hash": "32d3c78d029bc565d3c2330b087ae4487493c6ed545a60fb718988bd2791e716"
},
{
"name": "print_single_command",
"canonical_name": "func8",
"repo": "LachlanGunn/oic",
"decompiled_code": "__int64 __fastcall print_single_command(__int64 a1)\n{\nif ( *(_QWORD *)a1 )\n{\nfwrite(*(const void **)a1, 1uLL, *(_QWORD *)(a1 + 8), stdout);\nputchar(10);\n}\nreturn print_command_tree(*(_QWORD *)(a1 + 40), 1);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func8(__int64 a1)\n{\nif ( *(_QWORD *)a1 )\n{\nfwrite(*(const void **)a1, 1uLL, *(_QWORD *)(a1 + 8), stdout);\nputchar(10);\n}\nreturn func7(*(_QWORD *)(a1 + 40), 1);\n}",
"original_code": "void print_single_command(struct scpi_command* list)\n{\n if(list->long_name != ((void *)0))\n {\n fwrite(list->long_name, 1, list->long_name_length, stdout);\n putchar('\\n');\n }\n print_command_tree(list->children, 1);\n}",
"canonical_original_code": "void print_single_command(struct scpi_command *list)\n{\n if(list->long_name != ((void *)0))\n {\n fwrite(list->long_name, 1, list->long_name_length, stdout);\n putchar('\\n');\n }\n print_command_tree(list->children, 1);\n}",
"variable_types": [
[
"list",
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 } (*callback)(struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; } *error_queue_head; struct scpi_error *error_queue_tail; } *, struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *); } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes (*callback)(struct scpi_parser_context *, struct scpi_token *); }",
"enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error *error_queue_head; struct scpi_error *error_queue_tail; }",
"struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; }",
"struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; }"
],
"binary_hash": "32d3c78d029bc565d3c2330b087ae4487493c6ed545a60fb718988bd2791e716"
},
{
"name": "main",
"canonical_name": "main",
"repo": "LachlanGunn/oic",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\n__int64 v4[3]; // [rsp+10h] [rbp-30h] BYREF\n__int64 v5; // [rsp+28h] [rbp-18h]\n__int64 v6; // [rsp+30h] [rbp-10h]\n__int64 v7; // [rsp+38h] [rbp-8h]\n\nvoltage = 0;\nvoltage_on = 0;\nscpi_init(v4, argv, envp);\nv7 = scpi_register_command(v4[0], 1LL, \"MEASURE\", 7LL, \"MEAS\", 4LL, 0LL);\nputs(\"\\nAssembling command tree:\\n\");\nscpi_register_command(v4[0], 0LL, \"*IDN?\", 5LL, \"*IDN?\", 5LL, identify);\nscpi_register_command(v7, 1LL, \"VOLTAGE?\", 8LL, \"VOLT?\", 5LL, measure_callback);\nscpi_register_command(v7, 1LL, \"FREQUENCY?\", 10LL, \"FREQ?\", 5LL, 0LL);\nv6 = scpi_register_command(v7, 0LL, \"SOURCE\", 6LL, \"SOUR\", 4LL, 0LL);\nscpi_register_command(v6, 1LL, \"VOLTAGE\", 7LL, \"VOLT\", 4LL, set_voltage);\nv5 = scpi_register_command(v7, 0LL, \"OUTPUT\", 6LL, \"OUTP\", 4LL, set_output);\nscpi_register_command(v7, 0LL, \"OUTPUT?\", 7LL, \"OUTP?\", 5LL, get_output);\nscpi_register_command(v5, 1LL, \"STATE\", 5LL, \"STAT\", 4LL, set_output);\nscpi_register_command(v5, 1LL, \"STATE?\", 6LL, \"STAT?\", 5LL, get_output);\nprint_command_tree(v4[0], 0);\nputchar(10);\nexecute_command((__int64)v4, \"*IDN?\");\nexecute_command((__int64)v4, \":MEASURE:VOLTAGE?\");\nexecute_command((__int64)v4, \":SOURCE:VOLTAGE 15kV\");\nexecute_command((__int64)v4, \":MEASURE:VOLTAGE?\");\nexecute_command((__int64)v4, \":OUTPUT:STATE ON\");\nexecute_command((__int64)v4, \":MEASURE:VOLTAGE?\");\nexecute_command((__int64)v4, \":OUTPUT:STATE?\");\nexecute_command((__int64)v4, \":OUTPUT OFF\");\nexecute_command((__int64)v4, \":OUTPUT?\");\nexecute_command((__int64)v4, \":SYSTEM:ERROR?\");\nexecute_command((__int64)v4, \":CAUSE:AN:ERROR\");\nexecute_command((__int64)v4, \":CAUSE:ANOTHER:ERROR\");\nexecute_command((__int64)v4, \":SYSTEM:ERROR?\");\nexecute_command((__int64)v4, \":SYSTEM:ERROR?\");\nexecute_command((__int64)v4, \":SYSTEM:ERROR?\");\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\n__int64 v4[3]; // [rsp+10h] [rbp-30h] BYREF\n__int64 v5; // [rsp+28h] [rbp-18h]\n__int64 v6; // [rsp+30h] [rbp-10h]\n__int64 v7; // [rsp+38h] [rbp-8h]\n\nvoltage = 0;\nvoltage_on = 0;\nscpi_init(v4, argv, envp);\nv7 = scpi_register_command(v4[0], 1LL, \"MEASURE\", 7LL, \"MEAS\", 4LL, 0LL);\nputs(\"\\nAssembling command tree:\\n\");\nscpi_register_command(v4[0], 0LL, \"*IDN?\", 5LL, \"*IDN?\", 5LL, identify);\nscpi_register_command(v7, 1LL, \"VOLTAGE?\", 8LL, \"VOLT?\", 5LL, measure_callback);\nscpi_register_command(v7, 1LL, \"FREQUENCY?\", 10LL, \"FREQ?\", 5LL, 0LL);\nv6 = scpi_register_command(v7, 0LL, \"SOURCE\", 6LL, \"SOUR\", 4LL, 0LL);\nscpi_register_command(v6, 1LL, \"VOLTAGE\", 7LL, \"VOLT\", 4LL, set_voltage);\nv5 = scpi_register_command(v7, 0LL, \"OUTPUT\", 6LL, \"OUTP\", 4LL, set_output);\nscpi_register_command(v7, 0LL, \"OUTPUT?\", 7LL, \"OUTP?\", 5LL, get_output);\nscpi_register_command(v5, 1LL, \"STATE\", 5LL, \"STAT\", 4LL, set_output);\nscpi_register_command(v5, 1LL, \"STATE?\", 6LL, \"STAT?\", 5LL, get_output);\nfunc7(v4[0], 0);\nputchar(10);\nfunc6((__int64)v4, \"*IDN?\");\nfunc6((__int64)v4, \":MEASURE:VOLTAGE?\");\nfunc6((__int64)v4, \":SOURCE:VOLTAGE 15kV\");\nfunc6((__int64)v4, \":MEASURE:VOLTAGE?\");\nfunc6((__int64)v4, \":OUTPUT:STATE ON\");\nfunc6((__int64)v4, \":MEASURE:VOLTAGE?\");\nfunc6((__int64)v4, \":OUTPUT:STATE?\");\nfunc6((__int64)v4, \":OUTPUT OFF\");\nfunc6((__int64)v4, \":OUTPUT?\");\nfunc6((__int64)v4, \":SYSTEM:ERROR?\");\nfunc6((__int64)v4, \":CAUSE:AN:ERROR\");\nfunc6((__int64)v4, \":CAUSE:ANOTHER:ERROR\");\nfunc6((__int64)v4, \":SYSTEM:ERROR?\");\nfunc6((__int64)v4, \":SYSTEM:ERROR?\");\nfunc6((__int64)v4, \":SYSTEM:ERROR?\");\nreturn 0;\n}",
"original_code": "int main(int argc, char** argv)\n{\n struct scpi_parser_context ctx;\n struct scpi_command* measure;\n struct scpi_command* source;\n struct scpi_command* output;\n voltage = 0;\n voltage_on = 0;\n scpi_init(&ctx);\n measure = scpi_register_command(ctx.command_tree, SCPI_CL_CHILD,\n \"MEASURE\", 7, \"MEAS\", 4, ((void *)0));\n printf(\"\\nAssembling command tree:\\n\\n\");\n scpi_register_command(ctx.command_tree, SCPI_CL_SAMELEVEL, \"*IDN?\", 5, \"*IDN?\", 5, identify);\n scpi_register_command(measure, SCPI_CL_CHILD, \"VOLTAGE?\", 8, \"VOLT?\", 5, measure_callback);\n scpi_register_command(measure, SCPI_CL_CHILD, \"FREQUENCY?\", 10, \"FREQ?\", 5, ((void *)0));\n source = scpi_register_command(measure, SCPI_CL_SAMELEVEL, \"SOURCE\", 6, \"SOUR\", 4, ((void *)0));\n scpi_register_command(source, SCPI_CL_CHILD, \"VOLTAGE\", 7, \"VOLT\", 4, set_voltage);\n output = scpi_register_command(measure, SCPI_CL_SAMELEVEL, \"OUTPUT\", 6, \"OUTP\", 4, set_output);\n scpi_register_command(measure, SCPI_CL_SAMELEVEL, \"OUTPUT?\", 7, \"OUTP?\", 5, get_output);\n scpi_register_command(output, SCPI_CL_CHILD, \"STATE\", 5, \"STAT\", 4, set_output);\n scpi_register_command(output, SCPI_CL_CHILD, \"STATE?\", 6, \"STAT?\", 5, get_output);\n print_command_tree(ctx.command_tree, 0);\n putchar('\\n');\n execute_command(&ctx, \"*IDN?\");\n execute_command(&ctx, \":MEASURE:VOLTAGE?\");\n execute_command(&ctx, \":SOURCE:VOLTAGE 15kV\");\n execute_command(&ctx, \":MEASURE:VOLTAGE?\");\n execute_command(&ctx, \":OUTPUT:STATE ON\");\n execute_command(&ctx, \":MEASURE:VOLTAGE?\");\n execute_command(&ctx, \":OUTPUT:STATE?\");\n execute_command(&ctx, \":OUTPUT OFF\");\n execute_command(&ctx, \":OUTPUT?\");\n execute_command(&ctx, \":SYSTEM:ERROR?\");\n execute_command(&ctx, \":CAUSE:AN:ERROR\");\n execute_command(&ctx, \":CAUSE:ANOTHER:ERROR\");\n execute_command(&ctx, \":SYSTEM:ERROR?\");\n execute_command(&ctx, \":SYSTEM:ERROR?\");\n execute_command(&ctx, \":SYSTEM:ERROR?\");\n return 0;\n}",
"canonical_original_code": "int main(int argc, char **argv)\n{\n struct scpi_parser_context ctx;\n struct scpi_command *measure;\n struct scpi_command *source;\n struct scpi_command *output;\n voltage = 0;\n voltage_on = 0;\n scpi_init(&ctx);\n measure = scpi_register_command(ctx.command_tree, SCPI_CL_CHILD,\n \"MEASURE\", 7, \"MEAS\", 4, ((void *)0));\n printf(\"\\nAssembling command tree:\\n\\n\");\n scpi_register_command(ctx.command_tree, SCPI_CL_SAMELEVEL, \"*IDN?\", 5, \"*IDN?\", 5, identify);\n scpi_register_command(measure, SCPI_CL_CHILD, \"VOLTAGE?\", 8, \"VOLT?\", 5, measure_callback);\n scpi_register_command(measure, SCPI_CL_CHILD, \"FREQUENCY?\", 10, \"FREQ?\", 5, ((void *)0));\n source = scpi_register_command(measure, SCPI_CL_SAMELEVEL, \"SOURCE\", 6, \"SOUR\", 4, ((void *)0));\n scpi_register_command(source, SCPI_CL_CHILD, \"VOLTAGE\", 7, \"VOLT\", 4, set_voltage);\n output = scpi_register_command(measure, SCPI_CL_SAMELEVEL, \"OUTPUT\", 6, \"OUTP\", 4, set_output);\n scpi_register_command(measure, SCPI_CL_SAMELEVEL, \"OUTPUT?\", 7, \"OUTP?\", 5, get_output);\n scpi_register_command(output, SCPI_CL_CHILD, \"STATE\", 5, \"STAT\", 4, set_output);\n scpi_register_command(output, SCPI_CL_CHILD, \"STATE?\", 6, \"STAT?\", 5, get_output);\n print_command_tree(ctx.command_tree, 0);\n putchar('\\n');\n execute_command(&ctx, \"*IDN?\");\n execute_command(&ctx, \":MEASURE:VOLTAGE?\");\n execute_command(&ctx, \":SOURCE:VOLTAGE 15kV\");\n execute_command(&ctx, \":MEASURE:VOLTAGE?\");\n execute_command(&ctx, \":OUTPUT:STATE ON\");\n execute_command(&ctx, \":MEASURE:VOLTAGE?\");\n execute_command(&ctx, \":OUTPUT:STATE?\");\n execute_command(&ctx, \":OUTPUT OFF\");\n execute_command(&ctx, \":OUTPUT?\");\n execute_command(&ctx, \":SYSTEM:ERROR?\");\n execute_command(&ctx, \":CAUSE:AN:ERROR\");\n execute_command(&ctx, \":CAUSE:ANOTHER:ERROR\");\n execute_command(&ctx, \":SYSTEM:ERROR?\");\n execute_command(&ctx, \":SYSTEM:ERROR?\");\n execute_command(&ctx, \":SYSTEM:ERROR?\");\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char **"
],
[
"ctx",
"struct scpi_parser_context { struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 } (*callback)(struct scpi_parser_context *, struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *); } *command_tree; struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; } *error_queue_head; struct scpi_error *error_queue_tail; }"
],
[
"measure",
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 } (*callback)(struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; } *error_queue_head; struct scpi_error *error_queue_tail; } *, struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *); } *"
],
[
"source",
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 } (*callback)(struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; } *error_queue_head; struct scpi_error *error_queue_tail; } *, struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *); } *"
],
[
"output",
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 } (*callback)(struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; } *error_queue_head; struct scpi_error *error_queue_tail; } *, struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; } *); } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct scpi_parser_context { struct scpi_command *command_tree; struct scpi_error *error_queue_head; struct scpi_error *error_queue_tail; }",
"struct scpi_command { char *long_name; unsigned long long_name_length; char *short_name; unsigned long short_name_length; struct scpi_command *next; struct scpi_command *children; enum scpi_error_codes (*callback)(struct scpi_parser_context *, struct scpi_token *); }",
"struct scpi_error { int id; char *description; unsigned long length; struct scpi_error *next; }",
"enum scpi_error_codes { SCPI_SUCCESS=0, SCPI_COMMAND_NOT_FOUND=-1, SCPI_NO_CALLBACK=-2 }",
"struct scpi_token { unsigned char type; char *value; unsigned long length; struct scpi_token *next; }"
],
"binary_hash": "32d3c78d029bc565d3c2330b087ae4487493c6ed545a60fb718988bd2791e716"
}
] |
704a7290545268f82ffad20339cb76180d24e58218c2b62dee17543fe398da1f | amoweb/RaspberryBoucle | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"main",
"->",
"IHMinit",
"midiInit",
"midiOpenDevice",
"inputAvailable",
"midiReadLast",
"IHMuserEntry",
"midiFlush",
"midiWrite"
],
[
"midiInit",
"->",
"main"
],
[
"midiOpenDevice",
"->",
"main"
],
[
"inputAvailable",
"->",
"main"
],
[
"midiNoteOn",
"->",
"midiNoteOff"
],
[
"midiWrite",
"->",
"main"
],
[
"midiNoteOff",
"->",
"midiNoteOn"
],
[
"midiReadLast",
"->",
"main"
],
[
"midiFlush",
"->",
"main"
],
[
"IHMinit",
"->",
"main"
],
[
"IHMuserEntry",
"->",
"main"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_404010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"void *func3()\n{\nreturn &_bss_start;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"void *func5()\n{\nvoid *result; // rax\n\nif ( !completed_0 )\n{\nresult = func3();\ncompleted_0 = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"_libc_csu_init",
"void __fastcall func17(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func18(void)\n{\n;\n}"
]
] | [
{
"name": "main",
"canonical_name": "main",
"repo": "amoweb/RaspberryBoucle",
"decompiled_code": "int __cdecl __noreturn main(int argc, const char **argv, const char **envp)\n{\nint v3; // [rsp+0h] [rbp-10h]\nint i; // [rsp+4h] [rbp-Ch]\nsigned int v5; // [rsp+8h] [rbp-8h]\nint v6; // [rsp+Ch] [rbp-4h]\n\nputs(\"Boucle Midi - amoweb.fr\");\nIHMinit(\"Boucle Midi - amoweb.fr\", argv);\nif ( (unsigned __int8)midiInit() )\nexit(-1);\nmidiOpenDevice(3LL, 2LL);\nwhile ( 1 )\n{\nLABEL_4:\nv6 = 0;\nv5 = 0;\ndo\n{\nif ( (unsigned __int8)inputAvailable() )\n{\nmidiReadLast(24LL * (v5 % 1000) + 4210912);\nif ( !v6 )\n{\nv6 = qword_4040F0[3 * (v5 % 1000)];\nputs(\"Recording\");\n}\n++v5;\n}\n}\nwhile ( !(unsigned __int8)IHMuserEntry() );\nprintf(\"Recorded=%d t=%ld\\n\", (unsigned int)v5, qword_4040F0[3 * (v5 % 1000)] - v6);\nwhile ( v5 )\n{\nputs(\"Playing\\r\");\nv3 = Pt_Time();\nfor ( i = 0; i < v5; i += 2 )\n{\nwhile ( (int)(Pt_Time() - v3) < qword_4040F0[3 * i] - v6 )\n{\nif ( (unsigned __int8)IHMuserEntry() )\ngoto LABEL_4;\nmidiFlush();\n}\nmidiWrite(24LL * i + 4210912);\n}\n}\n}\n}\n",
"canonical_decompiled_code": "int __cdecl __noreturn main(int argc, const char **argv, const char **envp)\n{\nint v3; // [rsp+0h] [rbp-10h]\nint i; // [rsp+4h] [rbp-Ch]\nsigned int v5; // [rsp+8h] [rbp-8h]\nint v6; // [rsp+Ch] [rbp-4h]\n\nputs(\"Boucle Midi - amoweb.fr\");\nfunc15(\"Boucle Midi - amoweb.fr\", argv);\nif ( (unsigned __int8)func7() )\nexit(-1);\nfunc8(3LL, 2LL);\nwhile ( 1 )\n{\nLABEL_4:\nv6 = 0;\nv5 = 0;\ndo\n{\nif ( (unsigned __int8)func9() )\n{\nfunc13(24LL * (v5 % 1000) + 4210912);\nif ( !v6 )\n{\nv6 = qword_4040F0[3 * (v5 % 1000)];\nputs(\"Recording\");\n}\n++v5;\n}\n}\nwhile ( !(unsigned __int8)func16() );\nprintf(\"Recorded=%d t=%ld\\n\", (unsigned int)v5, qword_4040F0[3 * (v5 % 1000)] - v6);\nwhile ( v5 )\n{\nputs(\"Playing\\r\");\nv3 = Pt_Time();\nfor ( i = 0; i < v5; i += 2 )\n{\nwhile ( (int)(Pt_Time() - v3) < qword_4040F0[3 * i] - v6 )\n{\nif ( (unsigned __int8)func16() )\ngoto LABEL_4;\nfunc14();\n}\nfunc11(24LL * i + 4210912);\n}\n}\n}\n}",
"original_code": "int main()\n{\n printf(\"Boucle Midi - amoweb.fr\\n\");\n IHMinit();\n if(midiInit())\n exit(-1);\n midiOpenDevice(3, 2);\nbeginRecord:\n while(1) {\n int tStartRecord = 0;\n int pos = 0;\n while(1) {\n if(inputAvailable()) {\n midiReadLast(&(record[pos%1000]));\n if(tStartRecord == 0) {\n tStartRecord = record[pos%1000].t;\n printf(\"Recording\\n\");\n }\n pos++;\n }\n if(IHMuserEntry()){\n break;\n }\n }\n printf(\"Recorded=%d t=%ld\\n\", pos, record[pos%1000].t-tStartRecord);\n while(1) {\n if(pos == 0)\n goto beginRecord;\n printf(\"Playing\\r\\n\");\n int tStartPlay = Pt_Time(((void *)0));\n for(int i=0; i<pos; i++) {\n while(Pt_Time(((void *)0))-tStartPlay < record[i].t-tStartRecord) {\n if(IHMuserEntry())\n goto beginRecord;\n midiFlush();\n }\n midiWrite(&record[i]);\n i++;\n }\n }\n pos = 0;\n midiFlush();\n }\n}",
"canonical_original_code": "int main()\n{\n printf(\"Boucle Midi - amoweb.fr\\n\");\n IHMinit();\n if(midiInit())\n exit(-1);\n midiOpenDevice(3, 2);\nbeginRecord:\n while(1) {\n int tStartRecord = 0;\n int pos = 0;\n while(1) {\n if(inputAvailable()) {\n midiReadLast(&(record[pos%1000]));\n if(tStartRecord == 0) {\n tStartRecord = record[pos%1000].t;\n printf(\"Recording\\n\");\n }\n pos++;\n }\n if(IHMuserEntry()){\n break;\n }\n }\n printf(\"Recorded=%d t=%ld\\n\", pos, record[pos%1000].t-tStartRecord);\n while(1) {\n if(pos == 0)\n goto beginRecord;\n printf(\"Playing\\r\\n\");\n int tStartPlay = Pt_Time(((void *)0));\n for(int i = 0; i<pos; i++) {\n while(Pt_Time(((void *)0))-tStartPlay < record[i].t-tStartRecord) {\n if(IHMuserEntry())\n goto beginRecord;\n midiFlush();\n }\n midiWrite(&record[i]);\n i++;\n }\n }\n pos = 0;\n midiFlush();\n }\n}",
"variable_types": [
[
"tStartRecord",
"int"
],
[
"pos",
"int"
],
[
"tStartPlay",
"int"
],
[
"i",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "704a7290545268f82ffad20339cb76180d24e58218c2b62dee17543fe398da1f"
},
{
"name": "midiInit",
"canonical_name": "func7",
"repo": "amoweb/RaspberryBoucle",
"decompiled_code": "__int64 midiInit()\n{\n__int64 v1; // [rsp+8h] [rbp-18h]\nint i; // [rsp+14h] [rbp-Ch]\nint v3; // [rsp+18h] [rbp-8h]\nint v4; // [rsp+1Ch] [rbp-4h]\n\nPm_Initialize();\nnbEventWaiting = 0;\niEventWaiting = 0;\nv4 = -1;\nv3 = -1;\nfor ( i = 0; i < (int)Pm_CountDevices(); ++i )\n{\nv1 = Pm_GetDeviceInfo();\nif ( *(_DWORD *)(v1 + 24) || *(_DWORD *)(v1 + 28) )\n{\nprintf(\"%d: %s, %s\", (unsigned int)i, *(const char **)(v1 + 8), *(const char **)(v1 + 16));\nif ( *(_DWORD *)(v1 + 24) )\n{\nv4 = i;\nprintf(\" (input)\");\n}\nif ( *(_DWORD *)(v1 + 28) )\n{\nv3 = i;\nprintf(\" (output)\");\n}\nputchar(10);\n}\n}\nif ( v3 != -1 && v4 != -1 )\nreturn 0LL;\nputs(\"Midi port not found.\\r\");\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 func7()\n{\n__int64 v1; // [rsp+8h] [rbp-18h]\nint i; // [rsp+14h] [rbp-Ch]\nint v3; // [rsp+18h] [rbp-8h]\nint v4; // [rsp+1Ch] [rbp-4h]\n\nPm_Initialize();\nnbEventWaiting = 0;\niEventWaiting = 0;\nv4 = -1;\nv3 = -1;\nfor ( i = 0; i < (int)Pm_CountDevices(); ++i )\n{\nv1 = Pm_GetDeviceInfo();\nif ( *(_DWORD *)(v1 + 24) || *(_DWORD *)(v1 + 28) )\n{\nprintf(\"%d: %s, %s\", (unsigned int)i, *(const char **)(v1 + 8), *(const char **)(v1 + 16));\nif ( *(_DWORD *)(v1 + 24) )\n{\nv4 = i;\nprintf(\" (input)\");\n}\nif ( *(_DWORD *)(v1 + 28) )\n{\nv3 = i;\nprintf(\" (output)\");\n}\nputchar(10);\n}\n}\nif ( v3 != -1 && v4 != -1 )\nreturn 0LL;\nputs(\"Midi port not found.\\r\");\nreturn 1LL;\n}",
"original_code": "_Bool midiInit()\n{\n Pm_Initialize();\n nbEventWaiting = 0;\n iEventWaiting = 0;\n int portIn = -1;\n int portOut = -1;\n for (int i = 0; i < Pm_CountDevices(); i++) {\n const PmDeviceInfo *info = Pm_GetDeviceInfo(i);\n if ((info->input) || (info->output)) {\n printf(\"%d: %s, %s\", i, info->interf, info->name);\n if (info->input) {\n portIn = i;\n printf(\" (input)\");\n }\n if (info->output) {\n portOut = i;\n printf(\" (output)\");\n }\n printf(\"\\n\");\n }\n }\n if(portOut == -1 || portIn == -1) {\n printf(\"Midi port not found.\\r\\n\");\n return -1;\n }\n return 0;\n}",
"canonical_original_code": "_Bool midiInit()\n{\n Pm_Initialize();\n nbEventWaiting = 0;\n iEventWaiting = 0;\n int portIn = -1;\n int portOut = -1;\n for (int i = 0; i < Pm_CountDevices(); i++) {\n struct PmDeviceInfo *info = Pm_GetDeviceInfo(i);\n if ((info->input) || (info->output)) {\n printf(\"%d: %s, %s\", i, info->interf, info->name);\n if (info->input) {\n portIn = i;\n printf(\" (input)\");\n }\n if (info->output) {\n portOut = i;\n printf(\" (output)\");\n }\n printf(\"\\n\");\n }\n }\n if(portOut == -1 || portIn == -1) {\n printf(\"Midi port not found.\\r\\n\");\n return -1;\n }\n return 0;\n}",
"variable_types": [
[
"portIn",
"int"
],
[
"portOut",
"int"
],
[
"i",
"int"
],
[
"info",
"struct PmDeviceInfo { int structVersion; char *interf; char *name; int input; int output; int opened; } *"
]
],
"return_type": "_Bool",
"user_defined_types": [
"struct PmDeviceInfo { int structVersion; char *interf; char *name; int input; int output; int opened; }"
],
"binary_hash": "704a7290545268f82ffad20339cb76180d24e58218c2b62dee17543fe398da1f"
},
{
"name": "midiOpenDevice",
"canonical_name": "func8",
"repo": "amoweb/RaspberryBoucle",
"decompiled_code": "__int64 midiOpenDevice()\n{\nPt_Start();\nPm_OpenInput();\nPm_SetFilter();\nreturn Pm_OpenOutput();\n}\n",
"canonical_decompiled_code": "__int64 func8()\n{\nPt_Start();\nPm_OpenInput();\nPm_SetFilter();\nreturn Pm_OpenOutput();\n}",
"original_code": "void midiOpenDevice(int inId, int outId)\n{\n Pt_Start(1, ((void *)0), ((void *)0));\n Pm_OpenInput(&in, inId, ((void *)0), 1000,\n (PmTimestamp (*)(void *)) Pt_Time, ((void *)0));\n Pm_SetFilter(in, (1 << 0x0E) | (1 << 0x08));\n Pm_OpenOutput(&out, outId, ((void *)0), 1000,\n (PmTimestamp (*)(void *)) Pt_Time, ((void *)0), 0);\n}",
"canonical_original_code": "void midiOpenDevice(int inId, int outId)\n{\n Pt_Start(1, ((void *)0), ((void *)0));\n Pm_OpenInput(&in, inId, ((void *)0), 1000,\n (int (*)(void *)) Pt_Time, ((void *)0));\n Pm_SetFilter(in, (1 << 0x0E) | (1 << 0x08));\n Pm_OpenOutput(&out, outId, ((void *)0), 1000,\n (int (*)(void *)) Pt_Time, ((void *)0), 0);\n}",
"variable_types": [
[
"inId",
"int"
],
[
"outId",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "704a7290545268f82ffad20339cb76180d24e58218c2b62dee17543fe398da1f"
},
{
"name": "inputAvailable",
"canonical_name": "func9",
"repo": "amoweb/RaspberryBoucle",
"decompiled_code": "__int64 inputAvailable()\n{\nif ( (unsigned int)Pm_Poll() == 1 || nbEventWaiting > 0 )\nreturn 1LL;\nPm_Poll();\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 func9()\n{\nif ( (unsigned int)Pm_Poll() == 1 || nbEventWaiting > 0 )\nreturn 1LL;\nPm_Poll();\nreturn 0LL;\n}",
"original_code": "_Bool inputAvailable()\n{\n if(Pm_Poll(in) == 1 || nbEventWaiting > 0)\n return 1;\n else if(Pm_Poll(in) == 0)\n return 0;\n return 0;\n}",
"canonical_original_code": "_Bool inputAvailable()\n{\n if(Pm_Poll(in) == 1 || nbEventWaiting > 0)\n return 1;\n else if(Pm_Poll(in) == 0)\n return 0;\n return 0;\n}",
"variable_types": [],
"return_type": "_Bool",
"user_defined_types": [],
"binary_hash": "704a7290545268f82ffad20339cb76180d24e58218c2b62dee17543fe398da1f"
},
{
"name": "midiNoteOn",
"canonical_name": "func10",
"repo": "amoweb/RaspberryBoucle",
"decompiled_code": "__int64 __fastcall midiNoteOn(__int16 a1, int a2)\n{\nint v2; // eax\n\ndword_409EA4 = Pt_Time();\nv2 = (a2 << 16) & 0xFF0000 | (unsigned __int16)(a1 << 8);\nLOBYTE(v2) = -112;\noutBuffer = v2;\nreturn Pm_Write();\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func10(__int16 a1, int a2)\n{\nint v2; // eax\n\ndword_409EA4 = Pt_Time();\nv2 = (a2 << 16) & 0xFF0000 | (unsigned __int16)(a1 << 8);\nLOBYTE(v2) = -112;\noutBuffer = v2;\nreturn Pm_Write();\n}",
"original_code": "void midiNoteOn(int note, int vol)\n{\n outBuffer[0].timestamp = Pt_Time(((void *)0));\n outBuffer[0].message = ((((vol) << 16) & 0xFF0000) | (((note) << 8) & 0xFF00) | ((0x90) & 0xFF));\n Pm_Write(out, outBuffer, 1);\n}",
"canonical_original_code": "void midiNoteOn(int note, int vol)\n{\n outBuffer[0].timestamp = Pt_Time(((void *)0));\n outBuffer[0].message = ((((vol) << 16) & 0xFF0000) | (((note) << 8) & 0xFF00) | ((0x90) & 0xFF));\n Pm_Write(out, outBuffer, 1);\n}",
"variable_types": [
[
"note",
"int"
],
[
"vol",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "704a7290545268f82ffad20339cb76180d24e58218c2b62dee17543fe398da1f"
},
{
"name": "midiWrite",
"canonical_name": "func11",
"repo": "amoweb/RaspberryBoucle",
"decompiled_code": "__int64 __fastcall midiWrite(_DWORD *a1)\n{\ndword_409EA4 = Pt_Time();\noutBuffer = (unsigned __int16)((unsigned __int16)*a1 << 8) | (a1[1] << 16) & 0xFF0000 | (unsigned __int8)a1[2];\nreturn Pm_Write();\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func11(_DWORD *a1)\n{\ndword_409EA4 = Pt_Time();\noutBuffer = (unsigned __int16)((unsigned __int16)*a1 << 8) | (a1[1] << 16) & 0xFF0000 | (unsigned __int8)a1[2];\nreturn Pm_Write();\n}",
"original_code": "void midiWrite(struct Note *note)\n{\n outBuffer[0].timestamp = Pt_Time(((void *)0));\n outBuffer[0].message = ((((note->vol) << 16) & 0xFF0000) | (((note->note) << 8) & 0xFF00) | ((note->status) & 0xFF));\n Pm_Write(out, outBuffer, 1);\n}",
"canonical_original_code": "void midiWrite(struct Note *note)\n{\n outBuffer[0].timestamp = Pt_Time(((void *)0));\n outBuffer[0].message = ((((note->vol) << 16) & 0xFF0000) | (((note->note) << 8) & 0xFF00) | ((note->status) & 0xFF));\n Pm_Write(out, outBuffer, 1);\n}",
"variable_types": [
[
"note",
"struct Note { int note; int vol; int status; long t; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct Note { int note; int vol; int status; long t; }"
],
"binary_hash": "704a7290545268f82ffad20339cb76180d24e58218c2b62dee17543fe398da1f"
},
{
"name": "midiNoteOff",
"canonical_name": "func12",
"repo": "amoweb/RaspberryBoucle",
"decompiled_code": "__int64 __fastcall midiNoteOff(__int16 a1)\n{\nreturn midiNoteOn(a1, 0);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func12(__int16 a1)\n{\nreturn func10(a1, 0);\n}",
"original_code": "void midiNoteOff(int note)\n{\n midiNoteOn(note, 0);\n}",
"canonical_original_code": "void midiNoteOff(int note)\n{\n midiNoteOn(note, 0);\n}",
"variable_types": [
[
"note",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "704a7290545268f82ffad20339cb76180d24e58218c2b62dee17543fe398da1f"
},
{
"name": "midiReadLast",
"canonical_name": "func13",
"repo": "amoweb/RaspberryBoucle",
"decompiled_code": "__int64 __fastcall midiReadLast(__int64 a1)\n{\nif ( !nbEventWaiting )\n{\niEventWaiting = 0;\nnbEventWaiting = Pm_Read();\n}\n*(_QWORD *)(a1 + 16) = dword_40BDE4[2 * iEventWaiting];\n*(_DWORD *)a1 = (unsigned __int8)BYTE1(inBuffer[2 * iEventWaiting]);\n*(_DWORD *)(a1 + 4) = (unsigned __int8)BYTE2(inBuffer[2 * iEventWaiting]);\n*(_DWORD *)(a1 + 8) = (unsigned __int8)inBuffer[2 * iEventWaiting];\n--nbEventWaiting;\nreturn (unsigned int)++iEventWaiting;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func13(__int64 a1)\n{\nif ( !nbEventWaiting )\n{\niEventWaiting = 0;\nnbEventWaiting = Pm_Read();\n}\n*(_QWORD *)(a1 + 16) = dword_40BDE4[2 * iEventWaiting];\n*(_DWORD *)a1 = (unsigned __int8)BYTE1(inBuffer[2 * iEventWaiting]);\n*(_DWORD *)(a1 + 4) = (unsigned __int8)BYTE2(inBuffer[2 * iEventWaiting]);\n*(_DWORD *)(a1 + 8) = (unsigned __int8)inBuffer[2 * iEventWaiting];\n--nbEventWaiting;\nreturn (unsigned int)++iEventWaiting;\n}",
"original_code": "void midiReadLast(struct Note *note)\n{\n if(nbEventWaiting == 0) {\n iEventWaiting = 0;\n nbEventWaiting = Pm_Read(in, inBuffer, 1);\n }\n note->t = inBuffer[iEventWaiting].timestamp;\n note->note = (((inBuffer[iEventWaiting].message) >> 8) & 0xFF);\n note->vol = (((inBuffer[iEventWaiting].message) >> 16) & 0xFF);\n note->status = ((inBuffer[iEventWaiting].message) & 0xFF);\n nbEventWaiting--;\n iEventWaiting++;\n}",
"canonical_original_code": "void midiReadLast(struct Note *note)\n{\n if(nbEventWaiting == 0) {\n iEventWaiting = 0;\n nbEventWaiting = Pm_Read(in, inBuffer, 1);\n }\n note->t = inBuffer[iEventWaiting].timestamp;\n note->note = (((inBuffer[iEventWaiting].message) >> 8) & 0xFF);\n note->vol = (((inBuffer[iEventWaiting].message) >> 16) & 0xFF);\n note->status = ((inBuffer[iEventWaiting].message) & 0xFF);\n nbEventWaiting--;\n iEventWaiting++;\n}",
"variable_types": [
[
"note",
"struct Note { int note; int vol; int status; long t; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct Note { int note; int vol; int status; long t; }"
],
"binary_hash": "704a7290545268f82ffad20339cb76180d24e58218c2b62dee17543fe398da1f"
},
{
"name": "midiFlush",
"canonical_name": "func14",
"repo": "amoweb/RaspberryBoucle",
"decompiled_code": "__int64 midiFlush()\n{\nnbEventWaiting = 0;\niEventWaiting = 0;\nreturn Pm_Read();\n}\n",
"canonical_decompiled_code": "__int64 func14()\n{\nnbEventWaiting = 0;\niEventWaiting = 0;\nreturn Pm_Read();\n}",
"original_code": "void midiFlush()\n{\n nbEventWaiting = 0;\n iEventWaiting = 0;\n Pm_Read(in, inBuffer, 1);\n}",
"canonical_original_code": "void midiFlush()\n{\n nbEventWaiting = 0;\n iEventWaiting = 0;\n Pm_Read(in, inBuffer, 1);\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "704a7290545268f82ffad20339cb76180d24e58218c2b62dee17543fe398da1f"
},
{
"name": "IHMinit",
"canonical_name": "func15",
"repo": "amoweb/RaspberryBoucle",
"decompiled_code": "int IHMinit()\n{\nfdMouse = open(\"/dev/input/mice\", (int)\"r\");\nreturn fcntl(fdMouse, 4, 2048LL);\n}\n",
"canonical_decompiled_code": "int func15()\n{\nfdMouse = open(\"/dev/input/mice\", (int)\"r\");\nreturn fcntl(fdMouse, 4, 2048LL);\n}",
"original_code": "void IHMinit()\n{\n fdMouse = open(\"/dev/input/mice\", \"r\");\n fcntl(fdMouse, 4, 04000);\n}",
"canonical_original_code": "void IHMinit()\n{\n fdMouse = open(\"/dev/input/mice\", \"r\");\n fcntl(fdMouse, 4, 04000);\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "704a7290545268f82ffad20339cb76180d24e58218c2b62dee17543fe398da1f"
},
{
"name": "IHMuserEntry",
"canonical_name": "func16",
"repo": "amoweb/RaspberryBoucle",
"decompiled_code": "__int64 IHMuserEntry()\n{\n__int64 result; // rax\n\nif ( (unsigned int)read(fdMouse, &b, 2uLL) == -1 )\ngoto LABEL_8;\nif ( (b & 1) != 0 )\nreturn 76LL;\nif ( (b & 2) != 0 )\nreturn 82LL;\nif ( (b & 4) == 0 )\nLABEL_8:\nresult = 0LL;\nelse\nresult = 77LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 func16()\n{\n__int64 result; // rax\n\nif ( (unsigned int)read(fdMouse, &b, 2uLL) == -1 )\ngoto LABEL_8;\nif ( (b & 1) != 0 )\nreturn 76LL;\nif ( (b & 2) != 0 )\nreturn 82LL;\nif ( (b & 4) == 0 )\nLABEL_8:\nresult = 0LL;\nelse\nresult = 77LL;\nreturn result;\n}",
"original_code": "char IHMuserEntry()\n{\n int r = read(fdMouse, b, 2);\n if(r != -1) {\n int lb=(b[0]&1)>0;\n int rb=(b[0]&2)>0;\n int mb=(b[0]&4)>0;\n if(lb)\n return 'L';\n if(rb)\n return 'R';\n if(mb)\n return 'M';\n }\n return 0;\n}",
"canonical_original_code": "char IHMuserEntry()\n{\n int r = read(fdMouse, b, 2);\n if(r != -1) {\n int lb = (b[0]&1)>0;\n int rb = (b[0]&2)>0;\n int mb = (b[0]&4)>0;\n if(lb)\n return 'L';\n if(rb)\n return 'R';\n if(mb)\n return 'M';\n }\n return 0;\n}",
"variable_types": [
[
"r",
"int"
],
[
"lb",
"int"
],
[
"rb",
"int"
],
[
"mb",
"int"
]
],
"return_type": "char",
"user_defined_types": [],
"binary_hash": "704a7290545268f82ffad20339cb76180d24e58218c2b62dee17543fe398da1f"
}
] |
27f46eee7065b9e85ac39271fe7ddc487ade326ea704be4d60444d2c38e330a6 | Bladtman242/BOSC2013 | [
[
"asyncRunner",
"->"
],
[
"asyncListTest",
"->",
"main"
],
[
"main",
"->",
"asyncListTest"
]
] | [] | [
{
"name": "asyncRunner",
"canonical_name": "func0",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "void __fastcall __noreturn asyncRunner(void *a1)\n{\n__int64 v1; // rax\nint i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i < 500; ++i )\n{\nv1 = node_new();\nlist_add(fifo, v1);\n}\npthread_exit(0LL);\n}\n",
"canonical_decompiled_code": "void __fastcall __noreturn func0(void *a1)\n{\n__int64 v1; // rax\nint i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i < 500; ++i )\n{\nv1 = node_new();\nlist_add(fifo, v1);\n}\npthread_exit(0LL);\n}",
"original_code": "void *asyncRunner(void* peh){\n int i;\n for(i=0; i<elmsPerThread; i++){\n list_add(fifo, node_new());\n }\n pthread_exit(((void *)0));\n}",
"canonical_original_code": "void *asyncRunner(void *peh){\n int i;\n for(i=0; i<elmsPerThread; i++){\n list_add(fifo, node_new());\n }\n pthread_exit(((void *)0));\n}",
"variable_types": [
[
"peh",
"void *"
],
[
"i",
"int"
]
],
"return_type": "void *",
"user_defined_types": [],
"binary_hash": "27f46eee7065b9e85ac39271fe7ddc487ade326ea704be4d60444d2c38e330a6"
},
{
"name": "asyncListTest",
"canonical_name": "func1",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "__int64 asyncListTest()\n{\n__int64 v0; // rsi\n__int64 v1; // rdx\nvoid *v2; // rsp\n__int64 v3; // rdx\n__int64 result; // rax\nchar v5; // [rsp+7h] [rbp-69h] BYREF\npthread_t *newthread; // [rsp+8h] [rbp-68h]\nint v7; // [rsp+14h] [rbp-5Ch]\nunsigned __int64 v8; // [rsp+18h] [rbp-58h]\n__int64 v9; // [rsp+20h] [rbp-50h]\nint i; // [rsp+2Ch] [rbp-44h]\nint v11; // [rsp+30h] [rbp-40h]\nint v12; // [rsp+34h] [rbp-3Ch]\n__int64 j; // [rsp+38h] [rbp-38h]\n\nfifo = list_new();\nv9 = 2LL;\nv0 = 16LL;\nv1 = 7LL;\nv2 = alloca(32LL);\nv8 = 8 * ((unsigned __int64)&v5 >> 3);\nfor ( i = 0; i < 3; ++i )\n{\nnewthread = (pthread_t *)malloc(8uLL);\n*(_QWORD *)(v8 + 8LL * i) = newthread;\nv0 = 0LL;\npthread_create(newthread, 0LL, (void *(*)(void *))asyncRunner, 0LL);\n}\nfor ( i = 0; i < 3; ++i )\n{\nv0 = 0LL;\npthread_join(**(_QWORD **)(v8 + 8LL * i), 0LL);\n}\nv11 = 0;\nv12 = 0;\nv7 = *(_DWORD *)fifo;\nfor ( j = *(_QWORD *)(*(_QWORD *)(fifo + 8) + 8LL); j; j = *(_QWORD *)(j + 8) )\n++v12;\nfor ( j = list_remove(fifo, v0, v1); j; j = list_remove(fifo, v0, v3) )\n++v11;\nif ( v7 != v12 )\n_assert_fail(\"assertedN == actualN\", \"main.c\", 0x35u, \"asyncListTest\");\nif ( v11 != v12 )\n_assert_fail(\"removeN == actualN\", \"main.c\", 0x36u, \"asyncListTest\");\nif ( v12 != 1500 )\n_assert_fail(\"elmsPerThread*numberOfThreads == actualN\", \"main.c\", 0x37u, \"asyncListTest\");\nresult = *(unsigned int *)fifo;\nif ( (_DWORD)result )\n_assert_fail(\"fifo->len == 0\", \"main.c\", 0x38u, \"asyncListTest\");\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 func1()\n{\n__int64 v0; // rsi\n__int64 v1; // rdx\nvoid *v2; // rsp\n__int64 v3; // rdx\n__int64 result; // rax\nchar v5; // [rsp+7h] [rbp-69h] BYREF\npthread_t *newthread; // [rsp+8h] [rbp-68h]\nint v7; // [rsp+14h] [rbp-5Ch]\nunsigned __int64 v8; // [rsp+18h] [rbp-58h]\n__int64 v9; // [rsp+20h] [rbp-50h]\nint i; // [rsp+2Ch] [rbp-44h]\nint v11; // [rsp+30h] [rbp-40h]\nint v12; // [rsp+34h] [rbp-3Ch]\n__int64 j; // [rsp+38h] [rbp-38h]\n\nfifo = list_new();\nv9 = 2LL;\nv0 = 16LL;\nv1 = 7LL;\nv2 = alloca(32LL);\nv8 = 8 * ((unsigned __int64)&v5 >> 3);\nfor ( i = 0; i < 3; ++i )\n{\nnewthread = (pthread_t *)malloc(8uLL);\n*(_QWORD *)(v8 + 8LL * i) = newthread;\nv0 = 0LL;\npthread_create(newthread, 0LL, (void *(*)(void *))asyncRunner, 0LL);\n}\nfor ( i = 0; i < 3; ++i )\n{\nv0 = 0LL;\npthread_join(**(_QWORD **)(v8 + 8LL * i), 0LL);\n}\nv11 = 0;\nv12 = 0;\nv7 = *(_DWORD *)fifo;\nfor ( j = *(_QWORD *)(*(_QWORD *)(fifo + 8) + 8LL); j; j = *(_QWORD *)(j + 8) )\n++v12;\nfor ( j = list_remove(fifo, v0, v1); j; j = list_remove(fifo, v0, v3) )\n++v11;\nif ( v7 != v12 )\n_assert_fail(\"assertedN == actualN\", \"main.c\", 0x35u, \"asyncListTest\");\nif ( v11 != v12 )\n_assert_fail(\"removeN == actualN\", \"main.c\", 0x36u, \"asyncListTest\");\nif ( v12 != 1500 )\n_assert_fail(\"elmsPerThread*numberOfThreads == actualN\", \"main.c\", 0x37u, \"asyncListTest\");\nresult = *(unsigned int *)fifo;\nif ( (_DWORD)result )\n_assert_fail(\"fifo->len == 0\", \"main.c\", 0x38u, \"asyncListTest\");\nreturn result;\n}",
"original_code": "void asyncListTest(){\n fifo = list_new();\n pthread_t *ids[numberOfThreads];\n int i;\n for(i=0; i<numberOfThreads; i++){\n pthread_t* tid = (pthread_t *) malloc(sizeof(pthread_t));\n ids[i] = tid;\n pthread_create(tid, ((void *)0), asyncRunner, ((void *)0));\n }\n for(i=0; i<numberOfThreads; i++){\n pthread_join(*ids[i], ((void *)0));\n }\n int removeN=0;\n int actualN=0;\n int assertedN = fifo->len;\n Node *n = fifo->first->next;\n while(n != ((void *)0)) {\n actualN++;\n n = n->next;\n }\n n = list_remove(fifo);\n while(n != ((void *)0)){\n removeN++;\n n = list_remove(fifo);\n }\n ((void) sizeof ((assertedN == actualN) ? 1 : 0), __extension__ ({ if (assertedN == actualN) ; else __assert_fail (\"assertedN == actualN\", \"main.c\", 53, __extension__ __PRETTY_FUNCTION__); }));\n ((void) sizeof ((removeN == actualN) ? 1 : 0), __extension__ ({ if (removeN == actualN) ; else __assert_fail (\"removeN == actualN\", \"main.c\", 54, __extension__ __PRETTY_FUNCTION__); }));\n ((void) sizeof ((elmsPerThread*numberOfThreads == actualN) ? 1 : 0), __extension__ ({ if (elmsPerThread*numberOfThreads == actualN) ; else __assert_fail (\"elmsPerThread*numberOfThreads == actualN\", \"main.c\", 55, __extension__ __PRETTY_FUNCTION__); }));\n ((void) sizeof ((fifo->len == 0) ? 1 : 0), __extension__ ({ if (fifo->len == 0) ; else __assert_fail (\"fifo->len == 0\", \"main.c\", 56, __extension__ __PRETTY_FUNCTION__); }));\n}",
"canonical_original_code": "void asyncListTest(){\n fifo = list_new();\n unsigned long *ids[-1];\n int i;\n for(i=0; i<numberOfThreads; i++){\n unsigned long *tid = (pthread_t *) malloc(sizeof(pthread_t));\n ids[i] = tid;\n pthread_create(tid, ((void *)0), asyncRunner, ((void *)0));\n }\n for(i=0; i<numberOfThreads; i++){\n pthread_join(*ids[i], ((void *)0));\n }\n int removeN = 0;\n int actualN = 0;\n int assertedN = fifo->len;\n struct node *n = fifo->first->next;\n while(n != ((void *)0)) {\n actualN++;\n n = n->next;\n }\n n = list_remove(fifo);\n while(n != ((void *)0)){\n removeN++;\n n = list_remove(fifo);\n }\n ((void) sizeof ((assertedN == actualN) ? 1 : 0), __extension__ ({ if (assertedN == actualN) ; else __assert_fail (\"assertedN == actualN\", \"main.c\", 53, __extension__ __PRETTY_FUNCTION__); }));\n ((void) sizeof ((removeN == actualN) ? 1 : 0), __extension__ ({ if (removeN == actualN) ; else __assert_fail (\"removeN == actualN\", \"main.c\", 54, __extension__ __PRETTY_FUNCTION__); }));\n ((void) sizeof ((elmsPerThread*numberOfThreads == actualN) ? 1 : 0), __extension__ ({ if (elmsPerThread*numberOfThreads == actualN) ; else __assert_fail (\"elmsPerThread*numberOfThreads == actualN\", \"main.c\", 55, __extension__ __PRETTY_FUNCTION__); }));\n ((void) sizeof ((fifo->len == 0) ? 1 : 0), __extension__ ({ if (fifo->len == 0) ; else __assert_fail (\"fifo->len == 0\", \"main.c\", 56, __extension__ __PRETTY_FUNCTION__); }));\n}",
"variable_types": [
[
"ids",
"unsigned long *[-1]"
],
[
"i",
"int"
],
[
"tid",
"unsigned long *"
],
[
"removeN",
"int"
],
[
"actualN",
"int"
],
[
"assertedN",
"int"
],
[
"n",
"struct node { void *elm; struct node *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { void *elm; struct node *next; }"
],
"binary_hash": "27f46eee7065b9e85ac39271fe7ddc487ade326ea704be4d60444d2c38e330a6"
},
{
"name": "main",
"canonical_name": "main",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nasyncListTest(argc, argv, envp);\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nfunc1(argc, argv, envp);\nreturn 0;\n}",
"original_code": "int main(int argc, char* argv[])\n{\n asyncListTest();\n return 0;\n fifo = list_new();\n list_add(fifo, node_new_str(\"s1\"));\n list_add(fifo, node_new_str(\"s2\"));\n Node *n1 = list_remove(fifo);\n if (n1 == ((void *)0)) { printf(\"Error no elements in list\\n\"); exit(-1);}\n Node *n2 = list_remove(fifo);\n if (n2 == ((void *)0)) { printf(\"Error no elements in list\\n\"); exit(-1);}\n printf(\"%s\\n%s\\n\", n1->elm, n2->elm);\n return 0;\n}",
"canonical_original_code": "int main(int argc, char *argv[])\n{\n asyncListTest();\n return 0;\n fifo = list_new();\n list_add(fifo, node_new_str(\"s1\"));\n list_add(fifo, node_new_str(\"s2\"));\n struct node *n1 = list_remove(fifo);\n if (n1 == ((void *)0)) { printf(\"Error no elements in list\\n\"); exit(-1);}\n struct node *n2 = list_remove(fifo);\n if (n2 == ((void *)0)) { printf(\"Error no elements in list\\n\"); exit(-1);}\n printf(\"%s\\n%s\\n\", n1->elm, n2->elm);\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char *[]"
],
[
"n1",
"struct node { void *elm; struct node *next; } *"
],
[
"n2",
"struct node { void *elm; struct node *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct node { void *elm; struct node *next; }"
],
"binary_hash": "27f46eee7065b9e85ac39271fe7ddc487ade326ea704be4d60444d2c38e330a6"
}
] |
314a044bcf1227d6a6533d8fa97ab2452d69ede3aeeaec51602f2dd17491e179 | Bladtman242/BOSC2013 | [
[
"siginttrap",
"->"
],
[
"gethostname",
"->",
"main"
],
[
"executecmd",
"->",
"executeshellcmd"
],
[
"executeshellcmd",
"->",
"executecmd",
"main"
],
[
"main",
"->",
"gethostname",
"executeshellcmd"
]
] | [
[
"gethostname",
"char *__fastcall func1(char *a1)\n{\nchar *v2; // [rsp+10h] [rbp-10h]\nFILE *stream; // [rsp+18h] [rbp-8h]\n\nstream = fopen(\"/proc/sys/kernel/hostname\", \"r\");\nv2 = fgets(a1, 100, stream);\nfclose(stream);\na1[strlen(a1) - 1] = 0;\nreturn v2;\n}"
]
] | [
{
"name": "siginttrap",
"canonical_name": "func0",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "void __fastcall __noreturn siginttrap(unsigned int a1)\n{\nprintf(\"\\nI gots sigint %d\\n\", a1);\nexit(0);\n}\n",
"canonical_decompiled_code": "void __fastcall __noreturn func0(unsigned int a1)\n{\nprintf(\"\\nI gots sigint %d\\n\", a1);\nexit(0);\n}",
"original_code": "void siginttrap(int signal){\n printf(\"\\nI gots sigint %d\\n\", signal);\n exit (0);\n}",
"canonical_original_code": "void siginttrap(int signal){\n printf(\"\\nI gots sigint %d\\n\", signal);\n exit (0);\n}",
"variable_types": [
[
"signal",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "314a044bcf1227d6a6533d8fa97ab2452d69ede3aeeaec51602f2dd17491e179"
},
{
"name": "executecmd",
"canonical_name": "func2",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "__int64 __fastcall executecmd(const char ***a1, unsigned int a2, int a3, int a4)\n{\nint *v4; // rax\n__int64 result; // rax\nint *v6; // rax\nint *v7; // rax\nchar buf[8192]; // [rsp+20h] [rbp-2010h] BYREF\nint pipedes[2]; // [rsp+2020h] [rbp-10h] BYREF\nsize_t n; // [rsp+2028h] [rbp-8h]\n\nif ( a1 )\n{\npipe(pipedes);\nexecutecmd(a1[1], a2, (unsigned int)pipedes[1], 0LL);\nHIDWORD(n) = fork();\nif ( !HIDWORD(n) )\n{\ndup2(pipedes[0], 0);\ndup2(a3, 1);\nclose(pipedes[1]);\nsignal(2, (__sighandler_t)siginttrap);\nif ( execvp(**a1, (char *const *)*a1) )\n{\nprintf(\"Error in: %s\\n\", **a1);\nif ( *_errno_location() == 2 )\n{\nprintf(\"%s not found\\n\", **a1);\n}\nelse\n{\nv6 = _errno_location();\nprintf(\"errno set to: %d\", (unsigned int)*v6);\n}\nv7 = _errno_location();\nexit(*v7);\n}\n}\nif ( a3 != 1 || a4 )\n{\nif ( a3 != 1 )\nclose(a3);\n}\nelse\n{\nwaitpid(SHIDWORD(n), 0LL, 0);\n}\nresult = 0LL;\n}\nelse\n{\nif ( a2 )\n{\nputs(\"copying\");\nLODWORD(n) = 0;\ndo\n{\nLODWORD(n) = read(a2, buf, 0x400uLL);\nwrite(a3, buf, (unsigned int)n);\nv4 = _errno_location();\nprintf(\"did %d bytes, errno is: %d\\n\", (unsigned int)n, (unsigned int)*v4);\n}\nwhile ( (int)n > 0 );\nclose(a2);\n}\nclose(a3);\nresult = 0LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(const char ***a1, unsigned int a2, int a3, int a4)\n{\nint *v4; // rax\n__int64 result; // rax\nint *v6; // rax\nint *v7; // rax\nchar buf[8192]; // [rsp+20h] [rbp-2010h] BYREF\nint pipedes[2]; // [rsp+2020h] [rbp-10h] BYREF\nsize_t n; // [rsp+2028h] [rbp-8h]\n\nif ( a1 )\n{\npipe(pipedes);\nfunc2(a1[1], a2, (unsigned int)pipedes[1], 0LL);\nHIDWORD(n) = fork();\nif ( !HIDWORD(n) )\n{\ndup2(pipedes[0], 0);\ndup2(a3, 1);\nclose(pipedes[1]);\nsignal(2, (__sighandler_t)siginttrap);\nif ( execvp(**a1, (char *const *)*a1) )\n{\nprintf(\"Error in: %s\\n\", **a1);\nif ( *_errno_location() == 2 )\n{\nprintf(\"%s not found\\n\", **a1);\n}\nelse\n{\nv6 = _errno_location();\nprintf(\"errno set to: %d\", (unsigned int)*v6);\n}\nv7 = _errno_location();\nexit(*v7);\n}\n}\nif ( a3 != 1 || a4 )\n{\nif ( a3 != 1 )\nclose(a3);\n}\nelse\n{\nwaitpid(SHIDWORD(n), 0LL, 0);\n}\nresult = 0LL;\n}\nelse\n{\nif ( a2 )\n{\nputs(\"copying\");\nLODWORD(n) = 0;\ndo\n{\nLODWORD(n) = read(a2, buf, 0x400uLL);\nwrite(a3, buf, (unsigned int)n);\nv4 = _errno_location();\nprintf(\"did %d bytes, errno is: %d\\n\", (unsigned int)n, (unsigned int)*v4);\n}\nwhile ( (int)n > 0 );\nclose(a2);\n}\nclose(a3);\nresult = 0LL;\n}\nreturn result;\n}",
"original_code": "int executecmd (Cmd* cmd, int std_in, int std_out, int bg){\n if(cmd == ((void *)0)){\n if(std_in != 0){\n puts(\"copying\");\n void* buf[1024];\n int size=0;\n do {\n size = read(std_in, buf, 1024);\n write(std_out, buf, size);\n printf(\"did %d bytes, errno is: %d\\n\", size, (*__errno_location ()));\n } while (size > 0);\n close (std_in);\n }\n close (std_out);\n return 0;\n }\n int pfds[2];\n pipe(pfds);\n executecmd(cmd->next, std_in, pfds[1], 0);\n pid_t child = fork();\n if(child==0){\n dup2(pfds[0], 0);\n dup2(std_out, 1);\n close(pfds[1]);\n signal(2, siginttrap);\n if(execvp(cmd->cmd[0], cmd->cmd)){\n printf(\"Error in: %s\\n\", cmd->cmd[0]);\n if((*__errno_location ()) == 2){\n printf(\"%s not found\\n\", cmd->cmd[0]);\n }else {\n printf(\"errno set to: %d\", (*__errno_location ()));\n }\n exit ((*__errno_location ()));\n }\n }\n if(std_out == 1 && !bg){\n waitpid(child, ((void *)0), ((void *)0));\n }\n else if (std_out != 1){\n close(std_out);\n }\n return 0;\n}",
"canonical_original_code": "int executecmd(struct _cmd *cmd, int std_in, int std_out, int bg){\n if(cmd == ((void *)0)){\n if(std_in != 0){\n puts(\"copying\");\n void *buf[1024];\n int size = 0;\n do {\n size = read(std_in, buf, 1024);\n write(std_out, buf, size);\n printf(\"did %d bytes, errno is: %d\\n\", size, (*__errno_location ()));\n } while (size > 0);\n close (std_in);\n }\n close (std_out);\n return 0;\n }\n int pfds[2];\n pipe(pfds);\n executecmd(cmd->next, std_in, pfds[1], 0);\n int child = fork();\n if(child==0){\n dup2(pfds[0], 0);\n dup2(std_out, 1);\n close(pfds[1]);\n signal(2, siginttrap);\n if(execvp(cmd->cmd[0], cmd->cmd)){\n printf(\"Error in: %s\\n\", cmd->cmd[0]);\n if((*__errno_location ()) == 2){\n printf(\"%s not found\\n\", cmd->cmd[0]);\n }else {\n printf(\"errno set to: %d\", (*__errno_location ()));\n }\n exit ((*__errno_location ()));\n }\n }\n if(std_out == 1 && !bg){\n waitpid(child, ((void *)0), ((void *)0));\n }\n else if (std_out != 1){\n close(std_out);\n }\n return 0;\n}",
"variable_types": [
[
"cmd",
"struct _cmd { char **cmd; struct _cmd *next; } *"
],
[
"std_in",
"int"
],
[
"std_out",
"int"
],
[
"bg",
"int"
],
[
"buf",
"void *[1024]"
],
[
"size",
"int"
],
[
"pfds",
"int [2]"
],
[
"child",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct _cmd { char **cmd; struct _cmd *next; }"
],
"binary_hash": "314a044bcf1227d6a6533d8fa97ab2452d69ede3aeeaec51602f2dd17491e179"
},
{
"name": "executeshellcmd",
"canonical_name": "func3",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "__int64 __fastcall executeshellcmd(__int64 a1)\n{\nint v2; // [rsp+18h] [rbp-8h]\nint v3; // [rsp+1Ch] [rbp-4h]\n\nv3 = 0;\nif ( *(_QWORD *)(a1 + 8) )\nv3 = open(*(const char **)(a1 + 8), 0);\nv2 = 1;\nif ( *(_QWORD *)(a1 + 16) )\nv2 = open(*(const char **)(a1 + 16), 65);\nexecutecmd(*(const char ****)a1, v3, v2, *(_DWORD *)(a1 + 32));\nprintshellcmd(a1);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1)\n{\nint v2; // [rsp+18h] [rbp-8h]\nint v3; // [rsp+1Ch] [rbp-4h]\n\nv3 = 0;\nif ( *(_QWORD *)(a1 + 8) )\nv3 = open(*(const char **)(a1 + 8), 0);\nv2 = 1;\nif ( *(_QWORD *)(a1 + 16) )\nv2 = open(*(const char **)(a1 + 16), 65);\nfunc2(*(const char ****)a1, v3, v2, *(_DWORD *)(a1 + 32));\nprintshellcmd(a1);\nreturn 0LL;\n}",
"original_code": "int executeshellcmd (Shellcmd *shellcmd){\n int std_in = 0;\n if(shellcmd->rd_stdin != ((void *)0)){\n std_in = open(shellcmd->rd_stdin, 00);\n }\n int std_out = 1;\n if(shellcmd->rd_stdout != ((void *)0)){\n std_out = open(shellcmd->rd_stdout, 01|0100);\n }\n executecmd(shellcmd->the_cmds, std_in, std_out, shellcmd->background);\n printshellcmd(shellcmd);\n return 0;\n}",
"canonical_original_code": "int executeshellcmd(struct _shellcmd *shellcmd){\n int std_in = 0;\n if(shellcmd->rd_stdin != ((void *)0)){\n std_in = open(shellcmd->rd_stdin, 00);\n }\n int std_out = 1;\n if(shellcmd->rd_stdout != ((void *)0)){\n std_out = open(shellcmd->rd_stdout, 01|0100);\n }\n executecmd(shellcmd->the_cmds, std_in, std_out, shellcmd->background);\n printshellcmd(shellcmd);\n return 0;\n}",
"variable_types": [
[
"shellcmd",
"struct _shellcmd { struct _cmd { char **cmd; struct _cmd *next; } *the_cmds; char *rd_stdin; char *rd_stdout; char *rd_stderr; int background; } *"
],
[
"std_in",
"int"
],
[
"std_out",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct _shellcmd { struct _cmd *the_cmds; char *rd_stdin; char *rd_stdout; char *rd_stderr; int background; }",
"struct _cmd { char **cmd; struct _cmd *next; }"
],
"binary_hash": "314a044bcf1227d6a6533d8fa97ab2452d69ede3aeeaec51602f2dd17491e179"
},
{
"name": "main",
"canonical_name": "main",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nchar v4[48]; // [rsp+10h] [rbp-B0h] BYREF\nchar v5[112]; // [rsp+40h] [rbp-80h] BYREF\nchar *s1; // [rsp+B0h] [rbp-10h]\nint v7; // [rsp+BCh] [rbp-4h]\n\nv7 = 0;\nsignal(2, handler);\nif ( gethostname(v5) )\n{\nwhile ( !v7 )\n{\nprintf(\"%s\", v5);\ns1 = (char *)readline(\"$-> \");\nif ( s1 )\n{\nif ( *s1 )\n{\nadd_history(s1);\nif ( !strcmp(s1, \"exit\") )\n{\nv7 = 1;\n}\nelse if ( (unsigned int)parsecommand(s1, v4) )\n{\nv7 = executeshellcmd((__int64)v4);\n}\n}\nfree(s1);\n}\nelse\n{\nv7 = 1;\n}\n}\nputs(\"Exiting bosh.\");\n}\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nchar v4[48]; // [rsp+10h] [rbp-B0h] BYREF\nchar v5[112]; // [rsp+40h] [rbp-80h] BYREF\nchar *s1; // [rsp+B0h] [rbp-10h]\nint v7; // [rsp+BCh] [rbp-4h]\n\nv7 = 0;\nsignal(2, handler);\nif ( func1(v5) )\n{\nwhile ( !v7 )\n{\nprintf(\"%s\", v5);\ns1 = (char *)readline(\"$-> \");\nif ( s1 )\n{\nif ( *s1 )\n{\nadd_history(s1);\nif ( !strcmp(s1, \"exit\") )\n{\nv7 = 1;\n}\nelse if ( (unsigned int)parsecommand(s1, v4) )\n{\nv7 = func3((__int64)v4);\n}\n}\nfree(s1);\n}\nelse\n{\nv7 = 1;\n}\n}\nputs(\"Exiting bosh.\");\n}\nreturn 0;\n}",
"original_code": "int main(int argc, char* argv[]) {\n char *cmdline;\n char hostname[100];\n int terminate = 0;\n Shellcmd shellcmd;\n signal(2, ((__sighandler_t) 1));\n if (gethostname(hostname)) {\n while (!terminate) {\n printf(\"%s\", hostname);\n if (cmdline = readline(\"$-> \")) {\n if(*cmdline) {\n add_history(cmdline);\n if (!strcmp(cmdline, \"exit\")){\n terminate=1;\n } else if (parsecommand(cmdline, &shellcmd)) {\n terminate = executeshellcmd(&shellcmd);\n }\n }\n free(cmdline);\n } else terminate = 1;\n }\n printf(\"Exiting bosh.\\n\");\n }\n return 0;\n}",
"canonical_original_code": "int main(int argc, char *argv[]) {\n char *cmdline;\n char hostname[100];\n int terminate = 0;\n struct _shellcmd shellcmd;\n signal(2, ((void (*)(int)) 1));\n if (gethostname(hostname)) {\n while (!terminate) {\n printf(\"%s\", hostname);\n if (cmdline = readline(\"$-> \")) {\n if(*cmdline) {\n add_history(cmdline);\n if (!strcmp(cmdline, \"exit\")){\n terminate=1;\n } else if (parsecommand(cmdline, &shellcmd)) {\n terminate = executeshellcmd(&shellcmd);\n }\n }\n free(cmdline);\n } else terminate = 1;\n }\n printf(\"Exiting bosh.\\n\");\n }\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char *[]"
],
[
"cmdline",
"char *"
],
[
"hostname",
"char [100]"
],
[
"terminate",
"int"
],
[
"shellcmd",
"struct _shellcmd { struct _cmd { char **cmd; struct _cmd *next; } *the_cmds; char *rd_stdin; char *rd_stdout; char *rd_stderr; int background; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct _shellcmd { struct _cmd *the_cmds; char *rd_stdin; char *rd_stdout; char *rd_stderr; int background; }",
"struct _cmd { char **cmd; struct _cmd *next; }"
],
"binary_hash": "314a044bcf1227d6a6533d8fa97ab2452d69ede3aeeaec51602f2dd17491e179"
}
] |
3870c40de02969637a3a9eb22089ad22b1577f6085b751934c6ac1224617d212 | Bladtman242/BOSC2013 | [
[
"list_new",
"->"
],
[
"list_add",
"->"
],
[
"list_remove",
"->"
],
[
"node_new",
"->"
],
[
"node_new_str",
"->"
]
] | [] | [
{
"name": "list_new",
"canonical_name": "func0",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "_QWORD *list_new()\n{\n_QWORD *v1; // [rsp+8h] [rbp-8h]\n\npthread_mutex_init(&mutex, 0LL);\nv1 = malloc(0x18uLL);\n*(_DWORD *)v1 = 0;\nv1[2] = malloc(0x10uLL);\nv1[1] = v1[2];\n*(_QWORD *)v1[1] = 0LL;\n*(_QWORD *)(v1[1] + 8LL) = 0LL;\nreturn v1;\n}\n",
"canonical_decompiled_code": "_QWORD *func0()\n{\n_QWORD *v1; // [rsp+8h] [rbp-8h]\n\npthread_mutex_init(&mutex, 0LL);\nv1 = malloc(0x18uLL);\n*(_DWORD *)v1 = 0;\nv1[2] = malloc(0x10uLL);\nv1[1] = v1[2];\n*(_QWORD *)v1[1] = 0LL;\n*(_QWORD *)(v1[1] + 8LL) = 0LL;\nreturn v1;\n}",
"original_code": "List *list_new(void)\n{\n pthread_mutex_init(&mutex, ((void *)0));\n List *l;\n l = (List *) malloc(sizeof(List));\n l->len = 0;\n l->first = l->last = (Node *) malloc(sizeof(Node));\n l->first->elm = ((void *)0);\n l->first->next = ((void *)0);\n return l;\n}",
"canonical_original_code": "struct list *list_new()\n{\n pthread_mutex_init(&mutex, ((void *)0));\n struct list *l;\n l = (struct list *) malloc(sizeof(List));\n l->len = 0;\n l->first = l->last = (struct node *) malloc(sizeof(Node));\n l->first->elm = ((void *)0);\n l->first->next = ((void *)0);\n return l;\n}",
"variable_types": [
[
"l",
"struct list { int len; struct node { void *elm; struct node *next; } *first; struct node *last; } *"
]
],
"return_type": "struct list { int len; struct node { void *elm; struct node *next; } *first; struct node *last; } *",
"user_defined_types": [
"struct list { int len; struct node *first; struct node *last; }",
"struct node { void *elm; struct node *next; }"
],
"binary_hash": "3870c40de02969637a3a9eb22089ad22b1577f6085b751934c6ac1224617d212"
},
{
"name": "list_add",
"canonical_name": "func1",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "int __fastcall list_add(__int64 a1, __int64 a2)\n{\npthread_mutex_lock(&mutex);\nif ( *(_DWORD *)a1 )\n*(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL) = a2;\nelse\n*(_QWORD *)(*(_QWORD *)(a1 + 8) + 8LL) = a2;\n*(_QWORD *)(a1 + 16) = a2;\n++*(_DWORD *)a1;\nreturn pthread_mutex_unlock(&mutex);\n}\n",
"canonical_decompiled_code": "int __fastcall func1(__int64 a1, __int64 a2)\n{\npthread_mutex_lock(&mutex);\nif ( *(_DWORD *)a1 )\n*(_QWORD *)(*(_QWORD *)(a1 + 16) + 8LL) = a2;\nelse\n*(_QWORD *)(*(_QWORD *)(a1 + 8) + 8LL) = a2;\n*(_QWORD *)(a1 + 16) = a2;\n++*(_DWORD *)a1;\nreturn pthread_mutex_unlock(&mutex);\n}",
"original_code": "void list_add(List *l, Node *n)\n{\n pthread_mutex_lock(&mutex);\n if(l->len == 0){\n l->first->next = n;\n l->last = n;\n l->len++;\n }else{\n l->last->next = n;\n l->last = n;\n l->len++;\n }\n pthread_mutex_unlock(&mutex);\n}",
"canonical_original_code": "void list_add(struct list *l, struct node *n)\n{\n pthread_mutex_lock(&mutex);\n if(l->len == 0){\n l->first->next = n;\n l->last = n;\n l->len++;\n }else{\n l->last->next = n;\n l->last = n;\n l->len++;\n }\n pthread_mutex_unlock(&mutex);\n}",
"variable_types": [
[
"l",
"struct list { int len; struct node { void *elm; struct node *next; } *first; struct node *last; } *"
],
[
"n",
"struct node *"
]
],
"return_type": "void",
"user_defined_types": [
"struct list { int len; struct node *first; struct node *last; }",
"struct node { void *elm; struct node *next; }"
],
"binary_hash": "3870c40de02969637a3a9eb22089ad22b1577f6085b751934c6ac1224617d212"
},
{
"name": "list_remove",
"canonical_name": "func2",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "__int64 __fastcall list_remove(__int64 a1)\n{\n__int64 result; // rax\n__int64 v2; // [rsp+18h] [rbp-8h]\n\npthread_mutex_lock(&mutex);\nif ( *(_DWORD *)a1 )\n{\nv2 = *(_QWORD *)(*(_QWORD *)(a1 + 8) + 8LL);\n*(_QWORD *)(*(_QWORD *)(a1 + 8) + 8LL) = *(_QWORD *)(v2 + 8);\n--*(_DWORD *)a1;\npthread_mutex_unlock(&mutex);\nresult = v2;\n}\nelse\n{\npthread_mutex_unlock(&mutex);\nresult = 0LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1)\n{\n__int64 result; // rax\n__int64 v2; // [rsp+18h] [rbp-8h]\n\npthread_mutex_lock(&mutex);\nif ( *(_DWORD *)a1 )\n{\nv2 = *(_QWORD *)(*(_QWORD *)(a1 + 8) + 8LL);\n*(_QWORD *)(*(_QWORD *)(a1 + 8) + 8LL) = *(_QWORD *)(v2 + 8);\n--*(_DWORD *)a1;\npthread_mutex_unlock(&mutex);\nresult = v2;\n}\nelse\n{\npthread_mutex_unlock(&mutex);\nresult = 0LL;\n}\nreturn result;\n}",
"original_code": "Node *list_remove(List *l)\n{\n pthread_mutex_lock(&mutex);\n if(l->len == 0){\n pthread_mutex_unlock(&mutex);\n return ((void *)0);\n }\n Node *n = l->first->next;\n l->first->next = n->next;\n l->len--;\n pthread_mutex_unlock(&mutex);\n return n;\n}",
"canonical_original_code": "struct node *list_remove(struct list *l)\n{\n pthread_mutex_lock(&mutex);\n if(l->len == 0){\n pthread_mutex_unlock(&mutex);\n return ((void *)0);\n }\n struct node *n = l->first->next;\n l->first->next = n->next;\n l->len--;\n pthread_mutex_unlock(&mutex);\n return n;\n}",
"variable_types": [
[
"l",
"struct list { int len; struct node *first; struct node *last; } *"
],
[
"n",
"struct node { void *elm; struct node *next; } *"
]
],
"return_type": "struct node { void *elm; struct node *next; } *",
"user_defined_types": [
"struct list { int len; struct node *first; struct node *last; }",
"struct node { void *elm; struct node *next; }"
],
"binary_hash": "3870c40de02969637a3a9eb22089ad22b1577f6085b751934c6ac1224617d212"
},
{
"name": "node_new",
"canonical_name": "func3",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "_QWORD *node_new()\n{\n_QWORD *result; // rax\n\nresult = malloc(0x10uLL);\n*result = 0LL;\nresult[1] = 0LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "_QWORD *func3()\n{\n_QWORD *result; // rax\n\nresult = malloc(0x10uLL);\n*result = 0LL;\nresult[1] = 0LL;\nreturn result;\n}",
"original_code": "Node *node_new(void)\n{\n Node *n;\n n = (Node *) malloc(sizeof(Node));\n n->elm = ((void *)0);\n n->next = ((void *)0);\n return n;\n}",
"canonical_original_code": "struct node *node_new()\n{\n struct node *n;\n n = (struct node *) malloc(sizeof(Node));\n n->elm = ((void *)0);\n n->next = ((void *)0);\n return n;\n}",
"variable_types": [
[
"n",
"struct node { void *elm; struct node *next; } *"
]
],
"return_type": "struct node { void *elm; struct node *next; } *",
"user_defined_types": [
"struct node { void *elm; struct node *next; }"
],
"binary_hash": "3870c40de02969637a3a9eb22089ad22b1577f6085b751934c6ac1224617d212"
},
{
"name": "node_new_str",
"canonical_name": "func4",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "char **__fastcall node_new_str(const char *a1)\n{\nsize_t v1; // rax\nchar **v3; // [rsp+18h] [rbp-8h]\n\nv3 = (char **)malloc(0x10uLL);\nv1 = strlen(a1);\n*v3 = (char *)malloc(v1 + 1);\nstrcpy(*v3, a1);\nv3[1] = 0LL;\nreturn v3;\n}\n",
"canonical_decompiled_code": "char **__fastcall func4(const char *a1)\n{\nsize_t v1; // rax\nchar **v3; // [rsp+18h] [rbp-8h]\n\nv3 = (char **)malloc(0x10uLL);\nv1 = strlen(a1);\n*v3 = (char *)malloc(v1 + 1);\nstrcpy(*v3, a1);\nv3[1] = 0LL;\nreturn v3;\n}",
"original_code": "Node *node_new_str(char *s)\n{\n Node *n;\n n = (Node *) malloc(sizeof(Node));\n n->elm = (void *) malloc((strlen(s)+1) * sizeof(char));\n strcpy((char *) n->elm, s);\n n->next = ((void *)0);\n return n;\n}",
"canonical_original_code": "struct node *node_new_str(char *s)\n{\n struct node *n;\n n = (struct node *) malloc(sizeof(Node));\n n->elm = (void *) malloc((strlen(s)+1) * sizeof(char));\n strcpy((char *) n->elm, s);\n n->next = ((void *)0);\n return n;\n}",
"variable_types": [
[
"s",
"char *"
],
[
"n",
"struct node { void *elm; struct node *next; } *"
]
],
"return_type": "struct node { void *elm; struct node *next; } *",
"user_defined_types": [
"struct node { void *elm; struct node *next; }"
],
"binary_hash": "3870c40de02969637a3a9eb22089ad22b1577f6085b751934c6ac1224617d212"
}
] |
9b8a54615031b344bdf2a0157580341bbe78667287f40ca0b41ba4e9866a5a26 | Bladtman242/BOSC2013 | [
[
"printshellcmd",
"->"
]
] | [] | [
{
"name": "printshellcmd",
"canonical_name": "func0",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "int __fastcall printshellcmd(__int64 a1)\n{\nconst char *v1; // rax\nconst char *v2; // rax\nconst char *v3; // rax\nconst char ***v4; // rax\nconst char **v5; // rax\nconst char **v7; // [rsp+18h] [rbp-18h]\nconst char **v8; // [rsp+20h] [rbp-10h]\nconst char ***v9; // [rsp+28h] [rbp-8h]\n\nputs(\"Shellcommand:\");\nif ( *(_QWORD *)(a1 + 8) )\nv1 = *(const char **)(a1 + 8);\nelse\nv1 = \"<none>\";\nprintf(\" stdin : %s\\n\", v1);\nif ( *(_QWORD *)(a1 + 16) )\nv2 = *(const char **)(a1 + 16);\nelse\nv2 = \"<none>\";\nprintf(\" stdout: %s\\n\", v2);\nif ( *(_DWORD *)(a1 + 32) )\nv3 = \"yes\";\nelse\nv3 = \"no\";\nprintf(\" bg : %s\\n\", v3);\nv4 = *(const char ****)a1;\nv9 = *(const char ****)a1;\nwhile ( v9 )\n{\nv7 = *v9;\nv9 = (const char ***)v9[1];\nv8 = v7;\nprintf(\" [\");\nwhile ( *v8 )\n{\nv5 = v8++;\nprintf(\"%s \", *v5);\n}\nLODWORD(v4) = puts(\"]\");\n}\nreturn (int)v4;\n}\n",
"canonical_decompiled_code": "int __fastcall func0(__int64 a1)\n{\nconst char *v1; // rax\nconst char *v2; // rax\nconst char *v3; // rax\nconst char ***v4; // rax\nconst char **v5; // rax\nconst char **v7; // [rsp+18h] [rbp-18h]\nconst char **v8; // [rsp+20h] [rbp-10h]\nconst char ***v9; // [rsp+28h] [rbp-8h]\n\nputs(\"Shellcommand:\");\nif ( *(_QWORD *)(a1 + 8) )\nv1 = *(const char **)(a1 + 8);\nelse\nv1 = \"<none>\";\nprintf(\" stdin : %s\\n\", v1);\nif ( *(_QWORD *)(a1 + 16) )\nv2 = *(const char **)(a1 + 16);\nelse\nv2 = \"<none>\";\nprintf(\" stdout: %s\\n\", v2);\nif ( *(_DWORD *)(a1 + 32) )\nv3 = \"yes\";\nelse\nv3 = \"no\";\nprintf(\" bg : %s\\n\", v3);\nv4 = *(const char ****)a1;\nv9 = *(const char ****)a1;\nwhile ( v9 )\n{\nv7 = *v9;\nv9 = (const char ***)v9[1];\nv8 = v7;\nprintf(\" [\");\nwhile ( *v8 )\n{\nv5 = v8++;\nprintf(\"%s \", *v5);\n}\nLODWORD(v4) = puts(\"]\");\n}\nreturn (int)v4;\n}",
"original_code": "void printshellcmd(Shellcmd *shellcmd)\n{\n printf(\"Shellcommand:\\n\");\n printf(\" stdin : %s\\n\", shellcmd->rd_stdin ? shellcmd->rd_stdin : \"<none>\" );\n printf(\" stdout: %s\\n\", shellcmd->rd_stdout ? shellcmd->rd_stdout : \"<none>\" );\n printf(\" bg : %s\\n\", shellcmd->background ? \"yes\" : \"no\");\n Cmd *cmdlist = shellcmd->the_cmds;\n while (cmdlist != ((void *)0)) {\n char **cmd = cmdlist->cmd;\n cmdlist = cmdlist->next;\n char **printcmd = cmd;\n printf(\" [\");\n while (*printcmd != ((void *)0)) {\n printf(\"%s \", *printcmd++);\n }\n printf(\"]\\n\");\n }\n}",
"canonical_original_code": "void printshellcmd(struct _shellcmd *shellcmd)\n{\n printf(\"Shellcommand:\\n\");\n printf(\" stdin : %s\\n\", shellcmd->rd_stdin ? shellcmd->rd_stdin : \"<none>\" );\n printf(\" stdout: %s\\n\", shellcmd->rd_stdout ? shellcmd->rd_stdout : \"<none>\" );\n printf(\" bg : %s\\n\", shellcmd->background ? \"yes\" : \"no\");\n struct _cmd *cmdlist = shellcmd->the_cmds;\n while (cmdlist != ((void *)0)) {\n char **cmd = cmdlist->cmd;\n cmdlist = cmdlist->next;\n char **printcmd = cmd;\n printf(\" [\");\n while (*printcmd != ((void *)0)) {\n printf(\"%s \", *printcmd++);\n }\n printf(\"]\\n\");\n }\n}",
"variable_types": [
[
"shellcmd",
"struct _shellcmd { struct _cmd { char **cmd; struct _cmd *next; } *the_cmds; char *rd_stdin; char *rd_stdout; char *rd_stderr; int background; } *"
],
[
"cmdlist",
"struct _cmd { char **cmd; struct _cmd *next; } *"
],
[
"cmd",
"char **"
],
[
"printcmd",
"char **"
]
],
"return_type": "void",
"user_defined_types": [
"struct _shellcmd { struct _cmd *the_cmds; char *rd_stdin; char *rd_stdout; char *rd_stderr; int background; }",
"struct _cmd { char **cmd; struct _cmd *next; }"
],
"binary_hash": "9b8a54615031b344bdf2a0157580341bbe78667287f40ca0b41ba4e9866a5a26"
}
] |
9f2bb1af36a7f44c41ce89a1b2bf4cf48f843bd899931f2c6f6d58dd467594f4 | Bladtman242/BOSC2013 | [
[
"pipecmd",
"->"
]
] | [] | [
{
"name": "pipecmd",
"canonical_name": "func0",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "__int64 __fastcall pipecmd(const char *a1, char *const *a2, const char *a3, char *const *a4)\n{\nint pipedes[2]; // [rsp+24h] [rbp-Ch] BYREF\n\npipe(pipedes);\nif ( !fork() )\n{\nclose(1);\ndup2(pipedes[1], 1);\nclose(pipedes[0]);\nexecvp(a1, a2);\n}\nclose(0);\ndup2(pipedes[0], 0);\nclose(pipedes[1]);\nexecvp(a3, a4);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(const char *a1, char *const *a2, const char *a3, char *const *a4)\n{\nint pipedes[2]; // [rsp+24h] [rbp-Ch] BYREF\n\npipe(pipedes);\nif ( !fork() )\n{\nclose(1);\ndup2(pipedes[1], 1);\nclose(pipedes[0]);\nexecvp(a1, a2);\n}\nclose(0);\ndup2(pipedes[0], 0);\nclose(pipedes[1]);\nexecvp(a3, a4);\nreturn 0LL;\n}",
"original_code": "int pipecmd(char *filename1, char *argv1[], char *filename2, char *argv2[])\n{\n int pfds[2];\n pipe(pfds);\n pid_t p1 = fork();\n if(p1 == 0){\n close(1);\n dup2(pfds[1], 1);\n close(pfds[0]);\n execvp(filename1, argv1);\n }\n close(0);\n dup2(pfds[0], 0);\n close(pfds[1]);\n execvp(filename2, argv2);\n return 0;\n}",
"canonical_original_code": "int pipecmd(char *filename1, char *argv1[], char *filename2, char *argv2[])\n{\n int pfds[2];\n pipe(pfds);\n int p1 = fork();\n if(p1 == 0){\n close(1);\n dup2(pfds[1], 1);\n close(pfds[0]);\n execvp(filename1, argv1);\n }\n close(0);\n dup2(pfds[0], 0);\n close(pfds[1]);\n execvp(filename2, argv2);\n return 0;\n}",
"variable_types": [
[
"filename1",
"char *"
],
[
"argv1",
"char *[]"
],
[
"filename2",
"char *"
],
[
"argv2",
"char *[]"
],
[
"pfds",
"int [2]"
],
[
"p1",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "9f2bb1af36a7f44c41ce89a1b2bf4cf48f843bd899931f2c6f6d58dd467594f4"
}
] |
b1252419b6e214ea38839b7142bc6181e0639588d17fa095652151ba736a7757 | Bladtman242/BOSC2013 | [
[
"parsecommand",
"->",
"acmd",
"isidentifier"
],
[
"acmd",
"->",
"parsecommand"
],
[
"isidentifier",
"->",
"parsecommand"
]
] | [] | [
{
"name": "parsecommand",
"canonical_name": "func0",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "__int64 __fastcall parsecommand(__int64 a1, __int64 a2)\n{\n__int64 result; // rax\nint v3; // eax\nchar *v4; // [rsp+18h] [rbp-28h] BYREF\n__int64 v5; // [rsp+20h] [rbp-20h] BYREF\nint v6; // [rsp+28h] [rbp-18h]\nint v7; // [rsp+2Ch] [rbp-14h]\n__int64 v8; // [rsp+30h] [rbp-10h]\nint i; // [rsp+3Ch] [rbp-4h]\n\nv8 = a1;\nfor ( i = 0; i <= 18; ++i )\nqword_648[2 * i] = (char *)&cmdbuf + 16 * i + 16;\nqword_778 = 0LL;\ncmds = (__int64)&cmdbuf;\ncp = (__int64)&cbuf;\npp = (__int64)&pbuf;\n*(_QWORD *)(a2 + 8) = 0LL;\n*(_QWORD *)(a2 + 16) = 0LL;\n*(_QWORD *)(a2 + 24) = 0LL;\n*(_DWORD *)(a2 + 32) = 0;\n*(_QWORD *)a2 = 0LL;\nwhile ( 1 )\n{\nv6 = acmd(v8, &v5);\nif ( v6 <= 0 )\nbreak;\nv8 += v6;\n*(_QWORD *)(v5 + 8) = *(_QWORD *)a2;\n*(_QWORD *)a2 = v5;\nv7 = 1;\nwhile ( v7 )\n{\nv6 = nexttoken(v8, &v4);\nif ( !v6 )\nreturn 1LL;\nv8 += v6;\nv3 = *v4;\nif ( v3 == 124 )\n{\nv7 = 0;\n}\nelse\n{\nif ( v3 > 124 )\nreturn 0xFFFFFFFFLL;\nif ( v3 == 62 )\n{\nif ( *(_QWORD *)(a2 + 16) )\n{\nfwrite(\"duplicate redirection of stdout\\n\", 1uLL, 0x20uLL, stderr);\nreturn 0xFFFFFFFFLL;\n}\nv6 = nexttoken(v8, a2 + 16);\nif ( v6 < 0 )\nreturn 0xFFFFFFFFLL;\nif ( !(unsigned int)isidentifier(*(_QWORD *)(a2 + 16)) )\n{\nfprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", *(const char **)(a2 + 16));\nreturn 0xFFFFFFFFLL;\n}\nv8 += v6;\n}\nelse\n{\nif ( v3 > 62 )\nreturn 0xFFFFFFFFLL;\nif ( v3 == 38 )\n{\nv6 = nexttoken(v8, &v4);\nif ( v6 )\n{\nfwrite(\"illegal backgrounding\\n\", 1uLL, 0x16uLL, stderr);\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\n*(_DWORD *)(a2 + 32) = 1;\nresult = 1LL;\n}\nreturn result;\n}\nif ( v3 != 60 )\nreturn 0xFFFFFFFFLL;\nif ( *(_QWORD *)(a2 + 8) )\n{\nfwrite(\"duplicate redirection of stdin\\n\", 1uLL, 0x1FuLL, stderr);\nreturn 0xFFFFFFFFLL;\n}\nv6 = nexttoken(v8, a2 + 8);\nif ( v6 < 0 )\nreturn 0xFFFFFFFFLL;\nif ( !(unsigned int)isidentifier(*(_QWORD *)(a2 + 8)) )\n{\nfprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", *(const char **)(a2 + 8));\nreturn 0xFFFFFFFFLL;\n}\nv8 += v6;\n}\n}\n}\n}\nreturn 0xFFFFFFFFLL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, __int64 a2)\n{\n__int64 result; // rax\nint v3; // eax\nchar *v4; // [rsp+18h] [rbp-28h] BYREF\n__int64 v5; // [rsp+20h] [rbp-20h] BYREF\nint v6; // [rsp+28h] [rbp-18h]\nint v7; // [rsp+2Ch] [rbp-14h]\n__int64 v8; // [rsp+30h] [rbp-10h]\nint i; // [rsp+3Ch] [rbp-4h]\n\nv8 = a1;\nfor ( i = 0; i <= 18; ++i )\nqword_648[2 * i] = (char *)&cmdbuf + 16 * i + 16;\nqword_778 = 0LL;\ncmds = (__int64)&cmdbuf;\ncp = (__int64)&cbuf;\npp = (__int64)&pbuf;\n*(_QWORD *)(a2 + 8) = 0LL;\n*(_QWORD *)(a2 + 16) = 0LL;\n*(_QWORD *)(a2 + 24) = 0LL;\n*(_DWORD *)(a2 + 32) = 0;\n*(_QWORD *)a2 = 0LL;\nwhile ( 1 )\n{\nv6 = func1(v8, &v5);\nif ( v6 <= 0 )\nbreak;\nv8 += v6;\n*(_QWORD *)(v5 + 8) = *(_QWORD *)a2;\n*(_QWORD *)a2 = v5;\nv7 = 1;\nwhile ( v7 )\n{\nv6 = nexttoken(v8, &v4);\nif ( !v6 )\nreturn 1LL;\nv8 += v6;\nv3 = *v4;\nif ( v3 == 124 )\n{\nv7 = 0;\n}\nelse\n{\nif ( v3 > 124 )\nreturn 0xFFFFFFFFLL;\nif ( v3 == 62 )\n{\nif ( *(_QWORD *)(a2 + 16) )\n{\nfwrite(\"duplicate redirection of stdout\\n\", 1uLL, 0x20uLL, stderr);\nreturn 0xFFFFFFFFLL;\n}\nv6 = nexttoken(v8, a2 + 16);\nif ( v6 < 0 )\nreturn 0xFFFFFFFFLL;\nif ( !(unsigned int)func2(*(_QWORD *)(a2 + 16)) )\n{\nfprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", *(const char **)(a2 + 16));\nreturn 0xFFFFFFFFLL;\n}\nv8 += v6;\n}\nelse\n{\nif ( v3 > 62 )\nreturn 0xFFFFFFFFLL;\nif ( v3 == 38 )\n{\nv6 = nexttoken(v8, &v4);\nif ( v6 )\n{\nfwrite(\"illegal backgrounding\\n\", 1uLL, 0x16uLL, stderr);\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\n*(_DWORD *)(a2 + 32) = 1;\nresult = 1LL;\n}\nreturn result;\n}\nif ( v3 != 60 )\nreturn 0xFFFFFFFFLL;\nif ( *(_QWORD *)(a2 + 8) )\n{\nfwrite(\"duplicate redirection of stdin\\n\", 1uLL, 0x1FuLL, stderr);\nreturn 0xFFFFFFFFLL;\n}\nv6 = nexttoken(v8, a2 + 8);\nif ( v6 < 0 )\nreturn 0xFFFFFFFFLL;\nif ( !(unsigned int)func2(*(_QWORD *)(a2 + 8)) )\n{\nfprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", *(const char **)(a2 + 8));\nreturn 0xFFFFFFFFLL;\n}\nv8 += v6;\n}\n}\n}\n}\nreturn 0xFFFFFFFFLL;\n}",
"original_code": "int parsecommand(char *cmdline, Shellcmd *shellcmd)\n{\n int i, n;\n Cmd *cmd0;\n char *t = cmdline;\n char *tok;\n for (i = 0; i < 20 -1; i++) cmdbuf[i].next = &cmdbuf[i+1];\n cmdbuf[20 -1].next = ((void *)0);\n cmds = cmdbuf;\n cp = cbuf;\n pp = pbuf;\n shellcmd->rd_stdin = ((void *)0);\n shellcmd->rd_stdout = ((void *)0);\n shellcmd->rd_stderr = ((void *)0);\n shellcmd->background = 0;\n shellcmd->the_cmds = ((void *)0);\n do {\n if ((n = acmd(t, &cmd0)) <= 0)\n return -1;\n t += n;\n cmd0->next = shellcmd->the_cmds;\n shellcmd->the_cmds = cmd0;\n int newtoken = 1;\n while (newtoken) {\n n = nexttoken(t, &tok);\n if (n == 0)\n {\n return 1;\n }\n t += n;\n switch(*tok) {\n case ('|'):\n newtoken = 0;\n break;\n case ('&'):\n n = nexttoken(t, &tok);\n if (n == 0)\n {\n shellcmd->background = 1;\n return 1;\n }\n else\n {\n fprintf(stderr, \"illegal backgrounding\\n\");\n return -1;\n }\n newtoken = 0;\n break;\n case ('<'):\n if (shellcmd->rd_stdin != ((void *)0))\n {\n fprintf(stderr, \"duplicate redirection of stdin\\n\");\n return -1;\n }\n if ((n = nexttoken(t, &(shellcmd->rd_stdin))) < 0)\n return -1;\n if (!isidentifier(shellcmd->rd_stdin))\n {\n fprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", shellcmd->rd_stdin);\n return -1;\n }\n t += n;\n break;\n case ('>'):\n if (shellcmd->rd_stdout != ((void *)0))\n {\n fprintf(stderr, \"duplicate redirection of stdout\\n\");\n return -1;\n }\n if ((n = nexttoken(t, &(shellcmd->rd_stdout))) < 0)\n return -1;\n if (!isidentifier(shellcmd->rd_stdout))\n {\n fprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", shellcmd->rd_stdout);\n return -1;\n }\n t += n;\n break;\n default:\n return -1;\n }\n }\n } while (1);\n return 0;\n}",
"canonical_original_code": "int parsecommand(char *cmdline, struct _shellcmd *shellcmd)\n{\n int i; int n;\n struct _cmd *cmd0;\n char *t = cmdline;\n char *tok;\n for (i = 0; i < 20 -1; i++) cmdbuf[i].next = &cmdbuf[i+1];\n cmdbuf[20 -1].next = ((void *)0);\n cmds = cmdbuf;\n cp = cbuf;\n pp = pbuf;\n shellcmd->rd_stdin = ((void *)0);\n shellcmd->rd_stdout = ((void *)0);\n shellcmd->rd_stderr = ((void *)0);\n shellcmd->background = 0;\n shellcmd->the_cmds = ((void *)0);\n do {\n if ((n = acmd(t, &cmd0)) <= 0)\n return -1;\n t += n;\n cmd0->next = shellcmd->the_cmds;\n shellcmd->the_cmds = cmd0;\n int newtoken = 1;\n while (newtoken) {\n n = nexttoken(t, &tok);\n if (n == 0)\n {\n return 1;\n }\n t += n;\n switch(*tok) {\n case ('|'):\n newtoken = 0;\n break;\n case ('&'):\n n = nexttoken(t, &tok);\n if (n == 0)\n {\n shellcmd->background = 1;\n return 1;\n }\n else\n {\n fprintf(stderr, \"illegal backgrounding\\n\");\n return -1;\n }\n newtoken = 0;\n break;\n case ('<'):\n if (shellcmd->rd_stdin != ((void *)0))\n {\n fprintf(stderr, \"duplicate redirection of stdin\\n\");\n return -1;\n }\n if ((n = nexttoken(t, &(shellcmd->rd_stdin))) < 0)\n return -1;\n if (!isidentifier(shellcmd->rd_stdin))\n {\n fprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", shellcmd->rd_stdin);\n return -1;\n }\n t += n;\n break;\n case ('>'):\n if (shellcmd->rd_stdout != ((void *)0))\n {\n fprintf(stderr, \"duplicate redirection of stdout\\n\");\n return -1;\n }\n if ((n = nexttoken(t, &(shellcmd->rd_stdout))) < 0)\n return -1;\n if (!isidentifier(shellcmd->rd_stdout))\n {\n fprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", shellcmd->rd_stdout);\n return -1;\n }\n t += n;\n break;\n default:\n return -1;\n }\n }\n } while (1);\n return 0;\n}",
"variable_types": [
[
"cmdline",
"char *"
],
[
"shellcmd",
"struct _shellcmd { struct _cmd { char **cmd; struct _cmd *next; } *the_cmds; char *rd_stdin; char *rd_stdout; char *rd_stderr; int background; } *"
],
[
"i",
"int"
],
[
"n",
"int"
],
[
"cmd0",
"struct _cmd { char **cmd; struct _cmd *next; } *"
],
[
"t",
"char *"
],
[
"tok",
"char *"
],
[
"newtoken",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct _shellcmd { struct _cmd *the_cmds; char *rd_stdin; char *rd_stdout; char *rd_stderr; int background; }",
"struct _cmd { char **cmd; struct _cmd *next; }"
],
"binary_hash": "b1252419b6e214ea38839b7142bc6181e0639588d17fa095652151ba736a7757"
},
{
"name": "acmd",
"canonical_name": "func1",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "__int64 __fastcall acmd(char *a1, _QWORD *a2)\n{\n_QWORD *v2; // rax\n_QWORD *v4; // rax\n_BYTE *v6; // [rsp+10h] [rbp-20h] BYREF\nunsigned int v7; // [rsp+1Ch] [rbp-14h]\n_QWORD *v8; // [rsp+20h] [rbp-10h]\nunsigned int v9; // [rsp+2Ch] [rbp-4h]\n\nv9 = 0;\nv8 = (_QWORD *)cmds;\ncmds = *(_QWORD *)(cmds + 8);\nv8[1] = 0LL;\n*v8 = pp;\nwhile ( 1 )\n{\nv7 = (unsigned int)nexttoken(a1, &v6);\nif ( !v7 || *v6 == 124 || *v6 == 38 || *v6 == 60 || *v6 == 62 )\nbreak;\nv4 = (_QWORD *)pp;\npp += 8LL;\n*v4 = v6;\nv9 += v7;\na1 += (int)v7;\n}\n*a2 = v8;\nv2 = (_QWORD *)pp;\npp += 8LL;\n*v2 = 0LL;\nreturn v9;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(char *a1, _QWORD *a2)\n{\n_QWORD *v2; // rax\n_QWORD *v4; // rax\n_BYTE *v6; // [rsp+10h] [rbp-20h] BYREF\nunsigned int v7; // [rsp+1Ch] [rbp-14h]\n_QWORD *v8; // [rsp+20h] [rbp-10h]\nunsigned int v9; // [rsp+2Ch] [rbp-4h]\n\nv9 = 0;\nv8 = (_QWORD *)cmds;\ncmds = *(_QWORD *)(cmds + 8);\nv8[1] = 0LL;\n*v8 = pp;\nwhile ( 1 )\n{\nv7 = (unsigned int)nexttoken(a1, &v6);\nif ( !v7 || *v6 == 124 || *v6 == 38 || *v6 == 60 || *v6 == 62 )\nbreak;\nv4 = (_QWORD *)pp;\npp += 8LL;\n*v4 = v6;\nv9 += v7;\na1 += (int)v7;\n}\n*a2 = v8;\nv2 = (_QWORD *)pp;\npp += 8LL;\n*v2 = 0LL;\nreturn v9;\n}",
"original_code": "int acmd (char *s, Cmd **cmd)\n{\n char *tok;\n int n, cnt = 0;\n Cmd *cmd0 = cmds;\n cmds = cmds->next;\n cmd0->next = ((void *)0);\n cmd0->cmd = pp;\n while (1) {\n n = nexttoken(s, &tok);\n if (n == 0 || (((*tok) == ('|')) || ((*tok) == ('&')) || ((*tok) == ('<')) || ((*tok) == ('>'))))\n {\n *cmd = cmd0;\n *pp++ = ((void *)0);\n return cnt;\n }\n else\n {\n *pp++ = tok;\n cnt += n;\n s += n;\n }\n }\n}",
"canonical_original_code": "int acmd(char *s, struct _cmd **cmd)\n{\n char *tok;\n int n; int cnt = 0;\n struct _cmd *cmd0 = cmds;\n cmds = cmds->next;\n cmd0->next = ((void *)0);\n cmd0->cmd = pp;\n while (1) {\n n = nexttoken(s, &tok);\n if (n == 0 || (((*tok) == ('|')) || ((*tok) == ('&')) || ((*tok) == ('<')) || ((*tok) == ('>'))))\n {\n *cmd = cmd0;\n *pp++ = ((void *)0);\n return cnt;\n }\n else\n {\n *pp++ = tok;\n cnt += n;\n s += n;\n }\n }\n}",
"variable_types": [
[
"s",
"char *"
],
[
"cmd",
"struct _cmd { char **cmd; struct _cmd *next; } **"
],
[
"tok",
"char *"
],
[
"n",
"int"
],
[
"cnt",
"int"
],
[
"cmd0",
"struct _cmd { char **cmd; struct _cmd *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct _cmd { char **cmd; struct _cmd *next; }"
],
"binary_hash": "b1252419b6e214ea38839b7142bc6181e0639588d17fa095652151ba736a7757"
},
{
"name": "isidentifier",
"canonical_name": "func2",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "__int64 __fastcall isidentifier(char *a1)\n{\nconst unsigned __int16 *v1; // rcx\nchar *v2; // rax\nchar *v5; // [rsp+18h] [rbp-8h]\n\nwhile ( *a1 )\n{\nv5 = strrchr(\"_-.,/~+\", *a1);\nv1 = *_ctype_b_loc();\nv2 = a1++;\nif ( (v1[*v2] & 8) == 0 && !v5 )\nreturn 0LL;\n}\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(char *a1)\n{\nconst unsigned __int16 *v1; // rcx\nchar *v2; // rax\nchar *v5; // [rsp+18h] [rbp-8h]\n\nwhile ( *a1 )\n{\nv5 = strrchr(\"_-.,/~+\", *a1);\nv1 = *_ctype_b_loc();\nv2 = a1++;\nif ( (v1[*v2] & 8) == 0 && !v5 )\nreturn 0LL;\n}\nreturn 1LL;\n}",
"original_code": "int isidentifier (char *s)\n{\n while (*s)\n {\n char *p = strrchr (\"_-.,/~+\", *s);\n if (! ((*__ctype_b_loc ())[(int) ((*s++))] & (unsigned short int) _ISalnum) && (p == ((void *)0)))\n return 0;\n }\n return 1;\n}",
"canonical_original_code": "int isidentifier(char *s)\n{\n while (*s)\n {\n char *p = strrchr (\"_-.,/~+\", *s);\n if (! ((*__ctype_b_loc ())[(int) ((*s++))] & (unsigned short) _ISalnum) && (p == ((void *)0)))\n return 0;\n }\n return 1;\n}",
"variable_types": [
[
"s",
"char *"
],
[
"p",
"char *"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "b1252419b6e214ea38839b7142bc6181e0639588d17fa095652151ba736a7757"
}
] |
dcd9beff297a40cdf54a0968c610fa52c5f9c182235acd4ea4a4a2e17d26eb59 | Bladtman242/BOSC2013 | [
[
"main",
"->"
],
[
"producer",
"->",
"sleeper"
],
[
"consumer",
"->",
"sleeper"
],
[
"sleeper",
"->",
"producer",
"consumer"
]
] | [] | [
{
"name": "producer",
"canonical_name": "func0",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "void __fastcall __noreturn producer(int *a1)\n{\nint v1; // [rsp+10h] [rbp-20h] BYREF\nint sval; // [rsp+14h] [rbp-1Ch] BYREF\n_QWORD *v3; // [rsp+18h] [rbp-18h]\nvoid *ptr; // [rsp+20h] [rbp-10h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nptr = a1;\nfor ( i = *a1; i < *((_DWORD *)ptr + 1); ++i )\n{\nv3 = (_QWORD *)node_new();\n*v3 = i;\nsem_wait(&empty);\nlist_add(buffer, v3);\nsem_post(&full);\nsleeper(*(double *)_mm_cvtsi32_si128(SLEEP_TIME_MS).m128i_i64);\nsem_getvalue(&full, &sval);\nsem_getvalue(&empty, &v1);\nprintf(\n\"producer %i made item %i, full: %i, empty: %i\\n\",\n(unsigned int)(*(_DWORD *)ptr / producerLoad),\n(unsigned int)*v3,\n(unsigned int)sval,\n(unsigned int)v1);\n}\nfree(ptr);\npthread_exit(0LL);\n}\n",
"canonical_decompiled_code": "void __fastcall __noreturn func0(int *a1)\n{\nint v1; // [rsp+10h] [rbp-20h] BYREF\nint sval; // [rsp+14h] [rbp-1Ch] BYREF\n_QWORD *v3; // [rsp+18h] [rbp-18h]\nvoid *ptr; // [rsp+20h] [rbp-10h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nptr = a1;\nfor ( i = *a1; i < *((_DWORD *)ptr + 1); ++i )\n{\nv3 = (_QWORD *)node_new();\n*v3 = i;\nsem_wait(&empty);\nlist_add(buffer, v3);\nsem_post(&full);\nfunc2(*(double *)_mm_cvtsi32_si128(SLEEP_TIME_MS).m128i_i64);\nsem_getvalue(&full, &sval);\nsem_getvalue(&empty, &v1);\nprintf(\n\"producer %i made item %i, full: %i, empty: %i\\n\",\n(unsigned int)(*(_DWORD *)ptr / producerLoad),\n(unsigned int)*v3,\n(unsigned int)sval,\n(unsigned int)v1);\n}\nfree(ptr);\npthread_exit(0LL);\n}",
"original_code": "void *producer(void *params){\n struct runpars* pars = (struct runpars*) params;\n int i;\n for(i = pars->start; i < pars->end; i++){\n Node *n = node_new();\n n->elm = (void*) i;\n sem_wait(&empty);\n list_add(buffer, n);\n sem_post(&full);\n sleeper(SLEEP_TIME_MS);\n int fullC,emptyC;\n sem_getvalue(&full,&fullC);\n sem_getvalue(&empty,&emptyC);\n printf(\"producer %i made item %i, full: %i, empty: %i\\n\", pars->start/producerLoad, (int) n->elm, fullC, emptyC);\n }\n free(pars);\n pthread_exit(0);\n}",
"canonical_original_code": "void *producer(void *params){\n struct runpars *pars = (struct runpars*) params;\n int i;\n for(i = pars->start; i < pars->end; i++){\n struct node *n = node_new();\n n->elm = (void *) i;\n sem_wait(&empty);\n list_add(buffer, n);\n sem_post(&full);\n sleeper(SLEEP_TIME_MS);\n int fullC; int emptyC;\n sem_getvalue(&full,&fullC);\n sem_getvalue(&empty,&emptyC);\n printf(\"producer %i made item %i, full: %i, empty: %i\\n\", pars->start/producerLoad, (int) n->elm, fullC, emptyC);\n }\n free(pars);\n pthread_exit(0);\n}",
"variable_types": [
[
"params",
"void *"
],
[
"pars",
"struct runpars { int start; int end; } *"
],
[
"i",
"int"
],
[
"n",
"struct node { void *elm; struct node *next; } *"
],
[
"fullC",
"int"
],
[
"emptyC",
"int"
]
],
"return_type": "void *",
"user_defined_types": [
"struct runpars { int start; int end; }",
"struct node { void *elm; struct node *next; }"
],
"binary_hash": "dcd9beff297a40cdf54a0968c610fa52c5f9c182235acd4ea4a4a2e17d26eb59"
},
{
"name": "consumer",
"canonical_name": "func1",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "void __fastcall __noreturn consumer(int *a1)\n{\nint v1; // [rsp+10h] [rbp-20h] BYREF\nint sval; // [rsp+14h] [rbp-1Ch] BYREF\n_QWORD *v3; // [rsp+18h] [rbp-18h]\nvoid *ptr; // [rsp+20h] [rbp-10h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nptr = a1;\nfor ( i = *a1; i < *((_DWORD *)ptr + 1); ++i )\n{\nsem_wait(&full);\nv3 = (_QWORD *)list_remove(buffer);\nsem_post(&empty);\nsleeper(*(double *)_mm_cvtsi32_si128(SLEEP_TIME_MS).m128i_i64);\nsem_getvalue(&full, &sval);\nsem_getvalue(&empty, &v1);\nprintf(\"consumer ate item %i, full: %i, empty: %i\\n\", (unsigned int)*v3, (unsigned int)sval, (unsigned int)v1);\n}\nfree(ptr);\npthread_exit(0LL);\n}\n",
"canonical_decompiled_code": "void __fastcall __noreturn func1(int *a1)\n{\nint v1; // [rsp+10h] [rbp-20h] BYREF\nint sval; // [rsp+14h] [rbp-1Ch] BYREF\n_QWORD *v3; // [rsp+18h] [rbp-18h]\nvoid *ptr; // [rsp+20h] [rbp-10h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nptr = a1;\nfor ( i = *a1; i < *((_DWORD *)ptr + 1); ++i )\n{\nsem_wait(&full);\nv3 = (_QWORD *)list_remove(buffer);\nsem_post(&empty);\nfunc2(*(double *)_mm_cvtsi32_si128(SLEEP_TIME_MS).m128i_i64);\nsem_getvalue(&full, &sval);\nsem_getvalue(&empty, &v1);\nprintf(\"consumer ate item %i, full: %i, empty: %i\\n\", (unsigned int)*v3, (unsigned int)sval, (unsigned int)v1);\n}\nfree(ptr);\npthread_exit(0LL);\n}",
"original_code": "void *consumer(void *params){\n struct runpars* pars = (struct runpars*) params;\n int i;\n for(i = pars->start; i < pars->end; i++){\n sem_wait(&full);\n Node *n = list_remove(buffer);\n sem_post(&empty);\n sleeper(SLEEP_TIME_MS);\n int fullC,emptyC;\n sem_getvalue(&full,&fullC);\n sem_getvalue(&empty,&emptyC);\n printf(\"consumer ate item %i, full: %i, empty: %i\\n\", (int) n->elm, fullC, emptyC);\n }\n free(pars);\n pthread_exit(0);\n}",
"canonical_original_code": "void *consumer(void *params){\n struct runpars *pars = (struct runpars*) params;\n int i;\n for(i = pars->start; i < pars->end; i++){\n sem_wait(&full);\n struct node *n = list_remove(buffer);\n sem_post(&empty);\n sleeper(SLEEP_TIME_MS);\n int fullC; int emptyC;\n sem_getvalue(&full,&fullC);\n sem_getvalue(&empty,&emptyC);\n printf(\"consumer ate item %i, full: %i, empty: %i\\n\", (int) n->elm, fullC, emptyC);\n }\n free(pars);\n pthread_exit(0);\n}",
"variable_types": [
[
"params",
"void *"
],
[
"pars",
"struct runpars { int start; int end; } *"
],
[
"i",
"int"
],
[
"n",
"struct node { void *elm; struct node *next; } *"
],
[
"fullC",
"int"
],
[
"emptyC",
"int"
]
],
"return_type": "void *",
"user_defined_types": [
"struct runpars { int start; int end; }",
"struct node { void *elm; struct node *next; }"
],
"binary_hash": "dcd9beff297a40cdf54a0968c610fa52c5f9c182235acd4ea4a4a2e17d26eb59"
},
{
"name": "sleeper",
"canonical_name": "func2",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "int __fastcall sleeper(float a1)\n{\nfloat v2; // [rsp+Ch] [rbp-4h]\n\nv2 = (float)((float)rand() * a1) / 2147483600.0;\nreturn usleep(1000 * (int)v2);\n}\n",
"canonical_decompiled_code": "int __fastcall func2(float a1)\n{\nfloat v2; // [rsp+Ch] [rbp-4h]\n\nv2 = (float)((float)rand() * a1) / 2147483600.0;\nreturn usleep(1000 * (int)v2);\n}",
"original_code": "void sleeper(float waitMs){\n waitMs = (float)rand() * waitMs / (float)2147483647;\n usleep((int)waitMs * 1000);\n}",
"canonical_original_code": "void sleeper(float waitMs){\n waitMs = (float)rand() * waitMs / (float)2147483647;\n usleep((int)waitMs * 1000);\n}",
"variable_types": [
[
"waitMs",
"float"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "dcd9beff297a40cdf54a0968c610fa52c5f9c182235acd4ea4a4a2e17d26eb59"
},
{
"name": "main",
"canonical_name": "main",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nint result; // eax\nunsigned int v4; // eax\nunsigned int v5; // eax\nunsigned int v6; // eax\nunsigned int v7; // eax\nunsigned int v8; // eax\n_QWORD *ptr; // [rsp+18h] [rbp-18h]\n_QWORD *v10; // [rsp+20h] [rbp-10h]\nint i; // [rsp+2Ch] [rbp-4h]\nint j; // [rsp+2Ch] [rbp-4h]\n\nsetbuf(stdout, 0LL);\nif ( argc == 5 )\n{\nif ( atoi(argv[1]) > 0 )\n{\nif ( atoi(argv[2]) > 0 )\n{\nif ( atoi(argv[3]) > 0 )\n{\nif ( atoi(argv[4]) > 0 )\n{\nbuffer = list_new();\nprodN = atoi(argv[1]);\nconsN = atoi(argv[2]);\nbufferSize = atoi(argv[3]);\nproductsN = atoi(argv[4]);\nproducerLoad = productsN / prodN;\nconsumerLoad = productsN / consN;\nprintf(\n\"Starting! Here are the stats\\n\"\n\"prodN: %i\\n\"\n\"consN: %i\\n\"\n\"buffer: %i\\n\"\n\"products: %i\\n\"\n\"produderload: %i\\n\"\n\"consumerload: %i\\n\",\n(unsigned int)prodN,\n(unsigned int)consN,\nbufferSize,\n(unsigned int)productsN,\n(unsigned int)(productsN / prodN),\n(unsigned int)(productsN / consN));\nsem_init(&full, 0, 0);\nsem_init(&empty, 0, bufferSize);\nv8 = time(0LL);\nsrand(v8);\nv10 = (_QWORD *)spawnNThreads((unsigned int)consN, consumer);\nptr = (_QWORD *)spawnNThreads((unsigned int)prodN, producer);\nfor ( i = 0; i < prodN; ++i )\npthread_join(ptr[i], 0LL);\nfor ( j = 0; j < consN; ++j )\npthread_join(v10[j], 0LL);\nfree(ptr);\nfree(v10);\nresult = 0;\n}\nelse\n{\nv7 = atoi(argv[4]);\nfprintf(stderr, \"%d - products must be > 0\\n\", v7);\nresult = -1;\n}\n}\nelse\n{\nv6 = atoi(argv[3]);\nfprintf(stderr, \"%d - bufferSize must be > 0\\n\", v6);\nresult = -1;\n}\n}\nelse\n{\nv5 = atoi(argv[2]);\nfprintf(stderr, \"%d - consumers must be > 0\\n\", v5);\nresult = -1;\n}\n}\nelse\n{\nv4 = atoi(argv[1]);\nfprintf(stderr, \"%d - producers must be > 0\\n\", v4);\nresult = -1;\n}\n}\nelse\n{\nfwrite(\"usage: prodcons [procucers] [consumers] [bufferSize] [products]\\n\", 1uLL, 0x40uLL, stderr);\nresult = -1;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nint result; // eax\nunsigned int v4; // eax\nunsigned int v5; // eax\nunsigned int v6; // eax\nunsigned int v7; // eax\nunsigned int v8; // eax\n_QWORD *ptr; // [rsp+18h] [rbp-18h]\n_QWORD *v10; // [rsp+20h] [rbp-10h]\nint i; // [rsp+2Ch] [rbp-4h]\nint j; // [rsp+2Ch] [rbp-4h]\n\nsetbuf(stdout, 0LL);\nif ( argc == 5 )\n{\nif ( atoi(argv[1]) > 0 )\n{\nif ( atoi(argv[2]) > 0 )\n{\nif ( atoi(argv[3]) > 0 )\n{\nif ( atoi(argv[4]) > 0 )\n{\nbuffer = list_new();\nprodN = atoi(argv[1]);\nconsN = atoi(argv[2]);\nbufferSize = atoi(argv[3]);\nproductsN = atoi(argv[4]);\nproducerLoad = productsN / prodN;\nconsumerLoad = productsN / consN;\nprintf(\n\"Starting! Here are the stats\\n\"\n\"prodN: %i\\n\"\n\"consN: %i\\n\"\n\"buffer: %i\\n\"\n\"products: %i\\n\"\n\"produderload: %i\\n\"\n\"consumerload: %i\\n\",\n(unsigned int)prodN,\n(unsigned int)consN,\nbufferSize,\n(unsigned int)productsN,\n(unsigned int)(productsN / prodN),\n(unsigned int)(productsN / consN));\nsem_init(&full, 0, 0);\nsem_init(&empty, 0, bufferSize);\nv8 = time(0LL);\nsrand(v8);\nv10 = (_QWORD *)spawnNThreads((unsigned int)consN, consumer);\nptr = (_QWORD *)spawnNThreads((unsigned int)prodN, producer);\nfor ( i = 0; i < prodN; ++i )\npthread_join(ptr[i], 0LL);\nfor ( j = 0; j < consN; ++j )\npthread_join(v10[j], 0LL);\nfree(ptr);\nfree(v10);\nresult = 0;\n}\nelse\n{\nv7 = atoi(argv[4]);\nfprintf(stderr, \"%d - products must be > 0\\n\", v7);\nresult = -1;\n}\n}\nelse\n{\nv6 = atoi(argv[3]);\nfprintf(stderr, \"%d - bufferSize must be > 0\\n\", v6);\nresult = -1;\n}\n}\nelse\n{\nv5 = atoi(argv[2]);\nfprintf(stderr, \"%d - consumers must be > 0\\n\", v5);\nresult = -1;\n}\n}\nelse\n{\nv4 = atoi(argv[1]);\nfprintf(stderr, \"%d - producers must be > 0\\n\", v4);\nresult = -1;\n}\n}\nelse\n{\nfwrite(\"usage: prodcons [procucers] [consumers] [bufferSize] [products]\\n\", 1uLL, 0x40uLL, stderr);\nresult = -1;\n}\nreturn result;\n}",
"original_code": "int main(int argc, char* argv[]){\n setbuf(stdout,((void *)0));\n if(argc != 5){\n fprintf(stderr, \"usage: prodcons [procucers] [consumers] [bufferSize] [products]\\n\");\n return -1;\n }\n if(atoi(argv[1]) <= 0) {\n fprintf(stderr,\"%d - producers must be > 0\\n\", atoi(argv[1]));\n return -1;\n }\n if(atoi(argv[2]) <= 0) {\n fprintf(stderr,\"%d - consumers must be > 0\\n\", atoi(argv[2]));\n return -1;\n }\n if(atoi(argv[3]) <= 0) {\n fprintf(stderr,\"%d - bufferSize must be > 0\\n\", atoi(argv[3]));\n return -1;\n }\n if(atoi(argv[4]) <= 0) {\n fprintf(stderr,\"%d - products must be > 0\\n\", atoi(argv[4]));\n return -1;\n }\n buffer = list_new();\n prodN = atoi(argv[1]);\n consN = atoi(argv[2]);\n bufferSize = atoi(argv[3]);\n productsN = atoi(argv[4]);\n producerLoad = productsN / prodN;\n consumerLoad = productsN / consN;\n printf(\"Starting! Here are the stats\\n\"\n \"prodN: %i\\n\"\n \"consN: %i\\n\"\n \"buffer: %i\\n\"\n \"products: %i\\n\"\n \"produderload: %i\\n\"\n \"consumerload: %i\\n\",\n prodN, consN, bufferSize, productsN, producerLoad, consumerLoad);\n sem_init(&full, 0, 0);\n sem_init(&empty, 0, bufferSize);\n srand(time(((void *)0)));\n pthread_t *consIds = spawnNThreads(consN, consumer);\n pthread_t *prodIds = spawnNThreads(prodN, producer);\n int i;\n for(i=0; i<prodN; i++){\n pthread_join(prodIds[i], ((void *)0));\n }\n for(i=0; i<consN; i++){\n pthread_join(consIds[i], ((void *)0));\n }\n free(prodIds);\n free(consIds);\n return 0;\n}",
"canonical_original_code": "int main(int argc, char *argv[]){\n setbuf(stdout,((void *)0));\n if(argc != 5){\n fprintf(stderr, \"usage: prodcons [procucers] [consumers] [bufferSize] [products]\\n\");\n return -1;\n }\n if(atoi(argv[1]) <= 0) {\n fprintf(stderr,\"%d - producers must be > 0\\n\", atoi(argv[1]));\n return -1;\n }\n if(atoi(argv[2]) <= 0) {\n fprintf(stderr,\"%d - consumers must be > 0\\n\", atoi(argv[2]));\n return -1;\n }\n if(atoi(argv[3]) <= 0) {\n fprintf(stderr,\"%d - bufferSize must be > 0\\n\", atoi(argv[3]));\n return -1;\n }\n if(atoi(argv[4]) <= 0) {\n fprintf(stderr,\"%d - products must be > 0\\n\", atoi(argv[4]));\n return -1;\n }\n buffer = list_new();\n prodN = atoi(argv[1]);\n consN = atoi(argv[2]);\n bufferSize = atoi(argv[3]);\n productsN = atoi(argv[4]);\n producerLoad = productsN / prodN;\n consumerLoad = productsN / consN;\n printf(\"Starting! Here are the stats\\n\"\n \"prodN: %i\\n\"\n \"consN: %i\\n\"\n \"buffer: %i\\n\"\n \"products: %i\\n\"\n \"produderload: %i\\n\"\n \"consumerload: %i\\n\",\n prodN, consN, bufferSize, productsN, producerLoad, consumerLoad);\n sem_init(&full, 0, 0);\n sem_init(&empty, 0, bufferSize);\n srand(time(((void *)0)));\n unsigned long *consIds = spawnNThreads(consN, consumer);\n unsigned long *prodIds = spawnNThreads(prodN, producer);\n int i;\n for(i=0; i<prodN; i++){\n pthread_join(prodIds[i], ((void *)0));\n }\n for(i=0; i<consN; i++){\n pthread_join(consIds[i], ((void *)0));\n }\n free(prodIds);\n free(consIds);\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char *[]"
],
[
"consIds",
"unsigned long *"
],
[
"prodIds",
"unsigned long *"
],
[
"i",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "dcd9beff297a40cdf54a0968c610fa52c5f9c182235acd4ea4a4a2e17d26eb59"
}
] |
f4e0869ba1115b0f55a8048a68f7223efabf8068a766171674a8cd9017b7eb50 | Bladtman242/BOSC2013 | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"printavail",
"->",
"resource_request"
],
[
"Sleep",
"->",
"process_thread"
],
[
"arrayLE",
"->",
"resource_request"
],
[
"resource_request",
"->",
"arrayLE",
"printavail",
"process_thread",
"main"
],
[
"resource_release",
"->",
"process_thread"
],
[
"generate_request",
"->",
"process_thread"
],
[
"generate_release",
"->",
"process_thread"
],
[
"process_thread",
"->",
"generate_request",
"resource_request",
"Sleep",
"generate_release",
"resource_release"
],
[
"main",
"->",
"resource_request"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_405010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"void *func3()\n{\nreturn &_bss_start;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"void *func5()\n{\nvoid *result; // rax\n\nif ( !completed_0 )\n{\nresult = func3();\ncompleted_0 = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"_libc_csu_init",
"void __fastcall func15(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func16(void)\n{\n;\n}"
]
] | [
{
"name": "printavail",
"canonical_name": "func7",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "int printavail()\n{\nint i; // [rsp+Ch] [rbp-4h]\n\nprintf(\"Avaialble: [\");\nfor ( i = 0; i < n; ++i )\nprintf(\"%i,\", *(unsigned int *)(*(_QWORD *)(s + 8) + 4LL * i));\nreturn puts(\"]\");\n}\n",
"canonical_decompiled_code": "int func7()\n{\nint i; // [rsp+Ch] [rbp-4h]\n\nprintf(\"Avaialble: [\");\nfor ( i = 0; i < n; ++i )\nprintf(\"%i,\", *(unsigned int *)(*(_QWORD *)(s + 8) + 4LL * i));\nreturn puts(\"]\");\n}",
"original_code": "void printavail(){\n printf(\"Avaialble: [\");\n int i;\n for(i=0; i<n; i++){\n printf(\"%i,\", s->available[i]);\n }\n puts(\"]\");\n}",
"canonical_original_code": "void printavail(){\n printf(\"Avaialble: [\");\n int i;\n for(i=0; i<n; i++){\n printf(\"%i,\", s->available[i]);\n }\n puts(\"]\");\n}",
"variable_types": [
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "f4e0869ba1115b0f55a8048a68f7223efabf8068a766171674a8cd9017b7eb50"
},
{
"name": "Sleep",
"canonical_name": "func8",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "int __fastcall Sleep(float a1)\n{\nint v1; // eax\n\nv1 = rand();\nreturn usleep((int)(float)(1000.0 * (float)((float)((float)v1 * a1) / 2147483600.0)));\n}\n",
"canonical_decompiled_code": "int __fastcall func8(float a1)\n{\nint v1; // eax\n\nv1 = rand();\nreturn usleep((int)(float)(1000.0 * (float)((float)((float)v1 * a1) / 2147483600.0)));\n}",
"original_code": "void Sleep(float wait_time_ms)\n{\n wait_time_ms = ((float)rand())*wait_time_ms / (float)2147483647;\n usleep((int) (wait_time_ms * 1e3f));\n}",
"canonical_original_code": "void Sleep(float wait_time_ms)\n{\n wait_time_ms = ((float)rand())*wait_time_ms / (float)2147483647;\n usleep((int) (wait_time_ms * 1e3f));\n}",
"variable_types": [
[
"wait_time_ms",
"float"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "f4e0869ba1115b0f55a8048a68f7223efabf8068a766171674a8cd9017b7eb50"
},
{
"name": "arrayLE",
"canonical_name": "func9",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "__int64 __fastcall arrayLE(__int64 a1, __int64 a2, int a3)\n{\nint i; // [rsp+20h] [rbp-4h]\n\nfor ( i = 0; i < a3; ++i )\n{\nif ( *(_DWORD *)(4LL * i + a1) > *(_DWORD *)(4LL * i + a2) )\nreturn 0LL;\n}\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func9(__int64 a1, __int64 a2, int a3)\n{\nint i; // [rsp+20h] [rbp-4h]\n\nfor ( i = 0; i < a3; ++i )\n{\nif ( *(_DWORD *)(4LL * i + a1) > *(_DWORD *)(4LL * i + a2) )\nreturn 0LL;\n}\nreturn 1LL;\n}",
"original_code": "int arrayLE(int* a, int* b, int len)\n{\n int i;\n for(i=0; i<len; i++){\n if(a[i] > b[i]){\n return 0;\n }\n }\n return 1;\n}",
"canonical_original_code": "int arrayLE(int *a, int *b, int len)\n{\n int i;\n for(i=0; i<len; i++){\n if(a[i] > b[i]){\n return 0;\n }\n }\n return 1;\n}",
"variable_types": [
[
"a",
"int *"
],
[
"b",
"int *"
],
[
"len",
"int"
],
[
"i",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "f4e0869ba1115b0f55a8048a68f7223efabf8068a766171674a8cd9017b7eb50"
},
{
"name": "resource_request",
"canonical_name": "func10",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "__int64 __fastcall resource_request(int a1, __int64 a2)\n{\nvoid *v3; // rsp\nvoid *v4; // rsp\nvoid *v5; // rsp\n__int64 v6[8]; // [rsp+0h] [rbp-C0h] BYREF\n__int64 v7; // [rsp+40h] [rbp-80h]\nint v8; // [rsp+4Ch] [rbp-74h]\n__int64 v9; // [rsp+58h] [rbp-68h]\n__int64 v10; // [rsp+60h] [rbp-60h]\n__int64 v11; // [rsp+68h] [rbp-58h]\n__int64 v12; // [rsp+70h] [rbp-50h]\n__int64 v13; // [rsp+78h] [rbp-48h]\n__int64 v14; // [rsp+80h] [rbp-40h]\nint i; // [rsp+88h] [rbp-38h]\nunsigned int j; // [rsp+8Ch] [rbp-34h]\n\nv8 = a1;\nv7 = a2;\nif ( !(unsigned int)arrayLE(a2, *(_QWORD *)(s + 8), n) )\nreturn 0LL;\nv14 = n - 1LL;\nv6[6] = n;\nv6[7] = 0LL;\nv6[4] = n;\nv6[5] = 0LL;\nv3 = alloca(16 * ((4LL * n + 15) / 0x10uLL));\nv13 = 4 * (((unsigned __int64)v6 + 3) >> 2);\nv12 = m - 1LL;\nv6[2] = m;\nv6[3] = 0LL;\nv6[0] = m;\nv6[1] = 0LL;\nv4 = alloca(16 * ((4LL * m + 15) / 0x10uLL));\nv11 = v13;\nv10 = v14;\nv5 = alloca(16 * ((4LL * n + 15) / 0x10uLL));\nv9 = v13;\nfor ( i = 0; i < m; ++i )\n*(_DWORD *)(v11 + 4LL * i) = 0;\nfor ( i = 0; i < n; ++i )\n*(_DWORD *)(v13 + 4LL * i) = *(_DWORD *)(*(_QWORD *)(s + 8) + 4LL * i) - *(_DWORD *)(4LL * i + v7);\nfor ( i = 0; i < n; ++i )\n*(_DWORD *)(v9 + 4LL * i) = *(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 32) + 8LL * v8) + 4LL * i)\n- *(_DWORD *)(4LL * i + v7);\nfor ( j = 0; ; *(_DWORD *)(v11 + 4LL * (int)j) = 1 )\n{\nwhile ( (*(_DWORD *)(v11 + 4LL * (int)j) || !(unsigned int)arrayLE(v9, v13, n)) && (int)j < m )\n++j;\nif ( *(_DWORD *)(v11 + 4LL * (int)j) || !(unsigned int)arrayLE(v9, v13, n) )\nbreak;\nfor ( i = 0; i < n; ++i )\n*(_DWORD *)(v13 + 4LL * i) += *(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 24) + 8LL * v8) + 4LL * (int)j)\n+ *(_DWORD *)(4LL * i + v7);\n}\nj = 1;\ni = 0;\nif ( m > 0 && !*(_DWORD *)(v11 + 4LL * i) )\nj = 0;\nif ( j )\n{\npthread_mutex_lock(&mutex);\nfor ( i = 0; i < n; ++i )\n{\n*(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 24) + 8LL * v8) + 4LL * i) += *(_DWORD *)(4LL * i + v7);\n*(_DWORD *)(*(_QWORD *)(s + 8) + 4LL * i) -= *(_DWORD *)(4LL * i + v7);\n*(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 32) + 8LL * v8) + 4LL * i) -= *(_DWORD *)(4LL * i + v7);\n}\nprintavail();\npthread_mutex_unlock(&mutex);\n}\nreturn j;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func10(int a1, __int64 a2)\n{\nvoid *v3; // rsp\nvoid *v4; // rsp\nvoid *v5; // rsp\n__int64 v6[8]; // [rsp+0h] [rbp-C0h] BYREF\n__int64 v7; // [rsp+40h] [rbp-80h]\nint v8; // [rsp+4Ch] [rbp-74h]\n__int64 v9; // [rsp+58h] [rbp-68h]\n__int64 v10; // [rsp+60h] [rbp-60h]\n__int64 v11; // [rsp+68h] [rbp-58h]\n__int64 v12; // [rsp+70h] [rbp-50h]\n__int64 v13; // [rsp+78h] [rbp-48h]\n__int64 v14; // [rsp+80h] [rbp-40h]\nint i; // [rsp+88h] [rbp-38h]\nunsigned int j; // [rsp+8Ch] [rbp-34h]\n\nv8 = a1;\nv7 = a2;\nif ( !(unsigned int)func9(a2, *(_QWORD *)(s + 8), n) )\nreturn 0LL;\nv14 = n - 1LL;\nv6[6] = n;\nv6[7] = 0LL;\nv6[4] = n;\nv6[5] = 0LL;\nv3 = alloca(16 * ((4LL * n + 15) / 0x10uLL));\nv13 = 4 * (((unsigned __int64)v6 + 3) >> 2);\nv12 = m - 1LL;\nv6[2] = m;\nv6[3] = 0LL;\nv6[0] = m;\nv6[1] = 0LL;\nv4 = alloca(16 * ((4LL * m + 15) / 0x10uLL));\nv11 = v13;\nv10 = v14;\nv5 = alloca(16 * ((4LL * n + 15) / 0x10uLL));\nv9 = v13;\nfor ( i = 0; i < m; ++i )\n*(_DWORD *)(v11 + 4LL * i) = 0;\nfor ( i = 0; i < n; ++i )\n*(_DWORD *)(v13 + 4LL * i) = *(_DWORD *)(*(_QWORD *)(s + 8) + 4LL * i) - *(_DWORD *)(4LL * i + v7);\nfor ( i = 0; i < n; ++i )\n*(_DWORD *)(v9 + 4LL * i) = *(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 32) + 8LL * v8) + 4LL * i)\n- *(_DWORD *)(4LL * i + v7);\nfor ( j = 0; ; *(_DWORD *)(v11 + 4LL * (int)j) = 1 )\n{\nwhile ( (*(_DWORD *)(v11 + 4LL * (int)j) || !(unsigned int)func9(v9, v13, n)) && (int)j < m )\n++j;\nif ( *(_DWORD *)(v11 + 4LL * (int)j) || !(unsigned int)func9(v9, v13, n) )\nbreak;\nfor ( i = 0; i < n; ++i )\n*(_DWORD *)(v13 + 4LL * i) += *(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 24) + 8LL * v8) + 4LL * (int)j)\n+ *(_DWORD *)(4LL * i + v7);\n}\nj = 1;\ni = 0;\nif ( m > 0 && !*(_DWORD *)(v11 + 4LL * i) )\nj = 0;\nif ( j )\n{\npthread_mutex_lock(&mutex);\nfor ( i = 0; i < n; ++i )\n{\n*(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 24) + 8LL * v8) + 4LL * i) += *(_DWORD *)(4LL * i + v7);\n*(_DWORD *)(*(_QWORD *)(s + 8) + 4LL * i) -= *(_DWORD *)(4LL * i + v7);\n*(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 32) + 8LL * v8) + 4LL * i) -= *(_DWORD *)(4LL * i + v7);\n}\nfunc7();\npthread_mutex_unlock(&mutex);\n}\nreturn j;\n}",
"original_code": "int resource_request(int pi, int *request)\n{\n if(!arrayLE(request, s->available, n))\n return 0;\n int work[n];\n int finish[m];\n int tmpNeed[n];\n int i;\n for(i=0;i<m;i++){\n finish[i]=0;\n }\n for(i=0;i<n;i++){\n work[i]=s->available[i] - request[i];\n }\n for(i=0;i<n;i++){\n tmpNeed[i]=s->need[pi][i] - request[i];\n }\n int k=0;\n while(1){\n while(!(!finish[k] && arrayLE(tmpNeed, work, n)) && k<m){\n k++;\n }\n if(!(!finish[k] && arrayLE(tmpNeed, work, n))){\n break;\n }\n for(i=0; i<n; i++){\n work[i] = work[i] + s->allocation[pi][k] + request[i];\n }\n finish[k]=1;\n }\n k=1;\n for(i=0; i<m; i++){\n if (!finish[i])\n k=0;\n break;\n }\n if(k){\n pthread_mutex_lock(&mutex);\n for(i=0; i<n; i++){\n s->allocation[pi][i] = s->allocation[pi][i] + request[i];\n s->available[i] = s->available[i] - request[i];\n s->need[pi][i] = s->need[pi][i] - request[i];\n }\n printavail();\n pthread_mutex_unlock(&mutex);\n }\n return k;\n}",
"canonical_original_code": "int resource_request(int pi, int *request)\n{\n if(!arrayLE(request, s->available, n))\n return 0;\n int work[-1];\n int finish[-1];\n int tmpNeed[-1];\n int i;\n for(i=0;i<m;i++){\n finish[i]=0;\n }\n for(i=0;i<n;i++){\n work[i]=s->available[i] - request[i];\n }\n for(i=0;i<n;i++){\n tmpNeed[i]=s->need[pi][i] - request[i];\n }\n int k = 0;\n while(1){\n while(!(!finish[k] && arrayLE(tmpNeed, work, n)) && k<m){\n k++;\n }\n if(!(!finish[k] && arrayLE(tmpNeed, work, n))){\n break;\n }\n for(i=0; i<n; i++){\n work[i] = work[i] + s->allocation[pi][k] + request[i];\n }\n finish[k]=1;\n }\n k=1;\n for(i=0; i<m; i++){\n if (!finish[i])\n k=0;\n break;\n }\n if(k){\n pthread_mutex_lock(&mutex);\n for(i=0; i<n; i++){\n s->allocation[pi][i] = s->allocation[pi][i] + request[i];\n s->available[i] = s->available[i] - request[i];\n s->need[pi][i] = s->need[pi][i] - request[i];\n }\n printavail();\n pthread_mutex_unlock(&mutex);\n }\n return k;\n}",
"variable_types": [
[
"pi",
"int"
],
[
"request",
"int *"
],
[
"work",
"int [-1]"
],
[
"finish",
"int [-1]"
],
[
"tmpNeed",
"int [-1]"
],
[
"i",
"int"
],
[
"k",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "f4e0869ba1115b0f55a8048a68f7223efabf8068a766171674a8cd9017b7eb50"
},
{
"name": "resource_release",
"canonical_name": "func11",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "int __fastcall resource_release(int a1, __int64 a2)\n{\nint i; // [rsp+1Ch] [rbp-4h]\n\npthread_mutex_lock(&mutex);\nfor ( i = 0; i < n; ++i )\n{\n*(_DWORD *)(*(_QWORD *)(s + 8) + 4LL * i) += *(_DWORD *)(4LL * i + a2);\n*(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 24) + 8LL * a1) + 4LL * i) -= *(_DWORD *)(4LL * i + a2);\n*(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 32) + 8LL * a1) + 4LL * i) += *(_DWORD *)(4LL * i + a2);\n}\nreturn pthread_mutex_unlock(&mutex);\n}\n",
"canonical_decompiled_code": "int __fastcall func11(int a1, __int64 a2)\n{\nint i; // [rsp+1Ch] [rbp-4h]\n\npthread_mutex_lock(&mutex);\nfor ( i = 0; i < n; ++i )\n{\n*(_DWORD *)(*(_QWORD *)(s + 8) + 4LL * i) += *(_DWORD *)(4LL * i + a2);\n*(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 24) + 8LL * a1) + 4LL * i) -= *(_DWORD *)(4LL * i + a2);\n*(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 32) + 8LL * a1) + 4LL * i) += *(_DWORD *)(4LL * i + a2);\n}\nreturn pthread_mutex_unlock(&mutex);\n}",
"original_code": "void resource_release(int i, int *request)\n{\n int j;\n pthread_mutex_lock(&mutex);\n for(j=0; j<n; j++){\n s->available[j] = s->available[j] + request[j];\n s->allocation[i][j] = s->allocation[i][j] - request[j];\n s->need[i][j] = s->need[i][j] + request[j];\n }\n pthread_mutex_unlock(&mutex);\n}",
"canonical_original_code": "void resource_release(int i, int *request)\n{\n int j;\n pthread_mutex_lock(&mutex);\n for(j=0; j<n; j++){\n s->available[j] = s->available[j] + request[j];\n s->allocation[i][j] = s->allocation[i][j] - request[j];\n s->need[i][j] = s->need[i][j] + request[j];\n }\n pthread_mutex_unlock(&mutex);\n}",
"variable_types": [
[
"i",
"int"
],
[
"request",
"int *"
],
[
"j",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "f4e0869ba1115b0f55a8048a68f7223efabf8068a766171674a8cd9017b7eb50"
},
{
"name": "generate_request",
"canonical_name": "func12",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "int __fastcall generate_request(unsigned int a1, __int64 a2)\n{\ndouble v3; // [rsp+8h] [rbp-28h]\nint v4; // [rsp+28h] [rbp-8h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nv4 = 0;\nwhile ( !v4 )\n{\nfor ( i = 0; i < n; ++i )\n{\nv3 = (double)*(int *)(*(_QWORD *)(*(_QWORD *)(s + 32) + 8LL * (int)a1) + 4LL * i);\n*(_DWORD *)(a2 + 4LL * i) = (int)((double)rand() * v3 / 2147483647.0);\nv4 += *(_DWORD *)(4LL * i + a2);\n}\n}\nreturn printf(\"Process %d: Requesting resources.\\n\", a1);\n}\n",
"canonical_decompiled_code": "int __fastcall func12(unsigned int a1, __int64 a2)\n{\ndouble v3; // [rsp+8h] [rbp-28h]\nint v4; // [rsp+28h] [rbp-8h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nv4 = 0;\nwhile ( !v4 )\n{\nfor ( i = 0; i < n; ++i )\n{\nv3 = (double)*(int *)(*(_QWORD *)(*(_QWORD *)(s + 32) + 8LL * (int)a1) + 4LL * i);\n*(_DWORD *)(a2 + 4LL * i) = (int)((double)rand() * v3 / 2147483647.0);\nv4 += *(_DWORD *)(4LL * i + a2);\n}\n}\nreturn printf(\"Process %d: Requesting resources.\\n\", a1);\n}",
"original_code": "void generate_request(int i, int *request)\n{\n int j, sum = 0;\n while (!sum) {\n for (j = 0;j < n; j++) {\n request[j] = s->need[i][j] * ((double)rand())/ (double)2147483647;\n sum += request[j];\n }\n }\n printf(\"Process %d: Requesting resources.\\n\",i);\n}",
"canonical_original_code": "void generate_request(int i, int *request)\n{\n int j; int sum = 0;\n while (!sum) {\n for (j = 0;j < n; j++) {\n request[j] = s->need[i][j] * ((double)rand())/ (double)2147483647;\n sum += request[j];\n }\n }\n printf(\"Process %d: Requesting resources.\\n\",i);\n}",
"variable_types": [
[
"i",
"int"
],
[
"request",
"int *"
],
[
"j",
"int"
],
[
"sum",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "f4e0869ba1115b0f55a8048a68f7223efabf8068a766171674a8cd9017b7eb50"
},
{
"name": "generate_release",
"canonical_name": "func13",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "int __fastcall generate_release(unsigned int a1, __int64 a2)\n{\ndouble v3; // [rsp+8h] [rbp-28h]\nint v4; // [rsp+28h] [rbp-8h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nv4 = 0;\nwhile ( !v4 )\n{\nfor ( i = 0; i < n; ++i )\n{\nv3 = (double)*(int *)(*(_QWORD *)(*(_QWORD *)(s + 24) + 8LL * (int)a1) + 4LL * i);\n*(_DWORD *)(a2 + 4LL * i) = (int)((double)rand() * v3 / 2147483647.0);\nv4 += *(_DWORD *)(4LL * i + a2);\n}\n}\nreturn printf(\"Process %d: Releasing resources.\\n\", a1);\n}\n",
"canonical_decompiled_code": "int __fastcall func13(unsigned int a1, __int64 a2)\n{\ndouble v3; // [rsp+8h] [rbp-28h]\nint v4; // [rsp+28h] [rbp-8h]\nint i; // [rsp+2Ch] [rbp-4h]\n\nv4 = 0;\nwhile ( !v4 )\n{\nfor ( i = 0; i < n; ++i )\n{\nv3 = (double)*(int *)(*(_QWORD *)(*(_QWORD *)(s + 24) + 8LL * (int)a1) + 4LL * i);\n*(_DWORD *)(a2 + 4LL * i) = (int)((double)rand() * v3 / 2147483647.0);\nv4 += *(_DWORD *)(4LL * i + a2);\n}\n}\nreturn printf(\"Process %d: Releasing resources.\\n\", a1);\n}",
"original_code": "void generate_release(int i, int *request)\n{\n int j, sum = 0;\n while (!sum) {\n for (j = 0;j < n; j++) {\n request[j] = s->allocation[i][j] * ((double)rand())/ (double)2147483647;\n sum += request[j];\n }\n }\n printf(\"Process %d: Releasing resources.\\n\",i);\n}",
"canonical_original_code": "void generate_release(int i, int *request)\n{\n int j; int sum = 0;\n while (!sum) {\n for (j = 0;j < n; j++) {\n request[j] = s->allocation[i][j] * ((double)rand())/ (double)2147483647;\n sum += request[j];\n }\n }\n printf(\"Process %d: Releasing resources.\\n\",i);\n}",
"variable_types": [
[
"i",
"int"
],
[
"request",
"int *"
],
[
"j",
"int"
],
[
"sum",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "f4e0869ba1115b0f55a8048a68f7223efabf8068a766171674a8cd9017b7eb50"
},
{
"name": "process_thread",
"canonical_name": "func14",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "void __fastcall __noreturn process_thread(void *a1)\n{\nvoid *v1; // [rsp+10h] [rbp-10h]\n\nv1 = malloc(4LL * n);\nwhile ( 1 )\n{\ngenerate_request((unsigned int)a1, (__int64)v1);\nwhile ( !(unsigned int)resource_request((int)a1, (__int64)v1) )\nSleep(100.0);\ngenerate_release((unsigned int)a1, (__int64)v1);\nresource_release((int)a1, (__int64)v1);\nSleep(1000.0);\n}\n}\n",
"canonical_decompiled_code": "void __fastcall __noreturn func14(void *a1)\n{\nvoid *v1; // [rsp+10h] [rbp-10h]\n\nv1 = malloc(4LL * n);\nwhile ( 1 )\n{\nfunc12((unsigned int)a1, (__int64)v1);\nwhile ( !(unsigned int)func10((int)a1, (__int64)v1) )\nfunc8(100.0);\nfunc13((unsigned int)a1, (__int64)v1);\nfunc11((int)a1, (__int64)v1);\nfunc8(1000.0);\n}\n}",
"original_code": "void *process_thread(void *param)\n{\n int i = (int) (long) param, j;\n int *request = malloc(n*sizeof(int));\n while (1) {\n generate_request(i, request);\n while (!resource_request(i, request)) {\n Sleep(100);\n }\n generate_release(i, request);\n resource_release(i, request);\n Sleep(1000);\n }\n free(request);\n}",
"canonical_original_code": "void *process_thread(void *param)\n{\n int i = (int) (long) param; int j;\n int *request = malloc(n*sizeof(int));\n while (1) {\n generate_request(i, request);\n while (!resource_request(i, request)) {\n Sleep(100);\n }\n generate_release(i, request);\n resource_release(i, request);\n Sleep(1000);\n }\n free(request);\n}",
"variable_types": [
[
"param",
"void *"
],
[
"i",
"int"
],
[
"j",
"int"
],
[
"request",
"int *"
]
],
"return_type": "void *",
"user_defined_types": [],
"binary_hash": "f4e0869ba1115b0f55a8048a68f7223efabf8068a766171674a8cd9017b7eb50"
},
{
"name": "main",
"canonical_name": "main",
"repo": "Bladtman242/BOSC2013",
"decompiled_code": "int __cdecl __noreturn main(int argc, const char **argv, const char **envp)\n{\nvoid *v3; // rsp\nvoid *v4; // rsp\nvoid *v5; // rsp\nvoid *v6; // rsp\nvoid *v7; // rsp\nvoid *v8; // rsp\n__int64 v9[21]; // [rsp+0h] [rbp-1B0h] BYREF\nint v10; // [rsp+ACh] [rbp-104h]\nstruct timeval tv; // [rsp+B0h] [rbp-100h] BYREF\n__int64 v12[5]; // [rsp+F0h] [rbp-C0h] BYREF\npthread_t *v13; // [rsp+118h] [rbp-98h]\n__int64 v14; // [rsp+120h] [rbp-90h]\n__int64 v15; // [rsp+128h] [rbp-88h]\nunsigned __int64 v16; // [rsp+130h] [rbp-80h]\n__int64 v17; // [rsp+138h] [rbp-78h]\nunsigned __int64 v18; // [rsp+140h] [rbp-70h]\n__int64 v19; // [rsp+148h] [rbp-68h]\nunsigned __int64 v20; // [rsp+150h] [rbp-60h]\n__int64 v21; // [rsp+158h] [rbp-58h]\nunsigned __int64 v22; // [rsp+160h] [rbp-50h]\n__int64 v23; // [rsp+168h] [rbp-48h]\nunsigned __int64 v24; // [rsp+170h] [rbp-40h]\n__int64 v25; // [rsp+178h] [rbp-38h]\nint i; // [rsp+184h] [rbp-2Ch]\nint j; // [rsp+188h] [rbp-28h]\nint v28; // [rsp+18Ch] [rbp-24h]\n\nv10 = argc;\nv9[20] = (__int64)argv;\npthread_mutex_init(&mutex, 0LL);\nprintf(\"Number of processes: \");\n__isoc99_scanf();\nprintf(\"Number of resources: \");\n__isoc99_scanf();\nv25 = n - 1LL;\nv3 = alloca(16 * ((4LL * n + 15) / 0x10uLL));\nv24 = 4 * (((unsigned __int64)v9 + 3) >> 2);\nv23 = v25;\nv9[18] = n;\nv9[19] = 0LL;\nv9[16] = n;\nv9[17] = 0LL;\nv4 = alloca(16 * ((4LL * n + 15) / 0x10uLL));\nv22 = v24;\nv21 = m - 1LL;\nv9[14] = m;\nv9[15] = 0LL;\nv9[12] = m;\nv9[13] = 0LL;\nv5 = alloca(16 * ((8LL * m + 15) / 0x10uLL));\nv20 = 8 * (((unsigned __int64)v9 + 7) >> 3);\nv19 = v21;\nv9[10] = m;\nv9[11] = 0LL;\nv9[8] = m;\nv9[9] = 0LL;\nv6 = alloca(16 * ((8LL * m + 15) / 0x10uLL));\nv18 = v20;\nv17 = v21;\nv9[6] = m;\nv9[7] = 0LL;\nv9[4] = m;\nv9[5] = 0LL;\nv7 = alloca(16 * ((8LL * m + 15) / 0x10uLL));\nv16 = v20;\nfor ( i = 0; i < m; ++i )\n{\n*(_QWORD *)(v20 + 8LL * i) = malloc(4LL * n);\n*(_QWORD *)(v18 + 8LL * i) = malloc(4LL * n);\n*(_QWORD *)(v16 + 8LL * i) = malloc(4LL * n);\n}\nv12[0] = v24;\nv12[1] = v22;\nv12[2] = v20;\nv12[3] = v18;\nv12[4] = v16;\ns = (__int64)v12;\nprintf(\"Resource vector: \");\nfor ( i = 0; i < n; ++i )\n__isoc99_scanf();\nprintf(\"Enter max matrix: \");\nfor ( i = 0; i < m; ++i )\n{\nfor ( j = 0; j < n; ++j )\n__isoc99_scanf();\n}\nprintf(\"Enter allocation matrix: \");\nfor ( i = 0; i < m; ++i )\n{\nfor ( j = 0; j < n; ++j )\n__isoc99_scanf();\n}\nputchar(10);\nfor ( i = 0; i < m; ++i )\n{\nfor ( j = 0; j < n; ++j )\n*(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 32) + 8LL * i) + 4LL * j) = *(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 16)\n+ 8LL * i)\n+ 4LL * j)\n- *(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 24)\n+ 8LL * i)\n+ 4LL * j);\n}\nfor ( j = 0; j < n; ++j )\n{\nv28 = 0;\nfor ( i = 0; i < m; ++i )\nv28 += *(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 24) + 8LL * i) + 4LL * j);\n*(_DWORD *)(*(_QWORD *)(s + 8) + 4LL * j) = *(_DWORD *)(*(_QWORD *)s + 4LL * j) - v28;\n}\nputs(\"Need matrix:\");\nfor ( i = 0; i < n; ++i )\nprintf(\"R%d \", (unsigned int)(i + 1));\nputchar(10);\nfor ( i = 0; i < m; ++i )\n{\nfor ( j = 0; j < n; ++j )\nprintf(\"%d \", *(unsigned int *)(*(_QWORD *)(*(_QWORD *)(s + 32) + 8LL * i) + 4LL * j));\nputchar(10);\n}\nputs(\"Availability vector:\");\nfor ( i = 0; i < n; ++i )\nprintf(\"R%d \", (unsigned int)(i + 1));\nputchar(10);\nfor ( j = 0; j < n; ++j )\nprintf(\"%d \", *(unsigned int *)(*(_QWORD *)(s + 8) + 4LL * j));\nputchar(10);\nv15 = n - 1LL;\nv9[2] = n;\nv9[3] = 0LL;\nv9[0] = n;\nv9[1] = 0LL;\nv8 = alloca(16 * ((4LL * n + 15) / 0x10uLL));\nv14 = 4 * (((unsigned __int64)v9 + 3) >> 2);\nfor ( i = 0; i < n; ++i )\n*(_DWORD *)(v14 + 4LL * i) = 0;\nfor ( i = 0; i < m; ++i )\nresource_request(i, v14);\ngettimeofday(&tv, 0LL);\nsrand(tv.tv_usec);\nv13 = (pthread_t *)malloc(8LL * m);\nfor ( i = 0; i < m; ++i )\npthread_create(&v13[i], 0LL, (void *(*)(void *))process_thread, (void *)i);\npthread_exit(0LL);\n}\n",
"canonical_decompiled_code": "int __cdecl __noreturn main(int argc, const char **argv, const char **envp)\n{\nvoid *v3; // rsp\nvoid *v4; // rsp\nvoid *v5; // rsp\nvoid *v6; // rsp\nvoid *v7; // rsp\nvoid *v8; // rsp\n__int64 v9[21]; // [rsp+0h] [rbp-1B0h] BYREF\nint v10; // [rsp+ACh] [rbp-104h]\nstruct timeval tv; // [rsp+B0h] [rbp-100h] BYREF\n__int64 v12[5]; // [rsp+F0h] [rbp-C0h] BYREF\npthread_t *v13; // [rsp+118h] [rbp-98h]\n__int64 v14; // [rsp+120h] [rbp-90h]\n__int64 v15; // [rsp+128h] [rbp-88h]\nunsigned __int64 v16; // [rsp+130h] [rbp-80h]\n__int64 v17; // [rsp+138h] [rbp-78h]\nunsigned __int64 v18; // [rsp+140h] [rbp-70h]\n__int64 v19; // [rsp+148h] [rbp-68h]\nunsigned __int64 v20; // [rsp+150h] [rbp-60h]\n__int64 v21; // [rsp+158h] [rbp-58h]\nunsigned __int64 v22; // [rsp+160h] [rbp-50h]\n__int64 v23; // [rsp+168h] [rbp-48h]\nunsigned __int64 v24; // [rsp+170h] [rbp-40h]\n__int64 v25; // [rsp+178h] [rbp-38h]\nint i; // [rsp+184h] [rbp-2Ch]\nint j; // [rsp+188h] [rbp-28h]\nint v28; // [rsp+18Ch] [rbp-24h]\n\nv10 = argc;\nv9[20] = (__int64)argv;\npthread_mutex_init(&mutex, 0LL);\nprintf(\"Number of processes: \");\n__isoc99_scanf();\nprintf(\"Number of resources: \");\n__isoc99_scanf();\nv25 = n - 1LL;\nv3 = alloca(16 * ((4LL * n + 15) / 0x10uLL));\nv24 = 4 * (((unsigned __int64)v9 + 3) >> 2);\nv23 = v25;\nv9[18] = n;\nv9[19] = 0LL;\nv9[16] = n;\nv9[17] = 0LL;\nv4 = alloca(16 * ((4LL * n + 15) / 0x10uLL));\nv22 = v24;\nv21 = m - 1LL;\nv9[14] = m;\nv9[15] = 0LL;\nv9[12] = m;\nv9[13] = 0LL;\nv5 = alloca(16 * ((8LL * m + 15) / 0x10uLL));\nv20 = 8 * (((unsigned __int64)v9 + 7) >> 3);\nv19 = v21;\nv9[10] = m;\nv9[11] = 0LL;\nv9[8] = m;\nv9[9] = 0LL;\nv6 = alloca(16 * ((8LL * m + 15) / 0x10uLL));\nv18 = v20;\nv17 = v21;\nv9[6] = m;\nv9[7] = 0LL;\nv9[4] = m;\nv9[5] = 0LL;\nv7 = alloca(16 * ((8LL * m + 15) / 0x10uLL));\nv16 = v20;\nfor ( i = 0; i < m; ++i )\n{\n*(_QWORD *)(v20 + 8LL * i) = malloc(4LL * n);\n*(_QWORD *)(v18 + 8LL * i) = malloc(4LL * n);\n*(_QWORD *)(v16 + 8LL * i) = malloc(4LL * n);\n}\nv12[0] = v24;\nv12[1] = v22;\nv12[2] = v20;\nv12[3] = v18;\nv12[4] = v16;\ns = (__int64)v12;\nprintf(\"Resource vector: \");\nfor ( i = 0; i < n; ++i )\n__isoc99_scanf();\nprintf(\"Enter max matrix: \");\nfor ( i = 0; i < m; ++i )\n{\nfor ( j = 0; j < n; ++j )\n__isoc99_scanf();\n}\nprintf(\"Enter allocation matrix: \");\nfor ( i = 0; i < m; ++i )\n{\nfor ( j = 0; j < n; ++j )\n__isoc99_scanf();\n}\nputchar(10);\nfor ( i = 0; i < m; ++i )\n{\nfor ( j = 0; j < n; ++j )\n*(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 32) + 8LL * i) + 4LL * j) = *(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 16)\n+ 8LL * i)\n+ 4LL * j)\n- *(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 24)\n+ 8LL * i)\n+ 4LL * j);\n}\nfor ( j = 0; j < n; ++j )\n{\nv28 = 0;\nfor ( i = 0; i < m; ++i )\nv28 += *(_DWORD *)(*(_QWORD *)(*(_QWORD *)(s + 24) + 8LL * i) + 4LL * j);\n*(_DWORD *)(*(_QWORD *)(s + 8) + 4LL * j) = *(_DWORD *)(*(_QWORD *)s + 4LL * j) - v28;\n}\nputs(\"Need matrix:\");\nfor ( i = 0; i < n; ++i )\nprintf(\"R%d \", (unsigned int)(i + 1));\nputchar(10);\nfor ( i = 0; i < m; ++i )\n{\nfor ( j = 0; j < n; ++j )\nprintf(\"%d \", *(unsigned int *)(*(_QWORD *)(*(_QWORD *)(s + 32) + 8LL * i) + 4LL * j));\nputchar(10);\n}\nputs(\"Availability vector:\");\nfor ( i = 0; i < n; ++i )\nprintf(\"R%d \", (unsigned int)(i + 1));\nputchar(10);\nfor ( j = 0; j < n; ++j )\nprintf(\"%d \", *(unsigned int *)(*(_QWORD *)(s + 8) + 4LL * j));\nputchar(10);\nv15 = n - 1LL;\nv9[2] = n;\nv9[3] = 0LL;\nv9[0] = n;\nv9[1] = 0LL;\nv8 = alloca(16 * ((4LL * n + 15) / 0x10uLL));\nv14 = 4 * (((unsigned __int64)v9 + 3) >> 2);\nfor ( i = 0; i < n; ++i )\n*(_DWORD *)(v14 + 4LL * i) = 0;\nfor ( i = 0; i < m; ++i )\nfunc10(i, v14);\ngettimeofday(&tv, 0LL);\nsrand(tv.tv_usec);\nv13 = (pthread_t *)malloc(8LL * m);\nfor ( i = 0; i < m; ++i )\npthread_create(&v13[i], 0LL, (void *(*)(void *))process_thread, (void *)i);\npthread_exit(0LL);\n}",
"original_code": "int main(int argc, char* argv[])\n{\n pthread_mutex_init(&mutex, ((void *)0));\n int i, j;\n printf(\"Number of processes: \");\n scanf(\"%d\", &m);\n printf(\"Number of resources: \");\n scanf(\"%d\", &n);\n int res[n];\n int avail[n];\n int **max[m];\n int **alloc[m];\n int **need[m];\n for(i=0; i<m;i++){\n max[i] = malloc(sizeof(int)*n);\n alloc[i] = malloc(sizeof(int)*n);\n need[i] = malloc(sizeof(int)*n);\n }\n State p = (State)\n {\n .resource = (int*) res,\n .available = (int*) avail,\n .max = (int**) max,\n .allocation = (int**) alloc,\n .need = (int**) need\n };\n s = &p;\n printf(\"Resource vector: \");\n for(i = 0; i < n; i++)\n scanf(\"%d\", &s->resource[i]);\n printf(\"Enter max matrix: \");\n for(i = 0;i < m; i++)\n for(j = 0;j < n; j++){\n scanf(\"%d\", &s->max[i][j]);\n }\n printf(\"Enter allocation matrix: \");\n for(i = 0; i < m; i++)\n for(j = 0; j < n; j++) {\n scanf(\"%d\", &s->allocation[i][j]);\n }\n printf(\"\\n\");\n for(i = 0; i < m; i++)\n for(j = 0; j < n; j++)\n s->need[i][j] = s->max[i][j] - s->allocation[i][j];\n for(j = 0; j < n; j++) {\n int sum = 0;\n for(i = 0; i < m; i++)\n sum += s->allocation[i][j];\n s->available[j] = s->resource[j] - sum;\n }\n printf(\"Need matrix:\\n\");\n for(i = 0; i < n; i++)\n printf(\"R%d \", i+1);\n printf(\"\\n\");\n for(i = 0; i < m; i++) {\n for(j = 0; j < n; j++)\n printf(\"%d \",s->need[i][j]);\n printf(\"\\n\");\n }\n printf(\"Availability vector:\\n\");\n for(i = 0; i < n; i++)\n printf(\"R%d \", i+1);\n printf(\"\\n\");\n for(j = 0; j < n; j++)\n printf(\"%d \",s->available[j]);\n printf(\"\\n\");\n int req[n];\n for(i=0; i<n; i++)\n req[i]=0;\n for(i=0; i<m; i++)\n if (!resource_request(i, req))\n exit -1;\n struct timeval tv;\n gettimeofday(&tv, ((void *)0));\n srand(tv.tv_usec);\n pthread_t *tid = malloc(m*sizeof(pthread_t));\n for (i = 0; i < m; i++)\n pthread_create(&tid[i], ((void *)0), process_thread, (void *) (long) i);\n pthread_exit(0);\n free(tid);\n}",
"canonical_original_code": "int main(int argc, char *argv[])\n{\n pthread_mutex_init(&mutex, ((void *)0));\n int i; int j;\n printf(\"Number of processes: \");\n scanf(\"%d\", &m);\n printf(\"Number of resources: \");\n scanf(\"%d\", &n);\n int res[-1];\n int avail[-1];\n int **max[-1];\n int **alloc[-1];\n int **need[-1];\n for(i=0; i<m;i++){\n max[i] = malloc(sizeof(int)*n);\n alloc[i] = malloc(sizeof(int)*n);\n need[i] = malloc(sizeof(int)*n);\n }\n struct state p = (State)\n {\n .resource = (int*) res,\n .available = (int*) avail,\n .max = (int**) max,\n .allocation = (int**) alloc,\n .need = (int**) need\n };\n s = &p;\n printf(\"Resource vector: \");\n for(i = 0; i < n; i++)\n scanf(\"%d\", &s->resource[i]);\n printf(\"Enter max matrix: \");\n for(i = 0;i < m; i++)\n for(j = 0;j < n; j++){\n scanf(\"%d\", &s->max[i][j]);\n }\n printf(\"Enter allocation matrix: \");\n for(i = 0; i < m; i++)\n for(j = 0; j < n; j++) {\n scanf(\"%d\", &s->allocation[i][j]);\n }\n printf(\"\\n\");\n for(i = 0; i < m; i++)\n for(j = 0; j < n; j++)\n s->need[i][j] = s->max[i][j] - s->allocation[i][j];\n for(j = 0; j < n; j++) {\n int sum = 0;\n for(i = 0; i < m; i++)\n sum += s->allocation[i][j];\n s->available[j] = s->resource[j] - sum;\n }\n printf(\"Need matrix:\\n\");\n for(i = 0; i < n; i++)\n printf(\"R%d \", i+1);\n printf(\"\\n\");\n for(i = 0; i < m; i++) {\n for(j = 0; j < n; j++)\n printf(\"%d \",s->need[i][j]);\n printf(\"\\n\");\n }\n printf(\"Availability vector:\\n\");\n for(i = 0; i < n; i++)\n printf(\"R%d \", i+1);\n printf(\"\\n\");\n for(j = 0; j < n; j++)\n printf(\"%d \",s->available[j]);\n printf(\"\\n\");\n int req[-1];\n for(i=0; i<n; i++)\n req[i]=0;\n for(i=0; i<m; i++)\n if (!resource_request(i, req))\n exit -1;\n struct timeval tv;\n gettimeofday(&tv, ((void *)0));\n srand(tv.tv_usec);\n unsigned long *tid = malloc(m*sizeof(pthread_t));\n for (i = 0; i < m; i++)\n pthread_create(&tid[i], ((void *)0), process_thread, (void *) (long) i);\n pthread_exit(0);\n free(tid);\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char *[]"
],
[
"i",
"int"
],
[
"j",
"int"
],
[
"res",
"int [-1]"
],
[
"avail",
"int [-1]"
],
[
"max",
"int **[-1]"
],
[
"alloc",
"int **[-1]"
],
[
"need",
"int **[-1]"
],
[
"p",
"struct state { int *resource; int *available; int **max; int **allocation; int **need; }"
],
[
"sum",
"int"
],
[
"req",
"int [-1]"
],
[
"tv",
"struct timeval { long tv_sec; long tv_usec; }"
],
[
"tid",
"unsigned long *"
]
],
"return_type": "int",
"user_defined_types": [
"struct state { int *resource; int *available; int **max; int **allocation; int **need; }",
"struct timeval { long tv_sec; long tv_usec; }"
],
"binary_hash": "f4e0869ba1115b0f55a8048a68f7223efabf8068a766171674a8cd9017b7eb50"
}
] |
25b9682480f8bb352ea97cfc9af66fd542716f1a743eb87f7045212eb01442f5 | rbu/driftnet | [
[
"delete_event",
"->"
],
[
"make_backing_image",
"->",
"expose_event",
"configure_event"
],
[
"update_window",
"->",
"expose_event",
"configure_event",
"pipe_event"
],
[
"scroll_backing_image",
"->",
"pipe_event"
],
[
"add_image_rectangle",
"->",
"pipe_event"
],
[
"find_image_rectangle",
"->",
"button_release_event"
],
[
"expose_event",
"->",
"make_backing_image",
"update_window"
],
[
"configure_event",
"->",
"make_backing_image",
"update_window"
],
[
"save_image",
"->",
"button_release_event"
],
[
"button_press_event",
"->"
],
[
"button_release_event",
"->",
"find_image_rectangle",
"save_image"
],
[
"destroy",
"->"
],
[
"xread",
"->",
"pipe_event"
],
[
"pipe_event",
"->",
"xread",
"scroll_backing_image",
"add_image_rectangle",
"update_window"
],
[
"dodisplay",
"->"
]
] | [
[
"delete_event",
"__int64 func0()\n{\nif ( verbose )\nfwrite(\"driftnet: display child shutting down\\n\", 1uLL, 0x26uLL, stderr);\nreturn 0LL;\n}"
],
[
"make_backing_image",
"__int64 func1()\n{\n__int64 result; // rax\n__int64 v1; // [rsp+8h] [rbp-18h]\n_QWORD *s; // [rsp+10h] [rbp-10h]\nint v3; // [rsp+18h] [rbp-8h]\nint v4; // [rsp+1Ch] [rbp-4h]\n\nv1 = img_new_blank((unsigned int)width, (unsigned int)height);\nimg_alloc(v1);\nif ( backing_image )\n{\nv4 = *(_DWORD *)(backing_image + 8);\nif ( v4 > width )\nv4 = width;\nv3 = *(_DWORD *)(backing_image + 12);\nif ( v3 > height )\nv3 = height;\nimg_simple_blt(\nv1,\n0LL,\n(unsigned int)(height - v3),\nbacking_image,\n0LL,\n(unsigned int)(*(_DWORD *)(backing_image + 12) - v3),\n(unsigned int)v4,\n(unsigned int)v3);\nfor ( s = (_QWORD *)imgrects; (unsigned __int64)s < imgrects + 24LL * nimgrects; s += 3 )\n{\nif ( *s )\n{\n*((_DWORD *)s + 3) += height - *(_DWORD *)(backing_image + 12);\nif ( *((_DWORD *)s + 2) > width || *((_DWORD *)s + 3) + *((_DWORD *)s + 5) < 0 )\n{\nunlink((const char *)*s);\nxfree(*s);\nmemset(s, 0, 0x18uLL);\n}\n}\n}\nif ( v4 <= wrx )\nwrx = v4;\nimg_delete(backing_image);\n}\nbacking_image = v1;\nwrx = 6;\nresult = (unsigned int)(height - 6);\nwry = height - 6;\nrowheight = 12;\nreturn result;\n}"
],
[
"update_window",
"__int64 func2()\n{\n__int64 result; // rax\n__int64 v1; // [rsp+8h] [rbp-8h]\n\nresult = backing_image;\nif ( backing_image )\n{\nv1 = gdk_gc_new(drawable);\ngdk_draw_rgb_32_image(\ndrawable,\nv1,\n0LL,\n0LL,\n(unsigned int)width,\n(unsigned int)height,\n1LL,\n*(_QWORD *)(backing_image + 24),\n(unsigned int)(4 * width));\nresult = g_object_unref(v1);\n}\nreturn result;\n}"
],
[
"expose_event",
"__int64 func6()\n{\n__int64 v0; // rax\n__int64 v1; // rax\n\nif ( darea )\ndrawable = *(_QWORD *)(darea + 80);\nv0 = gdk_drawable_get_type();\nv1 = g_type_check_instance_cast(drawable, v0);\ngdk_drawable_get_size(v1, &width, &height);\nif ( !backing_image || *(_DWORD *)(backing_image + 8) != width || *(_DWORD *)(backing_image + 12) != height )\nfunc1();\nreturn func2();\n}"
],
[
"configure_event",
"__int64 func7()\n{\n__int64 v0; // rax\n__int64 v1; // rdi\n\nif ( darea )\ndrawable = *(_QWORD *)(darea + 80);\nv0 = gdk_drawable_get_type();\nv1 = g_type_check_instance_cast(drawable, v0);\ngdk_drawable_get_size(v1, &width, &height);\nif ( !backing_image || *(_DWORD *)(backing_image + 8) != width || *(_DWORD *)(backing_image + 12) != height )\nfunc1();\nreturn func2();\n}"
],
[
"button_press_event",
"__int64 __fastcall func9(__int64 a1, __int64 a2)\n{\ndouble v2; // xmm0_8\n__int64 result; // rax\n\nclick = (int)*(double *)(a2 + 24);\nv2 = *(double *)(a2 + 32);\nresult = (unsigned int)(int)v2;\ndword_1394 = (int)v2;\nreturn result;\n}"
],
[
"button_release_event",
"const char **__fastcall func10(__int64 a1, __int64 a2)\n{\nconst char **result; // rax\nstruct timespec requested_time; // [rsp+10h] [rbp-20h] BYREF\nconst char **v4; // [rsp+28h] [rbp-8h]\n\nresult = (const char **)func5(click, dword_1394);\nv4 = result;\nif ( result )\n{\nresult = (const char **)func5((int)*(double *)(a2 + 24), (int)*(double *)(a2 + 32));\nif ( v4 == result )\n{\nrequested_time.tv_sec = 0LL;\nrequested_time.tv_nsec = 100000000LL;\ngdk_draw_rectangle(\ndrawable,\n*(_QWORD *)(*(_QWORD *)(darea + 48) + 872LL),\n0LL,\n(unsigned int)(*((_DWORD *)v4 + 2) - 2),\n(unsigned int)(*((_DWORD *)v4 + 3) - 2),\n(unsigned int)(*((_DWORD *)v4 + 4) + 3),\n(unsigned int)(*((_DWORD *)v4 + 5) + 3));\ngdk_flush();\nfunc8(v4);\nnanosleep(&requested_time, 0LL);\nresult = (const char **)gdk_draw_rectangle(\ndrawable,\n*(_QWORD *)(*(_QWORD *)(darea + 48) + 864LL),\n0LL,\n(unsigned int)(*((_DWORD *)v4 + 2) - 2),\n(unsigned int)(*((_DWORD *)v4 + 3) - 2),\n(unsigned int)(*((_DWORD *)v4 + 4) + 3),\n(unsigned int)(*((_DWORD *)v4 + 5) + 3));\n}\n}\nreturn result;\n}"
],
[
"destroy",
"__int64 __fastcall func11(__int64 a1, __int64 a2)\n{\nreturn gtk_main_quit(a1, a2);\n}"
],
[
"pipe_event",
"__int64 __fastcall func13(size_t a1, char *a2)\n{\nchar *v2; // rdi\nstruct stat v4; // [rsp+10h] [rbp-F0h] BYREF\nchar name[64]; // [rsp+A0h] [rbp-60h] BYREF\nunsigned int *v6; // [rsp+E0h] [rbp-20h]\nunsigned int v7; // [rsp+E8h] [rbp-18h]\nint v8; // [rsp+ECh] [rbp-14h]\nint v9; // [rsp+F0h] [rbp-10h]\nint v10; // [rsp+F4h] [rbp-Ch]\n__int64 v11; // [rsp+F8h] [rbp-8h]\n\nv10 = 0;\nif ( !path_0 )\n{\na1 = strlen(tmpdir) + 64;\npath_0 = (char *)xmalloc(a1);\n}\nwhile ( v10 <= 3 )\n{\na2 = name;\na1 = (unsigned int)dpychld_fd;\nv11 = func12(dpychld_fd, name, 64LL);\nif ( v11 != 64 )\nbreak;\nv9 = 0;\n++v10;\nsprintf(path_0, \"%s/%s\", tmpdir, name);\na2 = (char *)&v4;\na1 = (size_t)path_0;\nif ( stat(path_0, &v4) != -1 )\n{\nif ( verbose )\n{\na2 = \"driftnet: received image %s of size %d\\n\";\na1 = (size_t)stderr;\nfprintf(stderr, \"driftnet: received image %s of size %d\\n\", name, LODWORD(v4.st_size));\n}\nif ( v4.st_size > 100 )\n{\nv6 = (unsigned int *)img_new(a1);\na2 = path_0;\nif ( !(unsigned int)img_load_file(v6, path_0, 1LL, 0LL) )\ngoto LABEL_8;\nif ( v6[2] <= 8 || v6[3] <= 8 )\n{\nif ( verbose )\n{\na2 = \"driftnet: %s: image dimensions (%d x %d) too small to bother with\\n\";\nfprintf(stderr, \"driftnet: %s: image dimensions (%d x %d) too small to bother with\\n\", name, v6[2], v6[3]);\n}\n}\nelse if ( (unsigned int)img_load(v6, 2LL, *v6) )\n{\nif ( v6[2] <= width - 12 )\nv8 = v6[2];\nelse\nv8 = width - 12;\nif ( v6[3] <= height - 12 )\nv7 = v6[3];\nelse\nv7 = height - 12;\nif ( v8 > width - wrx )\n{\nfunc3(v7 + 6);\nwrx = 6;\nrowheight = v7 + 6;\n}\nif ( (int)(v7 + 5) >= rowheight )\n{\nfunc3(v7 + 6 - rowheight);\nrowheight = v7 + 6;\n}\nimg_simple_blt(backing_image, (unsigned int)wrx, wry - v7, v6, 0LL, 0LL, (unsigned int)v8, v7);\na2 = (char *)(unsigned int)wrx;\nv2 = path_0;\nfunc4(path_0, wrx, wry - v7, v8, v7);\nv9 = 1;\nif ( (_DWORD)beep )\n{\na2 = \"\\a\";\nv2 = (_BYTE *)&loc_1;\nwrite(1, \"\\a\", 1uLL);\n}\nfunc2(v2);\nwrx += v8 + 6;\n}\nelse\n{\nLABEL_8:\na2 = \"driftnet: %s: bogus image (err = %d)\\n\";\nfprintf(stderr, \"driftnet: %s: bogus image (err = %d)\\n\", name, v6[12]);\n}\na1 = (size_t)v6;\nimg_delete(v6);\ngoto LABEL_31;\n}\nif ( verbose )\n{\na2 = \"driftnet: image data too small (%d bytes) to bother with\\n\";\na1 = (size_t)stderr;\nfprintf(stderr, \"driftnet: image data too small (%d bytes) to bother with\\n\", LODWORD(v4.st_size));\n}\nLABEL_31:\nif ( !v9 )\n{\na1 = (size_t)name;\nunlink(name);\n}\n}\n}\nif ( v11 != -1 || *_errno_location() == 4 || *_errno_location() == 11 )\n{\nif ( !v11 )\ngtk_main_quit(a1, a2);\n}\nelse\n{\nperror(\"driftnet: read\");\ngtk_main_quit(\"driftnet: read\", a2);\n}\nreturn 1LL;\n}"
],
[
"dodisplay",
"__int64 __fastcall func14(int a1, __int64 a2)\n{\n__int64 v2; // rax\n__int64 v3; // rbx\n__int64 v4; // rax\n__int64 v5; // rax\n__int64 v6; // rax\n__int64 v7; // rax\n__int64 v8; // rax\n__int64 v9; // rax\n__int64 v10; // rax\n__int64 v11; // rax\n__int64 v13; // [rsp+0h] [rbp-30h] BYREF\nint v14; // [rsp+Ch] [rbp-24h] BYREF\n__int64 v15; // [rsp+10h] [rbp-20h]\nconst char **i; // [rsp+18h] [rbp-18h]\n\nv14 = a1;\nv13 = a2;\nv15 = g_io_channel_unix_new((unsigned int)dpychld_fd);\ng_io_add_watch(v15, 25LL, pipe_event, 0LL);\nfcntl(dpychld_fd, 4, 2048LL);\nnimgrects = 16;\nimgrects = xcalloc(16LL, 24LL);\ngtk_init(&v14, &v13);\nv2 = gdk_rgb_get_colormap();\ngtk_widget_push_colormap(v2);\nwindow = gtk_window_new(0LL);\ngtk_widget_set_size_request(window, 100LL, 100LL);\ndarea = gtk_drawing_area_new();\nv3 = darea;\nv4 = gtk_container_get_type();\nv5 = g_type_check_instance_cast(window, v4);\ngtk_container_add(v5, v3);\ngtk_widget_set_events(darea, 770LL);\nv6 = g_type_check_instance_cast(window, 80LL);\ng_signal_connect_data(v6, \"delete_event\", delete_event, 0LL, 0LL, 0LL);\nv7 = g_type_check_instance_cast(window, 80LL);\ng_signal_connect_data(v7, \"destroy\", destroy, 0LL, 0LL, 0LL);\nv8 = g_type_check_instance_cast(darea, 80LL);\ng_signal_connect_data(v8, \"expose-event\", expose_event, 0LL, 0LL, 0LL);\nv9 = g_type_check_instance_cast(darea, 80LL);\ng_signal_connect_data(v9, \"configure_event\", expose_event, 0LL, 0LL, 0LL);\nv10 = g_type_check_instance_cast(darea, 80LL);\ng_signal_connect_data(v10, \"button_press_event\", button_press_event, 0LL, 0LL, 0LL);\nv11 = g_type_check_instance_cast(darea, 80LL);\ng_signal_connect_data(v11, \"button_release_event\", button_release_event, 0LL, 0LL, 0LL);\ngtk_widget_show_all(window);\ngtk_main();\nfor ( i = (const char **)imgrects; (unsigned __int64)i < imgrects + 24LL * nimgrects; i += 3 )\n{\nif ( *i )\nunlink(*i);\n}\nimg_delete(backing_image);\ngtk_exit(0LL);\nreturn 0LL;\n}"
]
] | [
{
"name": "scroll_backing_image",
"canonical_name": "func3",
"repo": "rbu/driftnet",
"decompiled_code": "unsigned __int64 __fastcall scroll_backing_image(int a1)\n{\nunsigned __int64 result; // rax\n_QWORD *s; // [rsp+18h] [rbp-18h]\nconst void **i; // [rsp+20h] [rbp-10h]\nvoid **j; // [rsp+20h] [rbp-10h]\nvoid **v5; // [rsp+28h] [rbp-8h]\n\nv5 = *(void ***)(backing_image + 16);\nfor ( i = (const void **)&v5[a1]; (unsigned __int64)i < *(_QWORD *)(backing_image + 16) + 8LL * height; ++i )\nmemcpy(*v5++, *i, 4LL * width);\nfor ( j = v5; (unsigned __int64)j < *(_QWORD *)(backing_image + 16) + 8LL * height; ++j )\nmemset(*j, 0, 4LL * width);\nfor ( s = (_QWORD *)imgrects; ; s += 3 )\n{\nresult = imgrects + 24LL * nimgrects;\nif ( (unsigned __int64)s >= result )\nbreak;\nif ( *s )\n{\n*((_DWORD *)s + 3) -= a1;\nif ( *((_DWORD *)s + 3) + *((_DWORD *)s + 5) < 0 )\n{\nunlink((const char *)*s);\nxfree(*s);\nmemset(s, 0, 0x18uLL);\n}\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func3(int a1)\n{\nunsigned __int64 result; // rax\n_QWORD *s; // [rsp+18h] [rbp-18h]\nconst void **i; // [rsp+20h] [rbp-10h]\nvoid **j; // [rsp+20h] [rbp-10h]\nvoid **v5; // [rsp+28h] [rbp-8h]\n\nv5 = *(void ***)(backing_image + 16);\nfor ( i = (const void **)&v5[a1]; (unsigned __int64)i < *(_QWORD *)(backing_image + 16) + 8LL * height; ++i )\nmemcpy(*v5++, *i, 4LL * width);\nfor ( j = v5; (unsigned __int64)j < *(_QWORD *)(backing_image + 16) + 8LL * height; ++j )\nmemset(*j, 0, 4LL * width);\nfor ( s = (_QWORD *)imgrects; ; s += 3 )\n{\nresult = imgrects + 24LL * nimgrects;\nif ( (unsigned __int64)s >= result )\nbreak;\nif ( *s )\n{\n*((_DWORD *)s + 3) -= a1;\nif ( *((_DWORD *)s + 3) + *((_DWORD *)s + 5) < 0 )\n{\nunlink((const char *)*s);\nxfree(*s);\nmemset(s, 0, 0x18uLL);\n}\n}\n}\nreturn result;\n}",
"original_code": "void scroll_backing_image(const int dy) {\n pel **row1, **row2;\n struct imgrect *ir;\n for (row1 = backing_image->data, row2 = backing_image->data + dy;\n row2 < backing_image->data + height; ++row1, ++row2)\n memcpy(*row1, *row2, width * sizeof(pel));\n for (row2 = row1; row2 < backing_image->data + height; ++row2)\n memset(*row2, 0, width * sizeof(pel));\n for (ir = imgrects; ir < imgrects + nimgrects; ++ir) {\n if (ir->filename) {\n ir->y -= dy;\n if ((ir->y + ir->h) < 0) {\n unlink(ir->filename);\n xfree(ir->filename);\n memset(ir, 0, sizeof *ir);\n }\n }\n }\n}",
"canonical_original_code": "void scroll_backing_image(int dy) {\n unsigned int **row1; unsigned int **row2;\n struct imgrect *ir;\n for (row1 = backing_image->data, row2 = backing_image->data + dy;\n row2 < backing_image->data + height; ++row1, ++row2)\n memcpy(*row1, *row2, width * sizeof(pel));\n for (row2 = row1; row2 < backing_image->data + height; ++row2)\n memset(*row2, 0, width * sizeof(pel));\n for (ir = imgrects; ir < imgrects + nimgrects; ++ir) {\n if (ir->filename) {\n ir->y -= dy;\n if ((ir->y + ir->h) < 0) {\n unlink(ir->filename);\n xfree(ir->filename);\n memset(ir, 0, sizeof *ir);\n }\n }\n }\n}",
"variable_types": [
[
"dy",
"int"
],
[
"row1",
"unsigned int **"
],
[
"row2",
"unsigned int **"
],
[
"ir",
"struct imgrect { char *filename; int x; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct imgrect { char *filename; int x; }"
],
"binary_hash": "25b9682480f8bb352ea97cfc9af66fd542716f1a743eb87f7045212eb01442f5"
},
{
"name": "add_image_rectangle",
"canonical_name": "func4",
"repo": "rbu/driftnet",
"decompiled_code": "unsigned __int64 __fastcall add_image_rectangle(const char *a1, int a2, int a3, int a4, int a5)\n{\nunsigned __int64 result; // rax\nunsigned __int64 i; // [rsp+28h] [rbp-8h]\n\nfor ( i = imgrects; i < imgrects + 24LL * nimgrects && *(_QWORD *)i; i += 24LL )\n;\nif ( i == imgrects + 24LL * nimgrects )\n{\nimgrects = xrealloc(imgrects, 48LL * nimgrects);\nmemset((void *)(imgrects + 24LL * nimgrects), 0, 24LL * nimgrects);\ni = imgrects + 24LL * nimgrects;\nnimgrects *= 2;\n}\n*(_QWORD *)i = strdup(a1);\n*(_DWORD *)(i + 8) = a2;\n*(_DWORD *)(i + 12) = a3;\n*(_DWORD *)(i + 16) = a4;\nresult = i;\n*(_DWORD *)(i + 20) = a5;\nreturn result;\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func4(const char *a1, int a2, int a3, int a4, int a5)\n{\nunsigned __int64 result; // rax\nunsigned __int64 i; // [rsp+28h] [rbp-8h]\n\nfor ( i = imgrects; i < imgrects + 24LL * nimgrects && *(_QWORD *)i; i += 24LL )\n;\nif ( i == imgrects + 24LL * nimgrects )\n{\nimgrects = xrealloc(imgrects, 48LL * nimgrects);\nmemset((void *)(imgrects + 24LL * nimgrects), 0, 24LL * nimgrects);\ni = imgrects + 24LL * nimgrects;\nnimgrects *= 2;\n}\n*(_QWORD *)i = strdup(a1);\n*(_DWORD *)(i + 8) = a2;\n*(_DWORD *)(i + 12) = a3;\n*(_DWORD *)(i + 16) = a4;\nresult = i;\n*(_DWORD *)(i + 20) = a5;\nreturn result;\n}",
"original_code": "void add_image_rectangle(const char *filename, const int x, const int y, const int w, const int h) {\n struct imgrect *ir;\n for (ir = imgrects; ir < imgrects + nimgrects; ++ir) {\n if (!ir->filename)\n break;\n }\n if (ir == imgrects + nimgrects) {\n imgrects = xrealloc(imgrects, 2 * nimgrects * sizeof *imgrects);\n memset(imgrects + nimgrects, 0, nimgrects * sizeof *imgrects);\n ir = imgrects + nimgrects;\n nimgrects *= 2;\n }\n ir->filename = strdup(filename);\n ir->x = x;\n ir->y = y;\n ir->w = w;\n ir->h = h;\n}",
"canonical_original_code": "void add_image_rectangle(char *filename, int x, int y, int w, int h) {\n struct imgrect *ir;\n for (ir = imgrects; ir < imgrects + nimgrects; ++ir) {\n if (!ir->filename)\n break;\n }\n if (ir == imgrects + nimgrects) {\n imgrects = xrealloc(imgrects, 2 * nimgrects * sizeof *imgrects);\n memset(imgrects + nimgrects, 0, nimgrects * sizeof *imgrects);\n ir = imgrects + nimgrects;\n nimgrects *= 2;\n }\n ir->filename = strdup(filename);\n ir->x = x;\n ir->y = y;\n ir->w = w;\n ir->h = h;\n}",
"variable_types": [
[
"filename",
"char *"
],
[
"x",
"int"
],
[
"y",
"int"
],
[
"w",
"int"
],
[
"h",
"int"
],
[
"ir",
"struct imgrect { char *filename; int x; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct imgrect { char *filename; int x; }"
],
"binary_hash": "25b9682480f8bb352ea97cfc9af66fd542716f1a743eb87f7045212eb01442f5"
},
{
"name": "find_image_rectangle",
"canonical_name": "func5",
"repo": "rbu/driftnet",
"decompiled_code": "unsigned __int64 __fastcall find_image_rectangle(int a1, int a2)\n{\nunsigned __int64 i; // [rsp+10h] [rbp-8h]\n\nfor ( i = imgrects; i < imgrects + 24LL * nimgrects; i += 24LL )\n{\nif ( *(_QWORD *)i\n&& a1 >= *(_DWORD *)(i + 8)\n&& a1 < *(_DWORD *)(i + 8) + *(_DWORD *)(i + 16)\n&& a2 >= *(_DWORD *)(i + 12)\n&& a2 < *(_DWORD *)(i + 12) + *(_DWORD *)(i + 20) )\n{\nreturn i;\n}\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func5(int a1, int a2)\n{\nunsigned __int64 i; // [rsp+10h] [rbp-8h]\n\nfor ( i = imgrects; i < imgrects + 24LL * nimgrects; i += 24LL )\n{\nif ( *(_QWORD *)i\n&& a1 >= *(_DWORD *)(i + 8)\n&& a1 < *(_DWORD *)(i + 8) + *(_DWORD *)(i + 16)\n&& a2 >= *(_DWORD *)(i + 12)\n&& a2 < *(_DWORD *)(i + 12) + *(_DWORD *)(i + 20) )\n{\nreturn i;\n}\n}\nreturn 0LL;\n}",
"original_code": "struct imgrect *find_image_rectangle(const int x, const int y) {\n struct imgrect *ir;\n for (ir = imgrects; ir < imgrects + nimgrects; ++ir)\n if (ir->filename && x >= ir->x && x < ir->x + ir->w && y >= ir->y && y < ir->y + ir->h)\n return ir;\n return ((void *)0);\n}",
"canonical_original_code": "struct imgrect *find_image_rectangle(int x, int y) {\n struct imgrect *ir;\n for (ir = imgrects; ir < imgrects + nimgrects; ++ir)\n if (ir->filename && x >= ir->x && x < ir->x + ir->w && y >= ir->y && y < ir->y + ir->h)\n return ir;\n return ((void *)0);\n}",
"variable_types": [
[
"x",
"int"
],
[
"y",
"int"
],
[
"ir",
"struct imgrect { char *filename; int x; } *"
]
],
"return_type": "struct imgrect { char *filename; int x; } *",
"user_defined_types": [
"struct imgrect { char *filename; int x; }"
],
"binary_hash": "25b9682480f8bb352ea97cfc9af66fd542716f1a743eb87f7045212eb01442f5"
},
{
"name": "save_image",
"canonical_name": "func8",
"repo": "rbu/driftnet",
"decompiled_code": "int __fastcall save_image(const char **a1)\n{\nsize_t v1; // rax\nchar *v2; // rcx\nunsigned int v3; // eax\nint *v4; // rax\nchar *v5; // rax\nint result; // eax\nint *v7; // rax\nchar *v8; // rax\nint *v9; // rax\nchar *v10; // rax\nint *v11; // rax\nchar *v12; // rax\nstruct stat v13; // [rsp+10h] [rbp-20A0h] BYREF\nchar buf[8192]; // [rsp+A0h] [rbp-2010h] BYREF\nsize_t n; // [rsp+20A0h] [rbp-10h]\nint v16; // [rsp+20A8h] [rbp-8h]\nint fd; // [rsp+20ACh] [rbp-4h]\n\nif ( !name_2 )\n{\nv1 = strlen(savedimgpfx);\nname_2 = (char *)xcalloc(v1 + 16, 1LL);\n}\ndo\n{\nv2 = strrchr(*a1, 46);\nv3 = num_1++;\nsprintf(name_2, \"%s%d%s\", savedimgpfx, v3, v2);\n}\nwhile ( !stat(name_2, &v13) );\nfprintf(stderr, \"driftnet: saving `%s' as `%s'\\n\", *a1, name_2);\nfd = open(*a1, 0);\nif ( fd == -1 )\n{\nv4 = _errno_location();\nv5 = strerror(*v4);\nresult = fprintf(stderr, \"driftnet: %s: %s\\n\", *a1, v5);\n}\nelse\n{\nv16 = open(name_2, 577, 438LL);\nif ( v16 == -1 )\n{\nv7 = _errno_location();\nv8 = strerror(*v7);\nfprintf(stderr, \"driftnet: %s: %s\\n\", name_2, v8);\nresult = close(fd);\n}\nelse\n{\nwhile ( 1 )\n{\nn = read(fd, buf, 0x2000uLL);\nif ( (__int64)n <= 0 )\nbreak;\nif ( write(v16, buf, n) == -1 )\n{\nv9 = _errno_location();\nv10 = strerror(*v9);\nfprintf(stderr, \"driftnet: %s: %s\\n\", name_2, v10);\nclose(fd);\nreturn close(v16);\n}\n}\nif ( n == -1LL )\n{\nv11 = _errno_location();\nv12 = strerror(*v11);\nfprintf(stderr, \"driftnet: %s: %s\\n\", *a1, v12);\n}\nclose(fd);\nresult = close(v16);\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func8(const char **a1)\n{\nsize_t v1; // rax\nchar *v2; // rcx\nunsigned int v3; // eax\nint *v4; // rax\nchar *v5; // rax\nint result; // eax\nint *v7; // rax\nchar *v8; // rax\nint *v9; // rax\nchar *v10; // rax\nint *v11; // rax\nchar *v12; // rax\nstruct stat v13; // [rsp+10h] [rbp-20A0h] BYREF\nchar buf[8192]; // [rsp+A0h] [rbp-2010h] BYREF\nsize_t n; // [rsp+20A0h] [rbp-10h]\nint v16; // [rsp+20A8h] [rbp-8h]\nint fd; // [rsp+20ACh] [rbp-4h]\n\nif ( !name_2 )\n{\nv1 = strlen(savedimgpfx);\nname_2 = (char *)xcalloc(v1 + 16, 1LL);\n}\ndo\n{\nv2 = strrchr(*a1, 46);\nv3 = num_1++;\nsprintf(name_2, \"%s%d%s\", savedimgpfx, v3, v2);\n}\nwhile ( !stat(name_2, &v13) );\nfprintf(stderr, \"driftnet: saving `%s' as `%s'\\n\", *a1, name_2);\nfd = open(*a1, 0);\nif ( fd == -1 )\n{\nv4 = _errno_location();\nv5 = strerror(*v4);\nresult = fprintf(stderr, \"driftnet: %s: %s\\n\", *a1, v5);\n}\nelse\n{\nv16 = open(name_2, 577, 438LL);\nif ( v16 == -1 )\n{\nv7 = _errno_location();\nv8 = strerror(*v7);\nfprintf(stderr, \"driftnet: %s: %s\\n\", name_2, v8);\nresult = close(fd);\n}\nelse\n{\nwhile ( 1 )\n{\nn = read(fd, buf, 0x2000uLL);\nif ( (__int64)n <= 0 )\nbreak;\nif ( write(v16, buf, n) == -1 )\n{\nv9 = _errno_location();\nv10 = strerror(*v9);\nfprintf(stderr, \"driftnet: %s: %s\\n\", name_2, v10);\nclose(fd);\nreturn close(v16);\n}\n}\nif ( n == -1LL )\n{\nv11 = _errno_location();\nv12 = strerror(*v11);\nfprintf(stderr, \"driftnet: %s: %s\\n\", *a1, v12);\n}\nclose(fd);\nresult = close(v16);\n}\n}\nreturn result;\n}",
"original_code": "void save_image(struct imgrect *ir) {\n static char *name;\n static int num;\n int fd1, fd2;\n char buf[8192];\n ssize_t l;\n struct stat st;\n if (!name)\n name = xcalloc(strlen(savedimgpfx) + 16, 1);\n do\n sprintf(name, \"%s%d%s\", savedimgpfx, num++, strrchr(ir->filename, '.'));\n while (stat(name, &st) == 0);\n fprintf(stderr, \"driftnet\"\": saving `%s' as `%s'\\n\", ir->filename, name);\n fd1 = open(ir->filename, 00);\n if (fd1 == -1) {\n fprintf(stderr, \"driftnet\"\": %s: %s\\n\", ir->filename, strerror((*__errno_location ())));\n return;\n }\n fd2 = open(name, 01 | 0100 | 01000, 0666);\n if (fd2 == -1) {\n fprintf(stderr, \"driftnet\"\": %s: %s\\n\", name, strerror((*__errno_location ())));\n close(fd1);\n return;\n }\n while ((l = read(fd1, buf, sizeof buf)) > 0) {\n if (write(fd2, buf, l) == -1) {\n fprintf(stderr, \"driftnet\"\": %s: %s\\n\", name, strerror((*__errno_location ())));\n close(fd1);\n close(fd2);\n return;\n }\n }\n if (l == -1)\n fprintf(stderr, \"driftnet\"\": %s: %s\\n\", ir->filename, strerror((*__errno_location ())));\n close(fd1);\n close(fd2);\n}",
"canonical_original_code": "void save_image(struct imgrect *ir) {\n static char *name;\n static int num;\n int fd1; int fd2;\n char buf[8192];\n long l;\n struct stat st;\n if (!name)\n name = xcalloc(strlen(savedimgpfx) + 16, 1);\n do\n sprintf(name, \"%s%d%s\", savedimgpfx, num++, strrchr(ir->filename, '.'));\n while (stat(name, &st) == 0);\n fprintf(stderr, \"driftnet\"\": saving `%s' as `%s'\\n\", ir->filename, name);\n fd1 = open(ir->filename, 00);\n if (fd1 == -1) {\n fprintf(stderr, \"driftnet\"\": %s: %s\\n\", ir->filename, strerror((*__errno_location ())));\n return;\n }\n fd2 = open(name, 01 | 0100 | 01000, 0666);\n if (fd2 == -1) {\n fprintf(stderr, \"driftnet\"\": %s: %s\\n\", name, strerror((*__errno_location ())));\n close(fd1);\n return;\n }\n while ((l = read(fd1, buf, sizeof buf)) > 0) {\n if (write(fd2, buf, l) == -1) {\n fprintf(stderr, \"driftnet\"\": %s: %s\\n\", name, strerror((*__errno_location ())));\n close(fd1);\n close(fd2);\n return;\n }\n }\n if (l == -1)\n fprintf(stderr, \"driftnet\"\": %s: %s\\n\", ir->filename, strerror((*__errno_location ())));\n close(fd1);\n close(fd2);\n}",
"variable_types": [
[
"ir",
"struct imgrect { char *filename; int x; } *"
],
[
"name",
"char *"
],
[
"num",
"int"
],
[
"fd1",
"int"
],
[
"fd2",
"int"
],
[
"buf",
"char [8192]"
],
[
"l",
"long"
],
[
"st",
"struct stat { unsigned long st_dev; unsigned long st_ino; unsigned long st_nlink; unsigned int st_mode; unsigned int st_uid; unsigned int st_gid; int __pad0; unsigned long st_rdev; long st_size; long st_blksize; long st_blocks; struct timespec { long tv_sec; long tv_nsec; } st_atim; struct timespec st_mtim; struct timespec st_ctim; long __glibc_reserved[3]; }"
]
],
"return_type": "void",
"user_defined_types": [
"struct stat { unsigned long st_dev; unsigned long st_ino; unsigned long st_nlink; unsigned int st_mode; unsigned int st_uid; unsigned int st_gid; int __pad0; unsigned long st_rdev; long st_size; long st_blksize; long st_blocks; struct timespec st_atim; struct timespec st_mtim; struct timespec st_ctim; long __glibc_reserved[3]; }",
"struct imgrect { char *filename; int x; }",
"struct timespec { long tv_sec; long tv_nsec; }"
],
"binary_hash": "25b9682480f8bb352ea97cfc9af66fd542716f1a743eb87f7045212eb01442f5"
},
{
"name": "xread",
"canonical_name": "func12",
"repo": "rbu/driftnet",
"decompiled_code": "__int64 __fastcall xread(int a1, char *a2, __int64 a3)\n{\nssize_t v5; // [rsp+20h] [rbp-10h]\nchar *buf; // [rsp+28h] [rbp-8h]\n\nfor ( buf = a2; buf < &a2[a3]; buf += v5 )\n{\nv5 = read(a1, buf, &a2[a3] - buf);\nif ( v5 == -1 && *_errno_location() != 4 )\nreturn -1LL;\nif ( !v5 )\nreturn 0LL;\n}\nreturn a3;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func12(int a1, char *a2, __int64 a3)\n{\nssize_t v5; // [rsp+20h] [rbp-10h]\nchar *buf; // [rsp+28h] [rbp-8h]\n\nfor ( buf = a2; buf < &a2[a3]; buf += v5 )\n{\nv5 = read(a1, buf, &a2[a3] - buf);\nif ( v5 == -1 && *_errno_location() != 4 )\nreturn -1LL;\nif ( !v5 )\nreturn 0LL;\n}\nreturn a3;\n}",
"original_code": "static ssize_t xread(int fd, void *buf, size_t len) {\n char *p;\n for (p = (char*)buf; p < (char*)buf + len; ) {\n ssize_t l;\n l = read(fd, p, (char*)buf + len - p);\n if (l == -1 && (*__errno_location ()) != 4)\n return -1;\n else if (l == 0)\n return 0;\n else\n p += l;\n }\n return len;\n}",
"canonical_original_code": "static long xread(int fd, void *buf, unsigned long len) {\n char *p;\n for (p = (char *)buf; p < (char *)buf + len; ) {\n long l;\n l = read(fd, p, (char *)buf + len - p);\n if (l == -1 && (*__errno_location ()) != 4)\n return -1;\n else if (l == 0)\n return 0;\n else\n p += l;\n }\n return len;\n}",
"variable_types": [
[
"fd",
"int"
],
[
"buf",
"void *"
],
[
"len",
"unsigned long"
],
[
"p",
"char *"
],
[
"l",
"long"
]
],
"return_type": "long",
"user_defined_types": [],
"binary_hash": "25b9682480f8bb352ea97cfc9af66fd542716f1a743eb87f7045212eb01442f5"
}
] |
643c05f2bf9832bf316259cb439a0e6ad3a5b0003496a038204f03e9fe7451c4 | rbu/driftnet | [
[
"is_driftnet_file",
"->"
],
[
"count_temporary_files",
"->",
"connection_extract_media"
],
[
"dispatch_image",
"->"
],
[
"dispatch_mpeg_audio",
"->"
],
[
"connection_extract_media",
"->",
"count_temporary_files"
]
] | [
[
"count_temporary_files",
"__int64 func1()\n{\nconst char *s1; // [rsp+8h] [rbp-18h]\nstruct dirent *v2; // [rsp+10h] [rbp-10h]\nDIR *dirp; // [rsp+18h] [rbp-8h]\n\nif ( time(0LL) - 5 > last_counted_1 )\n{\nnum_0 = 0;\ndirp = opendir(tmpdir);\nif ( dirp )\n{\nwhile ( 1 )\n{\nv2 = readdir(dirp);\nif ( !v2 )\nbreak;\ns1 = strrchr(v2->d_name, 46);\nif ( s1\n&& !strncmp(v2->d_name, \"driftnet-\", 9uLL)\n&& (!strcmp(s1, \".jpeg\") || !strcmp(s1, \".gif\") || !strcmp(s1, \".png\") || !strcmp(s1, \".mp3\")) )\n{\n++num_0;\n}\n}\nclosedir(dirp);\nlast_counted_1 = time(0LL);\n}\n}\nreturn (unsigned int)num_0;\n}"
]
] | [
{
"name": "is_driftnet_file",
"canonical_name": "func0",
"repo": "rbu/driftnet",
"decompiled_code": "_BOOL8 __fastcall is_driftnet_file(const char *a1)\n{\nconst char *v2; // [rsp+18h] [rbp-8h]\n\nif ( strncmp(a1, \"driftnet-\", 9uLL) )\nreturn 0LL;\nv2 = strrchr(a1, 46);\nif ( !v2 )\nreturn 0LL;\nreturn !strcmp(v2, \".jpeg\") || !strcmp(v2, \".gif\") || !strcmp(v2, \".png\") || !strcmp(v2, \".mp3\");\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func0(const char *a1)\n{\nconst char *v2; // [rsp+18h] [rbp-8h]\n\nif ( strncmp(a1, \"driftnet-\", 9uLL) )\nreturn 0LL;\nv2 = strrchr(a1, 46);\nif ( !v2 )\nreturn 0LL;\nreturn !strcmp(v2, \".jpeg\") || !strcmp(v2, \".gif\") || !strcmp(v2, \".png\") || !strcmp(v2, \".mp3\");\n}",
"original_code": "int is_driftnet_file(char *filename) {\n if (strncmp(filename, \"driftnet-\", 9) != 0) return 0;\n char *p = strrchr(filename, '.');\n if (p == 0) return 0;\n return (strcmp(p, \".jpeg\") == 0 ||\n strcmp(p, \".gif\") == 0 ||\n strcmp(p, \".png\") == 0 ||\n strcmp(p, \".mp3\") == 0);\n}",
"canonical_original_code": "int is_driftnet_file(char *filename) {\n if (strncmp(filename, \"driftnet-\", 9) != 0) return 0;\n char *p = strrchr(filename, '.');\n if (p == 0) return 0;\n return (strcmp(p, \".jpeg\") == 0 ||\n strcmp(p, \".gif\") == 0 ||\n strcmp(p, \".png\") == 0 ||\n strcmp(p, \".mp3\") == 0);\n}",
"variable_types": [
[
"filename",
"char *"
],
[
"p",
"char *"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "643c05f2bf9832bf316259cb439a0e6ad3a5b0003496a038204f03e9fe7451c4"
},
{
"name": "dispatch_image",
"canonical_name": "func2",
"repo": "rbu/driftnet",
"decompiled_code": "int __fastcall dispatch_image(const char *a1, const void *a2, size_t a3)\n{\nsize_t v3; // rax\nunsigned int v4; // ebx\nunsigned int v5; // eax\nint result; // eax\nchar s[8]; // [rsp+20h] [rbp-60h] BYREF\n__int64 v9; // [rsp+28h] [rbp-58h]\n__int64 v10; // [rsp+30h] [rbp-50h]\n__int64 v11; // [rsp+38h] [rbp-48h]\n__int64 v12; // [rsp+40h] [rbp-40h]\n__int64 v13; // [rsp+48h] [rbp-38h]\n__int64 v14; // [rsp+50h] [rbp-30h]\n__int64 v15; // [rsp+58h] [rbp-28h]\nint fd; // [rsp+64h] [rbp-1Ch]\nchar *file; // [rsp+68h] [rbp-18h]\n\n*(_QWORD *)s = 0LL;\nv9 = 0LL;\nv10 = 0LL;\nv11 = 0LL;\nv12 = 0LL;\nv13 = 0LL;\nv14 = 0LL;\nv15 = 0LL;\nv3 = strlen(tmpdir);\nfile = (char *)xmalloc(v3 + 64);\nv4 = rand();\nv5 = time(0LL);\nsprintf(s, \"driftnet-%08x%08x.%s\", v5, v4, a1);\nsprintf(file, \"%s/%s\", tmpdir, s);\nresult = open(file, 193, 420LL);\nfd = result;\nif ( result != -1 )\n{\nwrite(fd, a2, a3);\nclose(fd);\nif ( adjunct )\nputs(file);\nelse\nwrite(dpychld_fd, s, 0x40uLL);\nresult = xfree(file);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func2(const char *a1, const void *a2, size_t a3)\n{\nsize_t v3; // rax\nunsigned int v4; // ebx\nunsigned int v5; // eax\nint result; // eax\nchar s[8]; // [rsp+20h] [rbp-60h] BYREF\n__int64 v9; // [rsp+28h] [rbp-58h]\n__int64 v10; // [rsp+30h] [rbp-50h]\n__int64 v11; // [rsp+38h] [rbp-48h]\n__int64 v12; // [rsp+40h] [rbp-40h]\n__int64 v13; // [rsp+48h] [rbp-38h]\n__int64 v14; // [rsp+50h] [rbp-30h]\n__int64 v15; // [rsp+58h] [rbp-28h]\nint fd; // [rsp+64h] [rbp-1Ch]\nchar *file; // [rsp+68h] [rbp-18h]\n\n*(_QWORD *)s = 0LL;\nv9 = 0LL;\nv10 = 0LL;\nv11 = 0LL;\nv12 = 0LL;\nv13 = 0LL;\nv14 = 0LL;\nv15 = 0LL;\nv3 = strlen(tmpdir);\nfile = (char *)xmalloc(v3 + 64);\nv4 = rand();\nv5 = time(0LL);\nsprintf(s, \"driftnet-%08x%08x.%s\", v5, v4, a1);\nsprintf(file, \"%s/%s\", tmpdir, s);\nresult = open(file, 193, 420LL);\nfd = result;\nif ( result != -1 )\n{\nwrite(fd, a2, a3);\nclose(fd);\nif ( adjunct )\nputs(file);\nelse\nwrite(dpychld_fd, s, 0x40uLL);\nresult = xfree(file);\n}\nreturn result;\n}",
"original_code": "void dispatch_image(const char *mname, const unsigned char *data, const size_t len) {\n char *buf, name[64] = {0};\n int fd;\n buf = xmalloc(strlen(tmpdir) + 64);\n sprintf(name, \"driftnet-%08x%08x.%s\", (unsigned int)time(((void *)0)), rand(), mname);\n sprintf(buf, \"%s/%s\", tmpdir, name);\n fd = open(buf, 01 | 0100 | 0200, 0644);\n if (fd == -1)\n return;\n write(fd, data, len);\n close(fd);\n if (adjunct)\n printf(\"%s\\n\", buf);\n else\n write(dpychld_fd, name, sizeof name);\n xfree(buf);\n}",
"canonical_original_code": "void dispatch_image(char *mname, unsigned char *data, unsigned long len) {\n char *buf; char name[64] = {0};\n int fd;\n buf = xmalloc(strlen(tmpdir) + 64);\n sprintf(name, \"driftnet-%08x%08x.%s\", (unsigned int)time(((void *)0)), rand(), mname);\n sprintf(buf, \"%s/%s\", tmpdir, name);\n fd = open(buf, 01 | 0100 | 0200, 0644);\n if (fd == -1)\n return;\n write(fd, data, len);\n close(fd);\n if (adjunct)\n printf(\"%s\\n\", buf);\n else\n write(dpychld_fd, name, sizeof name);\n xfree(buf);\n}",
"variable_types": [
[
"mname",
"char *"
],
[
"data",
"unsigned char *"
],
[
"len",
"unsigned long"
],
[
"buf",
"char *"
],
[
"name",
"char [64]"
],
[
"fd",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "643c05f2bf9832bf316259cb439a0e6ad3a5b0003496a038204f03e9fe7451c4"
},
{
"name": "dispatch_mpeg_audio",
"canonical_name": "func3",
"repo": "rbu/driftnet",
"decompiled_code": "__int64 __fastcall dispatch_mpeg_audio(__int64 a1, __int64 a2, __int64 a3)\n{\nreturn mpeg_submit_chunk(a2, a3);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1, __int64 a2, __int64 a3)\n{\nreturn mpeg_submit_chunk(a2, a3);\n}",
"original_code": "void dispatch_mpeg_audio(const char *mname, const unsigned char *data, const size_t len) {\n mpeg_submit_chunk(data, len);\n}",
"canonical_original_code": "void dispatch_mpeg_audio(char *mname, unsigned char *data, unsigned long len) {\n mpeg_submit_chunk(data, len);\n}",
"variable_types": [
[
"mname",
"char *"
],
[
"data",
"unsigned char *"
],
[
"len",
"unsigned long"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "643c05f2bf9832bf316259cb439a0e6ad3a5b0003496a038204f03e9fe7451c4"
},
{
"name": "connection_extract_media",
"canonical_name": "func4",
"repo": "rbu/driftnet",
"decompiled_code": "int *__fastcall connection_extract_media(__int64 a1, int a2)\n{\nint *result; // rax\n__int64 v3; // [rsp+10h] [rbp-30h] BYREF\n__int64 v4; // [rsp+18h] [rbp-28h] BYREF\nunsigned __int64 v5; // [rsp+20h] [rbp-20h]\nunsigned __int64 v6; // [rsp+28h] [rbp-18h]\nint j; // [rsp+34h] [rbp-Ch]\nint *i; // [rsp+38h] [rbp-8h]\n\nresult = *(int **)(a1 + 48);\nfor ( i = result; i; i = result )\n{\nif ( i[1] > 0 && i[7] )\n{\nfor ( j = 0; j <= 4; ++j )\n{\nif ( (a2 & *((_DWORD *)&unk_568 + 8 * j)) != 0 )\n{\nv6 = *(_QWORD *)(a1 + 24) + *i + (__int64)i[j + 2];\nv5 = 0LL;\nwhile ( v6 != v5 && v6 < *(_QWORD *)(a1 + 24) + *i + (__int64)i[1] )\n{\nv5 = v6;\nv6 = ((__int64 (__fastcall *)(unsigned __int64, unsigned __int64, __int64 *, __int64 *))*(&off_570 + 4 * j))(\nv6,\n*i + i[1] - (v6 - *(_QWORD *)(a1 + 24)),\n&v4,\n&v3);\nif ( v4 && (!max_tmpfiles || (int)count_temporary_files() < max_tmpfiles) )\n((void (__fastcall *)(char *, __int64, __int64))*(&off_578 + 4 * j))((&driver)[4 * j], v4, v3);\n}\ni[j + 2] = v6 - *(_QWORD *)(a1 + 24) - *i;\n}\n}\ni[7] = 0;\n}\nresult = (int *)*((_QWORD *)i + 4);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int *__fastcall func4(__int64 a1, int a2)\n{\nint *result; // rax\n__int64 v3; // [rsp+10h] [rbp-30h] BYREF\n__int64 v4; // [rsp+18h] [rbp-28h] BYREF\nunsigned __int64 v5; // [rsp+20h] [rbp-20h]\nunsigned __int64 v6; // [rsp+28h] [rbp-18h]\nint j; // [rsp+34h] [rbp-Ch]\nint *i; // [rsp+38h] [rbp-8h]\n\nresult = *(int **)(a1 + 48);\nfor ( i = result; i; i = result )\n{\nif ( i[1] > 0 && i[7] )\n{\nfor ( j = 0; j <= 4; ++j )\n{\nif ( (a2 & *((_DWORD *)&unk_568 + 8 * j)) != 0 )\n{\nv6 = *(_QWORD *)(a1 + 24) + *i + (__int64)i[j + 2];\nv5 = 0LL;\nwhile ( v6 != v5 && v6 < *(_QWORD *)(a1 + 24) + *i + (__int64)i[1] )\n{\nv5 = v6;\nv6 = ((__int64 (__fastcall *)(unsigned __int64, unsigned __int64, __int64 *, __int64 *))*(&off_570 + 4 * j))(\nv6,\n*i + i[1] - (v6 - *(_QWORD *)(a1 + 24)),\n&v4,\n&v3);\nif ( v4 && (!max_tmpfiles || (int)func1() < max_tmpfiles) )\n((void (__fastcall *)(char *, __int64, __int64))*(&off_578 + 4 * j))((&driver)[4 * j], v4, v3);\n}\ni[j + 2] = v6 - *(_QWORD *)(a1 + 24) - *i;\n}\n}\ni[7] = 0;\n}\nresult = (int *)*((_QWORD *)i + 4);\n}\nreturn result;\n}",
"original_code": "void connection_extract_media(connection c, const enum mediatype T) {\n struct datablock *b;\n extern int max_tmpfiles;\n for (b = c->blocks; b; b = b->next) {\n if (b->len > 0 && b->dirty) {\n int i;\n for (i = 0; i < 5; ++i)\n if (driver[i].type & T) {\n unsigned char *ptr, *oldptr, *media;\n size_t mlen;\n ptr = c->data + b->off + b->moff[i];\n oldptr = ((void *)0);\n while (ptr != oldptr && ptr < c->data + b->off + b->len) {\n oldptr = ptr;\n ptr = driver[i].find_data(ptr, (b->off + b->len) - (ptr - c->data), &media, &mlen);\n if (media && (!max_tmpfiles || count_temporary_files() < max_tmpfiles))\n driver[i].dispatch_data(driver[i].name, media, mlen);\n }\n b->moff[i] = ptr - c->data - b->off;\n }\n b->dirty = 0;\n }\n }\n}",
"canonical_original_code": "void connection_extract_media(struct _connection *c, enum mediatype T) {\n struct datablock *b;\n extern int max_tmpfiles;\n for (b = c->blocks; b; b = b->next) {\n if (b->len > 0 && b->dirty) {\n int i;\n for (i = 0; i < 5; ++i)\n if (driver[i].type & T) {\n unsigned char *ptr; unsigned char *oldptr; unsigned char *media;\n unsigned long mlen;\n ptr = c->data + b->off + b->moff[i];\n oldptr = ((void *)0);\n while (ptr != oldptr && ptr < c->data + b->off + b->len) {\n oldptr = ptr;\n ptr = driver[i].find_data(ptr, (b->off + b->len) - (ptr - c->data), &media, &mlen);\n if (media && (!max_tmpfiles || count_temporary_files() < max_tmpfiles))\n driver[i].dispatch_data(driver[i].name, media, mlen);\n }\n b->moff[i] = ptr - c->data - b->off;\n }\n b->dirty = 0;\n }\n }\n}",
"variable_types": [
[
"c",
"struct _connection { struct in_addr { unsigned int s_addr; } src; short sport; unsigned int isn; unsigned int len; unsigned char *data; int fin; long last; struct datablock { int off; struct datablock *next; } *blocks; } *"
],
[
"T",
"enum mediatype { m_image=1, m_audio=2, m_text=4 }"
],
[
"b",
"struct datablock { int off; struct datablock *next; } *"
],
[
"max_tmpfiles",
"int"
],
[
"i",
"int"
],
[
"ptr",
"unsigned char *"
],
[
"oldptr",
"unsigned char *"
],
[
"media",
"unsigned char *"
],
[
"mlen",
"unsigned long"
]
],
"return_type": "void",
"user_defined_types": [
"enum mediatype { m_image=1, m_audio=2, m_text=4 }",
"struct _connection { struct in_addr src; short sport; unsigned int isn; unsigned int len; unsigned char *data; int fin; long last; struct datablock *blocks; }",
"struct datablock { int off; struct datablock *next; }",
"struct in_addr { unsigned int s_addr; }"
],
"binary_hash": "643c05f2bf9832bf316259cb439a0e6ad3a5b0003496a038204f03e9fe7451c4"
}
] |
8735d044e995b0ee29583ca655a1b7fa132ed9651806a5c47a6e3c7368cd4e99 | rbu/driftnet | [
[
"connection_new",
"->"
],
[
"connection_delete",
"->"
],
[
"connection_push",
"->"
]
] | [] | [
{
"name": "connection_new",
"canonical_name": "func0",
"repo": "rbu/driftnet",
"decompiled_code": "__int64 __fastcall connection_new(_DWORD *a1, _DWORD *a2, __int16 a3, __int16 a4)\n{\n__int64 v7; // [rsp+58h] [rbp-18h]\n\nv7 = xmalloc(56LL);\n*(_QWORD *)v7 = 0LL;\n*(_QWORD *)(v7 + 8) = 0LL;\n*(_QWORD *)(v7 + 16) = 0LL;\n*(_QWORD *)(v7 + 24) = 0LL;\n*(_QWORD *)(v7 + 32) = 0LL;\n*(_QWORD *)(v7 + 40) = 0LL;\n*(_QWORD *)(v7 + 48) = 0LL;\n*(_DWORD *)v7 = *a1;\n*(_DWORD *)(v7 + 4) = *a2;\n*(_WORD *)(v7 + 8) = a3;\n*(_WORD *)(v7 + 10) = a4;\n*(_DWORD *)(v7 + 20) = 0x4000;\n*(_QWORD *)(v7 + 24) = xmalloc(*(unsigned int *)(v7 + 20));\n*(_QWORD *)(v7 + 40) = time(0LL);\n*(_QWORD *)(v7 + 48) = 0LL;\nreturn v7;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(_DWORD *a1, _DWORD *a2, __int16 a3, __int16 a4)\n{\n__int64 v7; // [rsp+58h] [rbp-18h]\n\nv7 = xmalloc(56LL);\n*(_QWORD *)v7 = 0LL;\n*(_QWORD *)(v7 + 8) = 0LL;\n*(_QWORD *)(v7 + 16) = 0LL;\n*(_QWORD *)(v7 + 24) = 0LL;\n*(_QWORD *)(v7 + 32) = 0LL;\n*(_QWORD *)(v7 + 40) = 0LL;\n*(_QWORD *)(v7 + 48) = 0LL;\n*(_DWORD *)v7 = *a1;\n*(_DWORD *)(v7 + 4) = *a2;\n*(_WORD *)(v7 + 8) = a3;\n*(_WORD *)(v7 + 10) = a4;\n*(_DWORD *)(v7 + 20) = 0x4000;\n*(_QWORD *)(v7 + 24) = xmalloc(*(unsigned int *)(v7 + 20));\n*(_QWORD *)(v7 + 40) = time(0LL);\n*(_QWORD *)(v7 + 48) = 0LL;\nreturn v7;\n}",
"original_code": "connection connection_new(const struct in_addr *src, const struct in_addr *dst, const short int sport, const short int dport) {\n connection c;\n do { struct _connection as__z = {0}; c = xmalloc(sizeof *c); *c = as__z; } while (0);\n c->src = *src;\n c->dst = *dst;\n c->sport = sport;\n c->dport = dport;\n c->alloc = 16384;\n c->data = xmalloc(c->alloc);\n c->last = time(((void *)0));\n c->blocks = ((void *)0);\n return c;\n}",
"canonical_original_code": "struct _connection *connection_new(struct in_addr *src, struct in_addr *dst, short sport, short dport) {\n struct _connection *c;\n do { struct _connection as__z = {0}; c = xmalloc(sizeof *c); *c = as__z; } while (0);\n c->src = *src;\n c->dst = *dst;\n c->sport = sport;\n c->dport = dport;\n c->alloc = 16384;\n c->data = xmalloc(c->alloc);\n c->last = time(((void *)0));\n c->blocks = ((void *)0);\n return c;\n}",
"variable_types": [
[
"src",
"struct in_addr *"
],
[
"dst",
"struct in_addr *"
],
[
"sport",
"short"
],
[
"dport",
"short"
],
[
"c",
"struct _connection { struct in_addr { unsigned int s_addr; } src; short sport; unsigned int isn; unsigned int len; unsigned char *data; int fin; long last; struct datablock { int off; struct datablock *next; } *blocks; } *"
],
[
"as__z",
"struct _connection { struct in_addr { unsigned int s_addr; } src; short sport; unsigned int isn; unsigned int len; unsigned char *data; int fin; long last; struct datablock { int off; struct datablock *next; } *blocks; }"
]
],
"return_type": "struct _connection { struct in_addr { unsigned int s_addr; } src; short sport; unsigned int isn; unsigned int len; unsigned char *data; int fin; long last; struct datablock { int off; struct datablock *next; } *blocks; } *",
"user_defined_types": [
"struct _connection { struct in_addr src; short sport; unsigned int isn; unsigned int len; unsigned char *data; int fin; long last; struct datablock *blocks; }",
"struct in_addr { unsigned int s_addr; }",
"struct datablock { int off; struct datablock *next; }"
],
"binary_hash": "8735d044e995b0ee29583ca655a1b7fa132ed9651806a5c47a6e3c7368cd4e99"
},
{
"name": "connection_delete",
"canonical_name": "func1",
"repo": "rbu/driftnet",
"decompiled_code": "void __fastcall connection_delete(__int64 a1)\n{\n_QWORD *v1; // [rsp+10h] [rbp-10h]\n_QWORD *ptr; // [rsp+18h] [rbp-8h]\n\nfor ( ptr = *(_QWORD **)(a1 + 48); ptr; ptr = v1 )\n{\nv1 = (_QWORD *)ptr[4];\nfree(ptr);\n}\nfree(*(void **)(a1 + 24));\nfree((void *)a1);\n}\n",
"canonical_decompiled_code": "void __fastcall func1(__int64 a1)\n{\n_QWORD *v1; // [rsp+10h] [rbp-10h]\n_QWORD *ptr; // [rsp+18h] [rbp-8h]\n\nfor ( ptr = *(_QWORD **)(a1 + 48); ptr; ptr = v1 )\n{\nv1 = (_QWORD *)ptr[4];\nfree(ptr);\n}\nfree(*(void **)(a1 + 24));\nfree((void *)a1);\n}",
"original_code": "void connection_delete(connection c) {\n struct datablock *b;\n for (b = c->blocks; b;) {\n struct datablock *b2;\n b2 = b->next;\n free(b);\n b = b2;\n }\n free(c->data);\n free(c);\n}",
"canonical_original_code": "void connection_delete(struct _connection *c) {\n struct datablock *b;\n for (b = c->blocks; b;) {\n struct datablock *b2;\n b2 = b->next;\n free(b);\n b = b2;\n }\n free(c->data);\n free(c);\n}",
"variable_types": [
[
"c",
"struct _connection { struct in_addr { unsigned int s_addr; } src; short sport; unsigned int isn; unsigned int len; unsigned char *data; int fin; long last; struct datablock { int off; struct datablock *next; } *blocks; } *"
],
[
"b",
"struct datablock { int off; struct datablock *next; } *"
],
[
"b2",
"struct datablock { int off; struct datablock *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _connection { struct in_addr src; short sport; unsigned int isn; unsigned int len; unsigned char *data; int fin; long last; struct datablock *blocks; }",
"struct datablock { int off; struct datablock *next; }",
"struct in_addr { unsigned int s_addr; }"
],
"binary_hash": "8735d044e995b0ee29583ca655a1b7fa132ed9651806a5c47a6e3c7368cd4e99"
},
{
"name": "connection_push",
"canonical_name": "func2",
"repo": "rbu/driftnet",
"decompiled_code": "__int64 __fastcall connection_push(__int64 a1, const void *a2, unsigned int a3, unsigned int a4)\n{\n__int64 result; // rax\n_DWORD *ptr; // [rsp+48h] [rbp-38h]\n__int64 v8; // [rsp+50h] [rbp-30h]\nint v9; // [rsp+5Ch] [rbp-24h]\n__int64 v10; // [rsp+60h] [rbp-20h]\n__int64 v11; // [rsp+68h] [rbp-18h]\n__int64 i; // [rsp+68h] [rbp-18h]\n\nif ( !*(_DWORD *)(a1 + 20) )\n_assert_fail(\"c->alloc > 0\", \"connection.c\", 0x3Bu, \"connection_push\");\nif ( a4 + a3 > *(_DWORD *)(a1 + 20) )\n{\ndo\n*(_DWORD *)(a1 + 20) *= 2;\nwhile ( a4 + a3 > *(_DWORD *)(a1 + 20) );\n*(_QWORD *)(a1 + 24) = xrealloc(*(_QWORD *)(a1 + 24), *(unsigned int *)(a1 + 20));\n}\nmemcpy((void *)(a3 + *(_QWORD *)(a1 + 24)), a2, a4);\nif ( a4 + a3 > *(_DWORD *)(a1 + 16) )\n*(_DWORD *)(a1 + 16) = a4 + a3;\n*(_QWORD *)(a1 + 40) = time(0LL);\nv8 = xmalloc(40LL);\n*(_QWORD *)v8 = 0LL;\n*(_QWORD *)(v8 + 8) = 0LL;\n*(_QWORD *)(v8 + 16) = 0LL;\n*(_QWORD *)(v8 + 24) = 0LL;\n*(_QWORD *)(v8 + 32) = 0LL;\n*(_DWORD *)v8 = a3;\n*(_DWORD *)(v8 + 4) = a4;\n*(_DWORD *)(v8 + 28) = 1;\n*(_QWORD *)(v8 + 32) = 0LL;\nv11 = *(_QWORD *)(a1 + 48);\nv10 = 0LL;\nwhile ( v11 && a3 > *(_DWORD *)v11 || v10 && a3 <= *(_DWORD *)v10 )\n{\nv10 = v11;\nv11 = *(_QWORD *)(v11 + 32);\n}\n*(_QWORD *)(v8 + 32) = v11;\nif ( v10 )\n*(_QWORD *)(v10 + 32) = v8;\nelse\n*(_QWORD *)(a1 + 48) = v8;\ndo\n{\nv9 = 0;\nresult = *(_QWORD *)(a1 + 48);\nfor ( i = result; i; i = result )\n{\nif ( *(_QWORD *)(i + 32) )\n{\nif ( *(_DWORD *)(i + 4) + *(_DWORD *)i >= **(_DWORD **)(i + 32) )\n{\nptr = *(_DWORD **)(i + 32);\n*(_DWORD *)(i + 4) = ptr[1] + *ptr - *(_DWORD *)i;\n*(_QWORD *)(i + 32) = *((_QWORD *)ptr + 4);\n*(_DWORD *)(i + 28) = 1;\nfree(ptr);\n++v9;\n}\n}\nresult = *(_QWORD *)(i + 32);\n}\n}\nwhile ( v9 );\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, const void *a2, unsigned int a3, unsigned int a4)\n{\n__int64 result; // rax\n_DWORD *ptr; // [rsp+48h] [rbp-38h]\n__int64 v8; // [rsp+50h] [rbp-30h]\nint v9; // [rsp+5Ch] [rbp-24h]\n__int64 v10; // [rsp+60h] [rbp-20h]\n__int64 v11; // [rsp+68h] [rbp-18h]\n__int64 i; // [rsp+68h] [rbp-18h]\n\nif ( !*(_DWORD *)(a1 + 20) )\n_assert_fail(\"c->alloc > 0\", \"connection.c\", 0x3Bu, \"connection_push\");\nif ( a4 + a3 > *(_DWORD *)(a1 + 20) )\n{\ndo\n*(_DWORD *)(a1 + 20) *= 2;\nwhile ( a4 + a3 > *(_DWORD *)(a1 + 20) );\n*(_QWORD *)(a1 + 24) = xrealloc(*(_QWORD *)(a1 + 24), *(unsigned int *)(a1 + 20));\n}\nmemcpy((void *)(a3 + *(_QWORD *)(a1 + 24)), a2, a4);\nif ( a4 + a3 > *(_DWORD *)(a1 + 16) )\n*(_DWORD *)(a1 + 16) = a4 + a3;\n*(_QWORD *)(a1 + 40) = time(0LL);\nv8 = xmalloc(40LL);\n*(_QWORD *)v8 = 0LL;\n*(_QWORD *)(v8 + 8) = 0LL;\n*(_QWORD *)(v8 + 16) = 0LL;\n*(_QWORD *)(v8 + 24) = 0LL;\n*(_QWORD *)(v8 + 32) = 0LL;\n*(_DWORD *)v8 = a3;\n*(_DWORD *)(v8 + 4) = a4;\n*(_DWORD *)(v8 + 28) = 1;\n*(_QWORD *)(v8 + 32) = 0LL;\nv11 = *(_QWORD *)(a1 + 48);\nv10 = 0LL;\nwhile ( v11 && a3 > *(_DWORD *)v11 || v10 && a3 <= *(_DWORD *)v10 )\n{\nv10 = v11;\nv11 = *(_QWORD *)(v11 + 32);\n}\n*(_QWORD *)(v8 + 32) = v11;\nif ( v10 )\n*(_QWORD *)(v10 + 32) = v8;\nelse\n*(_QWORD *)(a1 + 48) = v8;\ndo\n{\nv9 = 0;\nresult = *(_QWORD *)(a1 + 48);\nfor ( i = result; i; i = result )\n{\nif ( *(_QWORD *)(i + 32) )\n{\nif ( *(_DWORD *)(i + 4) + *(_DWORD *)i >= **(_DWORD **)(i + 32) )\n{\nptr = *(_DWORD **)(i + 32);\n*(_DWORD *)(i + 4) = ptr[1] + *ptr - *(_DWORD *)i;\n*(_QWORD *)(i + 32) = *((_QWORD *)ptr + 4);\n*(_DWORD *)(i + 28) = 1;\nfree(ptr);\n++v9;\n}\n}\nresult = *(_QWORD *)(i + 32);\n}\n}\nwhile ( v9 );\nreturn result;\n}",
"original_code": "void connection_push(connection c, const unsigned char *data, unsigned int off, unsigned int len) {\n struct datablock *B, *b, *bl, BZ = {0};\n int a;\n ((void) sizeof ((c->alloc > 0) ? 1 : 0), __extension__ ({ if (c->alloc > 0) ; else __assert_fail (\"c->alloc > 0\", \"connection.c\", 59, __extension__ __PRETTY_FUNCTION__); }));\n if (off + len > c->alloc) {\n do\n c->alloc *= 2;\n while (off + len > c->alloc);\n c->data = (unsigned char*)xrealloc(c->data, c->alloc);\n }\n memcpy(c->data + off, data, len);\n if (off + len > c->len) c->len = off + len;\n c->last = time(((void *)0));\n B = xmalloc(sizeof *B);\n *B = BZ;\n B->off = off;\n B->len = len;\n B->dirty = 1;\n B->next = ((void *)0);\n for (b = c->blocks, bl = ((void *)0); ; bl = b, b = b->next) {\n if ((!b || off <= b->off) && (!bl || off > bl->off)) {\n B->next = b;\n if (bl)\n bl->next = B;\n else\n c->blocks = B;\n break;\n }\n }\n do {\n a = 0;\n for (b = c->blocks; b; b = b->next) {\n if (b->next && b->off + b->len >= b->next->off) {\n struct datablock *bb;\n bb = b->next;\n b->len = (bb->off + bb->len) - b->off;\n b->next = bb->next;\n b->dirty = 1;\n free(bb);\n ++a;\n }\n }\n } while (a);\n}",
"canonical_original_code": "void connection_push(struct _connection *c, unsigned char *data, unsigned int off, unsigned int len) {\n struct datablock *B; struct datablock *b; struct datablock *bl; struct datablock BZ = {0};\n int a;\n ((void) sizeof ((c->alloc > 0) ? 1 : 0), __extension__ ({ if (c->alloc > 0) ; else __assert_fail (\"c->alloc > 0\", \"connection.c\", 59, __extension__ __PRETTY_FUNCTION__); }));\n if (off + len > c->alloc) {\n do\n c->alloc *= 2;\n while (off + len > c->alloc);\n c->data = (unsigned char *)xrealloc(c->data, c->alloc);\n }\n memcpy(c->data + off, data, len);\n if (off + len > c->len) c->len = off + len;\n c->last = time(((void *)0));\n B = xmalloc(sizeof *B);\n *B = BZ;\n B->off = off;\n B->len = len;\n B->dirty = 1;\n B->next = ((void *)0);\n for (b = c->blocks, bl = ((void *)0); ; bl = b, b = b->next) {\n if ((!b || off <= b->off) && (!bl || off > bl->off)) {\n B->next = b;\n if (bl)\n bl->next = B;\n else\n c->blocks = B;\n break;\n }\n }\n do {\n a = 0;\n for (b = c->blocks; b; b = b->next) {\n if (b->next && b->off + b->len >= b->next->off) {\n struct datablock *bb;\n bb = b->next;\n b->len = (bb->off + bb->len) - b->off;\n b->next = bb->next;\n b->dirty = 1;\n free(bb);\n ++a;\n }\n }\n } while (a);\n}",
"variable_types": [
[
"c",
"struct _connection { struct in_addr { unsigned int s_addr; } src; short sport; unsigned int isn; unsigned int len; unsigned char *data; int fin; long last; struct datablock { int off; struct datablock *next; } *blocks; } *"
],
[
"data",
"unsigned char *"
],
[
"off",
"unsigned int"
],
[
"len",
"unsigned int"
],
[
"B",
"struct datablock { int off; struct datablock *next; } *"
],
[
"b",
"struct datablock { int off; struct datablock *next; } *"
],
[
"bl",
"struct datablock { int off; struct datablock *next; } *"
],
[
"BZ",
"struct datablock { int off; struct datablock *next; }"
],
[
"a",
"int"
],
[
"bb",
"struct datablock { int off; struct datablock *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct datablock { int off; struct datablock *next; }",
"struct _connection { struct in_addr src; short sport; unsigned int isn; unsigned int len; unsigned char *data; int fin; long last; struct datablock *blocks; }",
"struct in_addr { unsigned int s_addr; }"
],
"binary_hash": "8735d044e995b0ee29583ca655a1b7fa132ed9651806a5c47a6e3c7368cd4e99"
}
] |
9d8a94855fdf6487f152ef1d600f9eda2f5ae2202efe4076c69a29ff8b625aa3 | rbu/driftnet | [
[
"find_mpeg_stream",
"->"
]
] | [] | [
{
"name": "find_mpeg_stream",
"canonical_name": "func0",
"repo": "rbu/driftnet",
"decompiled_code": "char *__fastcall find_mpeg_stream(char *a1, unsigned __int64 a2, _QWORD *a3, _QWORD *a4)\n{\nchar v7[60]; // [rsp+20h] [rbp-60h] BYREF\nint v8; // [rsp+5Ch] [rbp-24h]\nchar *v9; // [rsp+60h] [rbp-20h]\nchar *v10; // [rsp+68h] [rbp-18h]\nint v11; // [rsp+74h] [rbp-Ch]\nvoid *s; // [rsp+78h] [rbp-8h]\n\n*a3 = 0LL;\nif ( a2 <= 3 )\nreturn a1;\nfor ( s = a1; ; s = v9 + 1 )\n{\nwhile ( 1 )\n{\nif ( s >= &a1[a2 - 4] )\nreturn (char *)s;\nv9 = (char *)memchr(s, 255, a2 - ((_BYTE *)s - a1) - 4);\nif ( !v9 )\nreturn &a1[a2 - 4];\nif ( (v9[1] & 0xE0) == 224 )\nbreak;\ns = v9 + 1;\n}\nif ( (unsigned int)mpeg_hdr_parse(v9, v7) )\nbreak;\n}\nv11 = 0;\nv10 = v9;\ndo\n{\n++v11;\nv8 = mpeg_hdr_nextframe_offset(v7);\nif ( !v8 )\nreturn v10 + 1;\nv10 += v8;\n}\nwhile ( v11 <= 99 && v10 < &a1[a2 - 4] && (unsigned int)mpeg_hdr_parse(v10, v7) );\nif ( v11 <= 99 )\nreturn v9;\n*a3 = v9;\n*a4 = v10 - v9;\nreturn v10;\n}\n",
"canonical_decompiled_code": "char *__fastcall func0(char *a1, unsigned __int64 a2, _QWORD *a3, _QWORD *a4)\n{\nchar v7[60]; // [rsp+20h] [rbp-60h] BYREF\nint v8; // [rsp+5Ch] [rbp-24h]\nchar *v9; // [rsp+60h] [rbp-20h]\nchar *v10; // [rsp+68h] [rbp-18h]\nint v11; // [rsp+74h] [rbp-Ch]\nvoid *s; // [rsp+78h] [rbp-8h]\n\n*a3 = 0LL;\nif ( a2 <= 3 )\nreturn a1;\nfor ( s = a1; ; s = v9 + 1 )\n{\nwhile ( 1 )\n{\nif ( s >= &a1[a2 - 4] )\nreturn (char *)s;\nv9 = (char *)memchr(s, 255, a2 - ((_BYTE *)s - a1) - 4);\nif ( !v9 )\nreturn &a1[a2 - 4];\nif ( (v9[1] & 0xE0) == 224 )\nbreak;\ns = v9 + 1;\n}\nif ( (unsigned int)mpeg_hdr_parse(v9, v7) )\nbreak;\n}\nv11 = 0;\nv10 = v9;\ndo\n{\n++v11;\nv8 = mpeg_hdr_nextframe_offset(v7);\nif ( !v8 )\nreturn v10 + 1;\nv10 += v8;\n}\nwhile ( v11 <= 99 && v10 < &a1[a2 - 4] && (unsigned int)mpeg_hdr_parse(v10, v7) );\nif ( v11 <= 99 )\nreturn v9;\n*a3 = v9;\n*a4 = v10 - v9;\nreturn v10;\n}",
"original_code": "unsigned char *find_mpeg_stream(const unsigned char *data, const size_t len, unsigned char **mpegdata, size_t *mpeglen) {\n unsigned char *stream_start, *p;\n struct mpeg_audio_hdr H;\n *mpegdata = ((void *)0);\n if (len < 4) return (unsigned char*)data;\n p = (unsigned char*)data;\n while (p < data + len - 4) {\n int nframes;\n unsigned char *q;\n stream_start = memchr(p, 0xff, len - 4 - (p - data));\n if (!stream_start)\n return (unsigned char*)(data + len - 4);\n if ((stream_start[1] & 0xe0) != 0xe0) {\n p = stream_start + 1;\n continue;\n }\n if (!mpeg_hdr_parse(stream_start, &H)) {\n p = stream_start + 1;\n continue;\n }\n nframes = 0;\n q = stream_start;\n do {\n int delta;\n ++nframes;\n delta = mpeg_hdr_nextframe_offset(&H);\n if (delta == 0)\n return q + 1;\n q += delta;\n } while (nframes < 100 && q < data + len - 4 && mpeg_hdr_parse(q, &H));\n if (nframes >= 100) {\n *mpegdata = stream_start;\n *mpeglen = q - stream_start;\n return q;\n } else\n return stream_start;\n }\n return p;\n}",
"canonical_original_code": "unsigned char *find_mpeg_stream(unsigned char *data, unsigned long len, unsigned char **mpegdata, unsigned long *mpeglen) {\n unsigned char *stream_start; unsigned char *p;\n struct mpeg_audio_hdr H;\n *mpegdata = ((void *)0);\n if (len < 4) return (unsigned char *)data;\n p = (unsigned char *)data;\n while (p < data + len - 4) {\n int nframes;\n unsigned char *q;\n stream_start = memchr(p, 0xff, len - 4 - (p - data));\n if (!stream_start)\n return (unsigned char *)(data + len - 4);\n if ((stream_start[1] & 0xe0) != 0xe0) {\n p = stream_start + 1;\n continue;\n }\n if (!mpeg_hdr_parse(stream_start, &H)) {\n p = stream_start + 1;\n continue;\n }\n nframes = 0;\n q = stream_start;\n do {\n int delta;\n ++nframes;\n delta = mpeg_hdr_nextframe_offset(&H);\n if (delta == 0)\n return q + 1;\n q += delta;\n } while (nframes < 100 && q < data + len - 4 && mpeg_hdr_parse(q, &H));\n if (nframes >= 100) {\n *mpegdata = stream_start;\n *mpeglen = q - stream_start;\n return q;\n } else\n return stream_start;\n }\n return p;\n}",
"variable_types": [
[
"data",
"unsigned char *"
],
[
"len",
"unsigned long"
],
[
"mpegdata",
"unsigned char **"
],
[
"mpeglen",
"unsigned long *"
],
[
"stream_start",
"unsigned char *"
],
[
"p",
"unsigned char *"
],
[
"H",
"struct mpeg_audio_hdr { enum { m_vers_unknown=0, m_vers_1=1, m_vers_2=2, m_vers_2_5=3 } version; enum { m_layer_unknown=0, m_layer_1=1, m_layer_2=2, m_layer_3=3 } layer; int has_crc; unsigned short crc; int bitrate; int samplerate; int padded; int priv; enum { m_chan_stereo=0, m_chan_joint=1, m_chan_dual=2, m_chan_mono=3 } channels; unsigned char mode_extn; int copyr; unsigned char emph; }"
],
[
"nframes",
"int"
],
[
"q",
"unsigned char *"
],
[
"delta",
"int"
]
],
"return_type": "unsigned char *",
"user_defined_types": [
"struct mpeg_audio_hdr { enum { m_vers_unknown=0, m_vers_1=1, m_vers_2=2, m_vers_2_5=3 } version; enum { m_layer_unknown=0, m_layer_1=1, m_layer_2=2, m_layer_3=3 } layer; int has_crc; unsigned short crc; int bitrate; int samplerate; int padded; int priv; enum { m_chan_stereo=0, m_chan_joint=1, m_chan_dual=2, m_chan_mono=3 } channels; unsigned char mode_extn; int copyr; unsigned char emph; }"
],
"binary_hash": "9d8a94855fdf6487f152ef1d600f9eda2f5ae2202efe4076c69a29ff8b625aa3"
}
] |
c27e4dc132a639427dcdcfd08504ba26e58e449a83ed64a9163333debb8ad52e | rbu/driftnet | [
[
"xmalloc",
"->",
"xstrdup"
],
[
"xcalloc",
"->"
],
[
"xrealloc",
"->"
],
[
"xfree",
"->"
],
[
"xstrdup",
"->",
"xmalloc"
],
[
"memstr",
"->"
]
] | [] | [
{
"name": "xmalloc",
"canonical_name": "func0",
"repo": "rbu/driftnet",
"decompiled_code": "void *__fastcall xmalloc(size_t a1)\n{\nvoid *v2; // [rsp+18h] [rbp-8h]\n\nv2 = malloc(a1);\nif ( !v2 )\nabort();\nreturn v2;\n}\n",
"canonical_decompiled_code": "void *__fastcall func0(size_t a1)\n{\nvoid *v2; // [rsp+18h] [rbp-8h]\n\nv2 = malloc(a1);\nif ( !v2 )\nabort();\nreturn v2;\n}",
"original_code": "void *xmalloc(size_t n) {\n void *v;\n v = malloc(n);\n if (!v) abort();\n return v;\n}",
"canonical_original_code": "void *xmalloc(unsigned long n) {\n void *v;\n v = malloc(n);\n if (!v) abort();\n return v;\n}",
"variable_types": [
[
"n",
"unsigned long"
],
[
"v",
"void *"
]
],
"return_type": "void *",
"user_defined_types": [],
"binary_hash": "c27e4dc132a639427dcdcfd08504ba26e58e449a83ed64a9163333debb8ad52e"
},
{
"name": "xcalloc",
"canonical_name": "func1",
"repo": "rbu/driftnet",
"decompiled_code": "void *__fastcall xcalloc(size_t a1, size_t a2)\n{\nvoid *v3; // [rsp+18h] [rbp-8h]\n\nv3 = calloc(a1, a2);\nif ( !v3 )\nabort();\nreturn v3;\n}\n",
"canonical_decompiled_code": "void *__fastcall func1(size_t a1, size_t a2)\n{\nvoid *v3; // [rsp+18h] [rbp-8h]\n\nv3 = calloc(a1, a2);\nif ( !v3 )\nabort();\nreturn v3;\n}",
"original_code": "void *xcalloc(size_t n, size_t m) {\n void *v;\n v = calloc(n, m);\n if (!v) abort();\n return v;\n}",
"canonical_original_code": "void *xcalloc(unsigned long n, unsigned long m) {\n void *v;\n v = calloc(n, m);\n if (!v) abort();\n return v;\n}",
"variable_types": [
[
"n",
"unsigned long"
],
[
"m",
"unsigned long"
],
[
"v",
"void *"
]
],
"return_type": "void *",
"user_defined_types": [],
"binary_hash": "c27e4dc132a639427dcdcfd08504ba26e58e449a83ed64a9163333debb8ad52e"
},
{
"name": "xrealloc",
"canonical_name": "func2",
"repo": "rbu/driftnet",
"decompiled_code": "void *__fastcall xrealloc(void *a1, size_t a2)\n{\nvoid *v3; // [rsp+18h] [rbp-8h]\n\nv3 = realloc(a1, a2);\nif ( a2 && !v3 )\nabort();\nreturn v3;\n}\n",
"canonical_decompiled_code": "void *__fastcall func2(void *a1, size_t a2)\n{\nvoid *v3; // [rsp+18h] [rbp-8h]\n\nv3 = realloc(a1, a2);\nif ( a2 && !v3 )\nabort();\nreturn v3;\n}",
"original_code": "void *xrealloc(void *w, size_t n) {\n void *v;\n v = realloc(w, n);\n if (n != 0 && !v) abort();\n return v;\n}",
"canonical_original_code": "void *xrealloc(void *w, unsigned long n) {\n void *v;\n v = realloc(w, n);\n if (n != 0 && !v) abort();\n return v;\n}",
"variable_types": [
[
"w",
"void *"
],
[
"n",
"unsigned long"
],
[
"v",
"void *"
]
],
"return_type": "void *",
"user_defined_types": [],
"binary_hash": "c27e4dc132a639427dcdcfd08504ba26e58e449a83ed64a9163333debb8ad52e"
},
{
"name": "xfree",
"canonical_name": "func3",
"repo": "rbu/driftnet",
"decompiled_code": "void __fastcall xfree(void *a1)\n{\nif ( a1 )\nfree(a1);\n}\n",
"canonical_decompiled_code": "void __fastcall func3(void *a1)\n{\nif ( a1 )\nfree(a1);\n}",
"original_code": "void xfree(void *v) {\n if (v) free(v);\n}",
"canonical_original_code": "void xfree(void *v) {\n if (v) free(v);\n}",
"variable_types": [
[
"v",
"void *"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "c27e4dc132a639427dcdcfd08504ba26e58e449a83ed64a9163333debb8ad52e"
},
{
"name": "xstrdup",
"canonical_name": "func4",
"repo": "rbu/driftnet",
"decompiled_code": "char *__fastcall xstrdup(const char *a1)\n{\nsize_t v1; // rax\nchar *dest; // [rsp+18h] [rbp-8h]\n\nv1 = strlen(a1);\ndest = (char *)xmalloc(v1 + 1);\nstrcpy(dest, a1);\nreturn dest;\n}\n",
"canonical_decompiled_code": "char *__fastcall func4(const char *a1)\n{\nsize_t v1; // rax\nchar *dest; // [rsp+18h] [rbp-8h]\n\nv1 = strlen(a1);\ndest = (char *)func0(v1 + 1);\nstrcpy(dest, a1);\nreturn dest;\n}",
"original_code": "char *xstrdup(const char *s) {\n char *t;\n t = xmalloc(strlen(s) + 1);\n strcpy(t, s);\n return t;\n}",
"canonical_original_code": "char *xstrdup(char *s) {\n char *t;\n t = xmalloc(strlen(s) + 1);\n strcpy(t, s);\n return t;\n}",
"variable_types": [
[
"s",
"char *"
],
[
"t",
"char *"
]
],
"return_type": "char *",
"user_defined_types": [],
"binary_hash": "c27e4dc132a639427dcdcfd08504ba26e58e449a83ed64a9163333debb8ad52e"
},
{
"name": "memstr",
"canonical_name": "func5",
"repo": "rbu/driftnet",
"decompiled_code": "__int64 __fastcall memstr(__int64 a1, unsigned __int64 a2, __int64 a3, __int64 a4)\n{\nint v5[257]; // [rsp+20h] [rbp-410h]\nint v6; // [rsp+424h] [rbp-Ch]\nint v7; // [rsp+428h] [rbp-8h]\nint i; // [rsp+42Ch] [rbp-4h]\n\nif ( !a4 )\nreturn a1;\nfor ( i = 0; i <= 255; ++i )\nv5[i] = a4;\nfor ( i = 0; i < (unsigned __int64)(a4 - 1); ++i )\nv5[*(unsigned __int8 *)(i + a3)] = a4 - i - 1;\nfor ( i = a4 - 1; a2 > i; i += v5[*(unsigned __int8 *)(i + a1)] )\n{\nv6 = a4 - 1;\nv7 = i;\nwhile ( v6 >= 0 && *(_BYTE *)(v7 + a1) == *(_BYTE *)(v6 + a3) )\n{\n--v7;\n--v6;\n}\nif ( v6 == -1 )\nreturn v7 + 1LL + a1;\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1, unsigned __int64 a2, __int64 a3, __int64 a4)\n{\nint v5[257]; // [rsp+20h] [rbp-410h]\nint v6; // [rsp+424h] [rbp-Ch]\nint v7; // [rsp+428h] [rbp-8h]\nint i; // [rsp+42Ch] [rbp-4h]\n\nif ( !a4 )\nreturn a1;\nfor ( i = 0; i <= 255; ++i )\nv5[i] = a4;\nfor ( i = 0; i < (unsigned __int64)(a4 - 1); ++i )\nv5[*(unsigned __int8 *)(i + a3)] = a4 - i - 1;\nfor ( i = a4 - 1; a2 > i; i += v5[*(unsigned __int8 *)(i + a1)] )\n{\nv6 = a4 - 1;\nv7 = i;\nwhile ( v6 >= 0 && *(_BYTE *)(v7 + a1) == *(_BYTE *)(v6 + a3) )\n{\n--v7;\n--v6;\n}\nif ( v6 == -1 )\nreturn v7 + 1LL + a1;\n}\nreturn 0LL;\n}",
"original_code": "unsigned char *memstr(const unsigned char *haystack, const size_t hlen,\n const unsigned char *needle, const size_t nlen) {\n int skip[256], k;\n if (nlen == 0) return (unsigned char*)haystack;\n for (k = 0; k < 256; ++k) skip[k] = nlen;\n for (k = 0; k < nlen - 1; ++k) skip[needle[k]] = nlen - k - 1;\n for (k = nlen - 1; k < hlen; k += skip[haystack[k]]) {\n int i, j;\n for (j = nlen - 1, i = k; j >= 0 && haystack[i] == needle[j]; j--) i--;\n if (j == -1) return (unsigned char*)(haystack + i + 1);\n }\n return ((void *)0);\n}",
"canonical_original_code": "unsigned char *memstr(unsigned char *haystack, unsigned long hlen, unsigned char *needle, unsigned long nlen) {\n int skip[256]; int k;\n if (nlen == 0) return (unsigned char *)haystack;\n for (k = 0; k < 256; ++k) skip[k] = nlen;\n for (k = 0; k < nlen - 1; ++k) skip[needle[k]] = nlen - k - 1;\n for (k = nlen - 1; k < hlen; k += skip[haystack[k]]) {\n int i; int j;\n for (j = nlen - 1, i = k; j >= 0 && haystack[i] == needle[j]; j--) i--;\n if (j == -1) return (unsigned char *)(haystack + i + 1);\n }\n return ((void *)0);\n}",
"variable_types": [
[
"haystack",
"unsigned char *"
],
[
"hlen",
"unsigned long"
],
[
"needle",
"unsigned char *"
],
[
"nlen",
"unsigned long"
],
[
"skip",
"int [256]"
],
[
"k",
"int"
],
[
"i",
"int"
],
[
"j",
"int"
]
],
"return_type": "unsigned char *",
"user_defined_types": [],
"binary_hash": "c27e4dc132a639427dcdcfd08504ba26e58e449a83ed64a9163333debb8ad52e"
}
] |
ca192c69248a7ea0b33b7120ab242338066d3562fa5c561d1696b63f89b77aae | rbu/driftnet | [
[
"mpeg_hdr_parse",
"->"
],
[
"mpeg_hdr_nextframe_offset",
"->"
],
[
"mpeg_hdr_print",
"->"
]
] | [
[
"mpeg_hdr_print",
"int __fastcall func2(FILE *a1, unsigned int *a2)\n{\nconst char *v2; // rdx\nconst char *v3; // rcx\nconst char *v4; // rdx\nint result; // eax\n\nfprintf(a1, \"version %s layer %d\\n\", (&vers_tbl)[*a2], a2[1]);\nif ( a2[2] )\nfprintf(a1, \" has CRC %04x\\n\", *((unsigned __int16 *)a2 + 6));\nfprintf(a1, \"bit rate %d kbps\\nsample rate %dHz\\n\", a2[4], a2[5]);\nif ( a2[6] )\nv2 = \"is\";\nelse\nv2 = \"is not\";\nfprintf(a1, \"%s padded\\n\", v2);\nfprintf(a1, \"%s\\n\", (&channel_tbl)[a2[8]]);\nif ( a2[8] == 1 )\nfprintf(a1, \"mode extension %d\\n\", *((unsigned __int8 *)a2 + 36));\nif ( a2[11] )\nv3 = \"is\";\nelse\nv3 = \"is not\";\nif ( a2[10] )\nv4 = \"is\";\nelse\nv4 = \"is not\";\nfprintf(a1, \"%s copyright\\n%s original\\n\", v4, v3);\nresult = *((unsigned __int8 *)a2 + 48);\nif ( (_BYTE)result )\nresult = fprintf(a1, \"emphasis %d\\n\", *((unsigned __int8 *)a2 + 48));\nreturn result;\n}"
]
] | [
{
"name": "mpeg_hdr_parse",
"canonical_name": "func0",
"repo": "rbu/driftnet",
"decompiled_code": "__int64 __fastcall mpeg_hdr_parse(__int64 a1, __int64 a2)\n{\nint v3; // eax\nint v4; // eax\nint v5; // eax\nunsigned int v6; // [rsp+48h] [rbp-10h]\nint v7; // [rsp+4Ch] [rbp-Ch]\n\n*(_QWORD *)a2 = 0LL;\n*(_QWORD *)(a2 + 8) = 0LL;\n*(_QWORD *)(a2 + 16) = 0LL;\n*(_QWORD *)(a2 + 24) = 0LL;\n*(_QWORD *)(a2 + 32) = 0LL;\n*(_QWORD *)(a2 + 40) = 0LL;\n*(_DWORD *)(a2 + 48) = 0;\nif ( *(_BYTE *)a1 != 0xFF || (*(_BYTE *)(a1 + 1) & 0xE0) != 224 )\nreturn 0LL;\nv6 = (*(unsigned __int8 *)(a1 + 2) << 8) | (*(unsigned __int8 *)(a1 + 1) << 16) | *(unsigned __int8 *)(a1 + 3);\nv3 = (v6 >> 19) & 3;\nif ( v3 == 3 )\n{\n*(_DWORD *)a2 = 1;\n}\nelse if ( v3 )\n{\nif ( v3 != 2 )\nreturn 0LL;\n*(_DWORD *)a2 = 2;\n}\nelse\n{\n*(_DWORD *)a2 = 3;\n}\nv4 = (v6 >> 17) & 3;\nswitch ( v4 )\n{\ncase 3:\n*(_DWORD *)(a2 + 4) = 1;\nbreak;\ncase 1:\n*(_DWORD *)(a2 + 4) = 3;\nbreak;\ncase 2:\n*(_DWORD *)(a2 + 4) = 2;\nbreak;\ndefault:\nreturn 0LL;\n}\n*(_DWORD *)(a2 + 8) = HIWORD(v6) & 1;\nif ( *(_DWORD *)(a2 + 8) )\n*(_WORD *)(a2 + 12) = _byteswap_ushort(*(_WORD *)(a1 + 5));\nif ( *(_DWORD *)a2 == 1 )\nv5 = 0;\nelse\nv5 = 3;\nv7 = *(_DWORD *)(a2 + 4) + v5 - 1;\nif ( *(_DWORD *)(a2 + 4) + v5 == 6 )\nv7 = 4;\n*(_DWORD *)(a2 + 16) = bitrate_tbl[5 * ((unsigned __int16)v6 >> 12) + v7];\nif ( *(_DWORD *)(a2 + 16) == -1 )\nreturn 0LL;\n*(_DWORD *)(a2 + 20) = samplerate_tbl[3 * ((v6 >> 10) & 3) - 1 + *(_DWORD *)a2];\nif ( *(_DWORD *)(a2 + 20) == -1 )\nreturn 0LL;\n*(_DWORD *)(a2 + 24) = (v6 >> 9) & 1;\n*(_DWORD *)(a2 + 32) = (unsigned __int8)v6 >> 6;\n*(_BYTE *)(a2 + 36) = (v6 >> 4) & 3;\n*(_DWORD *)(a2 + 40) = (v6 >> 3) & 1;\n*(_DWORD *)(a2 + 44) = (v6 >> 2) & 1;\n*(_BYTE *)(a2 + 48) = v6 & 3;\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, __int64 a2)\n{\nint v3; // eax\nint v4; // eax\nint v5; // eax\nunsigned int v6; // [rsp+48h] [rbp-10h]\nint v7; // [rsp+4Ch] [rbp-Ch]\n\n*(_QWORD *)a2 = 0LL;\n*(_QWORD *)(a2 + 8) = 0LL;\n*(_QWORD *)(a2 + 16) = 0LL;\n*(_QWORD *)(a2 + 24) = 0LL;\n*(_QWORD *)(a2 + 32) = 0LL;\n*(_QWORD *)(a2 + 40) = 0LL;\n*(_DWORD *)(a2 + 48) = 0;\nif ( *(_BYTE *)a1 != 0xFF || (*(_BYTE *)(a1 + 1) & 0xE0) != 224 )\nreturn 0LL;\nv6 = (*(unsigned __int8 *)(a1 + 2) << 8) | (*(unsigned __int8 *)(a1 + 1) << 16) | *(unsigned __int8 *)(a1 + 3);\nv3 = (v6 >> 19) & 3;\nif ( v3 == 3 )\n{\n*(_DWORD *)a2 = 1;\n}\nelse if ( v3 )\n{\nif ( v3 != 2 )\nreturn 0LL;\n*(_DWORD *)a2 = 2;\n}\nelse\n{\n*(_DWORD *)a2 = 3;\n}\nv4 = (v6 >> 17) & 3;\nswitch ( v4 )\n{\ncase 3:\n*(_DWORD *)(a2 + 4) = 1;\nbreak;\ncase 1:\n*(_DWORD *)(a2 + 4) = 3;\nbreak;\ncase 2:\n*(_DWORD *)(a2 + 4) = 2;\nbreak;\ndefault:\nreturn 0LL;\n}\n*(_DWORD *)(a2 + 8) = HIWORD(v6) & 1;\nif ( *(_DWORD *)(a2 + 8) )\n*(_WORD *)(a2 + 12) = _byteswap_ushort(*(_WORD *)(a1 + 5));\nif ( *(_DWORD *)a2 == 1 )\nv5 = 0;\nelse\nv5 = 3;\nv7 = *(_DWORD *)(a2 + 4) + v5 - 1;\nif ( *(_DWORD *)(a2 + 4) + v5 == 6 )\nv7 = 4;\n*(_DWORD *)(a2 + 16) = bitrate_tbl[5 * ((unsigned __int16)v6 >> 12) + v7];\nif ( *(_DWORD *)(a2 + 16) == -1 )\nreturn 0LL;\n*(_DWORD *)(a2 + 20) = samplerate_tbl[3 * ((v6 >> 10) & 3) - 1 + *(_DWORD *)a2];\nif ( *(_DWORD *)(a2 + 20) == -1 )\nreturn 0LL;\n*(_DWORD *)(a2 + 24) = (v6 >> 9) & 1;\n*(_DWORD *)(a2 + 32) = (unsigned __int8)v6 >> 6;\n*(_BYTE *)(a2 + 36) = (v6 >> 4) & 3;\n*(_DWORD *)(a2 + 40) = (v6 >> 3) & 1;\n*(_DWORD *)(a2 + 44) = (v6 >> 2) & 1;\n*(_BYTE *)(a2 + 48) = v6 & 3;\nreturn 1LL;\n}",
"original_code": "int mpeg_hdr_parse(const uint8_t *data, struct mpeg_audio_hdr *h) {\n struct mpeg_audio_hdr hz = {0};\n uint32_t hh;\n int i;\n *h = hz;\n if (data[0] != 0xff || (data[1] & 0xe0) != 0xe0)\n return 0;\n hh = (data[1] << 16) | (data[2] << 8) | data[3];\n switch ((((hh) & (((2 << ((20) - (19))) - 1) << (19))) >> (19))) {\n case 0: h->version = m_vers_2_5; break;\n case 2: h->version = m_vers_2; break;\n case 3: h->version = m_vers_1; break;\n default: return 0;\n }\n switch ((((hh) & (((2 << ((18) - (17))) - 1) << (17))) >> (17))) {\n case 1: h->layer = m_layer_3; break;\n case 2: h->layer = m_layer_2; break;\n case 3: h->layer = m_layer_1; break;\n default: return 0;\n }\n h->has_crc = (((hh) & (((2 << ((16) - (16))) - 1) << (16))) >> (16));\n if (h->has_crc)\n h->crc = (data[5] << 8) | (data[6]);\n i = (h->version == m_vers_1) ? 0 : 3;\n i += h->layer - 1;\n if (i == 5) i = 4;\n h->bitrate = bitrate_tbl[(((hh) & (((2 << ((15) - (12))) - 1) << (12))) >> (12))][i];\n if (h->bitrate == -1)\n return 0;\n i = h->version - 1;\n h->samplerate = samplerate_tbl[(((hh) & (((2 << ((11) - (10))) - 1) << (10))) >> (10))][i];\n if (h->samplerate == - 1)\n return 0;\n h->padded = (((hh) & (((2 << ((9) - (9))) - 1) << (9))) >> (9));\n h->channels = (((hh) & (((2 << ((7) - (6))) - 1) << (6))) >> (6));\n h->mode_extn = (((hh) & (((2 << ((5) - (4))) - 1) << (4))) >> (4));\n h->copyr = (((hh) & (((2 << ((3) - (3))) - 1) << (3))) >> (3));\n h->original = (((hh) & (((2 << ((2) - (2))) - 1) << (2))) >> (2));\n h->emph = (((hh) & (((2 << ((1) - (0))) - 1) << (0))) >> (0));\n return 1;\n}",
"canonical_original_code": "int mpeg_hdr_parse(unsigned char *data, struct mpeg_audio_hdr *h) {\n struct mpeg_audio_hdr hz = {0};\n unsigned int hh;\n int i;\n *h = hz;\n if (data[0] != 0xff || (data[1] & 0xe0) != 0xe0)\n return 0;\n hh = (data[1] << 16) | (data[2] << 8) | data[3];\n switch ((((hh) & (((2 << ((20) - (19))) - 1) << (19))) >> (19))) {\n case 0: h->version = m_vers_2_5; break;\n case 2: h->version = m_vers_2; break;\n case 3: h->version = m_vers_1; break;\n default: return 0;\n }\n switch ((((hh) & (((2 << ((18) - (17))) - 1) << (17))) >> (17))) {\n case 1: h->layer = m_layer_3; break;\n case 2: h->layer = m_layer_2; break;\n case 3: h->layer = m_layer_1; break;\n default: return 0;\n }\n h->has_crc = (((hh) & (((2 << ((16) - (16))) - 1) << (16))) >> (16));\n if (h->has_crc)\n h->crc = (data[5] << 8) | (data[6]);\n i = (h->version == m_vers_1) ? 0 : 3;\n i += h->layer - 1;\n if (i == 5) i = 4;\n h->bitrate = bitrate_tbl[(((hh) & (((2 << ((15) - (12))) - 1) << (12))) >> (12))][i];\n if (h->bitrate == -1)\n return 0;\n i = h->version - 1;\n h->samplerate = samplerate_tbl[(((hh) & (((2 << ((11) - (10))) - 1) << (10))) >> (10))][i];\n if (h->samplerate == - 1)\n return 0;\n h->padded = (((hh) & (((2 << ((9) - (9))) - 1) << (9))) >> (9));\n h->channels = (((hh) & (((2 << ((7) - (6))) - 1) << (6))) >> (6));\n h->mode_extn = (((hh) & (((2 << ((5) - (4))) - 1) << (4))) >> (4));\n h->copyr = (((hh) & (((2 << ((3) - (3))) - 1) << (3))) >> (3));\n h->original = (((hh) & (((2 << ((2) - (2))) - 1) << (2))) >> (2));\n h->emph = (((hh) & (((2 << ((1) - (0))) - 1) << (0))) >> (0));\n return 1;\n}",
"variable_types": [
[
"data",
"unsigned char *"
],
[
"h",
"struct mpeg_audio_hdr { enum { m_vers_unknown=0, m_vers_1=1, m_vers_2=2, m_vers_2_5=3 } version; enum { m_layer_unknown=0, m_layer_1=1, m_layer_2=2, m_layer_3=3 } layer; int has_crc; unsigned short crc; int bitrate; int samplerate; int padded; int priv; enum { m_chan_stereo=0, m_chan_joint=1, m_chan_dual=2, m_chan_mono=3 } channels; unsigned char mode_extn; int copyr; unsigned char emph; } *"
],
[
"hz",
"struct mpeg_audio_hdr { enum { m_vers_unknown=0, m_vers_1=1, m_vers_2=2, m_vers_2_5=3 } version; enum { m_layer_unknown=0, m_layer_1=1, m_layer_2=2, m_layer_3=3 } layer; int has_crc; unsigned short crc; int bitrate; int samplerate; int padded; int priv; enum { m_chan_stereo=0, m_chan_joint=1, m_chan_dual=2, m_chan_mono=3 } channels; unsigned char mode_extn; int copyr; unsigned char emph; }"
],
[
"hh",
"unsigned int"
],
[
"i",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct mpeg_audio_hdr { enum { m_vers_unknown=0, m_vers_1=1, m_vers_2=2, m_vers_2_5=3 } version; enum { m_layer_unknown=0, m_layer_1=1, m_layer_2=2, m_layer_3=3 } layer; int has_crc; unsigned short crc; int bitrate; int samplerate; int padded; int priv; enum { m_chan_stereo=0, m_chan_joint=1, m_chan_dual=2, m_chan_mono=3 } channels; unsigned char mode_extn; int copyr; unsigned char emph; }"
],
"binary_hash": "ca192c69248a7ea0b33b7120ab242338066d3562fa5c561d1696b63f89b77aae"
},
{
"name": "mpeg_hdr_nextframe_offset",
"canonical_name": "func1",
"repo": "rbu/driftnet",
"decompiled_code": "__int64 __fastcall mpeg_hdr_nextframe_offset(_DWORD *a1)\n{\n__int64 result; // rax\n\nif ( a1[1] == 1 )\nLODWORD(result) = 4 * (12000 * a1[4] / a1[5] + a1[6]);\nelse\nLODWORD(result) = 144000 * a1[4] / a1[5] + a1[6];\nreturn (unsigned int)result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(_DWORD *a1)\n{\n__int64 result; // rax\n\nif ( a1[1] == 1 )\nLODWORD(result) = 4 * (12000 * a1[4] / a1[5] + a1[6]);\nelse\nLODWORD(result) = 144000 * a1[4] / a1[5] + a1[6];\nreturn (unsigned int)result;\n}",
"original_code": "int mpeg_hdr_nextframe_offset(const struct mpeg_audio_hdr *h) {\n int off = 0;\n if (h->layer == m_layer_1)\n off += ((12 * h->bitrate * 1000) / h->samplerate + h->padded) * 4;\n else\n off += (144 * h->bitrate * 1000) / h->samplerate + h->padded;\n return off;\n}",
"canonical_original_code": "int mpeg_hdr_nextframe_offset(struct mpeg_audio_hdr *h) {\n int off = 0;\n if (h->layer == m_layer_1)\n off += ((12 * h->bitrate * 1000) / h->samplerate + h->padded) * 4;\n else\n off += (144 * h->bitrate * 1000) / h->samplerate + h->padded;\n return off;\n}",
"variable_types": [
[
"h",
"struct mpeg_audio_hdr { enum { m_vers_unknown=0, m_vers_1=1, m_vers_2=2, m_vers_2_5=3 } version; enum { m_layer_unknown=0, m_layer_1=1, m_layer_2=2, m_layer_3=3 } layer; int has_crc; unsigned short crc; int bitrate; int samplerate; int padded; int priv; enum { m_chan_stereo=0, m_chan_joint=1, m_chan_dual=2, m_chan_mono=3 } channels; unsigned char mode_extn; int copyr; unsigned char emph; } *"
],
[
"off",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct mpeg_audio_hdr { enum { m_vers_unknown=0, m_vers_1=1, m_vers_2=2, m_vers_2_5=3 } version; enum { m_layer_unknown=0, m_layer_1=1, m_layer_2=2, m_layer_3=3 } layer; int has_crc; unsigned short crc; int bitrate; int samplerate; int padded; int priv; enum { m_chan_stereo=0, m_chan_joint=1, m_chan_dual=2, m_chan_mono=3 } channels; unsigned char mode_extn; int copyr; unsigned char emph; }"
],
"binary_hash": "ca192c69248a7ea0b33b7120ab242338066d3562fa5c561d1696b63f89b77aae"
}
] |
e4a0bdc2ebc903fea49aadb1f66358b8070c7add9e8559956a99dc4cb004401b | rbu/driftnet | [
[
"audiochunk_new",
"->",
"mpeg_submit_chunk",
"do_mpeg_player"
],
[
"audiochunk_delete",
"->",
"mpeg_play"
],
[
"audiochunk_write",
"->",
"mpeg_play"
],
[
"mpeg_submit_chunk",
"->",
"audiochunk_new"
],
[
"mpeg_play",
"->",
"audiochunk_write",
"audiochunk_delete"
],
[
"mpeg_player_manager",
"->",
"do_mpeg_player"
],
[
"do_mpeg_player",
"->",
"audiochunk_new",
"mpeg_player_manager"
]
] | [] | [
{
"name": "audiochunk_new",
"canonical_name": "func0",
"repo": "rbu/driftnet",
"decompiled_code": "__int64 __fastcall audiochunk_new(const void *a1, size_t a2)\n{\n__int64 v3; // [rsp+28h] [rbp-8h]\n\nv3 = xmalloc(24LL);\n*(_QWORD *)v3 = 0LL;\n*(_QWORD *)(v3 + 8) = 0LL;\n*(_QWORD *)(v3 + 16) = 0LL;\n*(_QWORD *)(v3 + 8) = a2;\nif ( a1 )\n{\n*(_QWORD *)v3 = xmalloc(a2);\nmemcpy(*(void **)v3, a1, a2);\n}\nreturn v3;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(const void *a1, size_t a2)\n{\n__int64 v3; // [rsp+28h] [rbp-8h]\n\nv3 = xmalloc(24LL);\n*(_QWORD *)v3 = 0LL;\n*(_QWORD *)(v3 + 8) = 0LL;\n*(_QWORD *)(v3 + 16) = 0LL;\n*(_QWORD *)(v3 + 8) = a2;\nif ( a1 )\n{\n*(_QWORD *)v3 = xmalloc(a2);\nmemcpy(*(void **)v3, a1, a2);\n}\nreturn v3;\n}",
"original_code": "static audiochunk audiochunk_new(const unsigned char *data, const size_t len) {\n audiochunk A;\n do { struct _audiochunk as__z = {0}; A = xmalloc(sizeof *A); *A = as__z; } while (0);\n A->len = len;\n if (data) {\n A->data = xmalloc(len);\n memcpy(A->data, data, len);\n }\n return A;\n}",
"canonical_original_code": "static struct _audiochunk *audiochunk_new(unsigned char *data, unsigned long len) {\n struct _audiochunk *A;\n do { struct _audiochunk as__z = {0}; A = xmalloc(sizeof *A); *A = as__z; } while (0);\n A->len = len;\n if (data) {\n A->data = xmalloc(len);\n memcpy(A->data, data, len);\n }\n return A;\n}",
"variable_types": [
[
"data",
"unsigned char *"
],
[
"len",
"unsigned long"
],
[
"A",
"struct _audiochunk { unsigned char *data; unsigned long len; struct _audiochunk *next; } *"
],
[
"as__z",
"struct _audiochunk { unsigned char *data; unsigned long len; struct _audiochunk *next; }"
]
],
"return_type": "struct _audiochunk { unsigned char *data; unsigned long len; struct _audiochunk *next; } *",
"user_defined_types": [
"struct _audiochunk { unsigned char *data; unsigned long len; struct _audiochunk *next; }"
],
"binary_hash": "e4a0bdc2ebc903fea49aadb1f66358b8070c7add9e8559956a99dc4cb004401b"
},
{
"name": "audiochunk_delete",
"canonical_name": "func1",
"repo": "rbu/driftnet",
"decompiled_code": "__int64 __fastcall audiochunk_delete(_QWORD *a1)\n{\nxfree(*a1);\nreturn xfree(a1);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(_QWORD *a1)\n{\nxfree(*a1);\nreturn xfree(a1);\n}",
"original_code": "static void audiochunk_delete(audiochunk A) {\n xfree(A->data);\n xfree(A);\n}",
"canonical_original_code": "static void audiochunk_delete(struct _audiochunk *A) {\n xfree(A->data);\n xfree(A);\n}",
"variable_types": [
[
"A",
"struct _audiochunk { unsigned char *data; unsigned long len; struct _audiochunk *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _audiochunk { unsigned char *data; unsigned long len; struct _audiochunk *next; }"
],
"binary_hash": "e4a0bdc2ebc903fea49aadb1f66358b8070c7add9e8559956a99dc4cb004401b"
},
{
"name": "audiochunk_write",
"canonical_name": "func2",
"repo": "rbu/driftnet",
"decompiled_code": "__int64 __fastcall audiochunk_write(char **a1, int a2)\n{\nsize_t n; // [rsp+20h] [rbp-10h]\nchar *buf; // [rsp+28h] [rbp-8h]\n\nif ( !a1[1] )\nreturn 0LL;\nbuf = *a1;\ndo\n{\nn = 1024LL;\nif ( buf + 1024 > &a1[1][(_QWORD)*a1] )\nn = &a1[1][(_QWORD)*a1] - buf;\nif ( write(a2, buf, n) == -1 && *_errno_location() != 4 )\nreturn 0xFFFFFFFFLL;\nbuf += n;\n}\nwhile ( buf < &a1[1][(_QWORD)*a1] );\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(char **a1, int a2)\n{\nsize_t n; // [rsp+20h] [rbp-10h]\nchar *buf; // [rsp+28h] [rbp-8h]\n\nif ( !a1[1] )\nreturn 0LL;\nbuf = *a1;\ndo\n{\nn = 1024LL;\nif ( buf + 1024 > &a1[1][(_QWORD)*a1] )\nn = &a1[1][(_QWORD)*a1] - buf;\nif ( write(a2, buf, n) == -1 && *_errno_location() != 4 )\nreturn 0xFFFFFFFFLL;\nbuf += n;\n}\nwhile ( buf < &a1[1][(_QWORD)*a1] );\nreturn 0LL;\n}",
"original_code": "static int audiochunk_write(const audiochunk A, int fd) {\n const unsigned char *p;\n ssize_t n;\n if (A->len == 0)\n return 0;\n p = A->data;\n do {\n size_t d = 1024;\n if (p + d > A->data + A->len)\n d = A->data + A->len - p;\n n = write(fd, p, d);\n if (n == -1 && (*__errno_location ()) != 4)\n return -1;\n else\n p += d;\n } while (p < A->data + A->len);\n return 0;\n}",
"canonical_original_code": "static int audiochunk_write(struct _audiochunk *A, int fd) {\n unsigned char *p;\n long n;\n if (A->len == 0)\n return 0;\n p = A->data;\n do {\n unsigned long d = 1024;\n if (p + d > A->data + A->len)\n d = A->data + A->len - p;\n n = write(fd, p, d);\n if (n == -1 && (*__errno_location ()) != 4)\n return -1;\n else\n p += d;\n } while (p < A->data + A->len);\n return 0;\n}",
"variable_types": [
[
"A",
"struct _audiochunk { unsigned char *data; unsigned long len; struct _audiochunk *next; } *"
],
[
"fd",
"int"
],
[
"p",
"unsigned char *"
],
[
"n",
"long"
],
[
"d",
"unsigned long"
]
],
"return_type": "int",
"user_defined_types": [
"struct _audiochunk { unsigned char *data; unsigned long len; struct _audiochunk *next; }"
],
"binary_hash": "e4a0bdc2ebc903fea49aadb1f66358b8070c7add9e8559956a99dc4cb004401b"
},
{
"name": "mpeg_submit_chunk",
"canonical_name": "func3",
"repo": "rbu/driftnet",
"decompiled_code": "int __fastcall mpeg_submit_chunk(const void *a1, size_t a2)\n{\npthread_mutex_lock(&mpeg_mtx);\nif ( (unsigned __int64)buffered <= 0x800000 )\n{\n*(_QWORD *)(wr + 16) = audiochunk_new(a1, a2);\nwr = *(_QWORD *)(wr + 16);\nbuffered += a2;\n}\nelse if ( verbose )\n{\nfprintf(stderr, \"driftnet: MPEG buffer full with %d bytes\\n\", buffered);\n}\nreturn pthread_mutex_unlock(&mpeg_mtx);\n}\n",
"canonical_decompiled_code": "int __fastcall func3(const void *a1, size_t a2)\n{\npthread_mutex_lock(&mpeg_mtx);\nif ( (unsigned __int64)buffered <= 0x800000 )\n{\n*(_QWORD *)(wr + 16) = func0(a1, a2);\nwr = *(_QWORD *)(wr + 16);\nbuffered += a2;\n}\nelse if ( verbose )\n{\nfprintf(stderr, \"driftnet: MPEG buffer full with %d bytes\\n\", buffered);\n}\nreturn pthread_mutex_unlock(&mpeg_mtx);\n}",
"original_code": "void mpeg_submit_chunk(const unsigned char *data, const size_t len) {\n audiochunk A;\n pthread_mutex_lock(&mpeg_mtx);\n if (buffered > (8 * 1024 * 1024)) {\n if (verbose)\n fprintf(stderr, \"driftnet\"\": MPEG buffer full with %d bytes\\n\", buffered);\n goto finish;\n }\n A = audiochunk_new(data, len);\n wr->next = A;\n wr = wr->next;\n buffered += len;\nfinish:\n pthread_mutex_unlock(&mpeg_mtx);\n}",
"canonical_original_code": "void mpeg_submit_chunk(unsigned char *data, unsigned long len) {\n struct _audiochunk *A;\n pthread_mutex_lock(&mpeg_mtx);\n if (buffered > (8 * 1024 * 1024)) {\n if (verbose)\n fprintf(stderr, \"driftnet\"\": MPEG buffer full with %d bytes\\n\", buffered);\n goto finish;\n }\n A = audiochunk_new(data, len);\n wr->next = A;\n wr = wr->next;\n buffered += len;\nfinish:\n pthread_mutex_unlock(&mpeg_mtx);\n}",
"variable_types": [
[
"data",
"unsigned char *"
],
[
"len",
"unsigned long"
],
[
"A",
"struct _audiochunk { unsigned char *data; unsigned long len; struct _audiochunk *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct _audiochunk { unsigned char *data; unsigned long len; struct _audiochunk *next; }"
],
"binary_hash": "e4a0bdc2ebc903fea49aadb1f66358b8070c7add9e8559956a99dc4cb004401b"
},
{
"name": "mpeg_play",
"canonical_name": "func4",
"repo": "rbu/driftnet",
"decompiled_code": "void __fastcall __noreturn mpeg_play(void *a1)\n{\nint *v1; // rax\nchar *v2; // rax\nstruct timespec requested_time; // [rsp+10h] [rbp-20h] BYREF\nchar **v4; // [rsp+20h] [rbp-10h]\nvoid *v5; // [rsp+28h] [rbp-8h]\n\nv5 = a1;\nwhile ( 1 )\n{\nwhile ( 1 )\n{\npthread_mutex_lock(&mpeg_mtx);\nv4 = (char **)*((_QWORD *)rd + 2);\npthread_mutex_unlock(&mpeg_mtx);\nif ( v4 )\nbreak;\nrequested_time.tv_sec = 0LL;\nrequested_time.tv_nsec = 100000000LL;\nnanosleep(&requested_time, 0LL);\n}\nif ( (unsigned int)audiochunk_write(v4, mpeg_fd) == -1 )\n{\nv1 = _errno_location();\nv2 = strerror(*v1);\nfprintf(stderr, \"driftnet: write to MPEG player: %s\\n\", v2);\n}\npthread_mutex_lock(&mpeg_mtx);\nbuffered -= (__int64)v4[1];\naudiochunk_delete(rd);\nrd = v4;\npthread_mutex_unlock(&mpeg_mtx);\n}\n}\n",
"canonical_decompiled_code": "void __fastcall __noreturn func4(void *a1)\n{\nint *v1; // rax\nchar *v2; // rax\nstruct timespec requested_time; // [rsp+10h] [rbp-20h] BYREF\nchar **v4; // [rsp+20h] [rbp-10h]\nvoid *v5; // [rsp+28h] [rbp-8h]\n\nv5 = a1;\nwhile ( 1 )\n{\nwhile ( 1 )\n{\npthread_mutex_lock(&mpeg_mtx);\nv4 = (char **)*((_QWORD *)rd + 2);\npthread_mutex_unlock(&mpeg_mtx);\nif ( v4 )\nbreak;\nrequested_time.tv_sec = 0LL;\nrequested_time.tv_nsec = 100000000LL;\nnanosleep(&requested_time, 0LL);\n}\nif ( (unsigned int)func2(v4, mpeg_fd) == -1 )\n{\nv1 = _errno_location();\nv2 = strerror(*v1);\nfprintf(stderr, \"driftnet: write to MPEG player: %s\\n\", v2);\n}\npthread_mutex_lock(&mpeg_mtx);\nbuffered -= (__int64)v4[1];\nfunc1(rd);\nrd = v4;\npthread_mutex_unlock(&mpeg_mtx);\n}\n}",
"original_code": "static void *mpeg_play(void *a) {\n audiochunk A;\n A = (audiochunk)a;\n while (1) {\n audiochunk A;\n pthread_mutex_lock(&mpeg_mtx);\n A = rd->next;\n pthread_mutex_unlock(&mpeg_mtx);\n if (A) {\n if (audiochunk_write(A, mpeg_fd) == -1)\n fprintf(stderr, \"driftnet\"\": write to MPEG player: %s\\n\", strerror((*__errno_location ())));\n pthread_mutex_lock(&mpeg_mtx);\n buffered -= A->len;\n audiochunk_delete(rd);\n rd = A;\n pthread_mutex_unlock(&mpeg_mtx);\n } else {\n struct timespec tm;\n tm.tv_sec = 0;\n tm.tv_nsec = 100000000;\n nanosleep(&tm, ((void *)0));\n }\n }\n return ((void *)0);\n}",
"canonical_original_code": "static void *mpeg_play(void *a) {\n struct _audiochunk *A;\n A = (struct _audiochunk *)a;\n while (1) {\n struct _audiochunk *A;\n pthread_mutex_lock(&mpeg_mtx);\n A = rd->next;\n pthread_mutex_unlock(&mpeg_mtx);\n if (A) {\n if (audiochunk_write(A, mpeg_fd) == -1)\n fprintf(stderr, \"driftnet\"\": write to MPEG player: %s\\n\", strerror((*__errno_location ())));\n pthread_mutex_lock(&mpeg_mtx);\n buffered -= A->len;\n audiochunk_delete(rd);\n rd = A;\n pthread_mutex_unlock(&mpeg_mtx);\n } else {\n struct timespec tm;\n tm.tv_sec = 0;\n tm.tv_nsec = 100000000;\n nanosleep(&tm, ((void *)0));\n }\n }\n return ((void *)0);\n}",
"variable_types": [
[
"a",
"void *"
],
[
"A",
"struct _audiochunk { unsigned char *data; unsigned long len; struct _audiochunk *next; } *"
],
[
"tm",
"struct timespec { long tv_sec; long tv_nsec; }"
]
],
"return_type": "void *",
"user_defined_types": [
"struct timespec { long tv_sec; long tv_nsec; }",
"struct _audiochunk { unsigned char *data; unsigned long len; struct _audiochunk *next; }"
],
"binary_hash": "e4a0bdc2ebc903fea49aadb1f66358b8070c7add9e8559956a99dc4cb004401b"
},
{
"name": "mpeg_player_manager",
"canonical_name": "func5",
"repo": "rbu/driftnet",
"decompiled_code": "int mpeg_player_manager()\n{\nint *v0; // rax\nchar *v1; // rax\nint *v2; // rax\nchar *v3; // rax\nint v4; // eax\nint result; // eax\nint stat_loc; // [rsp+Ch] [rbp-B4h] BYREF\nstruct sigaction v7; // [rsp+10h] [rbp-B0h] BYREF\ntime_t v8; // [rsp+B0h] [rbp-10h]\n__pid_t pid; // [rsp+BCh] [rbp-4h]\n\nmemset(&v7, 0, sizeof(v7));\nv7.sa_handler = 0LL;\nsigaction(17, &v7, 0LL);\nwhile ( 1 )\n{\nresult = foad;\nif ( foad )\nbreak;\nfprintf(stderr, \"driftnet: starting MPEG player `%s'\\n\", audio_mpeg_player);\nv8 = time(0LL);\npid = fork();\nif ( pid == -1 )\n{\nv2 = _errno_location();\nv3 = strerror(*v2);\nfprintf(stderr, \"driftnet: fork: %s\\n\", v3);\nexit(-1);\n}\nif ( !pid )\n{\nexecl(\"/bin/sh\", \"/bin/sh\", \"-c\", audio_mpeg_player, 0LL);\nv0 = _errno_location();\nv1 = strerror(*v0);\nfprintf(stderr, \"driftnet: exec: %s\\n\", v1);\nexit(-1);\n}\nif ( verbose )\nfprintf(stderr, \"driftnet: MPEG player has PID %d\\n\", (unsigned int)pid);\nwaitpid(pid, &stat_loc, 0);\npid = 0;\nif ( verbose )\n{\nif ( (stat_loc & 0x7F) != 0 )\n{\nif ( (char)((stat_loc & 0x7F) + 1) >> 1 > 0 )\nfprintf(stderr, \"driftnet: MPEG player killed by signal %d\\n\", stat_loc & 0x7F);\n}\nelse\n{\nfprintf(stderr, \"driftnet: MPEG player exited with status %d\\n\", BYTE1(stat_loc));\n}\n}\nif ( !foad && time(0LL) - v8 <= 4 )\n{\nv4 = time(0LL);\nfprintf(stderr, \"driftnet: MPEG player expired after %d seconds, sleeping for a bit\\n\", (unsigned int)(v4 - v8));\nsleep(5u);\n}\n}\nif ( pid )\nresult = kill(pid, 15);\nreturn result;\n}\n",
"canonical_decompiled_code": "int func5()\n{\nint *v0; // rax\nchar *v1; // rax\nint *v2; // rax\nchar *v3; // rax\nint v4; // eax\nint result; // eax\nint stat_loc; // [rsp+Ch] [rbp-B4h] BYREF\nstruct sigaction v7; // [rsp+10h] [rbp-B0h] BYREF\ntime_t v8; // [rsp+B0h] [rbp-10h]\n__pid_t pid; // [rsp+BCh] [rbp-4h]\n\nmemset(&v7, 0, sizeof(v7));\nv7.sa_handler = 0LL;\nsigaction(17, &v7, 0LL);\nwhile ( 1 )\n{\nresult = foad;\nif ( foad )\nbreak;\nfprintf(stderr, \"driftnet: starting MPEG player `%s'\\n\", audio_mpeg_player);\nv8 = time(0LL);\npid = fork();\nif ( pid == -1 )\n{\nv2 = _errno_location();\nv3 = strerror(*v2);\nfprintf(stderr, \"driftnet: fork: %s\\n\", v3);\nexit(-1);\n}\nif ( !pid )\n{\nexecl(\"/bin/sh\", \"/bin/sh\", \"-c\", audio_mpeg_player, 0LL);\nv0 = _errno_location();\nv1 = strerror(*v0);\nfprintf(stderr, \"driftnet: exec: %s\\n\", v1);\nexit(-1);\n}\nif ( verbose )\nfprintf(stderr, \"driftnet: MPEG player has PID %d\\n\", (unsigned int)pid);\nwaitpid(pid, &stat_loc, 0);\npid = 0;\nif ( verbose )\n{\nif ( (stat_loc & 0x7F) != 0 )\n{\nif ( (char)((stat_loc & 0x7F) + 1) >> 1 > 0 )\nfprintf(stderr, \"driftnet: MPEG player killed by signal %d\\n\", stat_loc & 0x7F);\n}\nelse\n{\nfprintf(stderr, \"driftnet: MPEG player exited with status %d\\n\", BYTE1(stat_loc));\n}\n}\nif ( !foad && time(0LL) - v8 <= 4 )\n{\nv4 = time(0LL);\nfprintf(stderr, \"driftnet: MPEG player expired after %d seconds, sleeping for a bit\\n\", (unsigned int)(v4 - v8));\nsleep(5u);\n}\n}\nif ( pid )\nresult = kill(pid, 15);\nreturn result;\n}",
"original_code": "static void mpeg_player_manager(void) {\n extern sig_atomic_t foad;\n struct sigaction sa = {{0}};\n pid_t mpeg_pid;\n sa.__sigaction_handler.sa_handler = ((__sighandler_t) 0);\n sigaction(17, &sa, ((void *)0));\n while (!foad) {\n time_t whenstarted;\n int st;\n fprintf(stderr, \"driftnet\"\": starting MPEG player `%s'\\n\", audio_mpeg_player);\n whenstarted = time(((void *)0));\n switch ((mpeg_pid = fork())) {\n case 0:\n execl(\"/bin/sh\", \"/bin/sh\", \"-c\", audio_mpeg_player, ((void *)0));\n fprintf(stderr, \"driftnet\"\": exec: %s\\n\", strerror((*__errno_location ())));\n exit(-1);\n break;\n case -1:\n fprintf(stderr, \"driftnet\"\": fork: %s\\n\", strerror((*__errno_location ())));\n exit(-1);\n break;\n default:\n if (verbose)\n fprintf(stderr, \"driftnet\"\": MPEG player has PID %d\\n\", (int)mpeg_pid);\n break;\n }\n waitpid(mpeg_pid, &st, 0);\n mpeg_pid = 0;\n if (verbose) {\n if ((((st) & 0x7f) == 0))\n fprintf(stderr, \"driftnet\"\": MPEG player exited with status %d\\n\", (((st) & 0xff00) >> 8));\n else if ((((signed char) (((st) & 0x7f) + 1) >> 1) > 0))\n fprintf(stderr, \"driftnet\"\": MPEG player killed by signal %d\\n\", ((st) & 0x7f));\n }\n if (!foad && time(((void *)0)) - whenstarted < 5) {\n fprintf(stderr, \"driftnet\"\": MPEG player expired after %d seconds, sleeping for a bit\\n\", (int)(time(((void *)0)) - whenstarted));\n sleep(5);\n }\n }\n if (mpeg_pid)\n kill(mpeg_pid, 15);\n}",
"canonical_original_code": "static void mpeg_player_manager() {\n extern int foad;\n struct sigaction sa = {{0}};\n int mpeg_pid;\n sa.__sigaction_handler.sa_handler = ((void (*)(int)) 0);\n sigaction(17, &sa, ((void *)0));\n while (!foad) {\n long whenstarted;\n int st;\n fprintf(stderr, \"driftnet\"\": starting MPEG player `%s'\\n\", audio_mpeg_player);\n whenstarted = time(((void *)0));\n switch ((mpeg_pid = fork())) {\n case 0:\n execl(\"/bin/sh\", \"/bin/sh\", \"-c\", audio_mpeg_player, ((void *)0));\n fprintf(stderr, \"driftnet\"\": exec: %s\\n\", strerror((*__errno_location ())));\n exit(-1);\n break;\n case -1:\n fprintf(stderr, \"driftnet\"\": fork: %s\\n\", strerror((*__errno_location ())));\n exit(-1);\n break;\n default:\n if (verbose)\n fprintf(stderr, \"driftnet\"\": MPEG player has PID %d\\n\", (int)mpeg_pid);\n break;\n }\n waitpid(mpeg_pid, &st, 0);\n mpeg_pid = 0;\n if (verbose) {\n if ((((st) & 0x7f) == 0))\n fprintf(stderr, \"driftnet\"\": MPEG player exited with status %d\\n\", (((st) & 0xff00) >> 8));\n else if ((((char) (((st) & 0x7f) + 1) >> 1) > 0))\n fprintf(stderr, \"driftnet\"\": MPEG player killed by signal %d\\n\", ((st) & 0x7f));\n }\n if (!foad && time(((void *)0)) - whenstarted < 5) {\n fprintf(stderr, \"driftnet\"\": MPEG player expired after %d seconds, sleeping for a bit\\n\", (int)(time(((void *)0)) - whenstarted));\n sleep(5);\n }\n }\n if (mpeg_pid)\n kill(mpeg_pid, 15);\n}",
"variable_types": [
[
"foad",
"int"
],
[
"sa",
"struct sigaction { union { void (*sa_handler)(int); void (*sa_sigaction)(int, struct siginfo_t { int si_signo; int si_errno; int si_code; int __pad0; union { int _pad[-1]; struct { int si_pid; unsigned int si_uid; } _kill; struct { int si_tid; int si_overrun; union sigval { int sival_int; void *sival_ptr; } si_sigval; } _timer; struct { int si_pid; unsigned int si_uid; union sigval si_sigval; } _rt; struct { int si_pid; unsigned int si_uid; int si_status; long si_utime; long si_stime; } _sigchld; struct { void *si_addr; short si_addr_lsb; union { struct { void *_lower; void *_upper; } _addr_bnd; unsigned int _pkey; } _bounds; } _sigfault; struct { long si_band; int si_fd; } _sigpoll; struct { void *_call_addr; int _syscall; unsigned int _arch; } _sigsys; } _sifields; } *, void *); } __sigaction_handler; struct __sigset_t { unsigned long __val[-1]; } sa_mask; int sa_flags; void (*sa_restorer)(); }"
],
[
"mpeg_pid",
"int"
],
[
"whenstarted",
"long"
],
[
"st",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct sigaction { union { void (*sa_handler)(int); void (*sa_sigaction)(int, struct siginfo_t *, void *); } __sigaction_handler; struct __sigset_t sa_mask; int sa_flags; void (*sa_restorer)(); }",
"struct __sigset_t { unsigned long __val[-1]; }",
"struct siginfo_t { int si_signo; int si_errno; int si_code; int __pad0; union { int _pad[-1]; struct { int si_pid; unsigned int si_uid; } _kill; struct { int si_tid; int si_overrun; union sigval si_sigval; } _timer; struct { int si_pid; unsigned int si_uid; union sigval si_sigval; } _rt; struct { int si_pid; unsigned int si_uid; int si_status; long si_utime; long si_stime; } _sigchld; struct { void *si_addr; short si_addr_lsb; union { struct { void *_lower; void *_upper; } _addr_bnd; unsigned int _pkey; } _bounds; } _sigfault; struct { long si_band; int si_fd; } _sigpoll; struct { void *_call_addr; int _syscall; unsigned int _arch; } _sigsys; } _sifields; }",
"union sigval { int sival_int; void *sival_ptr; }"
],
"binary_hash": "e4a0bdc2ebc903fea49aadb1f66358b8070c7add9e8559956a99dc4cb004401b"
},
{
"name": "do_mpeg_player",
"canonical_name": "func6",
"repo": "rbu/driftnet",
"decompiled_code": "int do_mpeg_player()\n{\npthread_t newthread; // [rsp+0h] [rbp-10h] BYREF\nint pipedes[2]; // [rsp+8h] [rbp-8h] BYREF\n\nlist = audiochunk_new(0LL, 0LL);\nwr = list;\nrd = (void *)list;\npipe(pipedes);\nmpeg_mgr_pid = fork();\nif ( !mpeg_mgr_pid )\n{\nclose(pipedes[1]);\ndup2(pipedes[0], 0);\nmpeg_player_manager();\nexit(-1);\n}\nclose(pipedes[0]);\nmpeg_fd = pipedes[1];\nreturn pthread_create(&newthread, 0LL, (void *(*)(void *))mpeg_play, rd);\n}\n",
"canonical_decompiled_code": "int func6()\n{\npthread_t newthread; // [rsp+0h] [rbp-10h] BYREF\nint pipedes[2]; // [rsp+8h] [rbp-8h] BYREF\n\nlist = func0(0LL, 0LL);\nwr = list;\nrd = (void *)list;\npipe(pipedes);\nmpeg_mgr_pid = fork();\nif ( !mpeg_mgr_pid )\n{\nclose(pipedes[1]);\ndup2(pipedes[0], 0);\nfunc5();\nexit(-1);\n}\nclose(pipedes[0]);\nmpeg_fd = pipedes[1];\nreturn pthread_create(&newthread, 0LL, (void *(*)(void *))mpeg_play, rd);\n}",
"original_code": "void do_mpeg_player(void) {\n int pp[2];\n pthread_t thr;\n rd = wr = list = audiochunk_new(((void *)0), 0);\n pipe(pp);\n mpeg_mgr_pid = fork();\n if (mpeg_mgr_pid == 0) {\n close(pp[1]);\n dup2(pp[0], 0);\n mpeg_player_manager();\n exit(-1);\n } else {\n close(pp[0]);\n mpeg_fd = pp[1];\n pthread_create(&thr, ((void *)0), mpeg_play, rd);\n }\n}",
"canonical_original_code": "void do_mpeg_player() {\n int pp[2];\n unsigned long thr;\n rd = wr = list = audiochunk_new(((void *)0), 0);\n pipe(pp);\n mpeg_mgr_pid = fork();\n if (mpeg_mgr_pid == 0) {\n close(pp[1]);\n dup2(pp[0], 0);\n mpeg_player_manager();\n exit(-1);\n } else {\n close(pp[0]);\n mpeg_fd = pp[1];\n pthread_create(&thr, ((void *)0), mpeg_play, rd);\n }\n}",
"variable_types": [
[
"pp",
"int [2]"
],
[
"thr",
"unsigned long"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "e4a0bdc2ebc903fea49aadb1f66358b8070c7add9e8559956a99dc4cb004401b"
}
] |
f157170a728f494436a208fc2fe35800a80c4175776573e750e55e823ed68d95 | rbu/driftnet | [
[
"find_gif_image",
"->"
],
[
"jpeg_skip_block",
"->",
"find_jpeg_image"
],
[
"find_jpeg_image",
"->",
"jpeg_skip_block"
],
[
"find_png_eoi",
"->",
"find_png_image"
],
[
"find_png_image",
"->",
"find_png_eoi"
]
] | [] | [
{
"name": "find_gif_image",
"canonical_name": "func0",
"repo": "rbu/driftnet",
"decompiled_code": "unsigned __int8 *__fastcall find_gif_image(__int64 a1, unsigned __int64 a2, __int64 *a3, _QWORD *a4)\n{\nint v5; // eax\nunsigned __int8 *v8; // [rsp+30h] [rbp-10h]\n_BYTE *v9; // [rsp+30h] [rbp-10h]\n_BYTE *v10; // [rsp+30h] [rbp-10h]\nunsigned __int8 *v11; // [rsp+30h] [rbp-10h]\n_BYTE *v12; // [rsp+30h] [rbp-10h]\n_BYTE *v13; // [rsp+30h] [rbp-10h]\n_BYTE *v14; // [rsp+30h] [rbp-10h]\n_BYTE *v15; // [rsp+30h] [rbp-10h]\n_BYTE *v16; // [rsp+30h] [rbp-10h]\n__int64 v17; // [rsp+38h] [rbp-8h]\n\n*a3 = 0LL;\nif ( a2 <= 5 )\nreturn (unsigned __int8 *)a1;\nv17 = memstr(a1, a2, \"GIF89a\", 6LL);\nif ( !v17 )\nv17 = memstr(a1, a2, \"GIF87a\", 6LL);\nif ( !v17 )\nreturn (unsigned __int8 *)(a2 - 6 + a1);\nif ( (__int64)(a1 + a2 - v17) <= 13 )\nreturn (unsigned __int8 *)v17;\nv8 = (unsigned __int8 *)(v17 + 13);\nif ( v17 + 13 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nif ( *(char *)(v17 + 10) < 0 )\nv8 += 3 * (1 << ((*(_BYTE *)(v17 + 10) & 7) + 1));\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nwhile ( 1 )\n{\nv5 = *v8;\nif ( v5 == 59 )\n{\n*a3 = v17;\n*a4 = &v8[-v17 + 1];\nreturn v8 + 1;\n}\nif ( *v8 > 0x3Bu )\nbreak;\nif ( v5 == 33 )\n{\nv10 = v8 + 1;\nif ( (unsigned __int64)v10 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nswitch ( *v10 )\n{\ncase 0xF9:\nv11 = v10 + 1;\nif ( (unsigned __int64)v11 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nv8 = &v11[*v11 + 2];\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nbreak;\ncase 0xFE:\nv12 = v10 + 1;\ndo\n{\nif ( (unsigned __int64)v12 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nv12 += (unsigned __int8)*v12 + 1;\nif ( (unsigned __int64)v12 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\n}\nwhile ( *v12 );\nv8 = v12 + 1;\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nbreak;\ncase 1:\nv13 = v10 + 1;\nif ( (unsigned __int64)v13 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nif ( *v13 != 12 )\nreturn (unsigned __int8 *)(v17 + 6);\nv14 = v13 + 13;\ndo\n{\nif ( (unsigned __int64)v14 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nv14 += (unsigned __int8)*v14 + 1;\nif ( (unsigned __int64)v14 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\n}\nwhile ( *v14 );\nv8 = v14 + 1;\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nbreak;\ncase 0xFF:\nv15 = v10 + 1;\nif ( (unsigned __int64)v15 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nif ( *v15 != 11 )\nreturn (unsigned __int8 *)(v17 + 6);\nv16 = v15 + 12;\ndo\n{\nif ( (unsigned __int64)v16 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nv16 += (unsigned __int8)*v16 + 1;\nif ( (unsigned __int64)v16 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\n}\nwhile ( *v16 );\nv8 = v16 + 1;\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nbreak;\ndefault:\nreturn (unsigned __int8 *)(v17 + 6);\n}\n}\nelse\n{\nif ( v5 != 44 )\nreturn (unsigned __int8 *)(v17 + 6);\nif ( (unsigned __int64)(v8 + 9) > a1 + a2 )\nreturn (unsigned __int8 *)v17;\nif ( (v8[9] & 0x80u) != 0 )\n{\nv8 += 3 << ((*(_BYTE *)(v17 + 9) & 7) + 1);\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\n}\nv9 = v8 + 11;\ndo\n{\nif ( (unsigned __int64)v9 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nv9 += (unsigned __int8)*v9 + 1;\nif ( (unsigned __int64)v9 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\n}\nwhile ( *v9 );\nv8 = v9 + 1;\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\n}\n}\nreturn (unsigned __int8 *)(v17 + 6);\n}\n",
"canonical_decompiled_code": "unsigned __int8 *__fastcall func0(__int64 a1, unsigned __int64 a2, __int64 *a3, _QWORD *a4)\n{\nint v5; // eax\nunsigned __int8 *v8; // [rsp+30h] [rbp-10h]\n_BYTE *v9; // [rsp+30h] [rbp-10h]\n_BYTE *v10; // [rsp+30h] [rbp-10h]\nunsigned __int8 *v11; // [rsp+30h] [rbp-10h]\n_BYTE *v12; // [rsp+30h] [rbp-10h]\n_BYTE *v13; // [rsp+30h] [rbp-10h]\n_BYTE *v14; // [rsp+30h] [rbp-10h]\n_BYTE *v15; // [rsp+30h] [rbp-10h]\n_BYTE *v16; // [rsp+30h] [rbp-10h]\n__int64 v17; // [rsp+38h] [rbp-8h]\n\n*a3 = 0LL;\nif ( a2 <= 5 )\nreturn (unsigned __int8 *)a1;\nv17 = memstr(a1, a2, \"GIF89a\", 6LL);\nif ( !v17 )\nv17 = memstr(a1, a2, \"GIF87a\", 6LL);\nif ( !v17 )\nreturn (unsigned __int8 *)(a2 - 6 + a1);\nif ( (__int64)(a1 + a2 - v17) <= 13 )\nreturn (unsigned __int8 *)v17;\nv8 = (unsigned __int8 *)(v17 + 13);\nif ( v17 + 13 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nif ( *(char *)(v17 + 10) < 0 )\nv8 += 3 * (1 << ((*(_BYTE *)(v17 + 10) & 7) + 1));\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nwhile ( 1 )\n{\nv5 = *v8;\nif ( v5 == 59 )\n{\n*a3 = v17;\n*a4 = &v8[-v17 + 1];\nreturn v8 + 1;\n}\nif ( *v8 > 0x3Bu )\nbreak;\nif ( v5 == 33 )\n{\nv10 = v8 + 1;\nif ( (unsigned __int64)v10 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nswitch ( *v10 )\n{\ncase 0xF9:\nv11 = v10 + 1;\nif ( (unsigned __int64)v11 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nv8 = &v11[*v11 + 2];\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nbreak;\ncase 0xFE:\nv12 = v10 + 1;\ndo\n{\nif ( (unsigned __int64)v12 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nv12 += (unsigned __int8)*v12 + 1;\nif ( (unsigned __int64)v12 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\n}\nwhile ( *v12 );\nv8 = v12 + 1;\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nbreak;\ncase 1:\nv13 = v10 + 1;\nif ( (unsigned __int64)v13 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nif ( *v13 != 12 )\nreturn (unsigned __int8 *)(v17 + 6);\nv14 = v13 + 13;\ndo\n{\nif ( (unsigned __int64)v14 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nv14 += (unsigned __int8)*v14 + 1;\nif ( (unsigned __int64)v14 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\n}\nwhile ( *v14 );\nv8 = v14 + 1;\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nbreak;\ncase 0xFF:\nv15 = v10 + 1;\nif ( (unsigned __int64)v15 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nif ( *v15 != 11 )\nreturn (unsigned __int8 *)(v17 + 6);\nv16 = v15 + 12;\ndo\n{\nif ( (unsigned __int64)v16 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nv16 += (unsigned __int8)*v16 + 1;\nif ( (unsigned __int64)v16 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\n}\nwhile ( *v16 );\nv8 = v16 + 1;\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nbreak;\ndefault:\nreturn (unsigned __int8 *)(v17 + 6);\n}\n}\nelse\n{\nif ( v5 != 44 )\nreturn (unsigned __int8 *)(v17 + 6);\nif ( (unsigned __int64)(v8 + 9) > a1 + a2 )\nreturn (unsigned __int8 *)v17;\nif ( (v8[9] & 0x80u) != 0 )\n{\nv8 += 3 << ((*(_BYTE *)(v17 + 9) & 7) + 1);\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\n}\nv9 = v8 + 11;\ndo\n{\nif ( (unsigned __int64)v9 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\nv9 += (unsigned __int8)*v9 + 1;\nif ( (unsigned __int64)v9 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\n}\nwhile ( *v9 );\nv8 = v9 + 1;\nif ( (unsigned __int64)v8 >= a1 + a2 )\nreturn (unsigned __int8 *)v17;\n}\n}\nreturn (unsigned __int8 *)(v17 + 6);\n}",
"original_code": "unsigned char *find_gif_image(const unsigned char *data, const size_t len, unsigned char **gifdata, size_t *giflen) {\n unsigned char *gifhdr, *block;\n int gotimgblock = 0;\n int ncolours;\n *gifdata = ((void *)0);\n if (len < 6) return (unsigned char*)data;\n gifhdr = memstr(data, len, (unsigned char*) \"GIF89a\", 6);\n if (!gifhdr) gifhdr = memstr(data, len, (unsigned char*) \"GIF87a\", 6);\n if (!gifhdr) return (unsigned char*)(data + len - 6);\n if (data + len - gifhdr < 14) return gifhdr;\n ncolours = (1 << ((gifhdr[10] & 0x7) + 1));\n block = gifhdr + 13;\n if (block >= data + len) return gifhdr;\n if (gifhdr[10] & 0x80) block += 3 * ncolours;\n if (block >= data + len) return gifhdr;\n do {\n switch (*block) {\n case 0x2c:\n if (block + 9 > data + len) return gifhdr;\n if (block[9] & 0x80) {\n block += 3 * ((1 << ((gifhdr[9] & 0x7) + 1)));\n if (block >= data + len) return gifhdr;\n }\n block += 10;\n ++block;\n do {\n if (block >= data + len) return gifhdr;\n block += *block + 1;\n if (block >= data + len) return gifhdr;\n } while (*block);\n ++block;\n if (block >= data + len) return gifhdr;\n gotimgblock = 1;\n break;\n case 0x21:\n ++block;\n if (block >= data + len) return gifhdr;\n if (*block == 0xf9) {\n ++block;\n if (block >= data + len) return gifhdr;\n block += *block + 2;\n if (block >= data + len) return gifhdr;\n break;\n } else if (*block == 0xfe) {\n ++block;\n do {\n if (block >= data + len) return gifhdr;\n block += *block + 1;\n if (block >= data + len) return gifhdr;\n } while (*block);\n ++block;\n if (block >= data + len) return gifhdr;\n } else if (*block == 0x01) {\n ++block;\n if (block >= data + len) return gifhdr;\n if (*block != 12) return gifhdr + 6;\n block += 13;\n do {\n if (block >= data + len) return gifhdr;\n block += *block + 1;\n if (block >= data + len) return gifhdr;\n } while (*block);\n ++block;\n if (block >= data + len) return gifhdr;\n } else if (*block == 0xff) {\n ++block;\n if (block >= data + len) return gifhdr;\n if (*block != 11) return gifhdr + 6;\n block += 12;\n do {\n if (block >= data + len) return gifhdr;\n block += *block + 1;\n if (block >= data + len) return gifhdr;\n } while (*block);\n ++block;\n if (block >= data + len) return gifhdr;\n } else {\n return gifhdr + 6;\n }\n break;\n case 0x3b:\n *gifdata = gifhdr;\n *giflen = block - gifhdr + 1;\n return block + 1;\n break;\n default:\n return gifhdr + 6;\n }\n } while (1);\n}",
"canonical_original_code": "unsigned char *find_gif_image(unsigned char *data, unsigned long len, unsigned char **gifdata, unsigned long *giflen) {\n unsigned char *gifhdr; unsigned char *block;\n int gotimgblock = 0;\n int ncolours;\n *gifdata = ((void *)0);\n if (len < 6) return (unsigned char *)data;\n gifhdr = memstr(data, len, (unsigned char *) \"GIF89a\", 6);\n if (!gifhdr) gifhdr = memstr(data, len, (unsigned char *) \"GIF87a\", 6);\n if (!gifhdr) return (unsigned char *)(data + len - 6);\n if (data + len - gifhdr < 14) return gifhdr;\n ncolours = (1 << ((gifhdr[10] & 0x7) + 1));\n block = gifhdr + 13;\n if (block >= data + len) return gifhdr;\n if (gifhdr[10] & 0x80) block += 3 * ncolours;\n if (block >= data + len) return gifhdr;\n do {\n switch (*block) {\n case 0x2c:\n if (block + 9 > data + len) return gifhdr;\n if (block[9] & 0x80) {\n block += 3 * ((1 << ((gifhdr[9] & 0x7) + 1)));\n if (block >= data + len) return gifhdr;\n }\n block += 10;\n ++block;\n do {\n if (block >= data + len) return gifhdr;\n block += *block + 1;\n if (block >= data + len) return gifhdr;\n } while (*block);\n ++block;\n if (block >= data + len) return gifhdr;\n gotimgblock = 1;\n break;\n case 0x21:\n ++block;\n if (block >= data + len) return gifhdr;\n if (*block == 0xf9) {\n ++block;\n if (block >= data + len) return gifhdr;\n block += *block + 2;\n if (block >= data + len) return gifhdr;\n break;\n } else if (*block == 0xfe) {\n ++block;\n do {\n if (block >= data + len) return gifhdr;\n block += *block + 1;\n if (block >= data + len) return gifhdr;\n } while (*block);\n ++block;\n if (block >= data + len) return gifhdr;\n } else if (*block == 0x01) {\n ++block;\n if (block >= data + len) return gifhdr;\n if (*block != 12) return gifhdr + 6;\n block += 13;\n do {\n if (block >= data + len) return gifhdr;\n block += *block + 1;\n if (block >= data + len) return gifhdr;\n } while (*block);\n ++block;\n if (block >= data + len) return gifhdr;\n } else if (*block == 0xff) {\n ++block;\n if (block >= data + len) return gifhdr;\n if (*block != 11) return gifhdr + 6;\n block += 12;\n do {\n if (block >= data + len) return gifhdr;\n block += *block + 1;\n if (block >= data + len) return gifhdr;\n } while (*block);\n ++block;\n if (block >= data + len) return gifhdr;\n } else {\n return gifhdr + 6;\n }\n break;\n case 0x3b:\n *gifdata = gifhdr;\n *giflen = block - gifhdr + 1;\n return block + 1;\n break;\n default:\n return gifhdr + 6;\n }\n } while (1);\n}",
"variable_types": [
[
"data",
"unsigned char *"
],
[
"len",
"unsigned long"
],
[
"gifdata",
"unsigned char **"
],
[
"giflen",
"unsigned long *"
],
[
"gifhdr",
"unsigned char *"
],
[
"block",
"unsigned char *"
],
[
"gotimgblock",
"int"
],
[
"ncolours",
"int"
]
],
"return_type": "unsigned char *",
"user_defined_types": [],
"binary_hash": "f157170a728f494436a208fc2fe35800a80c4175776573e750e55e823ed68d95"
},
{
"name": "jpeg_skip_block",
"canonical_name": "func1",
"repo": "rbu/driftnet",
"decompiled_code": "unsigned __int8 *__fastcall jpeg_skip_block(unsigned __int8 *a1, unsigned __int64 a2)\n{\nunsigned __int8 *result; // rax\nint v3; // [rsp+1Ch] [rbp-4h]\n\nif ( a2 <= 1 )\nreturn 0LL;\nv3 = (*a1 << 8) | a1[1];\nif ( a2 >= v3 )\nresult = &a1[v3];\nelse\nresult = 0LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "unsigned __int8 *__fastcall func1(unsigned __int8 *a1, unsigned __int64 a2)\n{\nunsigned __int8 *result; // rax\nint v3; // [rsp+1Ch] [rbp-4h]\n\nif ( a2 <= 1 )\nreturn 0LL;\nv3 = (*a1 << 8) | a1[1];\nif ( a2 >= v3 )\nresult = &a1[v3];\nelse\nresult = 0LL;\nreturn result;\n}",
"original_code": "unsigned char *jpeg_skip_block(unsigned char *d, size_t len) {\n int l;\n if (len < 2) return ((void *)0);\n l = ((*(d) << 8) | *((d) + 1));\n if (l > len) return ((void *)0);\n return d + l;\n}",
"canonical_original_code": "unsigned char *jpeg_skip_block(unsigned char *d, unsigned long len) {\n int l;\n if (len < 2) return ((void *)0);\n l = ((*(d) << 8) | *((d) + 1));\n if (l > len) return ((void *)0);\n return d + l;\n}",
"variable_types": [
[
"d",
"unsigned char *"
],
[
"len",
"unsigned long"
],
[
"l",
"int"
]
],
"return_type": "unsigned char *",
"user_defined_types": [],
"binary_hash": "f157170a728f494436a208fc2fe35800a80c4175776573e750e55e823ed68d95"
},
{
"name": "find_jpeg_image",
"canonical_name": "func2",
"repo": "rbu/driftnet",
"decompiled_code": "__int64 __fastcall find_jpeg_image(__int64 a1, unsigned __int64 a2, __int64 *a3, _QWORD *a4)\n{\n__int64 v7; // [rsp+20h] [rbp-10h]\n_BYTE *v8; // [rsp+28h] [rbp-8h]\n__int64 v9; // [rsp+28h] [rbp-8h]\nunsigned __int8 *v10; // [rsp+28h] [rbp-8h]\n\n*a3 = 0LL;\nv7 = memstr(a1, a2, &unk_9A2, 2LL);\nif ( !v7 )\nreturn a2 - 1 + a1;\nif ( v7 + 2 > a1 + a2 )\nreturn v7;\nv8 = jpeg_next_marker((_BYTE *)(v7 + 2), a2 - (v7 - a1) - 2);\nif ( !v8 || a2 <= (unsigned __int64)&v8[-a1] )\nreturn v7;\nwhile ( 1 )\n{\nv10 = jpeg_skip_block(v8 + 1, a2 - (_QWORD)&v8[-a1 + 1]);\nif ( !v10 )\nbreak;\nv8 = jpeg_next_marker(v10, a2 - (_QWORD)&v10[-a1]);\nif ( !v8 || a2 <= (unsigned __int64)&v8[-a1] )\nreturn v7;\nif ( *v8 == 0xDA )\n{\nv9 = memstr(v8, a2 - (_QWORD)&v8[-a1], &unk_9A5, 2LL);\nif ( v9 )\n{\n*a3 = v7;\n*a4 = v9 + 2 - v7;\nreturn v9 + 2;\n}\nreturn v7;\n}\n}\nreturn v7;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, unsigned __int64 a2, __int64 *a3, _QWORD *a4)\n{\n__int64 v7; // [rsp+20h] [rbp-10h]\n_BYTE *v8; // [rsp+28h] [rbp-8h]\n__int64 v9; // [rsp+28h] [rbp-8h]\nunsigned __int8 *v10; // [rsp+28h] [rbp-8h]\n\n*a3 = 0LL;\nv7 = memstr(a1, a2, &unk_9A2, 2LL);\nif ( !v7 )\nreturn a2 - 1 + a1;\nif ( v7 + 2 > a1 + a2 )\nreturn v7;\nv8 = jpeg_next_marker((_BYTE *)(v7 + 2), a2 - (v7 - a1) - 2);\nif ( !v8 || a2 <= (unsigned __int64)&v8[-a1] )\nreturn v7;\nwhile ( 1 )\n{\nv10 = func1(v8 + 1, a2 - (_QWORD)&v8[-a1 + 1]);\nif ( !v10 )\nbreak;\nv8 = jpeg_next_marker(v10, a2 - (_QWORD)&v10[-a1]);\nif ( !v8 || a2 <= (unsigned __int64)&v8[-a1] )\nreturn v7;\nif ( *v8 == 0xDA )\n{\nv9 = memstr(v8, a2 - (_QWORD)&v8[-a1], &unk_9A5, 2LL);\nif ( v9 )\n{\n*a3 = v7;\n*a4 = v9 + 2 - v7;\nreturn v9 + 2;\n}\nreturn v7;\n}\n}\nreturn v7;\n}",
"original_code": "unsigned char *find_jpeg_image(const unsigned char *data, const size_t len, unsigned char **jpegdata, size_t *jpeglen) {\n unsigned char *jpeghdr, *block;\n *jpegdata = ((void *)0);\n jpeghdr = memstr(data, len, (unsigned char*) \"\\xff\\xd8\", 2);\n if (!jpeghdr) return (unsigned char*)(data + len - 1);\n if (jpeghdr + 2 > data + len) return jpeghdr;\n block = jpeg_next_marker(jpeghdr + 2, len - 2 - (jpeghdr - data));\n if (!block || (block - data) >= len) return jpeghdr;\n while ((block = jpeg_skip_block(block + 1, len - (block + 1 - data)))) {\n block = jpeg_next_marker(block, len - (block - data));\n if (!block || (block - data) >= len) return jpeghdr;\n if (*block == 0xda) {\n block = memstr(block, len - (block - data), (unsigned char*) \"\\xff\\xd9\", 2);\n if (block) {\n *jpegdata = jpeghdr;\n *jpeglen = block + 2 - jpeghdr;\n return block + 2;\n } else break;\n }\n }\n return jpeghdr;\n}",
"canonical_original_code": "unsigned char *find_jpeg_image(unsigned char *data, unsigned long len, unsigned char **jpegdata, unsigned long *jpeglen) {\n unsigned char *jpeghdr; unsigned char *block;\n *jpegdata = ((void *)0);\n jpeghdr = memstr(data, len, (unsigned char *) \"\\xff\\xd8\", 2);\n if (!jpeghdr) return (unsigned char *)(data + len - 1);\n if (jpeghdr + 2 > data + len) return jpeghdr;\n block = jpeg_next_marker(jpeghdr + 2, len - 2 - (jpeghdr - data));\n if (!block || (block - data) >= len) return jpeghdr;\n while ((block = jpeg_skip_block(block + 1, len - (block + 1 - data)))) {\n block = jpeg_next_marker(block, len - (block - data));\n if (!block || (block - data) >= len) return jpeghdr;\n if (*block == 0xda) {\n block = memstr(block, len - (block - data), (unsigned char *) \"\\xff\\xd9\", 2);\n if (block) {\n *jpegdata = jpeghdr;\n *jpeglen = block + 2 - jpeghdr;\n return block + 2;\n } else break;\n }\n }\n return jpeghdr;\n}",
"variable_types": [
[
"data",
"unsigned char *"
],
[
"len",
"unsigned long"
],
[
"jpegdata",
"unsigned char **"
],
[
"jpeglen",
"unsigned long *"
],
[
"jpeghdr",
"unsigned char *"
],
[
"block",
"unsigned char *"
]
],
"return_type": "unsigned char *",
"user_defined_types": [],
"binary_hash": "f157170a728f494436a208fc2fe35800a80c4175776573e750e55e823ed68d95"
},
{
"name": "find_png_eoi",
"canonical_name": "func3",
"repo": "rbu/driftnet",
"decompiled_code": "char *__fastcall find_png_eoi(__int64 a1, __int64 a2)\n{\n__int64 netlong; // [rsp+1Ch] [rbp-24h]\n_BYTE s[5]; // [rsp+27h] [rbp-19h] BYREF\nuint32_t v5; // [rsp+2Ch] [rbp-14h]\nunsigned __int64 v6; // [rsp+30h] [rbp-10h]\n__int64 *v7; // [rsp+38h] [rbp-8h]\n\nv7 = (__int64 *)(a1 + 8);\nv6 = a2 - 12 + a1;\nwhile ( (unsigned __int64)v7 <= v6 )\n{\nnetlong = *v7;\nmemset(s, 0, sizeof(s));\n*(_DWORD *)s = HIDWORD(netlong);\nv5 = ntohl(netlong);\nif ( !strncasecmp(s, \"iend\", 4uLL) )\nreturn (char *)v7 + 12;\nif ( v5 > (unsigned __int64)(a2 - ((_QWORD)v7 - a1)) )\nreturn 0LL;\nv7 = (__int64 *)((char *)v7 + v5 + 12);\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "char *__fastcall func3(__int64 a1, __int64 a2)\n{\n__int64 netlong; // [rsp+1Ch] [rbp-24h]\n_BYTE s[5]; // [rsp+27h] [rbp-19h] BYREF\nuint32_t v5; // [rsp+2Ch] [rbp-14h]\nunsigned __int64 v6; // [rsp+30h] [rbp-10h]\n__int64 *v7; // [rsp+38h] [rbp-8h]\n\nv7 = (__int64 *)(a1 + 8);\nv6 = a2 - 12 + a1;\nwhile ( (unsigned __int64)v7 <= v6 )\n{\nnetlong = *v7;\nmemset(s, 0, sizeof(s));\n*(_DWORD *)s = HIDWORD(netlong);\nv5 = ntohl(netlong);\nif ( !strncasecmp(s, \"iend\", 4uLL) )\nreturn (char *)v7 + 12;\nif ( v5 > (unsigned __int64)(a2 - ((_QWORD)v7 - a1)) )\nreturn 0LL;\nv7 = (__int64 *)((char *)v7 + v5 + 12);\n}\nreturn 0LL;\n}",
"original_code": "unsigned char *find_png_eoi(unsigned char *buffer, const size_t len) {\n unsigned char *end_data, *data, chunk_code[4 + 1];\n struct png_chunk chunk;\n u_int32_t datalen;\n data = (buffer + 8);\n end_data = (buffer + len - (sizeof(struct png_chunk) + 4));\n while (data <= end_data) {\n memcpy(&chunk, data, sizeof chunk);\n memset(chunk_code, '\\0', 4 + 1);\n memcpy(chunk_code, chunk.code, 4);\n datalen = ntohl(chunk.datalen);\n if (!strncasecmp((char*) chunk_code, \"iend\", 4))\n return (unsigned char *)(data + sizeof(struct png_chunk) + 4);\n if (datalen > (len - (data - buffer)))\n return ((void *)0);\n data += (sizeof(struct png_chunk) + datalen + 4);\n }\n return ((void *)0);\n}",
"canonical_original_code": "unsigned char *find_png_eoi(unsigned char *buffer, unsigned long len) {\n unsigned char *end_data; unsigned char *data; unsigned char chunk_code[-1];\n struct png_chunk chunk;\n unsigned int datalen;\n data = (buffer + 8);\n end_data = (buffer + len - (sizeof(struct png_chunk) + 4));\n while (data <= end_data) {\n memcpy(&chunk, data, sizeof chunk);\n memset(chunk_code, '\\0', 4 + 1);\n memcpy(chunk_code, chunk.code, 4);\n datalen = ntohl(chunk.datalen);\n if (!strncasecmp((char *) chunk_code, \"iend\", 4))\n return (unsigned char *)(data + sizeof(struct png_chunk) + 4);\n if (datalen > (len - (data - buffer)))\n return ((void *)0);\n data += (sizeof(struct png_chunk) + datalen + 4);\n }\n return ((void *)0);\n}",
"variable_types": [
[
"buffer",
"unsigned char *"
],
[
"len",
"unsigned long"
],
[
"end_data",
"unsigned char *"
],
[
"data",
"unsigned char *"
],
[
"chunk_code",
"unsigned char [-1]"
],
[
"chunk",
"struct png_chunk { unsigned int datalen; unsigned char code[4]; }"
],
[
"datalen",
"unsigned int"
]
],
"return_type": "unsigned char *",
"user_defined_types": [
"struct png_chunk { unsigned int datalen; unsigned char code[4]; }"
],
"binary_hash": "f157170a728f494436a208fc2fe35800a80c4175776573e750e55e823ed68d95"
},
{
"name": "find_png_image",
"canonical_name": "func4",
"repo": "rbu/driftnet",
"decompiled_code": "char *__fastcall find_png_image(__int64 a1, unsigned __int64 a2, __int64 *a3, _QWORD *a4)\n{\nchar *v7; // [rsp+28h] [rbp-18h]\n__int64 v8; // [rsp+38h] [rbp-8h]\n\n*a3 = 0LL;\nif ( a2 <= 7 )\nreturn (char *)a1;\nv8 = memstr(a1, a2, &unk_9AD, 8LL);\nif ( !v8 )\nreturn (char *)(a2 - 8 + a1);\nv7 = find_png_eoi(v8, a1 + a2 - v8);\nif ( !v7 )\nreturn (char *)v8;\n*a3 = v8;\n*a4 = &v7[-v8];\nreturn v7;\n}\n",
"canonical_decompiled_code": "char *__fastcall func4(__int64 a1, unsigned __int64 a2, __int64 *a3, _QWORD *a4)\n{\nchar *v7; // [rsp+28h] [rbp-18h]\n__int64 v8; // [rsp+38h] [rbp-8h]\n\n*a3 = 0LL;\nif ( a2 <= 7 )\nreturn (char *)a1;\nv8 = memstr(a1, a2, &unk_9AD, 8LL);\nif ( !v8 )\nreturn (char *)(a2 - 8 + a1);\nv7 = func3(v8, a1 + a2 - v8);\nif ( !v7 )\nreturn (char *)v8;\n*a3 = v8;\n*a4 = &v7[-v8];\nreturn v7;\n}",
"original_code": "unsigned char *find_png_image(const unsigned char *data, const size_t len, unsigned char **pngdata, size_t *pnglen) {\n unsigned char *pnghdr, *data_end, *png_eoi;\n *pngdata = ((void *)0);\n if (len < 8)\n return (unsigned char*)data;\n pnghdr = memstr(data, len, (unsigned char*) \"\\x89\\x50\\x4e\\x47\\x0d\\x0a\\x1a\\x0a\", 8);\n if (!pnghdr)\n return (unsigned char*)(data + len - 8);\n data_end = (unsigned char *)(data + len);\n if ((png_eoi = find_png_eoi(pnghdr, (data_end - pnghdr))) == ((void *)0))\n return pnghdr;\n *pngdata = pnghdr;\n *pnglen = (png_eoi - pnghdr);\n return png_eoi;\n}",
"canonical_original_code": "unsigned char *find_png_image(unsigned char *data, unsigned long len, unsigned char **pngdata, unsigned long *pnglen) {\n unsigned char *pnghdr; unsigned char *data_end; unsigned char *png_eoi;\n *pngdata = ((void *)0);\n if (len < 8)\n return (unsigned char *)data;\n pnghdr = memstr(data, len, (unsigned char *) \"\\x89\\x50\\x4e\\x47\\x0d\\x0a\\x1a\\x0a\", 8);\n if (!pnghdr)\n return (unsigned char *)(data + len - 8);\n data_end = (unsigned char *)(data + len);\n if ((png_eoi = find_png_eoi(pnghdr, (data_end - pnghdr))) == ((void *)0))\n return pnghdr;\n *pngdata = pnghdr;\n *pnglen = (png_eoi - pnghdr);\n return png_eoi;\n}",
"variable_types": [
[
"data",
"unsigned char *"
],
[
"len",
"unsigned long"
],
[
"pngdata",
"unsigned char **"
],
[
"pnglen",
"unsigned long *"
],
[
"pnghdr",
"unsigned char *"
],
[
"data_end",
"unsigned char *"
],
[
"png_eoi",
"unsigned char *"
]
],
"return_type": "unsigned char *",
"user_defined_types": [],
"binary_hash": "f157170a728f494436a208fc2fe35800a80c4175776573e750e55e823ed68d95"
}
] |
fe50906c74f83f5ecb08c59f4aa317a7d17d50127672dd7d3679146c8f00ad01 | rbu/driftnet | [
[
"find_http_req",
"->"
],
[
"dispatch_http_req",
"->"
]
] | [] | [
{
"name": "find_http_req",
"canonical_name": "func0",
"repo": "rbu/driftnet",
"decompiled_code": "__int64 __fastcall find_http_req(__int64 a1, unsigned __int64 a2, __int64 *a3, _QWORD *a4)\n{\n__int64 result; // rax\n__int64 v7; // [rsp+28h] [rbp-18h]\nunsigned __int64 v8; // [rsp+30h] [rbp-10h]\n__int64 v9; // [rsp+38h] [rbp-8h]\n\nif ( a2 <= 0x27 )\nreturn a1;\nv9 = memstr(a1, a2, \"GET \", 4LL);\nif ( !v9 )\nreturn a2 - 4 + a1;\nv8 = memstr(v9 + 4, a2 - (a1 - (v9 + 4)), \"\\r\\n\", 2LL);\nif ( v8 )\n{\nif ( v8 >= v9 + 5 )\n{\nif ( !memcmp((const void *)(v8 - 9), \" HTTP/1.\", 8uLL) && strchr(\"01\", *(unsigned __int8 *)(v8 - 1)) )\n{\nv7 = memstr(v8 + 2, a2 - (a1 - (v8 + 2)), \"\\r\\n\\r\\n\", 4LL);\nif ( v7 )\n{\nif ( !memcmp((const void *)(v9 + 4), \"http://\", 7uLL) || memstr(v8, v7 - v8 + 2, \"\\r\\nHost: \", 8LL) )\n{\n*a3 = v9;\n*a4 = v7 - v9;\nresult = v7 + 4;\n}\nelse\n{\nresult = v7 + 4;\n}\n}\nelse if ( a2 - (a1 - (v8 + 2)) <= 0x4000 )\n{\nresult = v9;\n}\nelse\n{\nresult = a2 - 4 + a1;\n}\n}\nelse\n{\nresult = v8 + 2;\n}\n}\nelse\n{\nresult = v8 + 2;\n}\n}\nelse if ( a2 - (a1 - (v9 + 4)) <= 0x4000 )\n{\nresult = v9;\n}\nelse\n{\nresult = v9 + 4;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, unsigned __int64 a2, __int64 *a3, _QWORD *a4)\n{\n__int64 result; // rax\n__int64 v7; // [rsp+28h] [rbp-18h]\nunsigned __int64 v8; // [rsp+30h] [rbp-10h]\n__int64 v9; // [rsp+38h] [rbp-8h]\n\nif ( a2 <= 0x27 )\nreturn a1;\nv9 = memstr(a1, a2, \"GET \", 4LL);\nif ( !v9 )\nreturn a2 - 4 + a1;\nv8 = memstr(v9 + 4, a2 - (a1 - (v9 + 4)), \"\\r\\n\", 2LL);\nif ( v8 )\n{\nif ( v8 >= v9 + 5 )\n{\nif ( !memcmp((const void *)(v8 - 9), \" HTTP/1.\", 8uLL) && strchr(\"01\", *(unsigned __int8 *)(v8 - 1)) )\n{\nv7 = memstr(v8 + 2, a2 - (a1 - (v8 + 2)), \"\\r\\n\\r\\n\", 4LL);\nif ( v7 )\n{\nif ( !memcmp((const void *)(v9 + 4), \"http://\", 7uLL) || memstr(v8, v7 - v8 + 2, \"\\r\\nHost: \", 8LL) )\n{\n*a3 = v9;\n*a4 = v7 - v9;\nresult = v7 + 4;\n}\nelse\n{\nresult = v7 + 4;\n}\n}\nelse if ( a2 - (a1 - (v8 + 2)) <= 0x4000 )\n{\nresult = v9;\n}\nelse\n{\nresult = a2 - 4 + a1;\n}\n}\nelse\n{\nresult = v8 + 2;\n}\n}\nelse\n{\nresult = v8 + 2;\n}\n}\nelse if ( a2 - (a1 - (v9 + 4)) <= 0x4000 )\n{\nresult = v9;\n}\nelse\n{\nresult = v9 + 4;\n}\nreturn result;\n}",
"original_code": "unsigned char *find_http_req(const unsigned char *data, const size_t len, unsigned char **http, size_t *httplen) {\n unsigned char *req, *le, *blankline, *hosthdr;\n if (len < 40)\n return (unsigned char*)data;\n if (!(req = memstr(data, len, (unsigned char*) \"GET \", 4)))\n return (unsigned char*)(data + len - 4);\n if (!(le = memstr(req + 4, (len - (data - (req + 4))), (unsigned char*) \"\\r\\n\", 2))) {\n if ((len - (data - (req + 4))) > 16384)\n return (unsigned char*)(req + 4);\n else\n return (unsigned char*)req;\n }\n if (le < req + 5)\n return le + 2;\n if (memcmp(le - 9, \" HTTP/1.\", 8) || !strchr(\"01\", (int)*(le - 1)))\n return le + 2;\n if (!(blankline = memstr(le + 2, (len - (data - (le + 2))), (unsigned char*) \"\\r\\n\\r\\n\", 4))) {\n if ((len - (data - (le + 2))) > 16384)\n return (unsigned char*)(data + len - 4);\n else\n return req;\n }\n if (memcmp(req + 4, \"http://\", 7) == 0)\n goto found;\n if (!(hosthdr = memstr(le, blankline - le + 2, (unsigned char*) \"\\r\\nHost: \", 8))) {\n return blankline + 4;\n }\nfound:\n *http = req;\n *httplen = blankline - req;\n return blankline + 4;\n}",
"canonical_original_code": "unsigned char *find_http_req(unsigned char *data, unsigned long len, unsigned char **http, unsigned long *httplen) {\n unsigned char *req; unsigned char *le; unsigned char *blankline; unsigned char *hosthdr;\n if (len < 40)\n return (unsigned char *)data;\n if (!(req = memstr(data, len, (unsigned char *) \"GET \", 4)))\n return (unsigned char *)(data + len - 4);\n if (!(le = memstr(req + 4, (len - (data - (req + 4))), (unsigned char *) \"\\r\\n\", 2))) {\n if ((len - (data - (req + 4))) > 16384)\n return (unsigned char *)(req + 4);\n else\n return (unsigned char *)req;\n }\n if (le < req + 5)\n return le + 2;\n if (memcmp(le - 9, \" HTTP/1.\", 8) || !strchr(\"01\", (int)*(le - 1)))\n return le + 2;\n if (!(blankline = memstr(le + 2, (len - (data - (le + 2))), (unsigned char *) \"\\r\\n\\r\\n\", 4))) {\n if ((len - (data - (le + 2))) > 16384)\n return (unsigned char *)(data + len - 4);\n else\n return req;\n }\n if (memcmp(req + 4, \"http://\", 7) == 0)\n goto found;\n if (!(hosthdr = memstr(le, blankline - le + 2, (unsigned char *) \"\\r\\nHost: \", 8))) {\n return blankline + 4;\n }\nfound:\n *http = req;\n *httplen = blankline - req;\n return blankline + 4;\n}",
"variable_types": [
[
"data",
"unsigned char *"
],
[
"len",
"unsigned long"
],
[
"http",
"unsigned char **"
],
[
"httplen",
"unsigned long *"
],
[
"req",
"unsigned char *"
],
[
"le",
"unsigned char *"
],
[
"blankline",
"unsigned char *"
],
[
"hosthdr",
"unsigned char *"
]
],
"return_type": "unsigned char *",
"user_defined_types": [],
"binary_hash": "fe50906c74f83f5ecb08c59f4aa317a7d17d50127672dd7d3679146c8f00ad01"
},
{
"name": "dispatch_http_req",
"canonical_name": "func1",
"repo": "rbu/driftnet",
"decompiled_code": "void __fastcall dispatch_http_req(__int64 a1, __int64 a2, __int64 a3)\n{\nint v4; // [rsp+24h] [rbp-2Ch]\nconst char *v5; // [rsp+28h] [rbp-28h]\nint v6; // [rsp+34h] [rbp-1Ch]\nconst char *s1; // [rsp+38h] [rbp-18h]\n__int64 v8; // [rsp+40h] [rbp-10h]\n__int64 v9; // [rsp+40h] [rbp-10h]\n__int64 v10; // [rsp+40h] [rbp-10h]\nchar *s; // [rsp+48h] [rbp-8h]\n\nv8 = memstr(a2, a3, \"\\r\\n\", 2LL);\nif ( v8 )\n{\ns1 = (const char *)(a2 + 4);\nv6 = v8 - 9 - (a2 + 4);\nif ( !memcmp((const void *)(a2 + 4), \"http://\", 7uLL) )\n{\ns = (char *)malloc(v6 + 1);\nsprintf(s, \"%.*s\", v6, s1);\nLABEL_8:\nfprintf(stderr, \"\\n\\n %s\\n\\n\", s);\nfree(s);\nreturn;\n}\nv9 = memstr(v8, a3 - (v8 - a2), \"\\r\\nHost: \", 8LL);\nif ( v9 )\n{\nv5 = (const char *)(v9 + 8);\nv10 = memstr(v9 + 8, a3 - (v9 + 8 - a2), \"\\r\\n\", 2LL);\nif ( v10 )\n{\nv4 = v10 - (_DWORD)v5;\nif ( (_DWORD)v10 != (_DWORD)v5 )\n{\ns = (char *)malloc(v4 + v6 + 9);\nsprintf(s, \"http://%.*s%.*s\", v4, v5, v6, s1);\ngoto LABEL_8;\n}\n}\n}\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func1(__int64 a1, __int64 a2, __int64 a3)\n{\nint v4; // [rsp+24h] [rbp-2Ch]\nconst char *v5; // [rsp+28h] [rbp-28h]\nint v6; // [rsp+34h] [rbp-1Ch]\nconst char *s1; // [rsp+38h] [rbp-18h]\n__int64 v8; // [rsp+40h] [rbp-10h]\n__int64 v9; // [rsp+40h] [rbp-10h]\n__int64 v10; // [rsp+40h] [rbp-10h]\nchar *s; // [rsp+48h] [rbp-8h]\n\nv8 = memstr(a2, a3, \"\\r\\n\", 2LL);\nif ( v8 )\n{\ns1 = (const char *)(a2 + 4);\nv6 = v8 - 9 - (a2 + 4);\nif ( !memcmp((const void *)(a2 + 4), \"http://\", 7uLL) )\n{\ns = (char *)malloc(v6 + 1);\nsprintf(s, \"%.*s\", v6, s1);\nLABEL_8:\nfprintf(stderr, \"\\n\\n %s\\n\\n\", s);\nfree(s);\nreturn;\n}\nv9 = memstr(v8, a3 - (v8 - a2), \"\\r\\nHost: \", 8LL);\nif ( v9 )\n{\nv5 = (const char *)(v9 + 8);\nv10 = memstr(v9 + 8, a3 - (v9 + 8 - a2), \"\\r\\n\", 2LL);\nif ( v10 )\n{\nv4 = v10 - (_DWORD)v5;\nif ( (_DWORD)v10 != (_DWORD)v5 )\n{\ns = (char *)malloc(v4 + v6 + 9);\nsprintf(s, \"http://%.*s%.*s\", v4, v5, v6, s1);\ngoto LABEL_8;\n}\n}\n}\n}\n}",
"original_code": "void dispatch_http_req(const char *mname, const unsigned char *data, const size_t len) {\n char *url;\n const char *path, *host;\n int pathlen, hostlen;\n const unsigned char *p;\n if (!(p = memstr(data, len, (unsigned char*) \"\\r\\n\", 2)))\n return;\n path = (const char*)(data + 4);\n pathlen = (p - 9) - (unsigned char*)path;\n if (memcmp(path, \"http://\", 7) == 0) {\n url = malloc(pathlen + 1);\n sprintf(url, \"%.*s\", pathlen, path);\n } else {\n if (!(p = memstr(p, len - (p - data), (unsigned char*) \"\\r\\nHost: \", 8)))\n return;\n host = (const char*)(p + 8);\n if (!(p = memstr(p + 8, len - (p + 8 - data), (unsigned char*) \"\\r\\n\", 2)))\n return;\n hostlen = p - (const unsigned char*)host;\n if (hostlen == 0)\n return;\n url = malloc(hostlen + pathlen + 9);\n sprintf(url, \"http://%.*s%.*s\", hostlen, host, pathlen, path);\n }\n fprintf(stderr, \"\\n\\n %s\\n\\n\", url);\n free(url);\n}",
"canonical_original_code": "void dispatch_http_req(char *mname, unsigned char *data, unsigned long len) {\n char *url;\n char *path; char *host;\n int pathlen; int hostlen;\n unsigned char *p;\n if (!(p = memstr(data, len, (unsigned char *) \"\\r\\n\", 2)))\n return;\n path = (char *)(data + 4);\n pathlen = (p - 9) - (unsigned char *)path;\n if (memcmp(path, \"http://\", 7) == 0) {\n url = malloc(pathlen + 1);\n sprintf(url, \"%.*s\", pathlen, path);\n } else {\n if (!(p = memstr(p, len - (p - data), (unsigned char *) \"\\r\\nHost: \", 8)))\n return;\n host = (char *)(p + 8);\n if (!(p = memstr(p + 8, len - (p + 8 - data), (unsigned char *) \"\\r\\n\", 2)))\n return;\n hostlen = p - (unsigned char *)host;\n if (hostlen == 0)\n return;\n url = malloc(hostlen + pathlen + 9);\n sprintf(url, \"http://%.*s%.*s\", hostlen, host, pathlen, path);\n }\n fprintf(stderr, \"\\n\\n %s\\n\\n\", url);\n free(url);\n}",
"variable_types": [
[
"mname",
"char *"
],
[
"data",
"unsigned char *"
],
[
"len",
"unsigned long"
],
[
"url",
"char *"
],
[
"path",
"char *"
],
[
"host",
"char *"
],
[
"pathlen",
"int"
],
[
"hostlen",
"int"
],
[
"p",
"unsigned char *"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "fe50906c74f83f5ecb08c59f4aa317a7d17d50127672dd7d3679146c8f00ad01"
}
] |
bd80db71512f7921bfee449b4e52caf8bc51e5046e65c24c3f230973d14f4adf | saulrh/Liberty-Daemon | [
[
"daemon_sig_handler",
"->"
],
[
"fork_sig_handler",
"->"
],
[
"daemonize",
"->"
],
[
"daemon_close",
"->",
"daemon_assert"
],
[
"daemon_assert",
"->",
"daemon_close"
]
] | [
[
"daemon_assert",
"void __fastcall func4(int a1, unsigned int a2)\n{\nint *v2; // rax\nchar *v3; // rbx\nint *v4; // rax\n\nif ( !a1 )\n{\nv2 = _errno_location();\nv3 = strerror(*v2);\nv4 = _errno_location();\nfprintf(stderr, \"Assertion failed on line %d, at time %s\\n\\t code=%d (%s)\\n\", a2, \"03:47:48\", (unsigned int)*v4, v3);\nfunc3();\nexit(1);\n}\n}"
]
] | [
{
"name": "daemon_sig_handler",
"canonical_name": "func0",
"repo": "saulrh/Liberty-Daemon",
"decompiled_code": "void __fastcall daemon_sig_handler(int a1)\n{\nswitch ( a1 )\n{\ncase 2:\ncase 3:\ncase 15:\ndaemon_sig_quit = 1;\nbreak;\ncase 10:\ndaemon_sig_usr1 = 1;\nbreak;\ncase 12:\ndaemon_sig_usr2 = 1;\nbreak;\ncase 14:\nexit(1);\ncase 17:\nexit(1);\ndefault:\nreturn;\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func0(int a1)\n{\nswitch ( a1 )\n{\ncase 2:\ncase 3:\ncase 15:\ndaemon_sig_quit = 1;\nbreak;\ncase 10:\ndaemon_sig_usr1 = 1;\nbreak;\ncase 12:\ndaemon_sig_usr2 = 1;\nbreak;\ncase 14:\nexit(1);\ncase 17:\nexit(1);\ndefault:\nreturn;\n}\n}",
"original_code": "static void daemon_sig_handler(int signum)\n{\n switch(signum)\n {\n case 14: exit(1); break;\n case 10: daemon_sig_usr1 = 1; break;\n case 12: daemon_sig_usr2 = 1; break;\n case 17: exit(1); break;\n case 2:\n case 3:\n case 15: daemon_sig_quit=1; break;\n }\n}",
"canonical_original_code": "static void daemon_sig_handler(int signum)\n{\n switch(signum)\n {\n case 14: exit(1); break;\n case 10: daemon_sig_usr1 = 1; break;\n case 12: daemon_sig_usr2 = 1; break;\n case 17: exit(1); break;\n case 2:\n case 3:\n case 15: daemon_sig_quit=1; break;\n }\n}",
"variable_types": [
[
"signum",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "bd80db71512f7921bfee449b4e52caf8bc51e5046e65c24c3f230973d14f4adf"
},
{
"name": "fork_sig_handler",
"canonical_name": "func1",
"repo": "saulrh/Liberty-Daemon",
"decompiled_code": "void __fastcall fork_sig_handler(int a1)\n{\nif ( a1 == 10 )\nexit(0);\n}\n",
"canonical_decompiled_code": "void __fastcall func1(int a1)\n{\nif ( a1 == 10 )\nexit(0);\n}",
"original_code": "static void fork_sig_handler(int signum)\n{\n switch(signum)\n {\n case 10: exit(0); break;\n }\n}",
"canonical_original_code": "static void fork_sig_handler(int signum)\n{\n switch(signum)\n {\n case 10: exit(0); break;\n }\n}",
"variable_types": [
[
"signum",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "bd80db71512f7921bfee449b4e52caf8bc51e5046e65c24c3f230973d14f4adf"
},
{
"name": "daemonize",
"canonical_name": "func2",
"repo": "saulrh/Liberty-Daemon",
"decompiled_code": "void __fastcall daemonize(const char *a1)\n{\nint *v1; // rax\nchar *v2; // rbx\nint *v3; // rax\nint *v4; // rax\nchar *v5; // rbx\nint *v6; // rax\nint *v7; // rax\nchar *v8; // rbx\nint *v9; // rax\nint *v10; // rax\nchar *v11; // rbx\nint *v12; // rax\nint *v13; // rax\nchar *v14; // rbx\nint *v15; // rax\nint *v16; // rax\nchar *v17; // rbx\nint *v18; // rax\nint *v19; // rax\nchar *v20; // rbx\nint *v21; // rax\nstruct sched_param param; // [rsp+1Ch] [rbp-184h] BYREF\nchar filename[112]; // [rsp+20h] [rbp-180h] BYREF\nchar s[224]; // [rsp+90h] [rbp-110h] BYREF\n__pid_t v25; // [rsp+170h] [rbp-30h]\n__pid_t pid; // [rsp+174h] [rbp-2Ch]\n__pid_t v27; // [rsp+178h] [rbp-28h]\n__pid_t v28; // [rsp+17Ch] [rbp-24h]\nstruct passwd *v29; // [rsp+180h] [rbp-20h]\nint v30; // [rsp+18Ch] [rbp-14h]\n\nsprintf(gdaemon_name, \"%s\", a1);\nsyslog(5, \"Starting daemonization for %s\", a1);\ndaemon_sig_quit = 0;\ndaemon_sig_usr1 = 0;\ndaemon_sig_usr2 = 0;\nv30 = -1;\nif ( getppid() != 1 )\n{\nsprintf(lockfile, \"/var/lock/%s\", a1);\nif ( lockfile[0] )\n{\nv30 = open(lockfile, 194, 416LL);\nif ( v30 < 0 )\n{\nv1 = _errno_location();\nv2 = strerror(*v1);\nv3 = _errno_location();\nsyslog(\n3,\n\"Unable to create lock file %s, code=%d (%s) Check if daemon already exists!\",\nlockfile,\n(unsigned int)*v3,\nv2);\nexit(1);\n}\n}\nif ( !getuid() || !geteuid() )\n{\nv29 = getpwnam(\"root\");\nif ( v29 )\n{\nsyslog(5, \"Setting user to root\");\nsetuid(v29->pw_uid);\n}\n}\nsignal(17, daemon_sig_handler);\nsignal(12, daemon_sig_handler);\nsignal(14, daemon_sig_handler);\nsignal(2, daemon_sig_handler);\nsignal(3, daemon_sig_handler);\nsignal(15, daemon_sig_handler);\nsignal(10, fork_sig_handler);\nv28 = fork();\nif ( v28 < 0 )\n{\nv4 = _errno_location();\nv5 = strerror(*v4);\nv6 = _errno_location();\nsyslog(3, \"Unable to fork daemon, code=%d (%s)\", (unsigned int)*v6, v5);\nexit(1);\n}\nif ( v28 > 0 )\n{\nalarm(2u);\npause();\nexit(1);\n}\nv27 = fork();\nif ( v27 < 0 )\n{\nv7 = _errno_location();\nv8 = strerror(*v7);\nv9 = _errno_location();\nsyslog(3, \"Unable to fork daemon, code=%d (%s)\", (unsigned int)*v9, v8);\nexit(1);\n}\nif ( v27 > 0 )\n{\npid = getppid();\nkill(pid, 10);\nalarm(2u);\npause();\nexit(1);\n}\npid = getppid();\nsignal(17, 0LL);\nsignal(20, handler);\nsignal(22, handler);\nsignal(21, handler);\nsignal(1, handler);\nsignal(10, daemon_sig_handler);\numask(0);\nv25 = setsid();\nif ( v25 < 0 )\n{\nv10 = _errno_location();\nv11 = strerror(*v10);\nv12 = _errno_location();\nsyslog(3, \"Unable to create new session, code=%d (%s)\", (unsigned int)*v12, v11);\nexit(1);\n}\nif ( chdir(\"/\") < 0 )\n{\nv13 = _errno_location();\nv14 = strerror(*v13);\nv15 = _errno_location();\nsyslog(3, \"Unable to change directory, code=%d (%s)\", (unsigned int)*v15, v14);\nexit(1);\n}\nsprintf(s, \"/var/log/daemon/%s-output\", a1);\nsprintf(filename, \"/var/log/daemon/%s-error\", a1);\nif ( !fopen(s, \"w\") || !fopen(filename, \"w\") )\n{\nv16 = _errno_location();\nv17 = strerror(*v16);\nv18 = _errno_location();\nsyslog(3, \"Unable to create log files, code=%d (%s)\", (unsigned int)*v18, v17);\nexit(1);\n}\nif ( !freopen(s, \"w\", stdout) || !freopen(filename, \"w\", stderr) )\n{\nv19 = _errno_location();\nv20 = strerror(*v19);\nv21 = _errno_location();\nsyslog(3, \"Unable to stream output, code=%d (%s)\", (unsigned int)*v21, v20);\nexit(1);\n}\nkill(pid, 10);\nparam.__sched_priority = 49;\nif ( sched_setscheduler(0, 1, ¶m) == -1 )\n{\nfwrite(\"sched_setscheduler Failed!\\n\", 1uLL, 0x1BuLL, stderr);\nexit(1);\n}\nif ( mlockall(3) == -1 )\n{\nfwrite(\"mlockall Failed!\\n\", 1uLL, 0x11uLL, stderr);\nexit(1);\n}\nstack_prefault();\nsyslog(5, \"Daemonization finished - Process Beginning\");\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func2(const char *a1)\n{\nint *v1; // rax\nchar *v2; // rbx\nint *v3; // rax\nint *v4; // rax\nchar *v5; // rbx\nint *v6; // rax\nint *v7; // rax\nchar *v8; // rbx\nint *v9; // rax\nint *v10; // rax\nchar *v11; // rbx\nint *v12; // rax\nint *v13; // rax\nchar *v14; // rbx\nint *v15; // rax\nint *v16; // rax\nchar *v17; // rbx\nint *v18; // rax\nint *v19; // rax\nchar *v20; // rbx\nint *v21; // rax\nstruct sched_param param; // [rsp+1Ch] [rbp-184h] BYREF\nchar filename[112]; // [rsp+20h] [rbp-180h] BYREF\nchar s[224]; // [rsp+90h] [rbp-110h] BYREF\n__pid_t v25; // [rsp+170h] [rbp-30h]\n__pid_t pid; // [rsp+174h] [rbp-2Ch]\n__pid_t v27; // [rsp+178h] [rbp-28h]\n__pid_t v28; // [rsp+17Ch] [rbp-24h]\nstruct passwd *v29; // [rsp+180h] [rbp-20h]\nint v30; // [rsp+18Ch] [rbp-14h]\n\nsprintf(gdaemon_name, \"%s\", a1);\nsyslog(5, \"Starting daemonization for %s\", a1);\ndaemon_sig_quit = 0;\ndaemon_sig_usr1 = 0;\ndaemon_sig_usr2 = 0;\nv30 = -1;\nif ( getppid() != 1 )\n{\nsprintf(lockfile, \"/var/lock/%s\", a1);\nif ( lockfile[0] )\n{\nv30 = open(lockfile, 194, 416LL);\nif ( v30 < 0 )\n{\nv1 = _errno_location();\nv2 = strerror(*v1);\nv3 = _errno_location();\nsyslog(\n3,\n\"Unable to create lock file %s, code=%d (%s) Check if daemon already exists!\",\nlockfile,\n(unsigned int)*v3,\nv2);\nexit(1);\n}\n}\nif ( !getuid() || !geteuid() )\n{\nv29 = getpwnam(\"root\");\nif ( v29 )\n{\nsyslog(5, \"Setting user to root\");\nsetuid(v29->pw_uid);\n}\n}\nsignal(17, daemon_sig_handler);\nsignal(12, daemon_sig_handler);\nsignal(14, daemon_sig_handler);\nsignal(2, daemon_sig_handler);\nsignal(3, daemon_sig_handler);\nsignal(15, daemon_sig_handler);\nsignal(10, fork_sig_handler);\nv28 = fork();\nif ( v28 < 0 )\n{\nv4 = _errno_location();\nv5 = strerror(*v4);\nv6 = _errno_location();\nsyslog(3, \"Unable to fork daemon, code=%d (%s)\", (unsigned int)*v6, v5);\nexit(1);\n}\nif ( v28 > 0 )\n{\nalarm(2u);\npause();\nexit(1);\n}\nv27 = fork();\nif ( v27 < 0 )\n{\nv7 = _errno_location();\nv8 = strerror(*v7);\nv9 = _errno_location();\nsyslog(3, \"Unable to fork daemon, code=%d (%s)\", (unsigned int)*v9, v8);\nexit(1);\n}\nif ( v27 > 0 )\n{\npid = getppid();\nkill(pid, 10);\nalarm(2u);\npause();\nexit(1);\n}\npid = getppid();\nsignal(17, 0LL);\nsignal(20, handler);\nsignal(22, handler);\nsignal(21, handler);\nsignal(1, handler);\nsignal(10, daemon_sig_handler);\numask(0);\nv25 = setsid();\nif ( v25 < 0 )\n{\nv10 = _errno_location();\nv11 = strerror(*v10);\nv12 = _errno_location();\nsyslog(3, \"Unable to create new session, code=%d (%s)\", (unsigned int)*v12, v11);\nexit(1);\n}\nif ( chdir(\"/\") < 0 )\n{\nv13 = _errno_location();\nv14 = strerror(*v13);\nv15 = _errno_location();\nsyslog(3, \"Unable to change directory, code=%d (%s)\", (unsigned int)*v15, v14);\nexit(1);\n}\nsprintf(s, \"/var/log/daemon/%s-output\", a1);\nsprintf(filename, \"/var/log/daemon/%s-error\", a1);\nif ( !fopen(s, \"w\") || !fopen(filename, \"w\") )\n{\nv16 = _errno_location();\nv17 = strerror(*v16);\nv18 = _errno_location();\nsyslog(3, \"Unable to create log files, code=%d (%s)\", (unsigned int)*v18, v17);\nexit(1);\n}\nif ( !freopen(s, \"w\", stdout) || !freopen(filename, \"w\", stderr) )\n{\nv19 = _errno_location();\nv20 = strerror(*v19);\nv21 = _errno_location();\nsyslog(3, \"Unable to stream output, code=%d (%s)\", (unsigned int)*v21, v20);\nexit(1);\n}\nkill(pid, 10);\nparam.__sched_priority = 49;\nif ( sched_setscheduler(0, 1, ¶m) == -1 )\n{\nfwrite(\"sched_setscheduler Failed!\\n\", 1uLL, 0x1BuLL, stderr);\nexit(1);\n}\nif ( mlockall(3) == -1 )\n{\nfwrite(\"mlockall Failed!\\n\", 1uLL, 0x11uLL, stderr);\nexit(1);\n}\nstack_prefault();\nsyslog(5, \"Daemonization finished - Process Beginning\");\n}\n}",
"original_code": "void daemonize(const char *daemon_name)\n{\n char pbuff[100];\n sprintf(gdaemon_name, \"%s\", daemon_name);\n syslog( 5, \"Starting daemonization for %s\", daemon_name );\n daemon_sig_quit = 0;\n daemon_sig_usr1 = 0;\n daemon_sig_usr2 = 0;\n pid_t pid, child, sid, parent;\n int lfp = -1;\n if( getppid() == 1 ) return;\n sprintf(lockfile, \"/var/lock/%s\", daemon_name);\n if( lockfile && lockfile[0] )\n {\n lfp = open(lockfile,02|0100|0200,0640);\n if( lfp < 0 )\n {\n syslog( 3, \"Unable to create lock file %s, code=%d (%s)\"\n \" Check if daemon already exists!\",\n lockfile, (*__errno_location ()), strerror((*__errno_location ())) );\n exit( 1 );\n }\n }\n if( getuid()==0 || geteuid()==0 )\n {\n struct passwd *pw = getpwnam(\"root\");\n if( pw )\n {\n syslog( 5, \"Setting user to \" \"root\" );\n setuid( pw->pw_uid );\n }\n }\n signal( 17, daemon_sig_handler );\n signal( 12, daemon_sig_handler );\n signal( 14, daemon_sig_handler );\n signal( 2, daemon_sig_handler );\n signal( 3, daemon_sig_handler );\n signal( 15, daemon_sig_handler );\n signal( 10, fork_sig_handler );\n child = fork();\n if( child<0 )\n {\n syslog( 3, \"Unable to fork daemon, code=%d (%s)\",\n (*__errno_location ()), strerror((*__errno_location ())) );\n exit( 1 );\n }\n if( child>0 )\n {\n alarm(2);\n pause();\n exit( 1 );\n }\n pid = fork();\n if( pid<0 )\n {\n syslog( 3, \"Unable to fork daemon, code=%d (%s)\",\n (*__errno_location ()), strerror((*__errno_location ())) );\n exit( 1 );\n }\n if( pid>0 )\n {\n parent = getppid();\n kill( parent, 10 );\n alarm(2);\n pause();\n exit( 1 );\n }\n parent = getppid();\n signal( 17, ((__sighandler_t) 0) );\n signal( 20, ((__sighandler_t) 1) );\n signal( 22, ((__sighandler_t) 1) );\n signal( 21, ((__sighandler_t) 1) );\n signal( 1, ((__sighandler_t) 1) );\n signal( 10, daemon_sig_handler );\n umask(0);\n sid = setsid();\n if( sid<0 )\n {\n syslog( 3, \"Unable to create new session, code=%d (%s)\",\n (*__errno_location ()), strerror((*__errno_location ())) );\n exit( 1 );\n }\n if( (chdir(\"/\")) < 0 )\n {\n syslog( 3, \"Unable to change directory, code=%d (%s)\",\n (*__errno_location ()), strerror((*__errno_location ())) );\n exit( 1 );\n }\n char outfile[100];\n char errfile[100];\n sprintf(outfile, \"/var/log/daemon/%s-output\", daemon_name);\n sprintf(errfile, \"/var/log/daemon/%s-error\", daemon_name);\n if( !fopen( outfile, \"w\" ) ||\n !fopen( errfile, \"w\" ) )\n {\n syslog( 3, \"Unable to create log files, code=%d (%s)\",\n (*__errno_location ()), strerror((*__errno_location ())) );\n exit(1);\n }\n if( !freopen( outfile, \"w\", stdout ) ||\n !freopen( errfile, \"w\", stderr ) )\n {\n syslog( 3, \"Unable to stream output, code=%d (%s)\",\n (*__errno_location ()), strerror((*__errno_location ())) );\n exit( 1 );\n }\n kill( parent, 10 );\n struct sched_param param;\n param.sched_priority = (49);\n if( sched_setscheduler(0, 1, ¶m) == -1 )\n {\n fprintf(stderr, \"sched_setscheduler Failed!\\n\");\n exit( 1 );\n }\n if(mlockall(1|2) == -1)\n {\n fprintf(stderr, \"mlockall Failed!\\n\");\n exit( 1 );\n }\n stack_prefault();\n syslog( 5, \"Daemonization finished - Process Beginning\" );\n}",
"canonical_original_code": "void daemonize(char *daemon_name)\n{\n char pbuff[100];\n sprintf(gdaemon_name, \"%s\", daemon_name);\n syslog( 5, \"Starting daemonization for %s\", daemon_name );\n daemon_sig_quit = 0;\n daemon_sig_usr1 = 0;\n daemon_sig_usr2 = 0;\n int pid; int child; int sid; int parent;\n int lfp = -1;\n if( getppid() == 1 ) return;\n sprintf(lockfile, \"/var/lock/%s\", daemon_name);\n if( lockfile && lockfile[0] )\n {\n lfp = open(lockfile,02|0100|0200,0640);\n if( lfp < 0 )\n {\n syslog( 3, \"Unable to create lock file %s, code=%d (%s)\"\n \" Check if daemon already exists!\",\n lockfile, (*__errno_location ()), strerror((*__errno_location ())) );\n exit( 1 );\n }\n }\n if( getuid()==0 || geteuid()==0 )\n {\n struct passwd *pw = getpwnam(\"root\");\n if( pw )\n {\n syslog( 5, \"Setting user to \" \"root\" );\n setuid( pw->pw_uid );\n }\n }\n signal( 17, daemon_sig_handler );\n signal( 12, daemon_sig_handler );\n signal( 14, daemon_sig_handler );\n signal( 2, daemon_sig_handler );\n signal( 3, daemon_sig_handler );\n signal( 15, daemon_sig_handler );\n signal( 10, fork_sig_handler );\n child = fork();\n if( child<0 )\n {\n syslog( 3, \"Unable to fork daemon, code=%d (%s)\",\n (*__errno_location ()), strerror((*__errno_location ())) );\n exit( 1 );\n }\n if( child>0 )\n {\n alarm(2);\n pause();\n exit( 1 );\n }\n pid = fork();\n if( pid<0 )\n {\n syslog( 3, \"Unable to fork daemon, code=%d (%s)\",\n (*__errno_location ()), strerror((*__errno_location ())) );\n exit( 1 );\n }\n if( pid>0 )\n {\n parent = getppid();\n kill( parent, 10 );\n alarm(2);\n pause();\n exit( 1 );\n }\n parent = getppid();\n signal( 17, ((void (*)(int)) 0) );\n signal( 20, ((void (*)(int)) 1) );\n signal( 22, ((void (*)(int)) 1) );\n signal( 21, ((void (*)(int)) 1) );\n signal( 1, ((void (*)(int)) 1) );\n signal( 10, daemon_sig_handler );\n umask(0);\n sid = setsid();\n if( sid<0 )\n {\n syslog( 3, \"Unable to create new session, code=%d (%s)\",\n (*__errno_location ()), strerror((*__errno_location ())) );\n exit( 1 );\n }\n if( (chdir(\"/\")) < 0 )\n {\n syslog( 3, \"Unable to change directory, code=%d (%s)\",\n (*__errno_location ()), strerror((*__errno_location ())) );\n exit( 1 );\n }\n char outfile[100];\n char errfile[100];\n sprintf(outfile, \"/var/log/daemon/%s-output\", daemon_name);\n sprintf(errfile, \"/var/log/daemon/%s-error\", daemon_name);\n if( !fopen( outfile, \"w\" ) ||\n !fopen( errfile, \"w\" ) )\n {\n syslog( 3, \"Unable to create log files, code=%d (%s)\",\n (*__errno_location ()), strerror((*__errno_location ())) );\n exit(1);\n }\n if( !freopen( outfile, \"w\", stdout ) ||\n !freopen( errfile, \"w\", stderr ) )\n {\n syslog( 3, \"Unable to stream output, code=%d (%s)\",\n (*__errno_location ()), strerror((*__errno_location ())) );\n exit( 1 );\n }\n kill( parent, 10 );\n struct sched_param param;\n param.sched_priority = (49);\n if( sched_setscheduler(0, 1, ¶m) == -1 )\n {\n fprintf(stderr, \"sched_setscheduler Failed!\\n\");\n exit( 1 );\n }\n if(mlockall(1|2) == -1)\n {\n fprintf(stderr, \"mlockall Failed!\\n\");\n exit( 1 );\n }\n stack_prefault();\n syslog( 5, \"Daemonization finished - Process Beginning\" );\n}",
"variable_types": [
[
"daemon_name",
"char *"
],
[
"pbuff",
"char [100]"
],
[
"pid",
"int"
],
[
"child",
"int"
],
[
"sid",
"int"
],
[
"parent",
"int"
],
[
"lfp",
"int"
],
[
"pw",
"struct passwd { char *pw_name; char *pw_passwd; unsigned int pw_uid; unsigned int pw_gid; char *pw_gecos; char *pw_dir; char *pw_shell; } *"
],
[
"outfile",
"char [100]"
],
[
"errfile",
"char [100]"
],
[
"param",
"struct sched_param { int sched_priority; }"
]
],
"return_type": "void",
"user_defined_types": [
"struct sched_param { int sched_priority; }",
"struct passwd { char *pw_name; char *pw_passwd; unsigned int pw_uid; unsigned int pw_gid; char *pw_gecos; char *pw_dir; char *pw_shell; }"
],
"binary_hash": "bd80db71512f7921bfee449b4e52caf8bc51e5046e65c24c3f230973d14f4adf"
},
{
"name": "daemon_close",
"canonical_name": "func3",
"repo": "saulrh/Liberty-Daemon",
"decompiled_code": "void daemon_close()\n{\nremove(lockfile);\nfclose(stdout);\nfclose(stderr);\nsyslog(5, \"Terminated process %s gracefully\", gdaemon_name);\ncloselog();\n}\n",
"canonical_decompiled_code": "void func3()\n{\nremove(lockfile);\nfclose(stdout);\nfclose(stderr);\nsyslog(5, \"Terminated process %s gracefully\", gdaemon_name);\ncloselog();\n}",
"original_code": "void daemon_close()\n{\n remove( lockfile );\n fclose( stdout );\n fclose( stderr );\n char buff[100];\n syslog( 5, \"Terminated process %s gracefully\", gdaemon_name );\n closelog();\n}",
"canonical_original_code": "void daemon_close()\n{\n remove( lockfile );\n fclose( stdout );\n fclose( stderr );\n char buff[100];\n syslog( 5, \"Terminated process %s gracefully\", gdaemon_name );\n closelog();\n}",
"variable_types": [
[
"buff",
"char [100]"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "bd80db71512f7921bfee449b4e52caf8bc51e5046e65c24c3f230973d14f4adf"
}
] |
327ea677fac1c524ebd5d880843d50b86acc50b5a3a5be2c9f903762dc1a3a00 | demonicblue/operating-systems | [
[
"parse",
"->",
"init",
"acmd",
"isidentifier"
],
[
"init",
"->",
"parse"
],
[
"acmd",
"->",
"parse"
],
[
"isidentifier",
"->",
"parse"
]
] | [] | [
{
"name": "parse",
"canonical_name": "func0",
"repo": "demonicblue/operating-systems",
"decompiled_code": "__int64 __fastcall parse(__int64 a1, __int64 a2)\n{\n__int64 result; // rax\nint v3; // eax\nchar *v4; // [rsp+10h] [rbp-20h] BYREF\n__int64 v5; // [rsp+18h] [rbp-18h] BYREF\nint v6; // [rsp+24h] [rbp-Ch]\n__int64 v7; // [rsp+28h] [rbp-8h]\n\nv7 = a1;\ninit();\n*(_QWORD *)(a2 + 8) = 0LL;\n*(_QWORD *)(a2 + 16) = 0LL;\n*(_QWORD *)(a2 + 24) = 0LL;\n*(_DWORD *)(a2 + 32) = 0;\n*(_QWORD *)a2 = 0LL;\nLABEL_2:\nv6 = acmd(v7, &v5);\nif ( v6 <= 0 )\nreturn 0xFFFFFFFFLL;\nv7 += v6;\n*(_QWORD *)(v5 + 8) = *(_QWORD *)a2;\n*(_QWORD *)a2 = v5;\nwhile ( 1 )\n{\nwhile ( 1 )\n{\nv6 = nexttoken(v7, &v4);\nif ( !v6 )\nreturn 1LL;\nv7 += v6;\nv3 = *v4;\nif ( v3 == 124 )\ngoto LABEL_2;\nif ( v3 > 124 )\nreturn 0xFFFFFFFFLL;\nif ( v3 != 62 )\nbreak;\nif ( *(_QWORD *)(a2 + 16) )\n{\nfwrite(\"duplicate redirection of stdout\\n\", 1uLL, 0x20uLL, stderr);\nreturn 0xFFFFFFFFLL;\n}\nv6 = nexttoken(v7, a2 + 16);\nif ( v6 < 0 )\nreturn 0xFFFFFFFFLL;\nif ( !(unsigned int)isidentifier(*(_QWORD *)(a2 + 16)) )\n{\nfprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", *(const char **)(a2 + 16));\nreturn 0xFFFFFFFFLL;\n}\nv7 += v6;\n}\nif ( v3 > 62 )\nreturn 0xFFFFFFFFLL;\nif ( v3 == 38 )\nbreak;\nif ( v3 != 60 )\nreturn 0xFFFFFFFFLL;\nif ( *(_QWORD *)(a2 + 8) )\n{\nfwrite(\"duplicate redirection of stdin\\n\", 1uLL, 0x1FuLL, stderr);\nreturn 0xFFFFFFFFLL;\n}\nv6 = nexttoken(v7, a2 + 8);\nif ( v6 < 0 )\nreturn 0xFFFFFFFFLL;\nif ( !(unsigned int)isidentifier(*(_QWORD *)(a2 + 8)) )\n{\nfprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", *(const char **)(a2 + 8));\nreturn 0xFFFFFFFFLL;\n}\nv7 += v6;\n}\nv6 = nexttoken(v7, &v4);\nif ( v6 )\n{\nfwrite(\"illegal bakgrounding\\n\", 1uLL, 0x15uLL, stderr);\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\n*(_DWORD *)(a2 + 32) = 1;\nresult = 1LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, __int64 a2)\n{\n__int64 result; // rax\nint v3; // eax\nchar *v4; // [rsp+10h] [rbp-20h] BYREF\n__int64 v5; // [rsp+18h] [rbp-18h] BYREF\nint v6; // [rsp+24h] [rbp-Ch]\n__int64 v7; // [rsp+28h] [rbp-8h]\n\nv7 = a1;\nfunc1();\n*(_QWORD *)(a2 + 8) = 0LL;\n*(_QWORD *)(a2 + 16) = 0LL;\n*(_QWORD *)(a2 + 24) = 0LL;\n*(_DWORD *)(a2 + 32) = 0;\n*(_QWORD *)a2 = 0LL;\nLABEL_2:\nv6 = func2(v7, &v5);\nif ( v6 <= 0 )\nreturn 0xFFFFFFFFLL;\nv7 += v6;\n*(_QWORD *)(v5 + 8) = *(_QWORD *)a2;\n*(_QWORD *)a2 = v5;\nwhile ( 1 )\n{\nwhile ( 1 )\n{\nv6 = nexttoken(v7, &v4);\nif ( !v6 )\nreturn 1LL;\nv7 += v6;\nv3 = *v4;\nif ( v3 == 124 )\ngoto LABEL_2;\nif ( v3 > 124 )\nreturn 0xFFFFFFFFLL;\nif ( v3 != 62 )\nbreak;\nif ( *(_QWORD *)(a2 + 16) )\n{\nfwrite(\"duplicate redirection of stdout\\n\", 1uLL, 0x20uLL, stderr);\nreturn 0xFFFFFFFFLL;\n}\nv6 = nexttoken(v7, a2 + 16);\nif ( v6 < 0 )\nreturn 0xFFFFFFFFLL;\nif ( !(unsigned int)func3(*(_QWORD *)(a2 + 16)) )\n{\nfprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", *(const char **)(a2 + 16));\nreturn 0xFFFFFFFFLL;\n}\nv7 += v6;\n}\nif ( v3 > 62 )\nreturn 0xFFFFFFFFLL;\nif ( v3 == 38 )\nbreak;\nif ( v3 != 60 )\nreturn 0xFFFFFFFFLL;\nif ( *(_QWORD *)(a2 + 8) )\n{\nfwrite(\"duplicate redirection of stdin\\n\", 1uLL, 0x1FuLL, stderr);\nreturn 0xFFFFFFFFLL;\n}\nv6 = nexttoken(v7, a2 + 8);\nif ( v6 < 0 )\nreturn 0xFFFFFFFFLL;\nif ( !(unsigned int)func3(*(_QWORD *)(a2 + 8)) )\n{\nfprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", *(const char **)(a2 + 8));\nreturn 0xFFFFFFFFLL;\n}\nv7 += v6;\n}\nv6 = nexttoken(v7, &v4);\nif ( v6 )\n{\nfwrite(\"illegal bakgrounding\\n\", 1uLL, 0x15uLL, stderr);\nresult = 0xFFFFFFFFLL;\n}\nelse\n{\n*(_DWORD *)(a2 + 32) = 1;\nresult = 1LL;\n}\nreturn result;\n}",
"original_code": "int\nparse (char *buf, Command *c)\n{\n int n;\n Pgm *cmd0;\n char *t = buf;\n char *tok;\n init();\n c->rstdin = ((void *)0);\n c->rstdout = ((void *)0);\n c->rstderr = ((void *)0);\n c->bakground = 0;\n c->pgm = ((void *)0);\nnewcmd:\n if ((n = acmd(t, &cmd0)) <= 0) {\n return -1;\n }\n t += n;\n cmd0->next = c->pgm;\n c->pgm = cmd0;\nnewtoken:\n n = nexttoken(t, &tok);\n if (n == 0) {\n return 1;\n }\n t += n;\n switch(*tok) {\n case ('|'):\n goto newcmd;\n break;\n case ('&'):\n n = nexttoken(t, &tok);\n if (n == 0) {\n c->bakground = 1;\n return 1;\n }\n else {\n fprintf(stderr, \"illegal bakgrounding\\n\");\n return -1;\n }\n break;\n case ('<'):\n if (c->rstdin != ((void *)0)) {\n fprintf(stderr, \"duplicate redirection of stdin\\n\");\n return -1;\n }\n if ((n = nexttoken(t, &(c->rstdin))) < 0) {\n return -1;\n }\n if (!isidentifier(c->rstdin)) {\n fprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", c->rstdin);\n return -1;\n }\n t += n;\n goto newtoken;\n break;\n case ('>'):\n if (c->rstdout != ((void *)0)) {\n fprintf(stderr, \"duplicate redirection of stdout\\n\");\n return -1;\n }\n if ((n = nexttoken(t, &(c->rstdout))) < 0) {\n return -1;\n }\n if (!isidentifier(c->rstdout)) {\n fprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", c->rstdout);\n return -1;\n }\n t += n;\n goto newtoken;\n break;\n default:\n return -1;\n }\n goto newcmd;\n}",
"canonical_original_code": "int parse(char *buf, struct node *c)\n{\n int n;\n struct c *cmd0;\n char *t = buf;\n char *tok;\n init();\n c->rstdin = ((void *)0);\n c->rstdout = ((void *)0);\n c->rstderr = ((void *)0);\n c->bakground = 0;\n c->pgm = ((void *)0);\nnewcmd:\n if ((n = acmd(t, &cmd0)) <= 0) {\n return -1;\n }\n t += n;\n cmd0->next = c->pgm;\n c->pgm = cmd0;\nnewtoken:\n n = nexttoken(t, &tok);\n if (n == 0) {\n return 1;\n }\n t += n;\n switch(*tok) {\n case ('|'):\n goto newcmd;\n break;\n case ('&'):\n n = nexttoken(t, &tok);\n if (n == 0) {\n c->bakground = 1;\n return 1;\n }\n else {\n fprintf(stderr, \"illegal bakgrounding\\n\");\n return -1;\n }\n break;\n case ('<'):\n if (c->rstdin != ((void *)0)) {\n fprintf(stderr, \"duplicate redirection of stdin\\n\");\n return -1;\n }\n if ((n = nexttoken(t, &(c->rstdin))) < 0) {\n return -1;\n }\n if (!isidentifier(c->rstdin)) {\n fprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", c->rstdin);\n return -1;\n }\n t += n;\n goto newtoken;\n break;\n case ('>'):\n if (c->rstdout != ((void *)0)) {\n fprintf(stderr, \"duplicate redirection of stdout\\n\");\n return -1;\n }\n if ((n = nexttoken(t, &(c->rstdout))) < 0) {\n return -1;\n }\n if (!isidentifier(c->rstdout)) {\n fprintf(stderr, \"Illegal filename: \\\"%s\\\"\\n\", c->rstdout);\n return -1;\n }\n t += n;\n goto newtoken;\n break;\n default:\n return -1;\n }\n goto newcmd;\n}",
"variable_types": [
[
"buf",
"char *"
],
[
"c",
"struct node { struct c { char **pgmlist; struct c *next; } *pgm; char *rstdin; char *rstdout; char *rstderr; int bakground; } *"
],
[
"n",
"int"
],
[
"cmd0",
"struct c { char **pgmlist; struct c *next; } *"
],
[
"t",
"char *"
],
[
"tok",
"char *"
]
],
"return_type": "int",
"user_defined_types": [
"struct node { struct c *pgm; char *rstdin; char *rstdout; char *rstderr; int bakground; }",
"struct c { char **pgmlist; struct c *next; }"
],
"binary_hash": "327ea677fac1c524ebd5d880843d50b86acc50b5a3a5be2c9f903762dc1a3a00"
},
{
"name": "init",
"canonical_name": "func1",
"repo": "demonicblue/operating-systems",
"decompiled_code": "_QWORD *init()\n{\n_QWORD *result; // rax\nint i; // [rsp+0h] [rbp-4h]\n\nfor ( i = 0; i <= 18; ++i )\n{\nresult = (_QWORD *)((char *)&unk_608 + 16 * i);\n*result = (char *)&cmdbuf + 16 * i + 16;\n}\nqword_738 = 0LL;\ncmds = (__int64)&cmdbuf;\ncp = (__int64)&cbuf;\npp = (__int64)&pbuf;\nreturn result;\n}\n",
"canonical_decompiled_code": "_QWORD *func1()\n{\n_QWORD *result; // rax\nint i; // [rsp+0h] [rbp-4h]\n\nfor ( i = 0; i <= 18; ++i )\n{\nresult = (_QWORD *)((char *)&unk_608 + 16 * i);\n*result = (char *)&cmdbuf + 16 * i + 16;\n}\nqword_738 = 0LL;\ncmds = (__int64)&cmdbuf;\ncp = (__int64)&cbuf;\npp = (__int64)&pbuf;\nreturn result;\n}",
"original_code": "void init( void )\n{\n int i;\n for (i=0;i<19;i++) {\n cmdbuf[i].next = &cmdbuf[i+1];\n }\n cmdbuf[19].next = ((void *)0);\n cmds = cmdbuf;\n cp = cbuf;\n pp = pbuf;\n}",
"canonical_original_code": "void init()\n{\n int i;\n for (i=0;i<19;i++) {\n cmdbuf[i].next = &cmdbuf[i+1];\n }\n cmdbuf[19].next = ((void *)0);\n cmds = cmdbuf;\n cp = cbuf;\n pp = pbuf;\n}",
"variable_types": [
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "327ea677fac1c524ebd5d880843d50b86acc50b5a3a5be2c9f903762dc1a3a00"
},
{
"name": "acmd",
"canonical_name": "func2",
"repo": "demonicblue/operating-systems",
"decompiled_code": "__int64 __fastcall acmd(char *a1, _QWORD *a2)\n{\n_QWORD *v2; // rax\n_QWORD *v4; // rax\n_BYTE *v6; // [rsp+10h] [rbp-20h] BYREF\nunsigned int v7; // [rsp+1Ch] [rbp-14h]\n_QWORD *v8; // [rsp+20h] [rbp-10h]\nunsigned int v9; // [rsp+2Ch] [rbp-4h]\n\nv9 = 0;\nv8 = (_QWORD *)cmds;\ncmds = *(_QWORD *)(cmds + 8);\nv8[1] = 0LL;\n*v8 = pp;\nwhile ( 1 )\n{\nv7 = (unsigned int)nexttoken(a1, &v6);\nif ( !v7 || *v6 == 124 || *v6 == 38 || *v6 == 60 || *v6 == 62 )\nbreak;\nv4 = (_QWORD *)pp;\npp += 8LL;\n*v4 = v6;\nv9 += v7;\na1 += (int)v7;\n}\n*a2 = v8;\nv2 = (_QWORD *)pp;\npp += 8LL;\n*v2 = 0LL;\nreturn v9;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(char *a1, _QWORD *a2)\n{\n_QWORD *v2; // rax\n_QWORD *v4; // rax\n_BYTE *v6; // [rsp+10h] [rbp-20h] BYREF\nunsigned int v7; // [rsp+1Ch] [rbp-14h]\n_QWORD *v8; // [rsp+20h] [rbp-10h]\nunsigned int v9; // [rsp+2Ch] [rbp-4h]\n\nv9 = 0;\nv8 = (_QWORD *)cmds;\ncmds = *(_QWORD *)(cmds + 8);\nv8[1] = 0LL;\n*v8 = pp;\nwhile ( 1 )\n{\nv7 = (unsigned int)nexttoken(a1, &v6);\nif ( !v7 || *v6 == 124 || *v6 == 38 || *v6 == 60 || *v6 == 62 )\nbreak;\nv4 = (_QWORD *)pp;\npp += 8LL;\n*v4 = v6;\nv9 += v7;\na1 += (int)v7;\n}\n*a2 = v8;\nv2 = (_QWORD *)pp;\npp += 8LL;\n*v2 = 0LL;\nreturn v9;\n}",
"original_code": "int\nacmd (char *s, Pgm **cmd)\n{\n char *tok;\n int n, cnt = 0;\n Pgm *cmd0 = cmds;\n cmds = cmds->next;\n cmd0->next = ((void *)0);\n cmd0->pgmlist = pp;\nnext:\n n = nexttoken(s, &tok);\n if (n == 0 || (((*tok) == ('|')) || ((*tok) == ('&')) || ((*tok) == ('<')) || ((*tok) == ('>')))) {\n *cmd = cmd0;\n *pp++ = ((void *)0);\n return cnt;\n }\n else {\n *pp++ = tok;\n cnt += n;\n s += n;\n goto next;\n }\n}",
"canonical_original_code": "int acmd(char *s, struct c **cmd)\n{\n char *tok;\n int n; int cnt = 0;\n struct c *cmd0 = cmds;\n cmds = cmds->next;\n cmd0->next = ((void *)0);\n cmd0->pgmlist = pp;\nnext:\n n = nexttoken(s, &tok);\n if (n == 0 || (((*tok) == ('|')) || ((*tok) == ('&')) || ((*tok) == ('<')) || ((*tok) == ('>')))) {\n *cmd = cmd0;\n *pp++ = ((void *)0);\n return cnt;\n }\n else {\n *pp++ = tok;\n cnt += n;\n s += n;\n goto next;\n }\n}",
"variable_types": [
[
"s",
"char *"
],
[
"cmd",
"struct c { char **pgmlist; struct c *next; } **"
],
[
"tok",
"char *"
],
[
"n",
"int"
],
[
"cnt",
"int"
],
[
"cmd0",
"struct c { char **pgmlist; struct c *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct c { char **pgmlist; struct c *next; }"
],
"binary_hash": "327ea677fac1c524ebd5d880843d50b86acc50b5a3a5be2c9f903762dc1a3a00"
},
{
"name": "isidentifier",
"canonical_name": "func3",
"repo": "demonicblue/operating-systems",
"decompiled_code": "__int64 __fastcall isidentifier(char *a1)\n{\nconst unsigned __int16 *v1; // rcx\nchar *v2; // rax\nchar *v5; // [rsp+18h] [rbp-8h]\n\nwhile ( *a1 )\n{\nv5 = strrchr(\"_-.,/~+\", *a1);\nv1 = *_ctype_b_loc();\nv2 = a1++;\nif ( (v1[*v2] & 8) == 0 && !v5 )\nreturn 0LL;\n}\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(char *a1)\n{\nconst unsigned __int16 *v1; // rcx\nchar *v2; // rax\nchar *v5; // [rsp+18h] [rbp-8h]\n\nwhile ( *a1 )\n{\nv5 = strrchr(\"_-.,/~+\", *a1);\nv1 = *_ctype_b_loc();\nv2 = a1++;\nif ( (v1[*v2] & 8) == 0 && !v5 )\nreturn 0LL;\n}\nreturn 1LL;\n}",
"original_code": "int\nisidentifier (char *s)\n{\n while (*s) {\n char *p = strrchr (\"_-.,/~+\", *s);\n if (! ((*__ctype_b_loc ())[(int) ((*s++))] & (unsigned short int) _ISalnum) && (p == ((void *)0)))\n return 0;\n }\n return 1;\n}",
"canonical_original_code": "int isidentifier(char *s)\n{\n while (*s) {\n char *p = strrchr (\"_-.,/~+\", *s);\n if (! ((*__ctype_b_loc ())[(int) ((*s++))] & (unsigned short) _ISalnum) && (p == ((void *)0)))\n return 0;\n }\n return 1;\n}",
"variable_types": [
[
"s",
"char *"
],
[
"p",
"char *"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "327ea677fac1c524ebd5d880843d50b86acc50b5a3a5be2c9f903762dc1a3a00"
}
] |
5284c03d416f97a9e8f4d517b07fff39407b11bfe5af11683acf1b8ea36f43af | demonicblue/operating-systems | [
[
"main",
"->",
"stripwhite"
],
[
"interrupt_handler",
"->"
],
[
"PrintCommand",
"->",
"PrintPgm"
],
[
"PrintPgm",
"->",
"PrintCommand"
],
[
"stripwhite",
"->",
"main"
]
] | [] | [
{
"name": "interrupt_handler",
"canonical_name": "func0",
"repo": "demonicblue/operating-systems",
"decompiled_code": "void interrupt_handler()\n{\nputs(\"\\nInterrupt\");\n}\n",
"canonical_decompiled_code": "void func0()\n{\nputs(\"\\nInterrupt\");\n}",
"original_code": "void\ninterrupt_handler(){\n printf(\"\\nInterrupt\\n\");\n}",
"canonical_original_code": "void interrupt_handler(){\n printf(\"\\nInterrupt\\n\");\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "5284c03d416f97a9e8f4d517b07fff39407b11bfe5af11683acf1b8ea36f43af"
},
{
"name": "PrintCommand",
"canonical_name": "func1",
"repo": "demonicblue/operating-systems",
"decompiled_code": "__int64 __fastcall PrintCommand(unsigned int a1, __int64 a2)\n{\nconst char *v2; // rax\nconst char *v3; // rax\nconst char *v4; // rax\n\nprintf(\"Parse returned %d:\\n\", a1);\nif ( *(_QWORD *)(a2 + 8) )\nv2 = *(const char **)(a2 + 8);\nelse\nv2 = \"<none>\";\nprintf(\" stdin : %s\\n\", v2);\nif ( *(_QWORD *)(a2 + 16) )\nv3 = *(const char **)(a2 + 16);\nelse\nv3 = \"<none>\";\nprintf(\" stdout: %s\\n\", v3);\nif ( *(_DWORD *)(a2 + 32) )\nv4 = \"yes\";\nelse\nv4 = \"no\";\nprintf(\" bg : %s\\n\", v4);\nreturn PrintPgm(*(_QWORD *)a2);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(unsigned int a1, __int64 a2)\n{\nconst char *v2; // rax\nconst char *v3; // rax\nconst char *v4; // rax\n\nprintf(\"Parse returned %d:\\n\", a1);\nif ( *(_QWORD *)(a2 + 8) )\nv2 = *(const char **)(a2 + 8);\nelse\nv2 = \"<none>\";\nprintf(\" stdin : %s\\n\", v2);\nif ( *(_QWORD *)(a2 + 16) )\nv3 = *(const char **)(a2 + 16);\nelse\nv3 = \"<none>\";\nprintf(\" stdout: %s\\n\", v3);\nif ( *(_DWORD *)(a2 + 32) )\nv4 = \"yes\";\nelse\nv4 = \"no\";\nprintf(\" bg : %s\\n\", v4);\nreturn func2(*(_QWORD *)a2);\n}",
"original_code": "void\nPrintCommand (int n, Command *cmd)\n{\n printf(\"Parse returned %d:\\n\", n);\n printf(\" stdin : %s\\n\", cmd->rstdin ? cmd->rstdin : \"<none>\" );\n printf(\" stdout: %s\\n\", cmd->rstdout ? cmd->rstdout : \"<none>\" );\n printf(\" bg : %s\\n\", cmd->bakground ? \"yes\" : \"no\");\n PrintPgm(cmd->pgm);\n}",
"canonical_original_code": "void PrintCommand(int n, struct node *cmd)\n{\n printf(\"Parse returned %d:\\n\", n);\n printf(\" stdin : %s\\n\", cmd->rstdin ? cmd->rstdin : \"<none>\" );\n printf(\" stdout: %s\\n\", cmd->rstdout ? cmd->rstdout : \"<none>\" );\n printf(\" bg : %s\\n\", cmd->bakground ? \"yes\" : \"no\");\n PrintPgm(cmd->pgm);\n}",
"variable_types": [
[
"n",
"int"
],
[
"cmd",
"struct node { struct c { char **pgmlist; struct c *next; } *pgm; char *rstdin; char *rstdout; char *rstderr; int bakground; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct c *pgm; char *rstdin; char *rstdout; char *rstderr; int bakground; }",
"struct c { char **pgmlist; struct c *next; }"
],
"binary_hash": "5284c03d416f97a9e8f4d517b07fff39407b11bfe5af11683acf1b8ea36f43af"
},
{
"name": "PrintPgm",
"canonical_name": "func2",
"repo": "demonicblue/operating-systems",
"decompiled_code": "int __fastcall PrintPgm(const char ***a1)\n{\nconst char **v1; // rax\nint result; // eax\nconst char **v3; // [rsp+18h] [rbp-8h]\n\nif ( a1 )\n{\nv3 = *a1;\nprintf(\" [\");\nwhile ( *v3 )\n{\nv1 = v3++;\nprintf(\"%s \", *v1);\n}\nresult = puts(\"]\");\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func2(const char ***a1)\n{\nconst char **v1; // rax\nint result; // eax\nconst char **v3; // [rsp+18h] [rbp-8h]\n\nif ( a1 )\n{\nv3 = *a1;\nprintf(\" [\");\nwhile ( *v3 )\n{\nv1 = v3++;\nprintf(\"%s \", *v1);\n}\nresult = puts(\"]\");\n}\nreturn result;\n}",
"original_code": "void\nPrintPgm (Pgm *p)\n{\n if (p == ((void *)0)) {\n return;\n }\n else {\n char **pl = p->pgmlist;\n printf(\" [\");\n while (*pl) {\n printf(\"%s \", *pl++);\n }\n printf(\"]\\n\");\n }\n}",
"canonical_original_code": "void PrintPgm(struct c *p)\n{\n if (p == ((void *)0)) {\n return;\n }\n else {\n char **pl = p->pgmlist;\n printf(\" [\");\n while (*pl) {\n printf(\"%s \", *pl++);\n }\n printf(\"]\\n\");\n }\n}",
"variable_types": [
[
"p",
"struct c { char **pgmlist; struct c *next; } *"
],
[
"pl",
"char **"
]
],
"return_type": "void",
"user_defined_types": [
"struct c { char **pgmlist; struct c *next; }"
],
"binary_hash": "5284c03d416f97a9e8f4d517b07fff39407b11bfe5af11683acf1b8ea36f43af"
},
{
"name": "stripwhite",
"canonical_name": "func3",
"repo": "demonicblue/operating-systems",
"decompiled_code": "char *__fastcall stripwhite(char *a1)\n{\nint i; // ebx\nint j; // ebx\nchar *result; // rax\n\nfor ( i = 0; a1[i] == 32 || a1[i] == 9; ++i )\n;\nif ( i )\nstrcpy(a1, &a1[i]);\nfor ( j = strlen(a1) - 1; j > 0 && (a1[j] == 32 || a1[j] == 9); --j )\n;\nresult = &a1[j + 1];\n*result = 0;\nreturn result;\n}\n",
"canonical_decompiled_code": "char *__fastcall func3(char *a1)\n{\nint i; // ebx\nint j; // ebx\nchar *result; // rax\n\nfor ( i = 0; a1[i] == 32 || a1[i] == 9; ++i )\n;\nif ( i )\nstrcpy(a1, &a1[i]);\nfor ( j = strlen(a1) - 1; j > 0 && (a1[j] == 32 || a1[j] == 9); --j )\n;\nresult = &a1[j + 1];\n*result = 0;\nreturn result;\n}",
"original_code": "void\nstripwhite (char *string)\n{\n register int i = 0;\n while ((((string[i]) == ' ') || ((string[i]) == '\\t'))) {\n i++;\n }\n if (i) {\n strcpy (string, string + i);\n }\n i = strlen( string ) - 1;\n while (i> 0 && (((string[i]) == ' ') || ((string[i]) == '\\t'))) {\n i--;\n }\n string [++i] = '\\0';\n}",
"canonical_original_code": "void stripwhite(char *string)\n{\n register int i = 0;\n while ((((string[i]) == ' ') || ((string[i]) == '\\t'))) {\n i++;\n }\n if (i) {\n strcpy (string, string + i);\n }\n i = strlen( string ) - 1;\n while (i> 0 && (((string[i]) == ' ') || ((string[i]) == '\\t'))) {\n i--;\n }\n string [++i] = '\\0';\n}",
"variable_types": [
[
"string",
"char *"
],
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "5284c03d416f97a9e8f4d517b07fff39407b11bfe5af11683acf1b8ea36f43af"
},
{
"name": "main",
"canonical_name": "main",
"repo": "demonicblue/operating-systems",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nchar buf[512]; // [rsp+0h] [rbp-240h] BYREF\nchar v5[52]; // [rsp+200h] [rbp-40h] BYREF\nint v6; // [rsp+234h] [rbp-Ch]\nvoid *ptr; // [rsp+238h] [rbp-8h]\n\nwhile ( !done )\n{\nsignal(2, interrupt_handler);\nsignal(17, handler);\ngetcwd(buf, 0x1F4uLL);\nstrcat(buf, \"> \");\nptr = (void *)readline(buf);\nif ( ptr )\n{\nstripwhite(ptr);\nif ( *(_BYTE *)ptr )\n{\nadd_history(ptr);\nv6 = parse(ptr, v5);\nexecPgm(v5);\n}\n}\nelse\n{\ndone = 1;\n}\nif ( ptr )\nfree(ptr);\n}\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nchar buf[512]; // [rsp+0h] [rbp-240h] BYREF\nchar v5[52]; // [rsp+200h] [rbp-40h] BYREF\nint v6; // [rsp+234h] [rbp-Ch]\nvoid *ptr; // [rsp+238h] [rbp-8h]\n\nwhile ( !done )\n{\nsignal(2, interrupt_handler);\nsignal(17, handler);\ngetcwd(buf, 0x1F4uLL);\nstrcat(buf, \"> \");\nptr = (void *)readline(buf);\nif ( ptr )\n{\nfunc3(ptr);\nif ( *(_BYTE *)ptr )\n{\nadd_history(ptr);\nv6 = parse(ptr, v5);\nexecPgm(v5);\n}\n}\nelse\n{\ndone = 1;\n}\nif ( ptr )\nfree(ptr);\n}\nreturn 0;\n}",
"original_code": "int main(void)\n{\n Command cmd;\n int n;\n while (!done) {\n signal(2, interrupt_handler);\n signal(17, ((__sighandler_t) 1));\n char *line;\n char buf[500];\n getcwd(buf, sizeof(buf));\n line = readline(strcat(buf,\"> \"));\n if (!line) {\n done = 1;\n }\n else {\n stripwhite(line);\n if(*line) {\n add_history(line);\n n = parse(line, &cmd);\n execPgm(&cmd);\n }\n }\n if(line) {\n free(line);\n }\n }\n return 0;\n}",
"canonical_original_code": "int main()\n{\n struct node cmd;\n int n;\n while (!done) {\n signal(2, interrupt_handler);\n signal(17, ((void (*)(int)) 1));\n char *line;\n char buf[500];\n getcwd(buf, sizeof(buf));\n line = readline(strcat(buf,\"> \"));\n if (!line) {\n done = 1;\n }\n else {\n stripwhite(line);\n if(*line) {\n add_history(line);\n n = parse(line, &cmd);\n execPgm(&cmd);\n }\n }\n if(line) {\n free(line);\n }\n }\n return 0;\n}",
"variable_types": [
[
"cmd",
"struct node { struct c { char **pgmlist; struct c *next; } *pgm; char *rstdin; char *rstdout; char *rstderr; int bakground; }"
],
[
"n",
"int"
],
[
"line",
"char *"
],
[
"buf",
"char [500]"
]
],
"return_type": "int",
"user_defined_types": [
"struct node { struct c *pgm; char *rstdin; char *rstdout; char *rstderr; int bakground; }",
"struct c { char **pgmlist; struct c *next; }"
],
"binary_hash": "5284c03d416f97a9e8f4d517b07fff39407b11bfe5af11683acf1b8ea36f43af"
}
] |
95bb52ba4213a670ffb0eba7b2f7d84872c882a7e96ec69119d77e217a9e1646 | demonicblue/operating-systems | [
[
"execPgm",
"->",
"execRecursive"
],
[
"execRecursive",
"->",
"execPgm"
]
] | [] | [
{
"name": "execPgm",
"canonical_name": "func0",
"repo": "demonicblue/operating-systems",
"decompiled_code": "int __fastcall execPgm(_QWORD *a1)\n{\nint result; // eax\nint *v2; // rax\nchar *v3; // rax\nint *v4; // rax\nchar *v5; // rax\nint v6; // eax\nint *v7; // rax\nchar *v8; // rax\nint v9; // eax\nint *v10; // rax\nchar *v11; // rax\nint v12; // [rsp+14h] [rbp-Ch]\nint fd; // [rsp+18h] [rbp-8h]\n__pid_t pid; // [rsp+1Ch] [rbp-4h]\n\nif ( !strcmp(**(const char ***)*a1, \"exit\") )\n{\nputs(\"Exiting bash..\");\nexit(0);\n}\nif ( !strcmp(**(const char ***)*a1, \"cd\") )\n{\nresult = chdir(*(const char **)(*(_QWORD *)*a1 + 8LL));\nif ( result < 0 )\n{\nv2 = _errno_location();\nv3 = strerror(*v2);\nresult = printf(\"ERROR: %s\\n\", v3);\n}\n}\nelse\n{\npid = fork();\nif ( !pid )\n{\nif ( *((_DWORD *)a1 + 8) )\nsignal(2, handler);\nif ( a1[1] )\n{\nfd = open((const char *)a1[1], 64, 448LL);\nif ( fd < 0 )\n{\nv4 = _errno_location();\nv5 = strerror(*v4);\nprintf(\"ERROR: %s\\n\", v5);\n}\nv6 = fileno(stdin);\ndup2(fd, v6);\nclose(fd);\n}\nif ( a1[2] )\n{\nv12 = open((const char *)a1[2], 65, 448LL);\nif ( v12 < 0 )\n{\nv7 = _errno_location();\nv8 = strerror(*v7);\nprintf(\"ERROR: %s\\n\", v8);\n}\nv9 = fileno(stdout);\ndup2(v12, v9);\nclose(v12);\n}\nif ( *(_QWORD *)(*a1 + 8LL) )\n{\nexecRecursive(*a1, 0xFFFFFFFFLL, 0xFFFFFFFFLL);\nexit(0);\n}\nif ( execvp(**(const char ***)*a1, *(char *const **)*a1) < 0 )\n{\nv10 = _errno_location();\nv11 = strerror(*v10);\nprintf(\"ERROR: %s\\n\", v11);\nexit(0);\n}\n}\nresult = *((_DWORD *)a1 + 8);\nif ( !result )\nresult = waitpid(pid, 0LL, 0);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func0(_QWORD *a1)\n{\nint result; // eax\nint *v2; // rax\nchar *v3; // rax\nint *v4; // rax\nchar *v5; // rax\nint v6; // eax\nint *v7; // rax\nchar *v8; // rax\nint v9; // eax\nint *v10; // rax\nchar *v11; // rax\nint v12; // [rsp+14h] [rbp-Ch]\nint fd; // [rsp+18h] [rbp-8h]\n__pid_t pid; // [rsp+1Ch] [rbp-4h]\n\nif ( !strcmp(**(const char ***)*a1, \"exit\") )\n{\nputs(\"Exiting bash..\");\nexit(0);\n}\nif ( !strcmp(**(const char ***)*a1, \"cd\") )\n{\nresult = chdir(*(const char **)(*(_QWORD *)*a1 + 8LL));\nif ( result < 0 )\n{\nv2 = _errno_location();\nv3 = strerror(*v2);\nresult = printf(\"ERROR: %s\\n\", v3);\n}\n}\nelse\n{\npid = fork();\nif ( !pid )\n{\nif ( *((_DWORD *)a1 + 8) )\nsignal(2, handler);\nif ( a1[1] )\n{\nfd = open((const char *)a1[1], 64, 448LL);\nif ( fd < 0 )\n{\nv4 = _errno_location();\nv5 = strerror(*v4);\nprintf(\"ERROR: %s\\n\", v5);\n}\nv6 = fileno(stdin);\ndup2(fd, v6);\nclose(fd);\n}\nif ( a1[2] )\n{\nv12 = open((const char *)a1[2], 65, 448LL);\nif ( v12 < 0 )\n{\nv7 = _errno_location();\nv8 = strerror(*v7);\nprintf(\"ERROR: %s\\n\", v8);\n}\nv9 = fileno(stdout);\ndup2(v12, v9);\nclose(v12);\n}\nif ( *(_QWORD *)(*a1 + 8LL) )\n{\nfunc1(*a1, 0xFFFFFFFFLL, 0xFFFFFFFFLL);\nexit(0);\n}\nif ( execvp(**(const char ***)*a1, *(char *const **)*a1) < 0 )\n{\nv10 = _errno_location();\nv11 = strerror(*v10);\nprintf(\"ERROR: %s\\n\", v11);\nexit(0);\n}\n}\nresult = *((_DWORD *)a1 + 8);\nif ( !result )\nresult = waitpid(pid, 0LL, 0);\n}\nreturn result;\n}",
"original_code": "void execPgm(Command *cmd) {\n if(strcmp(cmd->pgm->pgmlist[0], \"exit\") == 0){\n printf(\"Exiting bash..\\n\");\n exit(0);\n }\n else if(strcmp(cmd->pgm->pgmlist[0], \"cd\") == 0){\n if(chdir(cmd->pgm->pgmlist[1]) < 0){\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n }\n return;\n }\n pid_t child_pid;\n child_pid = fork();\n if( child_pid == 0 )\n {\n if(cmd->bakground) {\n signal(2, ((__sighandler_t) 1));\n }\n if(cmd->rstdin != ((void *)0)){\n int input_file = 0;\n if((input_file = open(cmd->rstdin, 00 | 0100, 00700)) < 0){\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n }\n dup2(input_file, fileno(stdin));\n close(input_file);\n }\n if(cmd->rstdout != ((void *)0)){\n int output_file = 0;\n if((output_file = open(cmd->rstdout, 01 | 0100, 00700)) < 0){\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n }\n dup2(output_file, fileno(stdout));\n close(output_file);\n }\n if(cmd->pgm->next != ((void *)0))\n {\n execRecursive(cmd->pgm, -1, -1);\n exit(0);\n }\n int isError = execvp(*cmd->pgm->pgmlist, cmd->pgm->pgmlist);\n if( isError < 0 ) {\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n exit(0);\n }\n }\n if(cmd->bakground){\n return;\n }\n waitpid(child_pid, ((void *)0), 0);\n}",
"canonical_original_code": "void execPgm(struct node *cmd) {\n if(strcmp(cmd->pgm->pgmlist[0], \"exit\") == 0){\n printf(\"Exiting bash..\\n\");\n exit(0);\n }\n else if(strcmp(cmd->pgm->pgmlist[0], \"cd\") == 0){\n if(chdir(cmd->pgm->pgmlist[1]) < 0){\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n }\n return;\n }\n int child_pid;\n child_pid = fork();\n if( child_pid == 0 )\n {\n if(cmd->bakground) {\n signal(2, ((void (*)(int)) 1));\n }\n if(cmd->rstdin != ((void *)0)){\n int input_file = 0;\n if((input_file = open(cmd->rstdin, 00 | 0100, 00700)) < 0){\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n }\n dup2(input_file, fileno(stdin));\n close(input_file);\n }\n if(cmd->rstdout != ((void *)0)){\n int output_file = 0;\n if((output_file = open(cmd->rstdout, 01 | 0100, 00700)) < 0){\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n }\n dup2(output_file, fileno(stdout));\n close(output_file);\n }\n if(cmd->pgm->next != ((void *)0))\n {\n execRecursive(cmd->pgm, -1, -1);\n exit(0);\n }\n int isError = execvp(*cmd->pgm->pgmlist, cmd->pgm->pgmlist);\n if( isError < 0 ) {\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n exit(0);\n }\n }\n if(cmd->bakground){\n return;\n }\n waitpid(child_pid, ((void *)0), 0);\n}",
"variable_types": [
[
"cmd",
"struct node { struct c { char **pgmlist; struct c *next; } *pgm; char *rstdin; char *rstdout; char *rstderr; int bakground; } *"
],
[
"child_pid",
"int"
],
[
"input_file",
"int"
],
[
"output_file",
"int"
],
[
"isError",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct c *pgm; char *rstdin; char *rstdout; char *rstderr; int bakground; }",
"struct c { char **pgmlist; struct c *next; }"
],
"binary_hash": "95bb52ba4213a670ffb0eba7b2f7d84872c882a7e96ec69119d77e217a9e1646"
},
{
"name": "execRecursive",
"canonical_name": "func1",
"repo": "demonicblue/operating-systems",
"decompiled_code": "int __fastcall execRecursive(__int64 a1, int a2, int a3)\n{\nint v3; // eax\nint result; // eax\nint *v5; // rax\nchar *v6; // rax\nint v7; // eax\nint *v8; // rax\nchar *v9; // rax\nint v10; // eax\nint v11; // eax\nint *v12; // rax\nchar *v13; // rax\nint pipedes[2]; // [rsp+10h] [rbp-10h] BYREF\n__pid_t v16; // [rsp+18h] [rbp-8h]\n__pid_t v17; // [rsp+1Ch] [rbp-4h]\n\nif ( *(_QWORD *)(a1 + 8) )\n{\nif ( a2 == -1 )\n{\npipe(pipedes);\nexecRecursive(*(_QWORD *)(a1 + 8), (unsigned int)pipedes[1], (unsigned int)pipedes[0]);\nv17 = fork();\nif ( v17 )\n{\nclose(pipedes[0]);\nclose(pipedes[1]);\nwait(0LL);\nresult = v17;\n}\nelse\n{\nv7 = fileno(stdin);\nclose(v7);\ndup(pipedes[0]);\nclose(pipedes[0]);\nclose(pipedes[1]);\nresult = execvp(**(const char ***)a1, *(char *const **)a1);\nif ( result < 0 )\n{\nv8 = _errno_location();\nv9 = strerror(*v8);\nprintf(\"ERROR: %s\\n\", v9);\nexit(0);\n}\n}\n}\nelse\n{\npipe(pipedes);\nexecRecursive(*(_QWORD *)(a1 + 8), (unsigned int)pipedes[1], (unsigned int)pipedes[0]);\nif ( fork() )\n{\nclose(pipedes[0]);\nclose(pipedes[1]);\nresult = wait(0LL);\n}\nelse\n{\nv10 = fileno(stdout);\ndup2(a2, v10);\nv11 = fileno(stdin);\ndup2(pipedes[0], v11);\nclose(a2);\nclose(pipedes[0]);\nclose(pipedes[1]);\nresult = execvp(**(const char ***)a1, *(char *const **)a1);\nif ( result < 0 )\n{\nv12 = _errno_location();\nv13 = strerror(*v12);\nprintf(\"ERROR: %s\\n\", v13);\nexit(0);\n}\n}\n}\n}\nelse\n{\nv16 = fork();\nif ( v16 )\n{\nwait(0LL);\nresult = v16;\n}\nelse\n{\nv3 = fileno(stdout);\nclose(v3);\ndup(a2);\nclose(a2);\nclose(a3);\nresult = execvp(**(const char ***)a1, *(char *const **)a1);\nif ( result < 0 )\n{\nv5 = _errno_location();\nv6 = strerror(*v5);\nprintf(\"ERROR: %s\\n\", v6);\nexit(0);\n}\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func1(__int64 a1, int a2, int a3)\n{\nint v3; // eax\nint result; // eax\nint *v5; // rax\nchar *v6; // rax\nint v7; // eax\nint *v8; // rax\nchar *v9; // rax\nint v10; // eax\nint v11; // eax\nint *v12; // rax\nchar *v13; // rax\nint pipedes[2]; // [rsp+10h] [rbp-10h] BYREF\n__pid_t v16; // [rsp+18h] [rbp-8h]\n__pid_t v17; // [rsp+1Ch] [rbp-4h]\n\nif ( *(_QWORD *)(a1 + 8) )\n{\nif ( a2 == -1 )\n{\npipe(pipedes);\nfunc1(*(_QWORD *)(a1 + 8), (unsigned int)pipedes[1], (unsigned int)pipedes[0]);\nv17 = fork();\nif ( v17 )\n{\nclose(pipedes[0]);\nclose(pipedes[1]);\nwait(0LL);\nresult = v17;\n}\nelse\n{\nv7 = fileno(stdin);\nclose(v7);\ndup(pipedes[0]);\nclose(pipedes[0]);\nclose(pipedes[1]);\nresult = execvp(**(const char ***)a1, *(char *const **)a1);\nif ( result < 0 )\n{\nv8 = _errno_location();\nv9 = strerror(*v8);\nprintf(\"ERROR: %s\\n\", v9);\nexit(0);\n}\n}\n}\nelse\n{\npipe(pipedes);\nfunc1(*(_QWORD *)(a1 + 8), (unsigned int)pipedes[1], (unsigned int)pipedes[0]);\nif ( fork() )\n{\nclose(pipedes[0]);\nclose(pipedes[1]);\nresult = wait(0LL);\n}\nelse\n{\nv10 = fileno(stdout);\ndup2(a2, v10);\nv11 = fileno(stdin);\ndup2(pipedes[0], v11);\nclose(a2);\nclose(pipedes[0]);\nclose(pipedes[1]);\nresult = execvp(**(const char ***)a1, *(char *const **)a1);\nif ( result < 0 )\n{\nv12 = _errno_location();\nv13 = strerror(*v12);\nprintf(\"ERROR: %s\\n\", v13);\nexit(0);\n}\n}\n}\n}\nelse\n{\nv16 = fork();\nif ( v16 )\n{\nwait(0LL);\nresult = v16;\n}\nelse\n{\nv3 = fileno(stdout);\nclose(v3);\ndup(a2);\nclose(a2);\nclose(a3);\nresult = execvp(**(const char ***)a1, *(char *const **)a1);\nif ( result < 0 )\n{\nv5 = _errno_location();\nv6 = strerror(*v5);\nprintf(\"ERROR: %s\\n\", v6);\nexit(0);\n}\n}\n}\nreturn result;\n}",
"original_code": "int execRecursive(Pgm *pgm, int pipe_in, int pipe_out)\n{\n int pipes[2];\n if(pgm->next == ((void *)0))\n {\n int child_pid = fork();\n if(child_pid == 0)\n {\n close(fileno(stdout));\n dup(pipe_in);\n close(pipe_in);\n close(pipe_out);\n if(execvp(*pgm->pgmlist, pgm->pgmlist) < 0){\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n exit(0);\n }\n } else {\n wait(((void *)0));\n return child_pid;\n }\n }\n else if(pipe_in == -1)\n {\n pipe(pipes);\n execRecursive(pgm->next, pipes[1], pipes[0]);\n int child_pid = fork();\n if(child_pid == 0)\n {\n close(fileno(stdin));\n dup(pipes[0]);\n close(pipes[0]);\n close(pipes[1]);\n if(execvp(*pgm->pgmlist, pgm->pgmlist) < 0){\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n exit(0);\n }\n } else {\n close(pipes[0]);\n close(pipes[1]);\n wait(((void *)0));\n return child_pid;\n }\n } else {\n pipe(pipes);\n execRecursive(pgm->next, pipes[1], pipes[0]);\n if(fork() == 0)\n {\n dup2(pipe_in, fileno(stdout));\n dup2(pipes[0], fileno(stdin));\n close(pipe_in);\n close(pipes[0]);\n close(pipes[1]);\n if(execvp(*pgm->pgmlist, pgm->pgmlist) < 0){\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n exit(0);\n }\n } else {\n close(pipes[0]);\n close(pipes[1]);\n wait(((void *)0));\n }\n }\n}",
"canonical_original_code": "int execRecursive(struct c *pgm, int pipe_in, int pipe_out)\n{\n int pipes[2];\n if(pgm->next == ((void *)0))\n {\n int child_pid = fork();\n if(child_pid == 0)\n {\n close(fileno(stdout));\n dup(pipe_in);\n close(pipe_in);\n close(pipe_out);\n if(execvp(*pgm->pgmlist, pgm->pgmlist) < 0){\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n exit(0);\n }\n } else {\n wait(((void *)0));\n return child_pid;\n }\n }\n else if(pipe_in == -1)\n {\n pipe(pipes);\n execRecursive(pgm->next, pipes[1], pipes[0]);\n int child_pid = fork();\n if(child_pid == 0)\n {\n close(fileno(stdin));\n dup(pipes[0]);\n close(pipes[0]);\n close(pipes[1]);\n if(execvp(*pgm->pgmlist, pgm->pgmlist) < 0){\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n exit(0);\n }\n } else {\n close(pipes[0]);\n close(pipes[1]);\n wait(((void *)0));\n return child_pid;\n }\n } else {\n pipe(pipes);\n execRecursive(pgm->next, pipes[1], pipes[0]);\n if(fork() == 0)\n {\n dup2(pipe_in, fileno(stdout));\n dup2(pipes[0], fileno(stdin));\n close(pipe_in);\n close(pipes[0]);\n close(pipes[1]);\n if(execvp(*pgm->pgmlist, pgm->pgmlist) < 0){\n printf(\"ERROR: %s\\n\", strerror((*__errno_location ())));\n exit(0);\n }\n } else {\n close(pipes[0]);\n close(pipes[1]);\n wait(((void *)0));\n }\n }\n}",
"variable_types": [
[
"pgm",
"struct c { char **pgmlist; struct c *next; } *"
],
[
"pipe_in",
"int"
],
[
"pipe_out",
"int"
],
[
"pipes",
"int [2]"
],
[
"child_pid",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct c { char **pgmlist; struct c *next; }"
],
"binary_hash": "95bb52ba4213a670ffb0eba7b2f7d84872c882a7e96ec69119d77e217a9e1646"
}
] |
ba25236168f29706806ef9a82ebea3df893fdac088a6376f573ab2bd9f2a0742 | demonicblue/operating-systems | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"initialize_queue",
"->",
"main"
],
[
"enqueue",
"->",
"my_thread",
"main"
],
[
"dequeue",
"->",
"my_thread"
],
[
"testMultiThreaded",
"->",
"main"
],
[
"my_thread",
"->",
"dequeue",
"enqueue"
],
[
"main",
"->",
"initialize_queue",
"enqueue",
"testMultiThreaded"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_404010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"void *func3()\n{\nreturn &_bss_start;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"void *func5()\n{\nvoid *result; // rax\n\nif ( !completed_0 )\n{\nresult = func3();\ncompleted_0 = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"initialize_queue",
"__int64 func7()\n{\n__int64 result; // rax\n_QWORD *v1; // [rsp+58h] [rbp-8h]\n\nv1 = malloc(0x10uLL);\n*(_DWORD *)v1 = 0;\nv1[1] = 0LL;\nqueue = (__int64)malloc(0x10uLL);\n*(_QWORD *)queue = v1;\nresult = queue;\n*(_QWORD *)(queue + 8) = v1;\n*(_OWORD *)&mutex1.__lock = 0uLL;\n*((_OWORD *)&mutex1.__align + 1) = 0uLL;\nmutex1.__list.__next = 0LL;\n*(_OWORD *)&mutex2.__lock = 0uLL;\n*((_OWORD *)&mutex2.__align + 1) = 0uLL;\nmutex2.__list.__next = 0LL;\nreturn result;\n}"
],
[
"dequeue",
"__int64 __fastcall func9(_DWORD *a1)\n{\n__int64 result; // rax\nvoid *ptr; // [rsp+18h] [rbp-8h]\n\npthread_mutex_lock(&mutex2);\nif ( *(_QWORD *)(*(_QWORD *)queue + 8LL) )\n{\n*a1 = **(_DWORD **)(*(_QWORD *)queue + 8LL);\nptr = *(void **)queue;\n*(_QWORD *)queue = *(_QWORD *)(*(_QWORD *)queue + 8LL);\npthread_mutex_unlock(&mutex2);\nfree(ptr);\nresult = 0LL;\n}\nelse\n{\npthread_mutex_unlock(&mutex2);\nresult = 1LL;\n}\nreturn result;\n}"
],
[
"main",
"int __cdecl main(int argc, const char **argv, const char **envp)\n{\nunsigned int v3; // eax\nint i; // [rsp+18h] [rbp-8h]\nint v6; // [rsp+1Ch] [rbp-4h]\n\nv6 = 2;\nv3 = time(0LL);\nsrand(v3);\nif ( argv[1] )\nv6 = atoi(argv[1]);\nfunc7();\nfor ( i = 0; i <= 99; ++i )\nfunc8(42);\nfunc10(v6);\nreturn 0;\n}"
],
[
"_libc_csu_init",
"void __fastcall func12(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func13(void)\n{\n;\n}"
]
] | [
{
"name": "enqueue",
"canonical_name": "func8",
"repo": "demonicblue/operating-systems",
"decompiled_code": "int __fastcall enqueue(int a1)\n{\n_QWORD *v2; // [rsp+18h] [rbp-8h]\n\nv2 = malloc(0x10uLL);\npthread_mutex_lock(&mutex1);\n*(_DWORD *)v2 = a1;\nv2[1] = 0LL;\n*(_QWORD *)(*(_QWORD *)(queue + 8) + 8LL) = v2;\n*(_QWORD *)(queue + 8) = v2;\nreturn pthread_mutex_unlock(&mutex1);\n}\n",
"canonical_decompiled_code": "int __fastcall func8(int a1)\n{\n_QWORD *v2; // [rsp+18h] [rbp-8h]\n\nv2 = malloc(0x10uLL);\npthread_mutex_lock(&mutex1);\n*(_DWORD *)v2 = a1;\nv2[1] = 0LL;\n*(_QWORD *)(*(_QWORD *)(queue + 8) + 8LL) = v2;\n*(_QWORD *)(queue + 8) = v2;\nreturn pthread_mutex_unlock(&mutex1);\n}",
"original_code": "void enqueue(int val){\n Node *new_tail;\n new_tail = malloc(sizeof(struct node));\n pthread_mutex_lock(&mutex1);\n new_tail->value=val;\n new_tail->next=((void *)0);\n queue->tail->next = new_tail;\n queue->tail = new_tail;\n pthread_mutex_unlock(&mutex1);\n}",
"canonical_original_code": "void enqueue(int val){\n struct node *new_tail;\n new_tail = malloc(sizeof(struct node));\n pthread_mutex_lock(&mutex1);\n new_tail->value=val;\n new_tail->next=((void *)0);\n queue->tail->next = new_tail;\n queue->tail = new_tail;\n pthread_mutex_unlock(&mutex1);\n}",
"variable_types": [
[
"val",
"int"
],
[
"new_tail",
"struct node { int value; struct node *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { int value; struct node *next; }"
],
"binary_hash": "ba25236168f29706806ef9a82ebea3df893fdac088a6376f573ab2bd9f2a0742"
},
{
"name": "testMultiThreaded",
"canonical_name": "func10",
"repo": "demonicblue/operating-systems",
"decompiled_code": "__int64 __fastcall testMultiThreaded(int a1)\n{\nvoid *v1; // rsp\nchar v3; // [rsp+7h] [rbp-59h] BYREF\nint v4; // [rsp+Ch] [rbp-54h]\nint arg; // [rsp+1Ch] [rbp-44h] BYREF\nstruct timeval tv; // [rsp+20h] [rbp-40h] BYREF\nint v7; // [rsp+30h] [rbp-30h]\nint v8; // [rsp+34h] [rbp-2Ch]\nunsigned __int64 v9; // [rsp+38h] [rbp-28h]\n__int64 v10; // [rsp+40h] [rbp-20h]\nint i; // [rsp+48h] [rbp-18h]\nint j; // [rsp+4Ch] [rbp-14h]\n\nv4 = a1;\nv10 = a1 - 1LL;\nv1 = alloca(16 * ((8LL * a1 + 15) / 0x10uLL));\nv9 = 8 * ((unsigned __int64)&v3 >> 3);\narg = 10000 / a1;\ngettimeofday(&tv, 0LL);\nv8 = tv.tv_usec;\nfor ( i = 0; i < v4; ++i )\npthread_create((pthread_t *)(8LL * i + v9), 0LL, my_thread, &arg);\nfor ( j = 0; j < v4; ++j )\npthread_join(*(_QWORD *)(v9 + 8LL * j), 0LL);\ngettimeofday(&tv, 0LL);\nv7 = tv.tv_usec;\nprintf(\"Total time: %.3f ms\\n\", (double)(LODWORD(tv.tv_usec) - v8) / 100.0);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func10(int a1)\n{\nvoid *v1; // rsp\nchar v3; // [rsp+7h] [rbp-59h] BYREF\nint v4; // [rsp+Ch] [rbp-54h]\nint arg; // [rsp+1Ch] [rbp-44h] BYREF\nstruct timeval tv; // [rsp+20h] [rbp-40h] BYREF\nint v7; // [rsp+30h] [rbp-30h]\nint v8; // [rsp+34h] [rbp-2Ch]\nunsigned __int64 v9; // [rsp+38h] [rbp-28h]\n__int64 v10; // [rsp+40h] [rbp-20h]\nint i; // [rsp+48h] [rbp-18h]\nint j; // [rsp+4Ch] [rbp-14h]\n\nv4 = a1;\nv10 = a1 - 1LL;\nv1 = alloca(16 * ((8LL * a1 + 15) / 0x10uLL));\nv9 = 8 * ((unsigned __int64)&v3 >> 3);\narg = 10000 / a1;\ngettimeofday(&tv, 0LL);\nv8 = tv.tv_usec;\nfor ( i = 0; i < v4; ++i )\npthread_create((pthread_t *)(8LL * i + v9), 0LL, my_thread, &arg);\nfor ( j = 0; j < v4; ++j )\npthread_join(*(_QWORD *)(v9 + 8LL * j), 0LL);\ngettimeofday(&tv, 0LL);\nv7 = tv.tv_usec;\nprintf(\"Total time: %.3f ms\\n\", (double)(LODWORD(tv.tv_usec) - v8) / 100.0);\nreturn 0LL;\n}",
"original_code": "int testMultiThreaded(int N)\n{\n struct timeval now;\n pthread_t threads[N];\n int num = 10000/N;\n int start, end;\n gettimeofday(&now, ((void *)0));\n start = now.tv_usec;\n for (int i = 0; i < N; ++i)\n {\n pthread_create( &threads[i], ((void *)0), my_thread, (void*) &num );\n }\n for (int i = 0; i < N; ++i)\n {\n pthread_join( threads[i], ((void *)0) );\n }\n gettimeofday(&now, ((void *)0));\n end = now.tv_usec;\n printf(\"Total time: %.3f ms\\n\", (end-start)/100.0);\n return 0;\n}",
"canonical_original_code": "int testMultiThreaded(int N)\n{\n struct timeval now;\n unsigned long threads[-1];\n int num = 10000/N;\n int start; int end;\n gettimeofday(&now, ((void *)0));\n start = now.tv_usec;\n for (int i = 0; i < N; ++i)\n {\n pthread_create( &threads[i], ((void *)0), my_thread, (void *) &num );\n }\n for (int i = 0; i < N; ++i)\n {\n pthread_join( threads[i], ((void *)0) );\n }\n gettimeofday(&now, ((void *)0));\n end = now.tv_usec;\n printf(\"Total time: %.3f ms\\n\", (end-start)/100.0);\n return 0;\n}",
"variable_types": [
[
"N",
"int"
],
[
"now",
"struct timeval { long tv_sec; long tv_usec; }"
],
[
"threads",
"unsigned long [-1]"
],
[
"num",
"int"
],
[
"start",
"int"
],
[
"end",
"int"
],
[
"i",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct timeval { long tv_sec; long tv_usec; }"
],
"binary_hash": "ba25236168f29706806ef9a82ebea3df893fdac088a6376f573ab2bd9f2a0742"
},
{
"name": "my_thread",
"canonical_name": "func11",
"repo": "demonicblue/operating-systems",
"decompiled_code": "void *__fastcall my_thread(void *a1)\n{\nint v2; // [rsp+10h] [rbp-10h] BYREF\nint v3; // [rsp+14h] [rbp-Ch]\nint v4; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nv4 = *(_DWORD *)a1;\nv2 = 0;\nv3 = 2 * v4;\nfor ( i = 0; i < v3; ++i )\n{\nif ( rand() % 2 <= 0 )\ndequeue(&v2);\nelse\nenqueue(i);\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "void *__fastcall func11(void *a1)\n{\nint v2; // [rsp+10h] [rbp-10h] BYREF\nint v3; // [rsp+14h] [rbp-Ch]\nint v4; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nv4 = *(_DWORD *)a1;\nv2 = 0;\nv3 = 2 * v4;\nfor ( i = 0; i < v3; ++i )\n{\nif ( rand() % 2 <= 0 )\nfunc9(&v2);\nelse\nfunc8(i);\n}\nreturn 0LL;\n}",
"original_code": "void *my_thread(void *ptr)\n{\n int num = *(int*)ptr;\n int ret = 0;\n int tot = 2*num;\n for(int i = 0; i< tot; i++)\n {\n if( (rand() % 2 + 1) > 1 ) {\n enqueue(i);\n } else {\n dequeue(&ret);\n }\n }\n return 0;\n}",
"canonical_original_code": "void *my_thread(void *ptr)\n{\n int num = *(int*)ptr;\n int ret = 0;\n int tot = 2*num;\n for(int i = 0; i< tot; i++)\n {\n if( (rand() % 2 + 1) > 1 ) {\n enqueue(i);\n } else {\n dequeue(&ret);\n }\n }\n return 0;\n}",
"variable_types": [
[
"ptr",
"void *"
],
[
"num",
"int"
],
[
"ret",
"int"
],
[
"tot",
"int"
],
[
"i",
"int"
]
],
"return_type": "void *",
"user_defined_types": [],
"binary_hash": "ba25236168f29706806ef9a82ebea3df893fdac088a6376f573ab2bd9f2a0742"
}
] |
82bc80c3ddeb0bf0c6eeff2d4ffa1d10f509bf1ac2c80081f27317173d294e82 | ikautak/crc8 | [
[
"sub_401020",
"->"
],
[
"start",
"->"
],
[
"dl_relocate_static_pie",
"->"
],
[
"deregister_tm_clones",
"->",
"_do_global_dtors_aux"
],
[
"register_tm_clones",
"->",
"frame_dummy"
],
[
"_do_global_dtors_aux",
"->",
"deregister_tm_clones"
],
[
"frame_dummy",
"->",
"register_tm_clones"
],
[
"crc8_lsb",
"->",
"main"
],
[
"crc8_msb",
"->",
"main"
],
[
"main",
"->",
"crc8_lsb",
"crc8_msb"
],
[
"_libc_csu_init",
"->"
],
[
"_libc_csu_fini",
"->"
]
] | [
[
"sub_401020",
"__int64 func0()\n{\nreturn qword_404010();\n}"
],
[
"start",
"void __fastcall __noreturn func1(__int64 a1, __int64 a2, void (*a3)(void))\n{\n__int64 v3; // rax\nint v4; // esi\n__int64 v5; // [rsp-8h] [rbp-8h] BYREF\nchar *retaddr; // [rsp+0h] [rbp+0h] BYREF\n\nv4 = v5;\nv5 = v3;\n_libc_start_main(\n(int (__fastcall *)(int, char **, char **))main,\nv4,\n&retaddr,\n_libc_csu_init,\n_libc_csu_fini,\na3,\n&v5);\n__halt();\n}"
],
[
"dl_relocate_static_pie",
"void func2()\n{\n;\n}"
],
[
"deregister_tm_clones",
"char *func3()\n{\nreturn &_bss_start;\n}"
],
[
"register_tm_clones",
"__int64 func4()\n{\nreturn 0LL;\n}"
],
[
"_do_global_dtors_aux",
"char *func5()\n{\nchar *result; // rax\n\nif ( !_bss_start )\n{\nresult = func3();\n_bss_start = 1;\n}\nreturn result;\n}"
],
[
"frame_dummy",
"__int64 func6()\n{\nreturn func4();\n}"
],
[
"_libc_csu_init",
"void __fastcall func9(unsigned int a1, __int64 a2, __int64 a3)\n{\nsigned __int64 v4; // rbp\n__int64 i; // rbx\n\ninit_proc();\nv4 = &_do_global_dtors_aux_fini_array_entry - &_frame_dummy_init_array_entry;\nif ( v4 )\n{\nfor ( i = 0LL; i != v4; ++i )\n((void (__fastcall *)(_QWORD, __int64, __int64))*(&_frame_dummy_init_array_entry + i))(a1, a2, a3);\n}\n}"
],
[
"_libc_csu_fini",
"void func10(void)\n{\n;\n}"
]
] | [
{
"name": "crc8_lsb",
"canonical_name": "func7",
"repo": "ikautak/crc8",
"decompiled_code": "__int64 __fastcall crc8_lsb(char a1, _BYTE *a2, __int64 a3)\n{\n_BYTE *v3; // rax\nint i; // [rsp+20h] [rbp-8h]\nunsigned __int8 v9; // [rsp+27h] [rbp-1h]\n\nv9 = 0;\nwhile ( a3-- )\n{\nv3 = a2++;\nv9 ^= *v3;\nfor ( i = 0; i <= 7; ++i )\n{\nif ( (v9 & 1) != 0 )\nv9 = a1 ^ (v9 >> 1);\nelse\nv9 >>= 1;\n}\n}\nreturn v9;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(char a1, _BYTE *a2, __int64 a3)\n{\n_BYTE *v3; // rax\nint i; // [rsp+20h] [rbp-8h]\nunsigned __int8 v9; // [rsp+27h] [rbp-1h]\n\nv9 = 0;\nwhile ( a3-- )\n{\nv3 = a2++;\nv9 ^= *v3;\nfor ( i = 0; i <= 7; ++i )\n{\nif ( (v9 & 1) != 0 )\nv9 = a1 ^ (v9 >> 1);\nelse\nv9 >>= 1;\n}\n}\nreturn v9;\n}",
"original_code": "uint8_t crc8_lsb(uint8_t poly, uint8_t *data, size_t size) {\n uint8_t crc = 0x00;\n while (size--) {\n crc ^= *data++;\n for (int bit = 0; bit < 8; bit++) {\n if (crc & 0x01) {\n crc = (crc >> 1) ^ poly;\n } else {\n crc >>= 1;\n }\n }\n }\n return crc;\n}",
"canonical_original_code": "unsigned char crc8_lsb(unsigned char poly, unsigned char *data, unsigned long size) {\n unsigned char crc = 0x00;\n while (size--) {\n crc ^= *data++;\n for (int bit = 0; bit < 8; bit++) {\n if (crc & 0x01) {\n crc = (crc >> 1) ^ poly;\n } else {\n crc >>= 1;\n }\n }\n }\n return crc;\n}",
"variable_types": [
[
"poly",
"unsigned char"
],
[
"data",
"unsigned char *"
],
[
"size",
"unsigned long"
],
[
"crc",
"unsigned char"
],
[
"bit",
"int"
]
],
"return_type": "unsigned char",
"user_defined_types": [],
"binary_hash": "82bc80c3ddeb0bf0c6eeff2d4ffa1d10f509bf1ac2c80081f27317173d294e82"
},
{
"name": "crc8_msb",
"canonical_name": "func8",
"repo": "ikautak/crc8",
"decompiled_code": "__int64 __fastcall crc8_msb(char a1, _BYTE *a2, __int64 a3)\n{\n_BYTE *v3; // rax\nint i; // [rsp+20h] [rbp-8h]\nchar v9; // [rsp+27h] [rbp-1h]\n\nv9 = 0;\nwhile ( a3-- )\n{\nv3 = a2++;\nv9 ^= *v3;\nfor ( i = 0; i <= 7; ++i )\n{\nif ( v9 >= 0 )\nv9 *= 2;\nelse\nv9 = (2 * v9) ^ a1;\n}\n}\nreturn (unsigned __int8)v9;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func8(char a1, _BYTE *a2, __int64 a3)\n{\n_BYTE *v3; // rax\nint i; // [rsp+20h] [rbp-8h]\nchar v9; // [rsp+27h] [rbp-1h]\n\nv9 = 0;\nwhile ( a3-- )\n{\nv3 = a2++;\nv9 ^= *v3;\nfor ( i = 0; i <= 7; ++i )\n{\nif ( v9 >= 0 )\nv9 *= 2;\nelse\nv9 = (2 * v9) ^ a1;\n}\n}\nreturn (unsigned __int8)v9;\n}",
"original_code": "uint8_t crc8_msb(uint8_t poly, uint8_t *data, size_t size) {\n uint8_t crc = 0x00;\n while (size--) {\n crc ^= *data++;\n for (int bit = 0; bit < 8; bit++) {\n if (crc & 0x80) {\n crc = (crc << 1) ^ poly;\n } else {\n crc <<= 1;\n }\n }\n }\n return crc;\n}",
"canonical_original_code": "unsigned char crc8_msb(unsigned char poly, unsigned char *data, unsigned long size) {\n unsigned char crc = 0x00;\n while (size--) {\n crc ^= *data++;\n for (int bit = 0; bit < 8; bit++) {\n if (crc & 0x80) {\n crc = (crc << 1) ^ poly;\n } else {\n crc <<= 1;\n }\n }\n }\n return crc;\n}",
"variable_types": [
[
"poly",
"unsigned char"
],
[
"data",
"unsigned char *"
],
[
"size",
"unsigned long"
],
[
"crc",
"unsigned char"
],
[
"bit",
"int"
]
],
"return_type": "unsigned char",
"user_defined_types": [],
"binary_hash": "82bc80c3ddeb0bf0c6eeff2d4ffa1d10f509bf1ac2c80081f27317173d294e82"
},
{
"name": "main",
"canonical_name": "main",
"repo": "ikautak/crc8",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\n__int64 v3; // rax\nunsigned __int8 v4; // al\n__int64 v5; // rax\nunsigned __int8 v6; // al\n__int64 v7; // rax\nunsigned __int8 v8; // al\n__int64 v9; // rax\nunsigned __int8 v10; // al\n\nv3 = strlen(\"Hello World!!!\");\nv4 = crc8_lsb(29, \"Hello World!!!\", v3);\nprintf(\"%02x\\n\", v4);\nv5 = strlen(\"Hello World!!!\");\nv6 = crc8_msb(29, \"Hello World!!!\", v5);\nprintf(\"%02x\\n\", v6);\nv7 = strlen(\"Hello World!!!\");\nv8 = crc8_lsb(49, \"Hello World!!!\", v7);\nprintf(\"%02x\\n\", v8);\nv9 = strlen(\"Hello World!!!\");\nv10 = crc8_msb(49, \"Hello World!!!\", v9);\nprintf(\"%02x\\n\", v10);\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\n__int64 v3; // rax\nunsigned __int8 v4; // al\n__int64 v5; // rax\nunsigned __int8 v6; // al\n__int64 v7; // rax\nunsigned __int8 v8; // al\n__int64 v9; // rax\nunsigned __int8 v10; // al\n\nv3 = strlen(\"Hello World!!!\");\nv4 = func7(29, \"Hello World!!!\", v3);\nprintf(\"%02x\\n\", v4);\nv5 = strlen(\"Hello World!!!\");\nv6 = func8(29, \"Hello World!!!\", v5);\nprintf(\"%02x\\n\", v6);\nv7 = strlen(\"Hello World!!!\");\nv8 = func7(49, \"Hello World!!!\", v7);\nprintf(\"%02x\\n\", v8);\nv9 = strlen(\"Hello World!!!\");\nv10 = func8(49, \"Hello World!!!\", v9);\nprintf(\"%02x\\n\", v10);\nreturn 0;\n}",
"original_code": "int main(void) {\n char *data = \"Hello World!!!\";\n uint8_t poly;\n poly = 0x1D;\n printf(\"%02x\\n\", crc8_lsb(poly, (uint8_t *)data, strlen(data)));\n printf(\"%02x\\n\", crc8_msb(poly, (uint8_t *)data, strlen(data)));\n poly = 0x31;\n printf(\"%02x\\n\", crc8_lsb(poly, (uint8_t *)data, strlen(data)));\n printf(\"%02x\\n\", crc8_msb(poly, (uint8_t *)data, strlen(data)));\n return 0;\n}",
"canonical_original_code": "int main() {\n char *data = \"Hello World!!!\";\n unsigned char poly;\n poly = 0x1D;\n printf(\"%02x\\n\", crc8_lsb(poly, (unsigned char *)data, strlen(data)));\n printf(\"%02x\\n\", crc8_msb(poly, (unsigned char *)data, strlen(data)));\n poly = 0x31;\n printf(\"%02x\\n\", crc8_lsb(poly, (unsigned char *)data, strlen(data)));\n printf(\"%02x\\n\", crc8_msb(poly, (unsigned char *)data, strlen(data)));\n return 0;\n}",
"variable_types": [
[
"data",
"char *"
],
[
"poly",
"unsigned char"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "82bc80c3ddeb0bf0c6eeff2d4ffa1d10f509bf1ac2c80081f27317173d294e82"
}
] |
16997b19f2608ef35050cbcdcc86e14d8638c1c02c5fd9b2cc1f906bd9696ac0 | avgo/avgmoney | [
[
"AvgMoney_CheckCreateDB",
"->",
"AvgMoney_MySQLPrepare"
],
[
"AvgMoney_Create",
"->",
"main"
],
[
"AvgMoney_MySQLPrepare",
"->",
"AvgMoney_CheckCreateDB",
"main"
],
[
"main",
"->",
"AvgMoney_Create",
"AvgMoney_MySQLPrepare"
]
] | [
[
"AvgMoney_CheckCreateDB",
"__int64 func0()\n{\n__int64 result; // rax\n__int64 v1; // rax\n__int64 v2; // rax\nunsigned int v3; // ebx\nconst char *v4; // rax\nint v5; // [rsp+Ch] [rbp-24h]\n__int64 v6; // [rsp+10h] [rbp-20h]\n\nresult = mysql_select_db(AvgMoneyApp, \"avgmoney\");\nif ( (_DWORD)result )\n{\nif ( (unsigned int)mysql_errno(AvgMoneyApp) != 1049 )\n{\nv3 = mysql_errno(AvgMoneyApp);\nv4 = (const char *)mysql_error(AvgMoneyApp);\ng_print(\"%s (%d)\\n\", v4, v3);\nexit(1);\n}\nv6 = gtk_message_dialog_new(0LL, 1LL, 0LL, 5LL, &unk_798);\nv1 = gtk_dialog_get_type();\nv2 = g_type_check_instance_cast(v6, v1);\nv5 = gtk_dialog_run(v2);\ngtk_widget_destroy(v6);\nif ( v5 != -5 )\nexit(1);\nif ( (unsigned int)mysql_query(AvgMoneyApp, \"CREATE DATABASE avgmoney;\") )\n{\ng_print(\"mysql_query() error 1.\\n\");\nexit(1);\n}\nif ( (unsigned int)mysql_query(AvgMoneyApp, \"USE avgmoney;\") )\n{\ng_print(\"mysql_query() error 2.\\n\");\nexit(1);\n}\nif ( (unsigned int)mysql_query(AvgMoneyApp, SQLCreateAccounts) )\n{\ng_print(\"mysql_query() error 3.\\n\");\nexit(1);\n}\nif ( (unsigned int)mysql_query(AvgMoneyApp, SQLCreateCategories) )\n{\ng_print(\"mysql_query() error 4.\\n\");\nexit(1);\n}\nresult = mysql_query(AvgMoneyApp, SQLCreateOperations);\nif ( (_DWORD)result )\n{\ng_print(\"mysql_query() error 5.\\n\");\nexit(1);\n}\n}\nreturn result;\n}"
]
] | [
{
"name": "AvgMoney_Create",
"canonical_name": "func1",
"repo": "avgo/avgmoney",
"decompiled_code": "__int64 AvgMoney_Create()\n{\n__int64 result; // rax\n\nif ( AvgMoneyApp )\n{\ng_print(\"error\\n\");\nexit(1);\n}\nAvgMoneyApp = (__int64)malloc(0x750uLL);\nresult = AvgMoneyApp;\nif ( !AvgMoneyApp )\n{\ng_print(\"error\\n\");\nexit(1);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 func1()\n{\n__int64 result; // rax\n\nif ( AvgMoneyApp )\n{\ng_print(\"error\\n\");\nexit(1);\n}\nAvgMoneyApp = (__int64)malloc(0x750uLL);\nresult = AvgMoneyApp;\nif ( !AvgMoneyApp )\n{\ng_print(\"error\\n\");\nexit(1);\n}\nreturn result;\n}",
"original_code": "void AvgMoney_Create()\n{\n if (AvgMoneyApp != ((void *)0))\n {\n g_print(\"error\\n\");\n exit(1);\n }\n AvgMoneyApp = malloc(sizeof(AvgMoney));\n if (AvgMoneyApp == ((void *)0))\n {\n g_print(\"error\\n\");\n exit(1);\n }\n}",
"canonical_original_code": "void AvgMoney_Create()\n{\n if (AvgMoneyApp != ((void *)0))\n {\n g_print(\"error\\n\");\n exit(1);\n }\n AvgMoneyApp = malloc(sizeof(AvgMoney));\n if (AvgMoneyApp == ((void *)0))\n {\n g_print(\"error\\n\");\n exit(1);\n }\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "16997b19f2608ef35050cbcdcc86e14d8638c1c02c5fd9b2cc1f906bd9696ac0"
},
{
"name": "AvgMoney_MySQLPrepare",
"canonical_name": "func2",
"repo": "avgo/avgmoney",
"decompiled_code": "__int64 AvgMoney_MySQLPrepare()\n{\nunsigned int v0; // ebx\nconst char *v1; // rax\n\nif ( !mysql_init(AvgMoneyApp) )\n{\ng_print(\"AvgMoney_MySQLPrepare(): \\n\");\nexit(1);\n}\nmysql_options(AvgMoneyApp, 7LL, \"utf8\");\nif ( !mysql_real_connect(AvgMoneyApp, &locale, &locale, &locale, 0LL, 0LL, 0LL, 0LL) )\n{\nv0 = mysql_errno(AvgMoneyApp);\nv1 = (const char *)mysql_error(AvgMoneyApp);\ng_print(\"%s() %s (%u).\\n\", \"AvgMoney_MySQLPrepare\", v1, v0);\nexit(1);\n}\nreturn AvgMoney_CheckCreateDB();\n}\n",
"canonical_decompiled_code": "__int64 func2()\n{\nunsigned int v0; // ebx\nconst char *v1; // rax\n\nif ( !mysql_init(AvgMoneyApp) )\n{\ng_print(\"AvgMoney_MySQLPrepare(): \\n\");\nexit(1);\n}\nmysql_options(AvgMoneyApp, 7LL, \"utf8\");\nif ( !mysql_real_connect(AvgMoneyApp, &locale, &locale, &locale, 0LL, 0LL, 0LL, 0LL) )\n{\nv0 = mysql_errno(AvgMoneyApp);\nv1 = (const char *)mysql_error(AvgMoneyApp);\ng_print(\"%s() %s (%u).\\n\", \"AvgMoney_MySQLPrepare\", v1, v0);\nexit(1);\n}\nreturn func0();\n}",
"original_code": "void AvgMoney_MySQLPrepare()\n{\n if (mysql_init(&AvgMoneyApp->MySQL) == ((void *)0))\n {\n g_print(\"AvgMoney_MySQLPrepare(): \\n\");\n exit(1);\n }\n mysql_options(&AvgMoneyApp->MySQL, MYSQL_SET_CHARSET_NAME, \"utf8\");\n if (mysql_real_connect(&AvgMoneyApp->MySQL, \"\", \"\", \"\", ((void *)0),\n 0, ((void *)0), 0) == ((void *)0))\n {\n g_print(\"%s() %s (%u).\\n\", __func__,\n mysql_error(&AvgMoneyApp->MySQL),\n mysql_errno(&AvgMoneyApp->MySQL));\n exit(1);\n }\n AvgMoney_CheckCreateDB();\n}",
"canonical_original_code": "void AvgMoney_MySQLPrepare()\n{\n if (mysql_init(&AvgMoneyApp->MySQL) == ((void *)0))\n {\n g_print(\"AvgMoney_MySQLPrepare(): \\n\");\n exit(1);\n }\n mysql_options(&AvgMoneyApp->MySQL, MYSQL_SET_CHARSET_NAME, \"utf8\");\n if (mysql_real_connect(&AvgMoneyApp->MySQL, \"\", \"\", \"\", ((void *)0),\n 0, ((void *)0), 0) == ((void *)0))\n {\n g_print(\"%s() %s (%u).\\n\", __func__,\n mysql_error(&AvgMoneyApp->MySQL),\n mysql_errno(&AvgMoneyApp->MySQL));\n exit(1);\n }\n AvgMoney_CheckCreateDB();\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "16997b19f2608ef35050cbcdcc86e14d8638c1c02c5fd9b2cc1f906bd9696ac0"
},
{
"name": "main",
"canonical_name": "main",
"repo": "avgo/avgmoney",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nconst char **v4; // [rsp+0h] [rbp-10h] BYREF\nint v5; // [rsp+Ch] [rbp-4h] BYREF\n\nv5 = argc;\nv4 = argv;\ngtk_init(&v5, &v4);\nsetlocale(6, &locale);\nsetlocale(1, \"C\");\nAvgMoney_Create();\nAvgMoney_MySQLPrepare();\nFormAccounts_Init(AvgMoneyApp + 1272);\nFormAccounts_Create(AvgMoneyApp + 1272, AvgMoneyApp);\nFormAccounts_UpdateData(AvgMoneyApp + 1272);\ngtk_main();\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nconst char **v4; // [rsp+0h] [rbp-10h] BYREF\nint v5; // [rsp+Ch] [rbp-4h] BYREF\n\nv5 = argc;\nv4 = argv;\ngtk_init(&v5, &v4);\nsetlocale(6, &locale);\nsetlocale(1, \"C\");\nfunc1();\nfunc2();\nFormAccounts_Init(AvgMoneyApp + 1272);\nFormAccounts_Create(AvgMoneyApp + 1272, AvgMoneyApp);\nFormAccounts_UpdateData(AvgMoneyApp + 1272);\ngtk_main();\nreturn 0;\n}",
"original_code": "int main(int argc, char* argv[])\n{\n gtk_init(&argc, &argv);\n setlocale(6, \"\");\n setlocale(1, \"C\");\n AvgMoney_Create();\n AvgMoney_MySQLPrepare();\n FormAccounts_Init(&AvgMoneyApp->form_accounts);\n FormAccounts_Create(&AvgMoneyApp->form_accounts, &AvgMoneyApp->MySQL);\n FormAccounts_UpdateData(&AvgMoneyApp->form_accounts);\n gtk_main();\n return 0;\n}",
"canonical_original_code": "int main(int argc, char *argv[])\n{\n gtk_init(&argc, &argv);\n setlocale(6, \"\");\n setlocale(1, \"C\");\n AvgMoney_Create();\n AvgMoney_MySQLPrepare();\n FormAccounts_Init(&AvgMoneyApp->form_accounts);\n FormAccounts_Create(&AvgMoneyApp->form_accounts, &AvgMoneyApp->MySQL);\n FormAccounts_UpdateData(&AvgMoneyApp->form_accounts);\n gtk_main();\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char *[]"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "16997b19f2608ef35050cbcdcc86e14d8638c1c02c5fd9b2cc1f906bd9696ac0"
}
] |
945bbf6e19355fc768640403203448fdf7064e43a7ca70df8c56ff0a7a747100 | avgo/avgmoney | [
[
"Calc",
"->"
]
] | [] | [
{
"name": "Calc",
"canonical_name": "func0",
"repo": "avgo/avgmoney",
"decompiled_code": "__int64 __fastcall Calc(const char *a1, double *a2)\n{\nchar *v3; // [rsp+18h] [rbp-28h] BYREF\nchar *endptr; // [rsp+20h] [rbp-20h] BYREF\ndouble v5; // [rsp+28h] [rbp-18h]\ndouble v6; // [rsp+30h] [rbp-10h]\ndouble v7; // [rsp+38h] [rbp-8h]\n\n*a2 = 0.0;\nv7 = strtod(a1, &endptr);\nif ( a1 == endptr )\nreturn 0xFFFFFFFFLL;\nwhile ( *endptr == 32 )\n++endptr;\nwhile ( *endptr )\n{\nif ( *endptr == 43 )\n{\nv6 = 1.0;\n++endptr;\n}\nelse if ( *endptr == 45 )\n{\nv6 = -1.0;\n++endptr;\n}\nwhile ( *endptr == 32 )\n++endptr;\nv5 = strtod(endptr, &v3);\nif ( endptr == v3 )\nreturn 0xFFFFFFFFLL;\nv7 = v6 * v5 + v7;\nfor ( endptr = v3; *endptr == 32; ++endptr )\n;\n}\n*a2 = v7;\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(const char *a1, double *a2)\n{\nchar *v3; // [rsp+18h] [rbp-28h] BYREF\nchar *endptr; // [rsp+20h] [rbp-20h] BYREF\ndouble v5; // [rsp+28h] [rbp-18h]\ndouble v6; // [rsp+30h] [rbp-10h]\ndouble v7; // [rsp+38h] [rbp-8h]\n\n*a2 = 0.0;\nv7 = strtod(a1, &endptr);\nif ( a1 == endptr )\nreturn 0xFFFFFFFFLL;\nwhile ( *endptr == 32 )\n++endptr;\nwhile ( *endptr )\n{\nif ( *endptr == 43 )\n{\nv6 = 1.0;\n++endptr;\n}\nelse if ( *endptr == 45 )\n{\nv6 = -1.0;\n++endptr;\n}\nwhile ( *endptr == 32 )\n++endptr;\nv5 = strtod(endptr, &v3);\nif ( endptr == v3 )\nreturn 0xFFFFFFFFLL;\nv7 = v6 * v5 + v7;\nfor ( endptr = v3; *endptr == 32; ++endptr )\n;\n}\n*a2 = v7;\nreturn 1LL;\n}",
"original_code": "int Calc(const char* Str, double* Result)\n{\n char* cp1;\n char* cp2;\n double d1, d2, sign;\n *Result = 0;\n d2 = strtod(Str, &cp1);\n if (cp1 == Str)\n {\n return -1;\n }\n while (*cp1 == ' ')\n {\n ++cp1;\n }\n while (*cp1 != '\\0')\n {\n if (*cp1 == '+')\n {\n sign = 1;\n ++cp1;\n }\n else\n if (*cp1 == '-')\n {\n sign = -1;\n ++cp1;\n }\n while (*cp1 == ' ')\n {\n ++cp1;\n }\n d1 = strtod(cp1, &cp2);\n if (cp1 == cp2)\n {\n return -1;\n }\n d2 = d2 + sign * d1;\n cp1 = cp2;\n while (*cp1 == ' ')\n {\n ++cp1;\n }\n }\n *Result = d2; return 1;\n}",
"canonical_original_code": "int Calc(char *Str, double *Result)\n{\n char *cp1;\n char *cp2;\n double d1; double d2; double sign;\n *Result = 0;\n d2 = strtod(Str, &cp1);\n if (cp1 == Str)\n {\n return -1;\n }\n while (*cp1 == ' ')\n {\n ++cp1;\n }\n while (*cp1 != '\\0')\n {\n if (*cp1 == '+')\n {\n sign = 1;\n ++cp1;\n }\n else\n if (*cp1 == '-')\n {\n sign = -1;\n ++cp1;\n }\n while (*cp1 == ' ')\n {\n ++cp1;\n }\n d1 = strtod(cp1, &cp2);\n if (cp1 == cp2)\n {\n return -1;\n }\n d2 = d2 + sign * d1;\n cp1 = cp2;\n while (*cp1 == ' ')\n {\n ++cp1;\n }\n }\n *Result = d2; return 1;\n}",
"variable_types": [
[
"Str",
"char *"
],
[
"Result",
"double *"
],
[
"cp1",
"char *"
],
[
"cp2",
"char *"
],
[
"d1",
"double"
],
[
"d2",
"double"
],
[
"sign",
"double"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "945bbf6e19355fc768640403203448fdf7064e43a7ca70df8c56ff0a7a747100"
}
] |
ab28d4e6f86a663b556310f7031e7cfc0078f9feae27af1b3fcbd797e5c767b8 | avgo/avgmoney | [
[
"FormCategories_ButtonAddClicked",
"->"
],
[
"FormCategories_ButtonCutClicked",
"->"
],
[
"FormCategories_ButtonDeleteClicked",
"->"
],
[
"FormCategories_ButtonPasteClicked",
"->"
],
[
"FormCategories_ButtonRenameClicked",
"->"
],
[
"FormCategories_Create",
"->",
"FormCategories_UpdateData"
],
[
"FormCategories_Destroy",
"->"
],
[
"FormCategories_Init",
"->"
],
[
"FormCategories_TreeViewCategoriesRowActivated",
"->"
],
[
"FormCategories_TreeViewCategoriesCursorChanged",
"->"
],
[
"FormCategories_UpdateData",
"->",
"FormCategories_Create"
]
] | [
[
"FormCategories_ButtonAddClicked",
"__int64 __fastcall func0(__int64 a1, _QWORD *a2)\n{\n__int64 v2; // rax\n__int64 v3; // rax\n__int64 v4; // rax\n__int64 v5; // rax\nunsigned int v7; // [rsp+1Ch] [rbp-14h]\n__int64 v8; // [rsp+20h] [rbp-10h]\n\nv2 = gtk_entry_get_type(a1, a2);\nv3 = g_type_check_instance_cast(a2[1], v2);\nv8 = gtk_entry_get_text(v3);\nv4 = gtk_toggle_button_get_type();\nv5 = g_type_check_instance_cast(*a2, v4);\nv7 = gtk_toggle_button_get_active(v5);\nreturn TreeViewCategories_CategoryAdd(a2 + 3, v8, v7);\n}"
],
[
"FormCategories_ButtonCutClicked",
"__int64 __fastcall func1(__int64 a1, __int64 a2)\n{\nreturn TreeViewCategories_Cut(a2 + 24);\n}"
],
[
"FormCategories_ButtonDeleteClicked",
"__int64 __fastcall func2(__int64 a1, __int64 a2)\n{\nreturn TreeViewCategories_CategoryDelete(a2 + 24);\n}"
],
[
"FormCategories_ButtonPasteClicked",
"__int64 __fastcall func3(__int64 a1, _QWORD *a2)\n{\n__int64 v2; // rax\n__int64 v3; // rax\nunsigned int v5; // [rsp+14h] [rbp-Ch]\n\nv2 = gtk_toggle_button_get_type(a1, a2);\nv3 = g_type_check_instance_cast(*a2, v2);\nv5 = gtk_toggle_button_get_active(v3);\nreturn TreeViewCategories_Paste(a2 + 3, v5);\n}"
],
[
"FormCategories_ButtonRenameClicked",
"__int64 __fastcall func4(__int64 a1, __int64 a2)\n{\n__int64 v2; // rax\n__int64 v3; // rax\n__int64 result; // rax\n\nv2 = gtk_entry_get_type(a1, a2);\nv3 = g_type_check_instance_cast(*(_QWORD *)(a2 + 8), v2);\nresult = gtk_entry_get_text(v3);\nif ( result )\nresult = TreeViewCategories_CategoryRename(a2 + 24, result);\nreturn result;\n}"
],
[
"FormCategories_Create",
"__int64 __fastcall func5(__int64 *a1, __int64 a2)\n{\n__int64 result; // rax\n__int64 v3; // rsi\n__int64 v4; // rax\n__int64 v5; // rax\n__int64 v6; // rax\n__int64 v7; // rbx\n__int64 v8; // rax\n__int64 v9; // rax\n__int64 v10; // rax\n__int64 v11; // rax\n__int64 v12; // rbx\n__int64 v13; // rax\n__int64 v14; // rax\n__int64 v15; // rbx\n__int64 v16; // rax\n__int64 v17; // rax\n__int64 v18; // rax\n__int64 v19; // rax\n__int64 v20; // rax\n__int64 v21; // rax\n__int64 v22; // rax\n__int64 v23; // rax\n__int64 v24; // rax\n__int64 v25; // rax\n__int64 v26; // rax\n__int64 v27; // rax\n__int64 v28; // rax\n__int64 v29; // rax\n__int64 v30; // rax\n__int64 v31; // rax\n__int64 v32; // rax\n__int64 v33; // rax\n__int64 v34; // rax\n__int64 v35; // rax\n__int64 v36; // [rsp+18h] [rbp-68h]\n_QWORD *v37; // [rsp+20h] [rbp-60h]\n__int64 v38; // [rsp+28h] [rbp-58h]\n__int64 v39; // [rsp+30h] [rbp-50h]\n__int64 v40; // [rsp+38h] [rbp-48h]\n__int64 v41; // [rsp+40h] [rbp-40h]\n__int64 v42; // [rsp+48h] [rbp-38h]\n__int64 v43; // [rsp+50h] [rbp-30h]\n__int64 v44; // [rsp+58h] [rbp-28h]\n__int64 v45; // [rsp+60h] [rbp-20h]\nunsigned int v46; // [rsp+6Ch] [rbp-14h]\n\nif ( a1[2] )\n{\nv37 = (_QWORD *)a1[2];\nv36 = gtk_window_get_type();\nif ( v37 )\n{\nif ( *v37 && v36 == *(_QWORD *)*v37 )\nv46 = 1;\nelse\nv46 = g_type_check_instance_is_a(v37, v36);\n}\nelse\n{\nv46 = 0;\n}\nresult = v46;\nif ( v46 )\n{\nv3 = gtk_window_get_type();\nv4 = g_type_check_instance_cast(a1[2], v3);\ngtk_window_present(v4);\nresult = g_print(\"%s(): fc->WindowCategories != NULL, present.\\n\", \"FormCategories_Create\");\n}\n}\nelse\n{\ng_print(\"%s(): fc->WindowCategories = NULL\\n\", \"FormCategories_Create\");\na1[2] = gtk_window_new(0LL);\nv5 = gtk_window_get_type();\nv6 = g_type_check_instance_cast(a1[2], v5);\ngtk_window_set_title(v6, &unk_883);\nv45 = gtk_vbox_new(0LL, 0LL);\nv44 = gtk_scrolled_window_new(0LL, 0LL);\nTreeViewCategories_Create(a1 + 3, a2);\nv7 = a1[3];\nv8 = gtk_container_get_type();\nv9 = g_type_check_instance_cast(v44, v8);\ngtk_container_add(v9, v7);\nv10 = gtk_box_get_type();\nv11 = g_type_check_instance_cast(v45, v10);\ngtk_box_pack_start(v11, v44, 1LL, 1LL, 0LL);\nv43 = gtk_hbox_new(0LL, 0LL);\n*a1 = gtk_check_button_new_with_label(&unk_896);\nv12 = *a1;\nv13 = gtk_box_get_type();\nv14 = g_type_check_instance_cast(v43, v13);\ngtk_box_pack_start(v14, v12, 0LL, 0LL, 0LL);\na1[1] = gtk_entry_new();\nv15 = a1[1];\nv16 = gtk_box_get_type();\nv17 = g_type_check_instance_cast(v43, v16);\ngtk_box_pack_start(v17, v15, 1LL, 1LL, 0LL);\nv42 = gtk_button_new_with_label(&unk_8A6);\nv18 = gtk_box_get_type();\nv19 = g_type_check_instance_cast(v43, v18);\ngtk_box_pack_start(v19, v42, 0LL, 0LL, 0LL);\nv41 = gtk_button_new_with_label(&unk_8B7);\nv20 = gtk_box_get_type();\nv21 = g_type_check_instance_cast(v43, v20);\ngtk_box_pack_start(v21, v41, 0LL, 0LL, 0LL);\nv40 = gtk_button_new_with_label(&unk_8D2);\nv22 = gtk_box_get_type();\nv23 = g_type_check_instance_cast(v43, v22);\ngtk_box_pack_start(v23, v40, 0LL, 0LL, 0LL);\nv39 = gtk_button_new_with_label(&unk_8E1);\nv24 = gtk_box_get_type();\nv25 = g_type_check_instance_cast(v43, v24);\ngtk_box_pack_start(v25, v39, 0LL, 0LL, 0LL);\nv38 = gtk_button_new_with_label(&unk_8F2);\nv26 = gtk_box_get_type();\nv27 = g_type_check_instance_cast(v43, v26);\ngtk_box_pack_start(v27, v38, 0LL, 0LL, 0LL);\nv28 = gtk_box_get_type();\nv29 = g_type_check_instance_cast(v45, v28);\ngtk_box_pack_start(v29, v43, 0LL, 0LL, 0LL);\nv30 = gtk_container_get_type();\nv31 = g_type_check_instance_cast(a1[2], v30);\ngtk_container_add(v31, v45);\nv32 = gtk_window_get_type();\nv33 = g_type_check_instance_cast(a1[2], v32);\ngtk_window_resize(v33, 650LL, 500LL);\nv34 = gtk_window_get_type();\nv35 = g_type_check_instance_cast(a1[2], v34);\ngtk_window_move(v35, 450LL, 150LL);\ng_signal_connect_data(v42, \"clicked\", FormCategories_ButtonAddClicked, a1, 0LL, 0LL);\ng_signal_connect_data(v41, \"clicked\", FormCategories_ButtonRenameClicked, a1, 0LL, 0LL);\ng_signal_connect_data(v40, \"clicked\", FormCategories_ButtonDeleteClicked, a1, 0LL, 0LL);\ng_signal_connect_data(v39, \"clicked\", FormCategories_ButtonCutClicked, a1, 0LL, 0LL);\ng_signal_connect_data(v38, \"clicked\", FormCategories_ButtonPasteClicked, a1, 0LL, 0LL);\ng_signal_connect_data(a1[2], \"destroy\", FormCategories_Destroy, a1, 0LL, 0LL);\nTreeViewCategories_SetCursorChanged(a1 + 3, FormCategories_TreeViewCategoriesCursorChanged, a1);\nTreeViewCategories_SetRowActivated(a1 + 3, FormCategories_TreeViewCategoriesRowActivated, a1);\ngtk_widget_show_all(a1[2]);\nresult = func10(a1);\n}\nreturn result;\n}"
],
[
"FormCategories_Destroy",
"__int64 __fastcall func6(__int64 a1, __int64 a2)\n{\n__int64 result; // rax\n\nresult = a2;\n*(_QWORD *)(a2 + 16) = 0LL;\nreturn result;\n}"
],
[
"FormCategories_Init",
"__int64 __fastcall func7(__int64 a1)\n{\n*(_QWORD *)(a1 + 16) = 0LL;\nreturn TreeViewCategories_Init(a1 + 24);\n}"
],
[
"FormCategories_TreeViewCategoriesCursorChanged",
"__int64 __fastcall func9(__int64 a1, __int64 a2, __int64 a3)\n{\n__int64 result; // rax\n__int64 v4; // rax\n__int64 v5; // rax\n\nresult = a3;\nif ( a2 )\n{\nv4 = gtk_entry_get_type(a1, a2);\nv5 = g_type_check_instance_cast(*(_QWORD *)(a3 + 8), v4);\nresult = gtk_entry_set_text(v5, a2);\n}\nreturn result;\n}"
],
[
"FormCategories_UpdateData",
"__int64 __fastcall func10(__int64 a1)\n{\nreturn TreeViewCategories_UpdateData(a1 + 24);\n}"
]
] | [
{
"name": "FormCategories_TreeViewCategoriesRowActivated",
"canonical_name": "func8",
"repo": "avgo/avgmoney",
"decompiled_code": "void FormCategories_TreeViewCategoriesRowActivated()\n{\n;\n}\n",
"canonical_decompiled_code": "void func8()\n{\n;\n}",
"original_code": "void FormCategories_TreeViewCategoriesRowActivated(unsigned int id, char* Desc, void* arg)\n{\n}",
"canonical_original_code": "void FormCategories_TreeViewCategoriesRowActivated(unsigned int id, char *Desc, void *arg)\n{\n}",
"variable_types": [
[
"id",
"unsigned int"
],
[
"Desc",
"char *"
],
[
"arg",
"void *"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "ab28d4e6f86a663b556310f7031e7cfc0078f9feae27af1b3fcbd797e5c767b8"
}
] |
d4056ee68e38cc153f1f173b475c1b62a4d412ff976c8ee1f85a4301daababca | avgo/avgmoney | [
[
"CatUpdate_AddAllocatedAndSort",
"->"
],
[
"CatUpdate_Execute",
"->",
"CUList_ForEach"
],
[
"CatUpdate_Free",
"->",
"CUList_Free"
],
[
"CatUpdate_Init",
"->"
],
[
"CatUpdate_Print",
"->",
"CUList_Print"
],
[
"CUList_ForEach",
"->",
"CatUpdate_Execute"
],
[
"CUList_Free",
"->",
"CatUpdate_Free"
],
[
"CUList_Print",
"->",
"CatUpdate_Print"
],
[
"CUListNode_Alloc",
"->"
],
[
"CUListNode_StmtExecUpdateCategories1",
"->",
"CUListNode_Print1"
],
[
"CUListNode_StmtExecUpdateCategories2",
"->",
"CUListNode_Print2"
],
[
"CUListNode_StmtExecUpdateCategories3",
"->",
"CUListNode_Print3"
],
[
"CUListNode_Print1",
"->",
"CUListNode_StmtExecUpdateCategories1"
],
[
"CUListNode_Print2",
"->",
"CUListNode_StmtExecUpdateCategories2"
],
[
"CUListNode_Print3",
"->",
"CUListNode_StmtExecUpdateCategories3"
]
] | [
[
"CatUpdate_AddAllocatedAndSort",
"void __fastcall func0(__int64 a1, _DWORD *a2)\n{\nif ( *a2 == a2[2] && a2[1] == a2[3] )\n{\nfree(a2);\n}\nelse if ( *a2 >= a2[2] )\n{\na2[4] = 0;\nCUList_AddAllocatedAndSort(a1, a2, 1LL);\n}\nelse\n{\na2[4] = (*(_DWORD *)(a1 + 32))++;\nCUList_AddAllocatedAndSort(a1 + 16, a2, 1LL);\n}\n}"
],
[
"CatUpdate_Execute",
"__int64 __fastcall func1(__int64 a1, __int64 a2)\n{\nsize_t v2; // rax\n__int64 v3; // rdx\nsize_t v4; // rax\n__int64 result; // rax\n__int64 v6[48]; // [rsp+10h] [rbp-180h] BYREF\n\nmemset(v6, 0, sizeof(v6));\nv6[0] = *(_QWORD *)(a1 + 40);\nv6[2] = (__int64)\"UPDATE categories SET id = ?, parent_id = ? WHERE id = ?;\\n\";\nv6[3] = (__int64)\"UPDATE operations SET category = ? WHERE category = ?;\\n\";\nv6[1] = mysql_stmt_init(*(_QWORD *)(a1 + 40), a2, v6);\nif ( !v6[1] )\n{\nLABEL_2:\nfprintf(stderr, \"%s(): mysql_stmt_init() error.\\n\", \"CatUpdate_Execute\");\ngoto LABEL_16;\n}\nv2 = strlen((const char *)v6[2]);\nif ( (unsigned int)mysql_stmt_prepare(v6[1], v6[2], v2) )\ngoto LABEL_4;\nmemset(&v6[4], 0, 0x150uLL);\nLODWORD(v6[16]) = 3;\nv6[6] = (__int64)&v6[46];\nBYTE5(v6[16]) = 1;\nLODWORD(v6[30]) = 3;\nv6[20] = (__int64)&v6[46] + 4;\nBYTE5(v6[30]) = 1;\nLODWORD(v6[44]) = 3;\nv6[34] = (__int64)&v6[47];\nBYTE5(v6[44]) = 1;\nif ( (unsigned __int8)mysql_stmt_bind_param(v6[1], &v6[4]) )\ngoto LABEL_6;\nputs(\"1 -------- LESS THAN --------\");\nif ( !(unsigned int)func5(a1 + 16, CUListNode_StmtExecUpdateCategories1, v6) )\ngoto LABEL_16;\nputs(\"2 -------- GREATER THAN --------\");\nif ( !(unsigned int)func5(a1, CUListNode_StmtExecUpdateCategories2, v6) )\ngoto LABEL_16;\nputs(\"3 -------- LESS THAN --------\");\nif ( !(unsigned int)func5(a1 + 16, CUListNode_StmtExecUpdateCategories3, v6) )\ngoto LABEL_16;\nmysql_stmt_close(v6[1]);\nv6[1] = 0LL;\nv6[1] = mysql_stmt_init(*(_QWORD *)(a1 + 40), CUListNode_StmtExecUpdateCategories3, v3);\nif ( !v6[1] )\ngoto LABEL_2;\nv4 = strlen((const char *)v6[3]);\nif ( (unsigned int)mysql_stmt_prepare(v6[1], v6[3], v4) )\n{\nLABEL_4:\nfprintf(stderr, \"%s(): mysql_stmt_prepare() error.\\n\", \"CatUpdate_Execute\");\ngoto LABEL_16;\n}\nmemset(&v6[4], 0, 0x150uLL);\nLODWORD(v6[16]) = 3;\nv6[6] = (__int64)&v6[46];\nBYTE5(v6[16]) = 1;\nLODWORD(v6[30]) = 3;\nv6[20] = (__int64)&v6[47];\nBYTE5(v6[30]) = 1;\nif ( (unsigned __int8)mysql_stmt_bind_param(v6[1], &v6[4]) )\n{\nLABEL_6:\nfprintf(stderr, \"%s(): mysql_stmt_bind_param() error.\\n\", \"CatUpdate_Execute\");\n}\nelse\n{\nputs(\"1 -------- LESS THAN --------\");\nif ( (unsigned int)func5(a1 + 16, CUListNode_StmtExecUpdateCategories1, v6) )\n{\nputs(\"2 -------- GREATER THAN --------\");\nif ( (unsigned int)func5(a1, CUListNode_StmtExecUpdateCategories2, v6) )\n{\nputs(\"3 -------- LESS THAN --------\");\nfunc5(a1 + 16, CUListNode_StmtExecUpdateCategories3, v6);\n}\n}\n}\nLABEL_16:\nresult = v6[1];\nif ( v6[1] )\nresult = mysql_stmt_close(v6[1]);\nreturn result;\n}"
],
[
"CatUpdate_Free",
"__int64 __fastcall func2(__int64 a1)\n{\nfunc6(a1 + 16);\nreturn func6(a1);\n}"
],
[
"CatUpdate_Init",
"__int64 __fastcall func3(__int64 a1)\n{\nCUList_Init(a1 + 16);\nreturn CUList_Init(a1);\n}"
],
[
"CatUpdate_Print",
"__int64 __fastcall func4(__int64 a1)\n{\nputs(\"LESS THAN:\");\nfunc7(a1 + 16);\nputs(\"GREATER THAN:\");\nreturn func7(a1);\n}"
],
[
"CUListNode_StmtExecUpdateCategories1",
"__int64 __fastcall func9(_DWORD *a1, __int64 a2)\n{\n*(_DWORD *)(a2 + 368) = a1[4];\n*(_DWORD *)(a2 + 372) = a1[1];\n*(_DWORD *)(a2 + 376) = a1[2];\nfunc12(a1, 0LL);\nif ( !(unsigned int)mysql_stmt_execute(*(_QWORD *)(a2 + 8)) )\nreturn 1LL;\nfprintf(stderr, \"%s(): mysql_stmt_execute() error.\\n\", \"CUListNode_StmtExecUpdateCategories1\");\nreturn 0LL;\n}"
],
[
"CUListNode_StmtExecUpdateCategories2",
"__int64 __fastcall func10(_DWORD *a1, __int64 a2)\n{\n*(_DWORD *)(a2 + 368) = *a1;\n*(_DWORD *)(a2 + 372) = a1[1];\n*(_DWORD *)(a2 + 376) = a1[2];\nfunc13(a1, 0LL);\nif ( !(unsigned int)mysql_stmt_execute(*(_QWORD *)(a2 + 8)) )\nreturn 1LL;\nfprintf(stderr, \"%s(): mysql_stmt_execute() error.\\n\", \"CUListNode_StmtExecUpdateCategories2\");\nreturn 0LL;\n}"
],
[
"CUListNode_StmtExecUpdateCategories3",
"__int64 __fastcall func11(_DWORD *a1, __int64 a2)\n{\n*(_DWORD *)(a2 + 368) = *a1;\n*(_DWORD *)(a2 + 372) = a1[1];\n*(_DWORD *)(a2 + 376) = a1[4];\nfunc14(a1, 0LL);\nif ( !(unsigned int)mysql_stmt_execute(*(_QWORD *)(a2 + 8)) )\nreturn 1LL;\nfprintf(stderr, \"%s(): mysql_stmt_execute() error.\\n\", \"CUListNode_StmtExecUpdateCategories3\");\nreturn 0LL;\n}"
]
] | [
{
"name": "CUList_ForEach",
"canonical_name": "func5",
"repo": "avgo/avgmoney",
"decompiled_code": "__int64 __fastcall CUList_ForEach(__int64 *a1, unsigned int (__fastcall *a2)(__int64, __int64), __int64 a3)\n{\n__int64 i; // [rsp+28h] [rbp-8h]\n\nfor ( i = *a1; i; i = *(_QWORD *)(i + 24) )\n{\nif ( !a2(i, a3) )\nreturn 0LL;\n}\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 *a1, unsigned int (__fastcall *a2)(__int64, __int64), __int64 a3)\n{\n__int64 i; // [rsp+28h] [rbp-8h]\n\nfor ( i = *a1; i; i = *(_QWORD *)(i + 24) )\n{\nif ( !a2(i, a3) )\nreturn 0LL;\n}\nreturn 1LL;\n}",
"original_code": "int CUList_ForEach(CUList* list, int (*f)(CUListNode*, void*), void* arg)\n{\n CUListNode* CurNode;\n for (CurNode = list->first; CurNode != ((void *)0); CurNode = CurNode->next)\n if (!f(CurNode, arg))\n return 0;\n return 1;\n}",
"canonical_original_code": "int CUList_ForEach(struct CUList_ *list, int (*f)(struct CUListNode_ *, void *), void *arg)\n{\n struct CUListNode_ *CurNode;\n for (CurNode = list->first; CurNode != ((void *)0); CurNode = CurNode->next)\n if (!f(CurNode, arg))\n return 0;\n return 1;\n}",
"variable_types": [
[
"list",
"struct CUList_ { struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; } *first; struct CUListNode_ *last; } *"
],
[
"f",
"int (*)(struct CUListNode_ *, void *)"
],
[
"arg",
"void *"
],
[
"CurNode",
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct CUList_ { struct CUListNode_ *first; struct CUListNode_ *last; }",
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; }"
],
"binary_hash": "d4056ee68e38cc153f1f173b475c1b62a4d412ff976c8ee1f85a4301daababca"
},
{
"name": "CUList_Free",
"canonical_name": "func6",
"repo": "avgo/avgmoney",
"decompiled_code": "__int64 __fastcall CUList_Free(_QWORD **a1)\n{\n_QWORD *v2; // [rsp+10h] [rbp-10h]\n_QWORD *ptr; // [rsp+18h] [rbp-8h]\n\nfor ( ptr = *a1; ptr; ptr = v2 )\n{\nv2 = (_QWORD *)ptr[3];\nfree(ptr);\n}\nreturn CUList_Init(a1);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func6(_QWORD **a1)\n{\n_QWORD *v2; // [rsp+10h] [rbp-10h]\n_QWORD *ptr; // [rsp+18h] [rbp-8h]\n\nfor ( ptr = *a1; ptr; ptr = v2 )\n{\nv2 = (_QWORD *)ptr[3];\nfree(ptr);\n}\nreturn CUList_Init(a1);\n}",
"original_code": "void CUList_Free(CUList* list)\n{\n CUListNode* node;\n CUListNode* next;\n for (node = list->first; node != ((void *)0); )\n {\n next = node->next;\n free(node);\n node = next;\n }\n CUList_Init(list);\n}",
"canonical_original_code": "void CUList_Free(struct CUList_ *list)\n{\n struct CUListNode_ *node;\n struct CUListNode_ *next;\n for (node = list->first; node != ((void *)0); )\n {\n next = node->next;\n free(node);\n node = next;\n }\n CUList_Init(list);\n}",
"variable_types": [
[
"list",
"struct CUList_ { struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; } *first; struct CUListNode_ *last; } *"
],
[
"node",
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; } *"
],
[
"next",
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct CUList_ { struct CUListNode_ *first; struct CUListNode_ *last; }",
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; }"
],
"binary_hash": "d4056ee68e38cc153f1f173b475c1b62a4d412ff976c8ee1f85a4301daababca"
},
{
"name": "CUList_Print",
"canonical_name": "func7",
"repo": "avgo/avgmoney",
"decompiled_code": "unsigned int *__fastcall CUList_Print(unsigned int **a1)\n{\nunsigned int *result; // rax\nunsigned int *i; // [rsp+18h] [rbp-8h]\n\nresult = *a1;\nfor ( i = *a1; i; i = result )\n{\nprintf(\"id = %d, parent_id = %d, old_id = %d, old_parent_id = %d, middle = %d\\n\", *i, i[1], i[2], i[3], i[4]);\nresult = (unsigned int *)*((_QWORD *)i + 3);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "unsigned int *__fastcall func7(unsigned int **a1)\n{\nunsigned int *result; // rax\nunsigned int *i; // [rsp+18h] [rbp-8h]\n\nresult = *a1;\nfor ( i = *a1; i; i = result )\n{\nprintf(\"id = %d, parent_id = %d, old_id = %d, old_parent_id = %d, middle = %d\\n\", *i, i[1], i[2], i[3], i[4]);\nresult = (unsigned int *)*((_QWORD *)i + 3);\n}\nreturn result;\n}",
"original_code": "void CUList_Print(CUList* list)\n{\n CUListNode* CurNode;\n for (CurNode = list->first; CurNode != ((void *)0); CurNode = CurNode->next)\n {\n printf(\"id = %d, parent_id = %d, old_id = %d, old_parent_id = %d, middle = %d\\n\",\n CurNode->id, CurNode->parent_id, CurNode->old_id, CurNode->old_parent_id, CurNode->middle);\n }\n}",
"canonical_original_code": "void CUList_Print(struct CUList_ *list)\n{\n struct CUListNode_ *CurNode;\n for (CurNode = list->first; CurNode != ((void *)0); CurNode = CurNode->next)\n {\n printf(\"id = %d, parent_id = %d, old_id = %d, old_parent_id = %d, middle = %d\\n\",\n CurNode->id, CurNode->parent_id, CurNode->old_id, CurNode->old_parent_id, CurNode->middle);\n }\n}",
"variable_types": [
[
"list",
"struct CUList_ { struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; } *first; struct CUListNode_ *last; } *"
],
[
"CurNode",
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct CUList_ { struct CUListNode_ *first; struct CUListNode_ *last; }",
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; }"
],
"binary_hash": "d4056ee68e38cc153f1f173b475c1b62a4d412ff976c8ee1f85a4301daababca"
},
{
"name": "CUListNode_Alloc",
"canonical_name": "func8",
"repo": "avgo/avgmoney",
"decompiled_code": "void *CUListNode_Alloc()\n{\nvoid *v1; // [rsp+8h] [rbp-8h]\n\nv1 = malloc(0x20uLL);\nif ( !v1 )\nfwrite(\"NewNode = NULL\\n\", 1uLL, 0xFuLL, stderr);\nreturn v1;\n}\n",
"canonical_decompiled_code": "void *func8()\n{\nvoid *v1; // [rsp+8h] [rbp-8h]\n\nv1 = malloc(0x20uLL);\nif ( !v1 )\nfwrite(\"NewNode = NULL\\n\", 1uLL, 0xFuLL, stderr);\nreturn v1;\n}",
"original_code": "CUListNode* CUListNode_Alloc()\n{\n CUListNode* NewNode;\n NewNode = (CUListNode*) malloc(sizeof(CUListNode));\n if (NewNode == ((void *)0))\n {\n fprintf(stderr, \"NewNode = NULL\\n\");\n }\n return NewNode;\n}",
"canonical_original_code": "struct CUListNode_ *CUListNode_Alloc()\n{\n struct CUListNode_ *NewNode;\n NewNode = (struct CUListNode_ *) malloc(sizeof(CUListNode));\n if (NewNode == ((void *)0))\n {\n fprintf(stderr, \"NewNode = NULL\\n\");\n }\n return NewNode;\n}",
"variable_types": [
[
"NewNode",
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; } *"
]
],
"return_type": "struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; } *",
"user_defined_types": [
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; }"
],
"binary_hash": "d4056ee68e38cc153f1f173b475c1b62a4d412ff976c8ee1f85a4301daababca"
},
{
"name": "CUListNode_Print1",
"canonical_name": "func12",
"repo": "avgo/avgmoney",
"decompiled_code": "__int64 __fastcall CUListNode_Print1(unsigned int *a1)\n{\nprintf(\n\"UPDATE categories SET id = %d, parent_id = %d WHERE id = %d; (id = %d, parent_id = %d, old_id = %d, old_parent_id\"\n\" = %d, middle = %d).\\n\",\na1[4],\na1[1],\na1[2],\n*a1,\na1[1],\na1[2],\na1[3],\na1[4]);\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func12(unsigned int *a1)\n{\nprintf(\n\"UPDATE categories SET id = %d, parent_id = %d WHERE id = %d; (id = %d, parent_id = %d, old_id = %d, old_parent_id\"\n\" = %d, middle = %d).\\n\",\na1[4],\na1[1],\na1[2],\n*a1,\na1[1],\na1[2],\na1[3],\na1[4]);\nreturn 1LL;\n}",
"original_code": "int CUListNode_Print1(CUListNode* ListNode, void* arg)\n{\n printf(\"UPDATE categories SET id = %d, parent_id = %d WHERE id = %d; \"\n \"(id = %d, parent_id = %d, old_id = %d, old_parent_id = %d, middle = %d).\\n\",\n ListNode->middle, ListNode->parent_id, ListNode->old_id,\n ListNode->id, ListNode->parent_id, ListNode->old_id, ListNode->old_parent_id, ListNode->middle);\n return 1;\n}",
"canonical_original_code": "int CUListNode_Print1(struct CUListNode_ *ListNode, void *arg)\n{\n printf(\"UPDATE categories SET id = %d, parent_id = %d WHERE id = %d; \"\n \"(id = %d, parent_id = %d, old_id = %d, old_parent_id = %d, middle = %d).\\n\",\n ListNode->middle, ListNode->parent_id, ListNode->old_id,\n ListNode->id, ListNode->parent_id, ListNode->old_id, ListNode->old_parent_id, ListNode->middle);\n return 1;\n}",
"variable_types": [
[
"ListNode",
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; } *"
],
[
"arg",
"void *"
]
],
"return_type": "int",
"user_defined_types": [
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; }"
],
"binary_hash": "d4056ee68e38cc153f1f173b475c1b62a4d412ff976c8ee1f85a4301daababca"
},
{
"name": "CUListNode_Print2",
"canonical_name": "func13",
"repo": "avgo/avgmoney",
"decompiled_code": "__int64 __fastcall CUListNode_Print2(unsigned int *a1)\n{\nprintf(\n\"UPDATE categories SET id = %d, parent_id = %d WHERE id = %d; (id = %d, parent_id = %d, old_id = %d, old_parent_id\"\n\" = %d, middle = %d).\\n\",\n*a1,\na1[1],\na1[2],\n*a1,\na1[1],\na1[2],\na1[3],\na1[4]);\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func13(unsigned int *a1)\n{\nprintf(\n\"UPDATE categories SET id = %d, parent_id = %d WHERE id = %d; (id = %d, parent_id = %d, old_id = %d, old_parent_id\"\n\" = %d, middle = %d).\\n\",\n*a1,\na1[1],\na1[2],\n*a1,\na1[1],\na1[2],\na1[3],\na1[4]);\nreturn 1LL;\n}",
"original_code": "int CUListNode_Print2(CUListNode* ListNode, void* arg)\n{\n printf(\"UPDATE categories SET id = %d, parent_id = %d WHERE id = %d; \"\n \"(id = %d, parent_id = %d, old_id = %d, old_parent_id = %d, middle = %d).\\n\",\n ListNode->id, ListNode->parent_id, ListNode->old_id,\n ListNode->id, ListNode->parent_id, ListNode->old_id, ListNode->old_parent_id, ListNode->middle);\n return 1;\n}",
"canonical_original_code": "int CUListNode_Print2(struct CUListNode_ *ListNode, void *arg)\n{\n printf(\"UPDATE categories SET id = %d, parent_id = %d WHERE id = %d; \"\n \"(id = %d, parent_id = %d, old_id = %d, old_parent_id = %d, middle = %d).\\n\",\n ListNode->id, ListNode->parent_id, ListNode->old_id,\n ListNode->id, ListNode->parent_id, ListNode->old_id, ListNode->old_parent_id, ListNode->middle);\n return 1;\n}",
"variable_types": [
[
"ListNode",
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; } *"
],
[
"arg",
"void *"
]
],
"return_type": "int",
"user_defined_types": [
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; }"
],
"binary_hash": "d4056ee68e38cc153f1f173b475c1b62a4d412ff976c8ee1f85a4301daababca"
},
{
"name": "CUListNode_Print3",
"canonical_name": "func14",
"repo": "avgo/avgmoney",
"decompiled_code": "__int64 __fastcall CUListNode_Print3(unsigned int *a1)\n{\nprintf(\n\"UPDATE categories SET id = %d, parent_id = %d WHERE id = %d; (id = %d, parent_id = %d, old_id = %d, old_parent_id\"\n\" = %d, middle = %d).\\n\",\n*a1,\na1[1],\na1[4],\n*a1,\na1[1],\na1[2],\na1[3],\na1[4]);\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func14(unsigned int *a1)\n{\nprintf(\n\"UPDATE categories SET id = %d, parent_id = %d WHERE id = %d; (id = %d, parent_id = %d, old_id = %d, old_parent_id\"\n\" = %d, middle = %d).\\n\",\n*a1,\na1[1],\na1[4],\n*a1,\na1[1],\na1[2],\na1[3],\na1[4]);\nreturn 1LL;\n}",
"original_code": "int CUListNode_Print3(CUListNode* ListNode, void* arg)\n{\n printf(\"UPDATE categories SET id = %d, parent_id = %d WHERE id = %d; \"\n \"(id = %d, parent_id = %d, old_id = %d, old_parent_id = %d, middle = %d).\\n\",\n ListNode->id, ListNode->parent_id, ListNode->middle,\n ListNode->id, ListNode->parent_id, ListNode->old_id, ListNode->old_parent_id, ListNode->middle);\n return 1;\n}",
"canonical_original_code": "int CUListNode_Print3(struct CUListNode_ *ListNode, void *arg)\n{\n printf(\"UPDATE categories SET id = %d, parent_id = %d WHERE id = %d; \"\n \"(id = %d, parent_id = %d, old_id = %d, old_parent_id = %d, middle = %d).\\n\",\n ListNode->id, ListNode->parent_id, ListNode->middle,\n ListNode->id, ListNode->parent_id, ListNode->old_id, ListNode->old_parent_id, ListNode->middle);\n return 1;\n}",
"variable_types": [
[
"ListNode",
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; } *"
],
[
"arg",
"void *"
]
],
"return_type": "int",
"user_defined_types": [
"struct CUListNode_ { unsigned int id; unsigned int parent_id; unsigned int old_id; unsigned int old_parent_id; unsigned int middle; struct CUListNode_ *next; }"
],
"binary_hash": "d4056ee68e38cc153f1f173b475c1b62a4d412ff976c8ee1f85a4301daababca"
}
] |
d86ba830bf2a537eeb78487d3f56614a77bcfb2b8a3eb4dd60562afadd6188d4 | avgo/avgmoney | [
[
"DateStrToDMY",
"->"
]
] | [] | [
{
"name": "DateStrToDMY",
"canonical_name": "func0",
"repo": "avgo/avgmoney",
"decompiled_code": "__int64 __fastcall DateStrToDMY(char *a1, _DWORD *a2, _DWORD *a3, _DWORD *a4)\n{\n__int64 result; // rax\nchar *endptr; // [rsp+20h] [rbp-10h] BYREF\nchar *nptr; // [rsp+28h] [rbp-8h]\n\nif ( !a1 )\nreturn 0xFFFFFFFFLL;\nnptr = a1;\n*_errno_location() = 0;\n*a2 = strtoul(nptr, &endptr, 10);\nif ( nptr < endptr\n&& *endptr == 45\n&& (nptr = endptr + 1, *_errno_location() = 0, *a3 = strtoul(nptr, &endptr, 10), nptr < endptr)\n&& *endptr == 45\n&& (nptr = endptr + 1, *_errno_location() = 0, *a4 = strtoul(nptr, &endptr, 10), nptr < endptr) )\n{\nresult = 1LL;\n}\nelse\n{\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(char *a1, _DWORD *a2, _DWORD *a3, _DWORD *a4)\n{\n__int64 result; // rax\nchar *endptr; // [rsp+20h] [rbp-10h] BYREF\nchar *nptr; // [rsp+28h] [rbp-8h]\n\nif ( !a1 )\nreturn 0xFFFFFFFFLL;\nnptr = a1;\n*_errno_location() = 0;\n*a2 = strtoul(nptr, &endptr, 10);\nif ( nptr < endptr\n&& *endptr == 45\n&& (nptr = endptr + 1, *_errno_location() = 0, *a3 = strtoul(nptr, &endptr, 10), nptr < endptr)\n&& *endptr == 45\n&& (nptr = endptr + 1, *_errno_location() = 0, *a4 = strtoul(nptr, &endptr, 10), nptr < endptr) )\n{\nresult = 1LL;\n}\nelse\n{\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}",
"original_code": "int DateStrToDMY(char* DateStr, unsigned int* Year, unsigned int* Month, unsigned int* Day)\n{\n char* DateStr1;\n char* DateStr2;\n if (DateStr == ((void *)0))\n {\n return -1;\n }\n DateStr1 = DateStr; (*__errno_location ()) = 0;\n *Year = strtoul(DateStr1, &DateStr2, 10);\n if (DateStr1 < DateStr2 && *DateStr2 == '-')\n {\n DateStr1 = DateStr2 + 1; (*__errno_location ()) = 0;\n *Month = strtoul(DateStr1, &DateStr2, 10);\n if (DateStr1 < DateStr2 && *DateStr2 == '-')\n {\n DateStr1 = DateStr2 + 1; (*__errno_location ()) = 0;\n *Day = strtoul(DateStr1, &DateStr2, 10);\n if (DateStr1 < DateStr2)\n {\n return 1;\n }\n }\n }\n return -1;\n}",
"canonical_original_code": "int DateStrToDMY(char *DateStr, unsigned int *Year, unsigned int *Month, unsigned int *Day)\n{\n char *DateStr1;\n char *DateStr2;\n if (DateStr == ((void *)0))\n {\n return -1;\n }\n DateStr1 = DateStr; (*__errno_location ()) = 0;\n *Year = strtoul(DateStr1, &DateStr2, 10);\n if (DateStr1 < DateStr2 && *DateStr2 == '-')\n {\n DateStr1 = DateStr2 + 1; (*__errno_location ()) = 0;\n *Month = strtoul(DateStr1, &DateStr2, 10);\n if (DateStr1 < DateStr2 && *DateStr2 == '-')\n {\n DateStr1 = DateStr2 + 1; (*__errno_location ()) = 0;\n *Day = strtoul(DateStr1, &DateStr2, 10);\n if (DateStr1 < DateStr2)\n {\n return 1;\n }\n }\n }\n return -1;\n}",
"variable_types": [
[
"DateStr",
"char *"
],
[
"Year",
"unsigned int *"
],
[
"Month",
"unsigned int *"
],
[
"Day",
"unsigned int *"
],
[
"DateStr1",
"char *"
],
[
"DateStr2",
"char *"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "d86ba830bf2a537eeb78487d3f56614a77bcfb2b8a3eb4dd60562afadd6188d4"
}
] |
028ddae45930b46e21004566b1caa831faaac0f27f9ccfbeb6105d2e6ef12556 | Mon-Ouie/b-fun | [
[
"sphere",
"->",
"random_radius"
],
[
"sphere_indices",
"->"
],
[
"random_radius",
"->",
"sphere"
]
] | [] | [
{
"name": "sphere",
"canonical_name": "func0",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "__int64 __fastcall sphere(__int64 a1, int a2, int a3, float a4, float a5, float a6)\n{\nfloat v6; // xmm0_4\nfloat v7; // xmm0_4\n__int64 v8; // rax\n__m128i v9; // xmm0\n__int64 v10; // rbx\n__int64 result; // rax\ndouble v14; // [rsp+24h] [rbp-3Ch]\nfloat v15; // [rsp+30h] [rbp-30h]\nfloat v16; // [rsp+34h] [rbp-2Ch]\nunsigned int v17; // [rsp+38h] [rbp-28h]\nint j; // [rsp+3Ch] [rbp-24h]\nint k; // [rsp+40h] [rbp-20h]\nint i; // [rsp+44h] [rbp-1Ch]\nfloat v21; // [rsp+48h] [rbp-18h]\nfloat v22; // [rsp+4Ch] [rbp-14h]\n\nv6 = 3.141592653589793 / (double)a2;\nv16 = v6;\nv7 = 6.283185307179586 / (double)a3;\nv15 = v7;\nv22 = -1.5707964;\nv21 = 0.0;\nfor ( i = 0; ; ++i )\n{\nresult = (unsigned int)i;\nif ( i > a2 )\nbreak;\nif ( i > 2 && i < a2 - 2 )\n{\nfor ( j = 0; j < a3; ++j )\n{\nv17 = LODWORD(a4);\nif ( !(rand() % 5) )\n{\nv9 = _mm_cvtsi32_si128(LODWORD(a4));\n*(double *)v9.m128i_i64 = random_radius(*(double *)v9.m128i_i64, a5, a6);\nv17 = _mm_cvtsi128_si32(v9);\n}\nv10 = 12LL * (a3 * i + j) + a1;\n*(double *)v10 = to_cartes(*(double *)_mm_cvtsi32_si128(v17).m128i_i64, v22, v21);\n*(float *)(v10 + 8) = v22;\nv21 = v21 + v15;\n}\nv22 = v22 + v16;\n}\nelse\n{\nfor ( k = 0; k < a3; ++k )\n{\nv14 = to_cartes(*(double *)_mm_cvtsi32_si128(LODWORD(a4)).m128i_i64, v22, v21);\nv8 = 12LL * (a3 * i + k) + a1;\n*(double *)v8 = v14;\n*(float *)(v8 + 8) = v22;\nv21 = v21 + v15;\n}\nv22 = v22 + v16;\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, int a2, int a3, float a4, float a5, float a6)\n{\nfloat v6; // xmm0_4\nfloat v7; // xmm0_4\n__int64 v8; // rax\n__m128i v9; // xmm0\n__int64 v10; // rbx\n__int64 result; // rax\ndouble v14; // [rsp+24h] [rbp-3Ch]\nfloat v15; // [rsp+30h] [rbp-30h]\nfloat v16; // [rsp+34h] [rbp-2Ch]\nunsigned int v17; // [rsp+38h] [rbp-28h]\nint j; // [rsp+3Ch] [rbp-24h]\nint k; // [rsp+40h] [rbp-20h]\nint i; // [rsp+44h] [rbp-1Ch]\nfloat v21; // [rsp+48h] [rbp-18h]\nfloat v22; // [rsp+4Ch] [rbp-14h]\n\nv6 = 3.141592653589793 / (double)a2;\nv16 = v6;\nv7 = 6.283185307179586 / (double)a3;\nv15 = v7;\nv22 = -1.5707964;\nv21 = 0.0;\nfor ( i = 0; ; ++i )\n{\nresult = (unsigned int)i;\nif ( i > a2 )\nbreak;\nif ( i > 2 && i < a2 - 2 )\n{\nfor ( j = 0; j < a3; ++j )\n{\nv17 = LODWORD(a4);\nif ( !(rand() % 5) )\n{\nv9 = _mm_cvtsi32_si128(LODWORD(a4));\n*(double *)v9.m128i_i64 = func2(*(double *)v9.m128i_i64, a5, a6);\nv17 = _mm_cvtsi128_si32(v9);\n}\nv10 = 12LL * (a3 * i + j) + a1;\n*(double *)v10 = to_cartes(*(double *)_mm_cvtsi32_si128(v17).m128i_i64, v22, v21);\n*(float *)(v10 + 8) = v22;\nv21 = v21 + v15;\n}\nv22 = v22 + v16;\n}\nelse\n{\nfor ( k = 0; k < a3; ++k )\n{\nv14 = to_cartes(*(double *)_mm_cvtsi32_si128(LODWORD(a4)).m128i_i64, v22, v21);\nv8 = 12LL * (a3 * i + k) + a1;\n*(double *)v8 = v14;\n*(float *)(v8 + 8) = v22;\nv21 = v21 + v15;\n}\nv22 = v22 + v16;\n}\n}\nreturn result;\n}",
"original_code": "void sphere(vertex *out,\n float r, int n_elevation, int n_azimuth,\n float min_factor, float max_factor) {\n float delevation = 3.141592653589793 / n_elevation;\n float dazimuth = 2 * 3.141592653589793 / n_azimuth;\n float elevation = -3.141592653589793 / 2;\n float azimuth = 0;\n for (int i = 0; i <= n_elevation; i++) {\n if (i < 3 || i > n_elevation-3) {\n for (int j = 0; j < n_azimuth; j++) {\n vertex data = to_cartes(r, elevation, azimuth);\n out[i *n_azimuth + j] = data;\n azimuth += dazimuth;\n }\n elevation += delevation;\n }\n else {\n for (int j = 0; j < n_azimuth; j++) {\n float local_r = r;\n if (rand()%5 == 0)\n local_r = random_radius(r, min_factor, max_factor);\n out[i * n_azimuth + j] = to_cartes(local_r, elevation, azimuth);\n azimuth += dazimuth;\n }\n elevation += delevation;\n }\n }\n}",
"canonical_original_code": "void sphere(struct vertex *out, float r, int n_elevation, int n_azimuth, float min_factor, float max_factor) {\n float delevation = 3.141592653589793 / n_elevation;\n float dazimuth = 2 * 3.141592653589793 / n_azimuth;\n float elevation = -3.141592653589793 / 2;\n float azimuth = 0;\n for (int i = 0; i <= n_elevation; i++) {\n if (i < 3 || i > n_elevation-3) {\n for (int j = 0; j < n_azimuth; j++) {\n struct vertex data = to_cartes(r, elevation, azimuth);\n out[i *n_azimuth + j] = data;\n azimuth += dazimuth;\n }\n elevation += delevation;\n }\n else {\n for (int j = 0; j < n_azimuth; j++) {\n float local_r = r;\n if (rand()%5 == 0)\n local_r = random_radius(r, min_factor, max_factor);\n out[i * n_azimuth + j] = to_cartes(local_r, elevation, azimuth);\n azimuth += dazimuth;\n }\n elevation += delevation;\n }\n }\n}",
"variable_types": [
[
"out",
"struct vertex { float x; } *"
],
[
"r",
"float"
],
[
"n_elevation",
"int"
],
[
"n_azimuth",
"int"
],
[
"min_factor",
"float"
],
[
"max_factor",
"float"
],
[
"delevation",
"float"
],
[
"dazimuth",
"float"
],
[
"elevation",
"float"
],
[
"azimuth",
"float"
],
[
"i",
"int"
],
[
"j",
"int"
],
[
"data",
"struct vertex { float x; }"
],
[
"local_r",
"float"
]
],
"return_type": "void",
"user_defined_types": [
"struct vertex { float x; }"
],
"binary_hash": "028ddae45930b46e21004566b1caa831faaac0f27f9ccfbeb6105d2e6ef12556"
},
{
"name": "sphere_indices",
"canonical_name": "func1",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "__int64 __fastcall sphere_indices(__int64 a1, int a2, int a3)\n{\nint v3; // eax\nint v4; // eax\nint v5; // eax\nint v6; // eax\nint v7; // eax\nint v8; // eax\nint v9; // eax\nint v10; // eax\n__int64 result; // rax\nint v12; // [rsp+1Ch] [rbp-24h]\nint v13; // [rsp+20h] [rbp-20h]\nint v14; // [rsp+24h] [rbp-1Ch]\n__int16 v15; // [rsp+28h] [rbp-18h]\n__int16 v16; // [rsp+2Ch] [rbp-14h]\n__int16 v17; // [rsp+30h] [rbp-10h]\nint j; // [rsp+34h] [rbp-Ch]\nunsigned int i; // [rsp+38h] [rbp-8h]\nint v20; // [rsp+3Ch] [rbp-4h]\nint v21; // [rsp+3Ch] [rbp-4h]\nint v22; // [rsp+3Ch] [rbp-4h]\n\nv20 = 0;\nfor ( i = 0; ; ++i )\n{\nresult = i;\nif ( (int)i >= a2 )\nbreak;\nfor ( j = 0; j < a3; ++j )\n{\nv17 = i - 1;\nv16 = i + 1;\nv15 = i + 2;\nif ( j )\nv3 = j - 1;\nelse\nv3 = a3 - 1;\nv14 = v3;\nif ( a3 == j + 1 )\nv4 = 0;\nelse\nv4 = j + 1;\nv13 = v4;\nif ( a3 == v4 + 1 )\nv5 = 0;\nelse\nv5 = v4 + 1;\nv12 = v5;\nif ( i )\n{\n*(_WORD *)(2LL * v20 + a1) = a3 * v17 + v14;\n*(_WORD *)(2LL * (v20 + 1) + a1) = a3 * v17 + j;\n*(_WORD *)(2LL * (v20 + 2) + a1) = a3 * v17 + v13;\nv7 = v20 + 3;\nv21 = v20 + 4;\n*(_WORD *)(2LL * v7 + a1) = a3 * v17 + v12;\n}\nelse\n{\n*(_WORD *)(2LL * v20 + a1) = a3 * v16 + (a3 / 2 + v14) % a3;\n*(_WORD *)(2LL * (v20 + 1) + a1) = a3 * v16 + (a3 / 2 + j) % a3;\n*(_WORD *)(2LL * (v20 + 2) + a1) = a3 * v16 + (a3 / 2 + v13) % a3;\nv6 = v20 + 3;\nv21 = v20 + 4;\n*(_WORD *)(2LL * v6 + a1) = a3 * v16 + (a3 / 2 + v12) % a3;\n}\n*(_WORD *)(2LL * v21 + a1) = a3 * i + v14;\n*(_WORD *)(2LL * (v21 + 1) + a1) = a3 * i + j;\n*(_WORD *)(2LL * (v21 + 2) + a1) = a3 * i + v13;\n*(_WORD *)(2LL * (v21 + 3) + a1) = a3 * i + v12;\n*(_WORD *)(2LL * (v21 + 4) + a1) = a3 * v16 + v14;\n*(_WORD *)(2LL * (v21 + 5) + a1) = a3 * v16 + j;\n*(_WORD *)(2LL * (v21 + 6) + a1) = a3 * v16 + v13;\nv8 = v21 + 7;\nv22 = v21 + 8;\n*(_WORD *)(2LL * v8 + a1) = a3 * v16 + v12;\nif ( i == a2 - 1 )\n{\n*(_WORD *)(2LL * v22 + a1) = a3 * i + (a3 / 2 + v14) % a3;\n*(_WORD *)(2LL * (v22 + 1) + a1) = a3 * i + (a3 / 2 + j) % a3;\n*(_WORD *)(2LL * (v22 + 2) + a1) = a3 * i + (a3 / 2 + v13) % a3;\nv9 = v22 + 3;\nv20 = v22 + 4;\n*(_WORD *)(2LL * v9 + a1) = a3 * i + (a3 / 2 + v12) % a3;\n}\nelse\n{\n*(_WORD *)(2LL * v22 + a1) = a3 * v15 + v14;\n*(_WORD *)(2LL * (v22 + 1) + a1) = a3 * v15 + j;\n*(_WORD *)(2LL * (v22 + 2) + a1) = a3 * v15 + v13;\nv10 = v22 + 3;\nv20 = v22 + 4;\n*(_WORD *)(2LL * v10 + a1) = a3 * v15 + v12;\n}\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1, int a2, int a3)\n{\nint v3; // eax\nint v4; // eax\nint v5; // eax\nint v6; // eax\nint v7; // eax\nint v8; // eax\nint v9; // eax\nint v10; // eax\n__int64 result; // rax\nint v12; // [rsp+1Ch] [rbp-24h]\nint v13; // [rsp+20h] [rbp-20h]\nint v14; // [rsp+24h] [rbp-1Ch]\n__int16 v15; // [rsp+28h] [rbp-18h]\n__int16 v16; // [rsp+2Ch] [rbp-14h]\n__int16 v17; // [rsp+30h] [rbp-10h]\nint j; // [rsp+34h] [rbp-Ch]\nunsigned int i; // [rsp+38h] [rbp-8h]\nint v20; // [rsp+3Ch] [rbp-4h]\nint v21; // [rsp+3Ch] [rbp-4h]\nint v22; // [rsp+3Ch] [rbp-4h]\n\nv20 = 0;\nfor ( i = 0; ; ++i )\n{\nresult = i;\nif ( (int)i >= a2 )\nbreak;\nfor ( j = 0; j < a3; ++j )\n{\nv17 = i - 1;\nv16 = i + 1;\nv15 = i + 2;\nif ( j )\nv3 = j - 1;\nelse\nv3 = a3 - 1;\nv14 = v3;\nif ( a3 == j + 1 )\nv4 = 0;\nelse\nv4 = j + 1;\nv13 = v4;\nif ( a3 == v4 + 1 )\nv5 = 0;\nelse\nv5 = v4 + 1;\nv12 = v5;\nif ( i )\n{\n*(_WORD *)(2LL * v20 + a1) = a3 * v17 + v14;\n*(_WORD *)(2LL * (v20 + 1) + a1) = a3 * v17 + j;\n*(_WORD *)(2LL * (v20 + 2) + a1) = a3 * v17 + v13;\nv7 = v20 + 3;\nv21 = v20 + 4;\n*(_WORD *)(2LL * v7 + a1) = a3 * v17 + v12;\n}\nelse\n{\n*(_WORD *)(2LL * v20 + a1) = a3 * v16 + (a3 / 2 + v14) % a3;\n*(_WORD *)(2LL * (v20 + 1) + a1) = a3 * v16 + (a3 / 2 + j) % a3;\n*(_WORD *)(2LL * (v20 + 2) + a1) = a3 * v16 + (a3 / 2 + v13) % a3;\nv6 = v20 + 3;\nv21 = v20 + 4;\n*(_WORD *)(2LL * v6 + a1) = a3 * v16 + (a3 / 2 + v12) % a3;\n}\n*(_WORD *)(2LL * v21 + a1) = a3 * i + v14;\n*(_WORD *)(2LL * (v21 + 1) + a1) = a3 * i + j;\n*(_WORD *)(2LL * (v21 + 2) + a1) = a3 * i + v13;\n*(_WORD *)(2LL * (v21 + 3) + a1) = a3 * i + v12;\n*(_WORD *)(2LL * (v21 + 4) + a1) = a3 * v16 + v14;\n*(_WORD *)(2LL * (v21 + 5) + a1) = a3 * v16 + j;\n*(_WORD *)(2LL * (v21 + 6) + a1) = a3 * v16 + v13;\nv8 = v21 + 7;\nv22 = v21 + 8;\n*(_WORD *)(2LL * v8 + a1) = a3 * v16 + v12;\nif ( i == a2 - 1 )\n{\n*(_WORD *)(2LL * v22 + a1) = a3 * i + (a3 / 2 + v14) % a3;\n*(_WORD *)(2LL * (v22 + 1) + a1) = a3 * i + (a3 / 2 + j) % a3;\n*(_WORD *)(2LL * (v22 + 2) + a1) = a3 * i + (a3 / 2 + v13) % a3;\nv9 = v22 + 3;\nv20 = v22 + 4;\n*(_WORD *)(2LL * v9 + a1) = a3 * i + (a3 / 2 + v12) % a3;\n}\nelse\n{\n*(_WORD *)(2LL * v22 + a1) = a3 * v15 + v14;\n*(_WORD *)(2LL * (v22 + 1) + a1) = a3 * v15 + j;\n*(_WORD *)(2LL * (v22 + 2) + a1) = a3 * v15 + v13;\nv10 = v22 + 3;\nv20 = v22 + 4;\n*(_WORD *)(2LL * v10 + a1) = a3 * v15 + v12;\n}\n}\n}\nreturn result;\n}",
"original_code": "void sphere_indices(GLushort *out,\n int n_elevation, int n_azimuth) {\n int n = 0;\n for (int i = 0; i < n_elevation; i++) {\n for (int j = 0; j < n_azimuth; j++) {\n int prev_i = i-1;\n int next_i = i+1;\n int next_i2 = next_i + 1;\n int prev_j = j == 0 ? n_azimuth - 1 : j - 1;\n int next_j = j+1 == n_azimuth ? 0 : j + 1;\n int next_j2 = next_j+1 == n_azimuth ? 0 : next_j + 1;\n if (i == 0) {\n out[n++] = next_i*n_azimuth+((prev_j+n_azimuth/2)%n_azimuth);\n out[n++] = next_i*n_azimuth+((j+n_azimuth/2)%n_azimuth);\n out[n++] = next_i*n_azimuth+((next_j+n_azimuth/2)%n_azimuth);\n out[n++] = next_i*n_azimuth+((next_j2+n_azimuth/2)%n_azimuth);\n }\n else {\n out[n++] = prev_i*n_azimuth+prev_j;\n out[n++] = prev_i*n_azimuth+j;\n out[n++] = prev_i*n_azimuth+next_j;\n out[n++] = prev_i*n_azimuth+next_j2;\n }\n out[n++] = i*n_azimuth+prev_j;\n out[n++] = i*n_azimuth+j;\n out[n++] = i*n_azimuth+next_j;\n out[n++] = i*n_azimuth+next_j2;\n out[n++] = next_i*n_azimuth+prev_j;\n out[n++] = next_i*n_azimuth+j;\n out[n++] = next_i*n_azimuth+next_j;\n out[n++] = next_i*n_azimuth+next_j2;\n if (i == n_elevation - 1) {\n out[n++] = i*n_azimuth+((prev_j+n_azimuth/2)%n_azimuth);\n out[n++] = i*n_azimuth+((j+n_azimuth/2)%n_azimuth);\n out[n++] = i*n_azimuth+((next_j+n_azimuth/2)%n_azimuth);\n out[n++] = i*n_azimuth+((next_j2+n_azimuth/2)%n_azimuth);\n }\n else {\n out[n++] = next_i2*n_azimuth+prev_j;\n out[n++] = next_i2*n_azimuth+j;\n out[n++] = next_i2*n_azimuth+next_j;\n out[n++] = next_i2*n_azimuth+next_j2;\n }\n }\n }\n}",
"canonical_original_code": "void sphere_indices(unsigned short *out, int n_elevation, int n_azimuth) {\n int n = 0;\n for (int i = 0; i < n_elevation; i++) {\n for (int j = 0; j < n_azimuth; j++) {\n int prev_i = i-1;\n int next_i = i+1;\n int next_i2 = next_i + 1;\n int prev_j = j == 0 ? n_azimuth - 1 : j - 1;\n int next_j = j+1 == n_azimuth ? 0 : j + 1;\n int next_j2 = next_j+1 == n_azimuth ? 0 : next_j + 1;\n if (i == 0) {\n out[n++] = next_i*n_azimuth+((prev_j+n_azimuth/2)%n_azimuth);\n out[n++] = next_i*n_azimuth+((j+n_azimuth/2)%n_azimuth);\n out[n++] = next_i*n_azimuth+((next_j+n_azimuth/2)%n_azimuth);\n out[n++] = next_i*n_azimuth+((next_j2+n_azimuth/2)%n_azimuth);\n }\n else {\n out[n++] = prev_i*n_azimuth+prev_j;\n out[n++] = prev_i*n_azimuth+j;\n out[n++] = prev_i*n_azimuth+next_j;\n out[n++] = prev_i*n_azimuth+next_j2;\n }\n out[n++] = i*n_azimuth+prev_j;\n out[n++] = i*n_azimuth+j;\n out[n++] = i*n_azimuth+next_j;\n out[n++] = i*n_azimuth+next_j2;\n out[n++] = next_i*n_azimuth+prev_j;\n out[n++] = next_i*n_azimuth+j;\n out[n++] = next_i*n_azimuth+next_j;\n out[n++] = next_i*n_azimuth+next_j2;\n if (i == n_elevation - 1) {\n out[n++] = i*n_azimuth+((prev_j+n_azimuth/2)%n_azimuth);\n out[n++] = i*n_azimuth+((j+n_azimuth/2)%n_azimuth);\n out[n++] = i*n_azimuth+((next_j+n_azimuth/2)%n_azimuth);\n out[n++] = i*n_azimuth+((next_j2+n_azimuth/2)%n_azimuth);\n }\n else {\n out[n++] = next_i2*n_azimuth+prev_j;\n out[n++] = next_i2*n_azimuth+j;\n out[n++] = next_i2*n_azimuth+next_j;\n out[n++] = next_i2*n_azimuth+next_j2;\n }\n }\n }\n}",
"variable_types": [
[
"out",
"unsigned short *"
],
[
"n_elevation",
"int"
],
[
"n_azimuth",
"int"
],
[
"n",
"int"
],
[
"i",
"int"
],
[
"j",
"int"
],
[
"prev_i",
"int"
],
[
"next_i",
"int"
],
[
"next_i2",
"int"
],
[
"prev_j",
"int"
],
[
"next_j",
"int"
],
[
"next_j2",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "028ddae45930b46e21004566b1caa831faaac0f27f9ccfbeb6105d2e6ef12556"
},
{
"name": "random_radius",
"canonical_name": "func2",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "float __fastcall random_radius(float a1, float a2, float a3)\n{\nreturn (float)((float)(randomf() * (float)(a3 - a2)) + a2) * a1;\n}\n",
"canonical_decompiled_code": "float __fastcall func2(float a1, float a2, float a3)\n{\nreturn (float)((float)(randomf() * (float)(a3 - a2)) + a2) * a1;\n}",
"original_code": "static float random_radius(float r, float min_factor, float max_factor) {\n return (min_factor + (max_factor-min_factor)*randomf())*r;\n}",
"canonical_original_code": "static float random_radius(float r, float min_factor, float max_factor) {\n return (min_factor + (max_factor-min_factor)*randomf())*r;\n}",
"variable_types": [
[
"r",
"float"
],
[
"min_factor",
"float"
],
[
"max_factor",
"float"
]
],
"return_type": "float",
"user_defined_types": [],
"binary_hash": "028ddae45930b46e21004566b1caa831faaac0f27f9ccfbeb6105d2e6ef12556"
}
] |
2e1715c31453e77fb02a2e542109edfdf01440d393d1aa2d22629b0070b40dbd | Mon-Ouie/b-fun | [
[
"enable_vertex",
"->"
],
[
"to_cartes",
"->"
],
[
"randomf",
"->"
],
[
"vec3_normalize",
"->"
]
] | [] | [
{
"name": "enable_vertex",
"canonical_name": "func0",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "__int64 enable_vertex()\n{\n_glewVertexAttribPointer(0LL, 3LL, 5126LL, 0LL, 12LL, 0LL);\nreturn _glewEnableVertexAttribArray(0LL);\n}\n",
"canonical_decompiled_code": "__int64 func0()\n{\n_glewVertexAttribPointer(0LL, 3LL, 5126LL, 0LL, 12LL, 0LL);\nreturn _glewEnableVertexAttribArray(0LL);\n}",
"original_code": "void enable_vertex() {\n __glewVertexAttribPointer(0, 3, 0x1406, 0, sizeof(vertex),\n (void*)__builtin_offsetof (vertex, x));\n __glewEnableVertexAttribArray(0);\n}",
"canonical_original_code": "void enable_vertex() {\n __glewVertexAttribPointer(0, 3, 0x1406, 0, sizeof(vertex),\n (void *)__builtin_offsetof (vertex, x));\n __glewEnableVertexAttribArray(0);\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "2e1715c31453e77fb02a2e542109edfdf01440d393d1aa2d22629b0070b40dbd"
},
{
"name": "to_cartes",
"canonical_name": "func1",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "double __fastcall to_cartes(float a1, float a2, float a3)\n{\n__m128i v3; // xmm0\n__m128i v4; // xmm0\nunsigned int v7; // [rsp+58h] [rbp-8h]\nunsigned int v8; // [rsp+5Ch] [rbp-4h]\n\nv3 = _mm_cvtsi32_si128(LODWORD(a2));\n*(float *)v3.m128i_i32 = cosf(*(float *)v3.m128i_i32);\n*(float *)&v8 = cosf(a3) * (float)(COERCE_FLOAT(_mm_cvtsi128_si32(v3)) * a1);\nv4 = _mm_cvtsi32_si128(LODWORD(a2));\n*(float *)v4.m128i_i32 = cosf(*(float *)v4.m128i_i32);\n*(float *)&v7 = sinf(a3) * (float)(COERCE_FLOAT(_mm_cvtsi128_si32(v4)) * a1);\nsinf(a2);\nreturn COERCE_DOUBLE(__PAIR64__(v7, v8));\n}\n",
"canonical_decompiled_code": "double __fastcall func1(float a1, float a2, float a3)\n{\n__m128i v3; // xmm0\n__m128i v4; // xmm0\nunsigned int v7; // [rsp+58h] [rbp-8h]\nunsigned int v8; // [rsp+5Ch] [rbp-4h]\n\nv3 = _mm_cvtsi32_si128(LODWORD(a2));\n*(float *)v3.m128i_i32 = cosf(*(float *)v3.m128i_i32);\n*(float *)&v8 = cosf(a3) * (float)(COERCE_FLOAT(_mm_cvtsi128_si32(v3)) * a1);\nv4 = _mm_cvtsi32_si128(LODWORD(a2));\n*(float *)v4.m128i_i32 = cosf(*(float *)v4.m128i_i32);\n*(float *)&v7 = sinf(a3) * (float)(COERCE_FLOAT(_mm_cvtsi128_si32(v4)) * a1);\nsinf(a2);\nreturn COERCE_DOUBLE(__PAIR64__(v7, v8));\n}",
"original_code": "vertex to_cartes(float r, float elevation, float azimuth) {\n GLfloat x = r * cosf(elevation) * cosf(azimuth);\n GLfloat y = r * cosf(elevation) * sinf(azimuth);\n GLfloat z = r * sinf(elevation);\n return (vertex){x, y, z};\n}",
"canonical_original_code": "struct vertex to_cartes(float r, float elevation, float azimuth) {\n float x = r * cosf(elevation) * cosf(azimuth);\n float y = r * cosf(elevation) * sinf(azimuth);\n float z = r * sinf(elevation);\n return (struct vertex){x, y, z};\n}",
"variable_types": [
[
"r",
"float"
],
[
"elevation",
"float"
],
[
"azimuth",
"float"
],
[
"x",
"float"
],
[
"y",
"float"
],
[
"z",
"float"
]
],
"return_type": "struct vertex { float x; }",
"user_defined_types": [
"struct vertex { float x; }"
],
"binary_hash": "2e1715c31453e77fb02a2e542109edfdf01440d393d1aa2d22629b0070b40dbd"
},
{
"name": "randomf",
"canonical_name": "func2",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "float randomf()\n{\nreturn (float)rand() / 2147483600.0;\n}\n",
"canonical_decompiled_code": "float func2()\n{\nreturn (float)rand() / 2147483600.0;\n}",
"original_code": "float randomf() {\n return (float)rand()/(float)2147483647;\n}",
"canonical_original_code": "float randomf() {\n return (float)rand()/(float)2147483647;\n}",
"variable_types": [],
"return_type": "float",
"user_defined_types": [],
"binary_hash": "2e1715c31453e77fb02a2e542109edfdf01440d393d1aa2d22629b0070b40dbd"
},
{
"name": "vec3_normalize",
"canonical_name": "func3",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "float *__fastcall vec3_normalize(float *a1, float *a2, float *a3)\n{\n__m128i v3; // xmm1\n__m128i v4; // xmm0\nfloat *result; // rax\nfloat v7; // [rsp+2Ch] [rbp-4h]\n\nv3 = (__m128i)*(unsigned int *)a1;\n*(float *)v3.m128i_i32 = (float)((float)(*(float *)v3.m128i_i32 * *a1) + (float)(*a2 * *a2)) + (float)(*a3 * *a3);\nv4 = _mm_cvtsi32_si128(_mm_cvtsi128_si32(v3));\n*(float *)v4.m128i_i32 = sqrtf(*(float *)v4.m128i_i32);\nv7 = COERCE_FLOAT(_mm_cvtsi128_si32(v4));\n*a1 = *a1 / v7;\n*a2 = *a2 / v7;\nresult = a3;\n*a3 = *a3 / v7;\nreturn result;\n}\n",
"canonical_decompiled_code": "float *__fastcall func3(float *a1, float *a2, float *a3)\n{\n__m128i v3; // xmm1\n__m128i v4; // xmm0\nfloat *result; // rax\nfloat v7; // [rsp+2Ch] [rbp-4h]\n\nv3 = (__m128i)*(unsigned int *)a1;\n*(float *)v3.m128i_i32 = (float)((float)(*(float *)v3.m128i_i32 * *a1) + (float)(*a2 * *a2)) + (float)(*a3 * *a3);\nv4 = _mm_cvtsi32_si128(_mm_cvtsi128_si32(v3));\n*(float *)v4.m128i_i32 = sqrtf(*(float *)v4.m128i_i32);\nv7 = COERCE_FLOAT(_mm_cvtsi128_si32(v4));\n*a1 = *a1 / v7;\n*a2 = *a2 / v7;\nresult = a3;\n*a3 = *a3 / v7;\nreturn result;\n}",
"original_code": "void vec3_normalize(float *x, float *y, float *z) {\n float norm = sqrtf((*x) * (*x) + (*y) * (*y) + (*z) * (*z));\n *x = *x / norm;\n *y = *y / norm;\n *z = *z / norm;\n}",
"canonical_original_code": "void vec3_normalize(float *x, float *y, float *z) {\n float norm = sqrtf((*x) * (*x) + (*y) * (*y) + (*z) * (*z));\n *x = *x / norm;\n *y = *y / norm;\n *z = *z / norm;\n}",
"variable_types": [
[
"x",
"float *"
],
[
"y",
"float *"
],
[
"z",
"float *"
],
[
"norm",
"float"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "2e1715c31453e77fb02a2e542109edfdf01440d393d1aa2d22629b0070b40dbd"
}
] |
7728e28754915e07ff9be57e22544dfce8fe3dc7295d2dd1a30b1b0b99ffc9b5 | Mon-Ouie/b-fun | [
[
"create_program",
"->",
"create_shader",
"check_link_errors",
"fetch_uniforms"
],
[
"delete_program",
"->"
],
[
"send_mvp",
"->"
],
[
"send_spline",
"->"
],
[
"create_shader",
"->",
"create_program"
],
[
"fetch_uniforms",
"->",
"create_program"
],
[
"check_link_errors",
"->",
"create_program"
]
] | [] | [
{
"name": "create_program",
"canonical_name": "func0",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "__int64 __fastcall create_program(unsigned int *a1)\n{\n*a1 = create_shader(35633LL, \"vertex shader\", vertex_shader);\na1[1] = create_shader(36488LL, \"tess control\", tess_control_shader);\na1[2] = create_shader(36487LL, \"tess eval\", tess_eval_shader);\na1[3] = create_shader(36313LL, \"geometry shader\", geometry_shader);\na1[4] = create_shader(35632LL, \"fragment shader\", fragment_shader);\na1[5] = _glewCreateProgram();\n_glewAttachShader(a1[5], *a1);\n_glewAttachShader(a1[5], a1[1]);\n_glewAttachShader(a1[5], a1[2]);\n_glewAttachShader(a1[5], a1[3]);\n_glewAttachShader(a1[5], a1[4]);\n_glewBindFragDataLocation(a1[5], 0LL, \"frag_color\");\n_glewBindAttribLocation(a1[5], 0LL, \"position\");\n_glewLinkProgram(a1[5]);\ncheck_link_errors(a1[5]);\n_glewUseProgram(a1[5]);\n_glewPatchParameteri(36466LL, 16LL);\nreturn fetch_uniforms(a1);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(unsigned int *a1)\n{\n*a1 = func4(35633LL, \"vertex shader\", vertex_shader);\na1[1] = func4(36488LL, \"tess control\", tess_control_shader);\na1[2] = func4(36487LL, \"tess eval\", tess_eval_shader);\na1[3] = func4(36313LL, \"geometry shader\", geometry_shader);\na1[4] = func4(35632LL, \"fragment shader\", fragment_shader);\na1[5] = _glewCreateProgram();\n_glewAttachShader(a1[5], *a1);\n_glewAttachShader(a1[5], a1[1]);\n_glewAttachShader(a1[5], a1[2]);\n_glewAttachShader(a1[5], a1[3]);\n_glewAttachShader(a1[5], a1[4]);\n_glewBindFragDataLocation(a1[5], 0LL, \"frag_color\");\n_glewBindAttribLocation(a1[5], 0LL, \"position\");\n_glewLinkProgram(a1[5]);\nfunc6(a1[5]);\n_glewUseProgram(a1[5]);\n_glewPatchParameteri(36466LL, 16LL);\nreturn func5(a1);\n}",
"original_code": "void create_program(bspline_program *prog) {\n prog->vs = create_shader(0x8B31, \"vertex shader\", vertex_shader);\n prog->tcs = create_shader(0x8E88, \"tess control\",\n tess_control_shader);\n prog->tes = create_shader(0x8E87, \"tess eval\",\n tess_eval_shader);\n prog->gs = create_shader(0x8DD9, \"geometry shader\",\n geometry_shader);\n prog->fs = create_shader(0x8B30, \"fragment shader\",\n fragment_shader);\n prog->prog = __glewCreateProgram();\n __glewAttachShader(prog->prog, prog->vs);\n __glewAttachShader(prog->prog, prog->tcs);\n __glewAttachShader(prog->prog, prog->tes);\n __glewAttachShader(prog->prog, prog->gs);\n __glewAttachShader(prog->prog, prog->fs);\n __glewBindFragDataLocation(prog->prog, 0, \"frag_color\");\n __glewBindAttribLocation(prog->prog, 0, \"position\");\n __glewLinkProgram(prog->prog);\n check_link_errors(prog->prog);\n __glewUseProgram(prog->prog);\n __glewPatchParameteri(0x8E72, 16);\n fetch_uniforms(prog);\n}",
"canonical_original_code": "void create_program(struct bspline_program *prog) {\n prog->vs = create_shader(0x8B31, \"vertex shader\", vertex_shader);\n prog->tcs = create_shader(0x8E88, \"tess control\",\n tess_control_shader);\n prog->tes = create_shader(0x8E87, \"tess eval\",\n tess_eval_shader);\n prog->gs = create_shader(0x8DD9, \"geometry shader\",\n geometry_shader);\n prog->fs = create_shader(0x8B30, \"fragment shader\",\n fragment_shader);\n prog->prog = __glewCreateProgram();\n __glewAttachShader(prog->prog, prog->vs);\n __glewAttachShader(prog->prog, prog->tcs);\n __glewAttachShader(prog->prog, prog->tes);\n __glewAttachShader(prog->prog, prog->gs);\n __glewAttachShader(prog->prog, prog->fs);\n __glewBindFragDataLocation(prog->prog, 0, \"frag_color\");\n __glewBindAttribLocation(prog->prog, 0, \"position\");\n __glewLinkProgram(prog->prog);\n check_link_errors(prog->prog);\n __glewUseProgram(prog->prog);\n __glewPatchParameteri(0x8E72, 16);\n fetch_uniforms(prog);\n}",
"variable_types": [
[
"prog",
"struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; }"
],
"binary_hash": "7728e28754915e07ff9be57e22544dfce8fe3dc7295d2dd1a30b1b0b99ffc9b5"
},
{
"name": "delete_program",
"canonical_name": "func1",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "__int64 __fastcall delete_program(unsigned int *a1)\n{\n_glewDeleteShader(*a1);\n_glewDeleteShader(a1[1]);\n_glewDeleteShader(a1[2]);\n_glewDeleteShader(a1[3]);\n_glewDeleteShader(a1[4]);\nreturn _glewDeleteProgram(a1[5]);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(unsigned int *a1)\n{\n_glewDeleteShader(*a1);\n_glewDeleteShader(a1[1]);\n_glewDeleteShader(a1[2]);\n_glewDeleteShader(a1[3]);\n_glewDeleteShader(a1[4]);\nreturn _glewDeleteProgram(a1[5]);\n}",
"original_code": "void delete_program(bspline_program *prog) {\n __glewDeleteShader(prog->vs);\n __glewDeleteShader(prog->tcs);\n __glewDeleteShader(prog->tes);\n __glewDeleteShader(prog->gs);\n __glewDeleteShader(prog->fs);\n __glewDeleteProgram(prog->prog);\n}",
"canonical_original_code": "void delete_program(struct bspline_program *prog) {\n __glewDeleteShader(prog->vs);\n __glewDeleteShader(prog->tcs);\n __glewDeleteShader(prog->tes);\n __glewDeleteShader(prog->gs);\n __glewDeleteShader(prog->fs);\n __glewDeleteProgram(prog->prog);\n}",
"variable_types": [
[
"prog",
"struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; }"
],
"binary_hash": "7728e28754915e07ff9be57e22544dfce8fe3dc7295d2dd1a30b1b0b99ffc9b5"
},
{
"name": "send_mvp",
"canonical_name": "func2",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "__int64 __fastcall send_mvp(__int64 a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, char a7)\n{\nreturn _glewUniformMatrix4fv(*(unsigned int *)(a1 + 24), 1LL, 1LL, &a7);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, char a7)\n{\nreturn _glewUniformMatrix4fv(*(unsigned int *)(a1 + 24), 1LL, 1LL, &a7);\n}",
"original_code": "void send_mvp(bspline_program *prog, mat4 matrix) {\n __glewUniformMatrix4fv(prog->uniforms.mvp, 1, 1, matrix.data);\n}",
"canonical_original_code": "void send_mvp(struct bspline_program *prog, struct mat4 matrix) {\n __glewUniformMatrix4fv(prog->uniforms.mvp, 1, 1, matrix.data);\n}",
"variable_types": [
[
"prog",
"struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; } *"
],
[
"matrix",
"struct mat4 { float data[16]; }"
]
],
"return_type": "void",
"user_defined_types": [
"struct mat4 { float data[16]; }",
"struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; }"
],
"binary_hash": "7728e28754915e07ff9be57e22544dfce8fe3dc7295d2dd1a30b1b0b99ffc9b5"
},
{
"name": "send_spline",
"canonical_name": "func3",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "__int64 __fastcall send_spline(__int64 a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, char a7)\n{\n_glewUniformMatrix4fv(*(unsigned int *)(a1 + 28), 1LL, 1LL, &a7);\nreturn _glewUniformMatrix4fv(*(unsigned int *)(a1 + 32), 1LL, 0LL, &a7);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1, __int64 a2, __int64 a3, __int64 a4, __int64 a5, __int64 a6, char a7)\n{\n_glewUniformMatrix4fv(*(unsigned int *)(a1 + 28), 1LL, 1LL, &a7);\nreturn _glewUniformMatrix4fv(*(unsigned int *)(a1 + 32), 1LL, 0LL, &a7);\n}",
"original_code": "void send_spline(bspline_program *prog, mat4 matrix) {\n __glewUniformMatrix4fv(prog->uniforms.spline, 1, 1, matrix.data);\n __glewUniformMatrix4fv(prog->uniforms.transpose_spline, 1, 0, matrix.data);\n}",
"canonical_original_code": "void send_spline(struct bspline_program *prog, struct mat4 matrix) {\n __glewUniformMatrix4fv(prog->uniforms.spline, 1, 1, matrix.data);\n __glewUniformMatrix4fv(prog->uniforms.transpose_spline, 1, 0, matrix.data);\n}",
"variable_types": [
[
"prog",
"struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; } *"
],
[
"matrix",
"struct mat4 { float data[16]; }"
]
],
"return_type": "void",
"user_defined_types": [
"struct mat4 { float data[16]; }",
"struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; }"
],
"binary_hash": "7728e28754915e07ff9be57e22544dfce8fe3dc7295d2dd1a30b1b0b99ffc9b5"
},
{
"name": "create_shader",
"canonical_name": "func4",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "__int64 __fastcall create_shader(unsigned int a1, const char *a2, char *a3)\n{\nchar *s; // [rsp+8h] [rbp-128h] BYREF\nconst char *v5; // [rsp+10h] [rbp-120h]\nunsigned int v6; // [rsp+1Ch] [rbp-114h]\nchar v7[260]; // [rsp+20h] [rbp-110h] BYREF\nint v8; // [rsp+124h] [rbp-Ch] BYREF\nint v9; // [rsp+128h] [rbp-8h] BYREF\nunsigned int v10; // [rsp+12Ch] [rbp-4h]\n\nv6 = a1;\nv5 = a2;\ns = a3;\nv10 = _glewCreateShader(a1);\nv9 = strlen(s);\n_glewShaderSource(v10, 1LL, &s, &v9);\n_glewCompileShader(v10);\n_glewGetShaderiv(v10, 35713LL, &v8);\n_glewGetShaderInfoLog(v10, 256LL, 0LL, v7);\nif ( !v8 )\nfprintf(stderr, \"%s: compilation error: %s\\n\", v5, v7);\nreturn v10;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(unsigned int a1, const char *a2, char *a3)\n{\nchar *s; // [rsp+8h] [rbp-128h] BYREF\nconst char *v5; // [rsp+10h] [rbp-120h]\nunsigned int v6; // [rsp+1Ch] [rbp-114h]\nchar v7[260]; // [rsp+20h] [rbp-110h] BYREF\nint v8; // [rsp+124h] [rbp-Ch] BYREF\nint v9; // [rsp+128h] [rbp-8h] BYREF\nunsigned int v10; // [rsp+12Ch] [rbp-4h]\n\nv6 = a1;\nv5 = a2;\ns = a3;\nv10 = _glewCreateShader(a1);\nv9 = strlen(s);\n_glewShaderSource(v10, 1LL, &s, &v9);\n_glewCompileShader(v10);\n_glewGetShaderiv(v10, 35713LL, &v8);\n_glewGetShaderInfoLog(v10, 256LL, 0LL, v7);\nif ( !v8 )\nfprintf(stderr, \"%s: compilation error: %s\\n\", v5, v7);\nreturn v10;\n}",
"original_code": "static GLuint create_shader(GLenum mode, const char *name,\n const char *src) {\n GLuint ret = __glewCreateShader(mode);\n GLint length = strlen(src);\n __glewShaderSource(ret, 1, &src, &length);\n __glewCompileShader(ret);\n int status;\n char error[256];\n __glewGetShaderiv(ret, 0x8B81, &status);\n __glewGetShaderInfoLog(ret, sizeof(error), 0, error);\n if (!status)\n fprintf(stderr, \"%s: compilation error: %s\\n\", name, error);\n return ret;\n}",
"canonical_original_code": "static unsigned int create_shader(unsigned int mode, char *name, char *src) {\n unsigned int ret = __glewCreateShader(mode);\n int length = strlen(src);\n __glewShaderSource(ret, 1, &src, &length);\n __glewCompileShader(ret);\n int status;\n char error[256];\n __glewGetShaderiv(ret, 0x8B81, &status);\n __glewGetShaderInfoLog(ret, sizeof(error), 0, error);\n if (!status)\n fprintf(stderr, \"%s: compilation error: %s\\n\", name, error);\n return ret;\n}",
"variable_types": [
[
"mode",
"unsigned int"
],
[
"name",
"char *"
],
[
"src",
"char *"
],
[
"ret",
"unsigned int"
],
[
"length",
"int"
],
[
"status",
"int"
],
[
"error",
"char [256]"
]
],
"return_type": "unsigned int",
"user_defined_types": [],
"binary_hash": "7728e28754915e07ff9be57e22544dfce8fe3dc7295d2dd1a30b1b0b99ffc9b5"
},
{
"name": "fetch_uniforms",
"canonical_name": "func5",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "__int64 __fastcall fetch_uniforms(unsigned int *a1)\n{\n__int64 result; // rax\n\na1[6] = _glewGetUniformLocation(a1[5], \"mvp\");\na1[7] = _glewGetUniformLocation(a1[5], \"B\");\nresult = _glewGetUniformLocation(a1[5], \"Bt\");\na1[8] = result;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(unsigned int *a1)\n{\n__int64 result; // rax\n\na1[6] = _glewGetUniformLocation(a1[5], \"mvp\");\na1[7] = _glewGetUniformLocation(a1[5], \"B\");\nresult = _glewGetUniformLocation(a1[5], \"Bt\");\na1[8] = result;\nreturn result;\n}",
"original_code": "static void fetch_uniforms(bspline_program *prog) {\n prog->uniforms.mvp = __glewGetUniformLocation(prog->prog, \"mvp\");\n prog->uniforms.spline = __glewGetUniformLocation(prog->prog, \"B\");\n prog->uniforms.transpose_spline = __glewGetUniformLocation(prog->prog, \"Bt\");\n}",
"canonical_original_code": "static void fetch_uniforms(struct bspline_program *prog) {\n prog->uniforms.mvp = __glewGetUniformLocation(prog->prog, \"mvp\");\n prog->uniforms.spline = __glewGetUniformLocation(prog->prog, \"B\");\n prog->uniforms.transpose_spline = __glewGetUniformLocation(prog->prog, \"Bt\");\n}",
"variable_types": [
[
"prog",
"struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; }"
],
"binary_hash": "7728e28754915e07ff9be57e22544dfce8fe3dc7295d2dd1a30b1b0b99ffc9b5"
},
{
"name": "check_link_errors",
"canonical_name": "func6",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "int __fastcall check_link_errors(unsigned int a1)\n{\nint result; // eax\nchar v2[268]; // [rsp+10h] [rbp-110h] BYREF\nint v3; // [rsp+11Ch] [rbp-4h] BYREF\n\n_glewGetProgramiv(a1, 35714LL, &v3);\n_glewGetProgramInfoLog(a1, 256LL, 0LL, v2);\nresult = v3;\nif ( !v3 )\nresult = fprintf(stderr, \"Linking error: %s\\n\", v2);\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func6(unsigned int a1)\n{\nint result; // eax\nchar v2[268]; // [rsp+10h] [rbp-110h] BYREF\nint v3; // [rsp+11Ch] [rbp-4h] BYREF\n\n_glewGetProgramiv(a1, 35714LL, &v3);\n_glewGetProgramInfoLog(a1, 256LL, 0LL, v2);\nresult = v3;\nif ( !v3 )\nresult = fprintf(stderr, \"Linking error: %s\\n\", v2);\nreturn result;\n}",
"original_code": "static void check_link_errors(GLuint prog) {\n int status;\n char error[256];\n __glewGetProgramiv(prog, 0x8B82, &status);\n __glewGetProgramInfoLog(prog, sizeof(error), 0, error);\n if (!status)\n fprintf(stderr, \"Linking error: %s\\n\", error);\n}",
"canonical_original_code": "static void check_link_errors(unsigned int prog) {\n int status;\n char error[256];\n __glewGetProgramiv(prog, 0x8B82, &status);\n __glewGetProgramInfoLog(prog, sizeof(error), 0, error);\n if (!status)\n fprintf(stderr, \"Linking error: %s\\n\", error);\n}",
"variable_types": [
[
"prog",
"unsigned int"
],
[
"status",
"int"
],
[
"error",
"char [256]"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "7728e28754915e07ff9be57e22544dfce8fe3dc7295d2dd1a30b1b0b99ffc9b5"
}
] |
9101aa33c7ca480ce687badd7160a2c6a4ea3938752173029162705efb285167 | Mon-Ouie/b-fun | [
[
"gl_setup",
"->"
],
[
"gl_teardown",
"->"
]
] | [] | [
{
"name": "gl_setup",
"canonical_name": "func0",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "__int64 __fastcall gl_setup(unsigned int *a1)\n{\nunsigned int v1; // eax\n\nv1 = time(0LL);\nsrand(v1);\nSDL_Init(32LL);\nSDL_SetVideoMode(640LL, 640LL, 32LL, 2LL);\nSDL_WM_SetCaption(\"Fun with B-Splines\", 0LL);\nglewInit();\nglEnable(2929LL);\ncreate_program(a1 + 3);\n_glewGenVertexArrays(1LL, a1);\n_glewBindVertexArray(*a1);\n_glewGenBuffers(1LL, a1 + 1);\n_glewBindBuffer(34962LL, a1[1]);\n_glewGenBuffers(1LL, a1 + 2);\n_glewBindBuffer(34963LL, a1[2]);\nreturn enable_vertex();\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(unsigned int *a1)\n{\nunsigned int v1; // eax\n\nv1 = time(0LL);\nsrand(v1);\nSDL_Init(32LL);\nSDL_SetVideoMode(640LL, 640LL, 32LL, 2LL);\nSDL_WM_SetCaption(\"Fun with B-Splines\", 0LL);\nglewInit();\nglEnable(2929LL);\ncreate_program(a1 + 3);\n_glewGenVertexArrays(1LL, a1);\n_glewBindVertexArray(*a1);\n_glewGenBuffers(1LL, a1 + 1);\n_glewBindBuffer(34962LL, a1[1]);\n_glewGenBuffers(1LL, a1 + 2);\n_glewBindBuffer(34963LL, a1[2]);\nreturn enable_vertex();\n}",
"original_code": "void gl_setup(gl_config *conf) {\n srand(time(((void *)0)));\n SDL_Init(0x00000020);\n SDL_SetVideoMode(640, 640, 32, 0x00000002);\n SDL_WM_SetCaption(\"Fun with B-Splines\", ((void *)0));\n glewInit();\n glEnable(0x0B71);\n create_program(&conf->prog);\n __glewGenVertexArrays(1, &conf->vao);\n __glewBindVertexArray(conf->vao);\n __glewGenBuffers(1, &conf->vbo);\n __glewBindBuffer(0x8892, conf->vbo);\n __glewGenBuffers(1, &conf->ibo);\n __glewBindBuffer(0x8893, conf->ibo);\n enable_vertex();\n}",
"canonical_original_code": "void gl_setup(struct gl_config *conf) {\n srand(time(((void *)0)));\n SDL_Init(0x00000020);\n SDL_SetVideoMode(640, 640, 32, 0x00000002);\n SDL_WM_SetCaption(\"Fun with B-Splines\", ((void *)0));\n glewInit();\n glEnable(0x0B71);\n create_program(&conf->prog);\n __glewGenVertexArrays(1, &conf->vao);\n __glewBindVertexArray(conf->vao);\n __glewGenBuffers(1, &conf->vbo);\n __glewBindBuffer(0x8892, conf->vbo);\n __glewGenBuffers(1, &conf->ibo);\n __glewBindBuffer(0x8893, conf->ibo);\n enable_vertex();\n}",
"variable_types": [
[
"conf",
"struct gl_config { unsigned int vao; unsigned int vbo; unsigned int ibo; struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; } prog; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct gl_config { unsigned int vao; unsigned int vbo; unsigned int ibo; struct bspline_program prog; }",
"struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; }"
],
"binary_hash": "9101aa33c7ca480ce687badd7160a2c6a4ea3938752173029162705efb285167"
},
{
"name": "gl_teardown",
"canonical_name": "func1",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "__int64 __fastcall gl_teardown(__int64 a1)\n{\n_glewDeleteBuffers(1LL, a1 + 8);\n_glewDeleteBuffers(1LL, a1 + 4);\n_glewDeleteVertexArrays(1LL, a1);\ndelete_program(a1 + 12);\nreturn SDL_Quit();\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1)\n{\n_glewDeleteBuffers(1LL, a1 + 8);\n_glewDeleteBuffers(1LL, a1 + 4);\n_glewDeleteVertexArrays(1LL, a1);\ndelete_program(a1 + 12);\nreturn SDL_Quit();\n}",
"original_code": "void gl_teardown(gl_config *conf) {\n __glewDeleteBuffers(1, &conf->ibo);\n __glewDeleteBuffers(1, &conf->vbo);\n __glewDeleteVertexArrays(1, &conf->vao);\n delete_program(&conf->prog);\n SDL_Quit();\n}",
"canonical_original_code": "void gl_teardown(struct gl_config *conf) {\n __glewDeleteBuffers(1, &conf->ibo);\n __glewDeleteBuffers(1, &conf->vbo);\n __glewDeleteVertexArrays(1, &conf->vao);\n delete_program(&conf->prog);\n SDL_Quit();\n}",
"variable_types": [
[
"conf",
"struct gl_config { unsigned int vao; unsigned int vbo; unsigned int ibo; struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; } prog; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct gl_config { unsigned int vao; unsigned int vbo; unsigned int ibo; struct bspline_program prog; }",
"struct bspline_program { unsigned int vs; unsigned int tcs; unsigned int tes; unsigned int gs; unsigned int fs; unsigned int prog; struct { int mvp; int spline; int transpose_spline; } uniforms; }"
],
"binary_hash": "9101aa33c7ca480ce687badd7160a2c6a4ea3938752173029162705efb285167"
}
] |
e0554fc9d5b92cd9783f7b4e2a20cbf7eac382f5214d18a365cfceedb04de5d0 | Mon-Ouie/b-fun | [
[
"main",
"->",
"create_sphere"
],
[
"create_sphere",
"->",
"main"
]
] | [
[
"main",
"int __cdecl main(int argc, const char **argv, const char **envp)\n{\nfloat v3; // xmm0_4\nfloat v4; // xmm0_4\nchar v6[8]; // [rsp+0h] [rbp-E0h] BYREF\nint v7; // [rsp+8h] [rbp-D8h]\n__int64 v8; // [rsp+20h] [rbp-C0h]\n__int64 v9; // [rsp+28h] [rbp-B8h]\n__int64 v10; // [rsp+30h] [rbp-B0h]\n__int64 v11; // [rsp+38h] [rbp-A8h]\n__int64 v12; // [rsp+40h] [rbp-A0h]\n__int64 v13; // [rsp+48h] [rbp-98h]\n__int64 v14; // [rsp+50h] [rbp-90h]\n__int64 v15; // [rsp+58h] [rbp-88h]\nchar v16[12]; // [rsp+60h] [rbp-80h] BYREF\n_BYTE v17[36]; // [rsp+6Ch] [rbp-74h] BYREF\n__int64 v18; // [rsp+90h] [rbp-50h] BYREF\nunsigned int v19; // [rsp+D4h] [rbp-Ch]\nchar v20; // [rsp+DAh] [rbp-6h]\nchar v21; // [rsp+DBh] [rbp-5h]\nfloat v22; // [rsp+DCh] [rbp-4h]\n\ngl_setup(v16, argv, envp);\nv8 = 0x3F000000BE2AAAABLL;\nv9 = 0x3E2AAAABBF000000LL;\nv10 = 0xBF8000003F000000LL;\nv11 = 1056964608LL;\nv12 = 3204448256LL;\nv13 = 1056964608LL;\nv14 = 0x3F2AAAAB3E2AAAABLL;\nv15 = 1042983595LL;\nsend_spline(v17);\nv19 = func0();\nv22 = 0.0;\nv21 = 1;\nv20 = 1;\nwhile ( v20 )\n{\nwhile ( (unsigned int)SDL_PollEvent(v6) )\n{\nif ( v6[0] == 12 )\n{\nv20 = 0;\n}\nelse if ( v6[0] == 2 && v7 == 32 )\n{\nv21 = v21 == 0;\nv21 &= 1u;\n}\n}\nif ( v21 )\n{\nv3 = v22 + 0.05235987755982988;\nv22 = v3;\nif ( v3 > 6.283185307179586 )\n{\nv4 = v22 - 6.283185307179586;\nv22 = v4;\n}\n}\nrotation(&v18, *(double *)_mm_cvtsi32_si128(LODWORD(v22)).m128i_i64, 1.0, 1.0, 0.0);\nsend_mvp(v17);\nglClear(16640LL);\nglDrawElements(14LL, v19, 5123LL, 0LL);\nSDL_GL_SwapBuffers();\n}\ngl_teardown(v16);\nreturn 0;\n}"
]
] | [
{
"name": "create_sphere",
"canonical_name": "func0",
"repo": "Mon-Ouie/b-fun",
"decompiled_code": "__int64 create_sphere()\n{\nchar v1[3200]; // [rsp+0h] [rbp-11B0h] BYREF\nchar v2[1328]; // [rsp+C80h] [rbp-530h] BYREF\n\nsphere(v2, 10LL, 10LL, 0.5, 0.5, 1.8);\nsphere_indices(v1, 10LL, 10LL);\n_glewBufferData(34962LL, 1320LL, v2, 35044LL);\n_glewBufferData(34963LL, 3200LL, v1, 35044LL);\nreturn (unsigned int)icount_0;\n}\n",
"canonical_decompiled_code": "__int64 func0()\n{\nchar v1[3200]; // [rsp+0h] [rbp-11B0h] BYREF\nchar v2[1328]; // [rsp+C80h] [rbp-530h] BYREF\n\nsphere(v2, 10LL, 10LL, 0.5, 0.5, 1.8);\nsphere_indices(v1, 10LL, 10LL);\n_glewBufferData(34962LL, 1320LL, v2, 35044LL);\n_glewBufferData(34963LL, 3200LL, v1, 35044LL);\nreturn (unsigned int)icount_0;\n}",
"original_code": "int create_sphere() {\n static const int icount = (16*(10)*(10));\n vertex vertices[(((10)+1)*(10))];\n GLushort indices[(16*(10)*(10))];\n sphere(vertices, 0.5, 10, 10,\n 0.5, 1.8);\n sphere_indices(indices, 10, 10);\n __glewBufferData(0x8892, sizeof(vertices), vertices, 0x88E4);\n __glewBufferData(0x8893, sizeof(indices), indices,\n 0x88E4);\n return icount;\n}",
"canonical_original_code": "int create_sphere() {\n static int icount = (16*(10)*(10));\n struct vertex vertices[-1];\n unsigned short indices[-1];\n sphere(vertices, 0.5, 10, 10,\n 0.5, 1.8);\n sphere_indices(indices, 10, 10);\n __glewBufferData(0x8892, sizeof(vertices), vertices, 0x88E4);\n __glewBufferData(0x8893, sizeof(indices), indices,\n 0x88E4);\n return icount;\n}",
"variable_types": [
[
"icount",
"int"
],
[
"vertices",
"struct vertex { float x; } [-1]"
],
[
"indices",
"unsigned short [-1]"
]
],
"return_type": "int",
"user_defined_types": [
"struct vertex { float x; }"
],
"binary_hash": "e0554fc9d5b92cd9783f7b4e2a20cbf7eac382f5214d18a365cfceedb04de5d0"
}
] |
15769cb1623e71719d5ca7d1996f982c834438f8eda1115b75e7438657fbb990 | lilingxin/mapred | [
[
"get_shell",
"->",
"spawn_process"
],
[
"last_component",
"->",
"spawn_process"
],
[
"set_noblocking",
"->"
],
[
"set_cloexec",
"->"
],
[
"wait_children",
"->"
],
[
"spawn_process",
"->",
"get_shell",
"last_component"
]
] | [] | [
{
"name": "get_shell",
"canonical_name": "func0",
"repo": "lilingxin/mapred",
"decompiled_code": "const char *get_shell()\n{\nconst char *result; // rax\nchar *v1; // [rsp+8h] [rbp-8h]\n\nv1 = getenv(\"SHELL\");\nif ( v1 )\nresult = v1;\nelse\nresult = \"/bin/sh\";\nreturn result;\n}\n",
"canonical_decompiled_code": "const char *func0()\n{\nconst char *result; // rax\nchar *v1; // [rsp+8h] [rbp-8h]\n\nv1 = getenv(\"SHELL\");\nif ( v1 )\nresult = v1;\nelse\nresult = \"/bin/sh\";\nreturn result;\n}",
"original_code": "static char* get_shell()\n{\n char* shell = getenv(\"SHELL\");\n return shell ? shell : \"/bin/sh\";\n}",
"canonical_original_code": "static char *get_shell()\n{\n char *shell = getenv(\"SHELL\");\n return shell ? shell : \"/bin/sh\";\n}",
"variable_types": [
[
"shell",
"char *"
]
],
"return_type": "char *",
"user_defined_types": [],
"binary_hash": "15769cb1623e71719d5ca7d1996f982c834438f8eda1115b75e7438657fbb990"
},
{
"name": "last_component",
"canonical_name": "func1",
"repo": "lilingxin/mapred",
"decompiled_code": "char *__fastcall last_component(const char *a1)\n{\nreturn strrchr(a1, 47) + 1;\n}\n",
"canonical_decompiled_code": "char *__fastcall func1(const char *a1)\n{\nreturn strrchr(a1, 47) + 1;\n}",
"original_code": "static char* last_component(const char* str)\n{\n char* bp = strrchr(str, (int)'/');\n return ++bp;\n}",
"canonical_original_code": "static char *last_component(char *str)\n{\n char *bp = strrchr(str, (int)'/');\n return ++bp;\n}",
"variable_types": [
[
"str",
"char *"
],
[
"bp",
"char *"
]
],
"return_type": "char *",
"user_defined_types": [],
"binary_hash": "15769cb1623e71719d5ca7d1996f982c834438f8eda1115b75e7438657fbb990"
},
{
"name": "set_noblocking",
"canonical_name": "func2",
"repo": "lilingxin/mapred",
"decompiled_code": "int __fastcall set_noblocking(int a1)\n{\nint v2; // [rsp+1Ch] [rbp-4h]\n\nv2 = fcntl(a1, 1, 0LL);\nreturn fcntl(a1, 2, v2 | 1u);\n}\n",
"canonical_decompiled_code": "int __fastcall func2(int a1)\n{\nint v2; // [rsp+1Ch] [rbp-4h]\n\nv2 = fcntl(a1, 1, 0LL);\nreturn fcntl(a1, 2, v2 | 1u);\n}",
"original_code": "int set_noblocking(int fd)\n{\n int flags = fcntl(fd, 1, 0);\n do { if ((flags >= 0) < 0) { error(1, (*__errno_location ()), \"fcntl error\"); } } while (0);\n return fcntl(fd, 2, flags | 1);\n}",
"canonical_original_code": "int set_noblocking(int fd)\n{\n int flags = fcntl(fd, 1, 0);\n do { if ((flags >= 0) < 0) { error(1, (*__errno_location ()), \"fcntl error\"); } } while (0);\n return fcntl(fd, 2, flags | 1);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"flags",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "15769cb1623e71719d5ca7d1996f982c834438f8eda1115b75e7438657fbb990"
},
{
"name": "set_cloexec",
"canonical_name": "func3",
"repo": "lilingxin/mapred",
"decompiled_code": "int __fastcall set_cloexec(int a1)\n{\nint v2; // [rsp+1Ch] [rbp-4h]\n\nv2 = fcntl(a1, 1, 0LL);\nreturn fcntl(a1, 2, v2 | 1u);\n}\n",
"canonical_decompiled_code": "int __fastcall func3(int a1)\n{\nint v2; // [rsp+1Ch] [rbp-4h]\n\nv2 = fcntl(a1, 1, 0LL);\nreturn fcntl(a1, 2, v2 | 1u);\n}",
"original_code": "int set_cloexec(int fd)\n{\n int flags = fcntl(fd, 1, 0);\n do { if ((flags >= 0) < 0) { error(1, (*__errno_location ()), \"fcntl error\"); } } while (0);\n return fcntl(fd, 2, flags | 1);\n}",
"canonical_original_code": "int set_cloexec(int fd)\n{\n int flags = fcntl(fd, 1, 0);\n do { if ((flags >= 0) < 0) { error(1, (*__errno_location ()), \"fcntl error\"); } } while (0);\n return fcntl(fd, 2, flags | 1);\n}",
"variable_types": [
[
"fd",
"int"
],
[
"flags",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "15769cb1623e71719d5ca7d1996f982c834438f8eda1115b75e7438657fbb990"
},
{
"name": "wait_children",
"canonical_name": "func4",
"repo": "lilingxin/mapred",
"decompiled_code": "__pid_t wait_children()\n{\n__pid_t result; // eax\nint stat_loc[2]; // [rsp+4h] [rbp-Ch] BYREF\nunsigned int v2; // [rsp+Ch] [rbp-4h]\n\nstat_loc[0] = -1;\nv2 = -1;\nwhile ( 1 )\n{\nresult = waitpid(-1, stat_loc, 0);\nv2 = result;\nif ( result <= 0 )\nbreak;\nif ( (char)((stat_loc[0] & 0x7F) + 1) >> 1 > 0 )\n{\nstat_loc[1] = stat_loc[0] & 0x7F;\nfprintf(stderr, \"child [%d] exit by signal %d\\n\", v2, stat_loc[0] & 0x7F);\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__pid_t func4()\n{\n__pid_t result; // eax\nint stat_loc[2]; // [rsp+4h] [rbp-Ch] BYREF\nunsigned int v2; // [rsp+Ch] [rbp-4h]\n\nstat_loc[0] = -1;\nv2 = -1;\nwhile ( 1 )\n{\nresult = waitpid(-1, stat_loc, 0);\nv2 = result;\nif ( result <= 0 )\nbreak;\nif ( (char)((stat_loc[0] & 0x7F) + 1) >> 1 > 0 )\n{\nstat_loc[1] = stat_loc[0] & 0x7F;\nfprintf(stderr, \"child [%d] exit by signal %d\\n\", v2, stat_loc[0] & 0x7F);\n}\n}\nreturn result;\n}",
"original_code": "void wait_children()\n{\n int status = -1;\n int pid = -1;\n while ( (pid = waitpid(-1, &status, 0)) > 0 ) {\n if ((((signed char) (((status) & 0x7f) + 1) >> 1) > 0)) {\n int signo = ((status) & 0x7f);\n fprintf(stderr, \"child [%d] exit by signal %d\\n\", pid, signo);\n }\n }\n}",
"canonical_original_code": "void wait_children()\n{\n int status = -1;\n int pid = -1;\n while ( (pid = waitpid(-1, &status, 0)) > 0 ) {\n if ((((char) (((status) & 0x7f) + 1) >> 1) > 0)) {\n int signo = ((status) & 0x7f);\n fprintf(stderr, \"child [%d] exit by signal %d\\n\", pid, signo);\n }\n }\n}",
"variable_types": [
[
"status",
"int"
],
[
"pid",
"int"
],
[
"signo",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "15769cb1623e71719d5ca7d1996f982c834438f8eda1115b75e7438657fbb990"
},
{
"name": "spawn_process",
"canonical_name": "func5",
"repo": "lilingxin/mapred",
"decompiled_code": "__int64 __fastcall spawn_process(__int64 a1, _DWORD *a2, _DWORD *a3)\n{\nint v3; // eax\nint v4; // eax\nint v5; // eax\nint v6; // eax\nchar *v7; // rax\nint v8; // eax\nint v11[2]; // [rsp+20h] [rbp-70h] BYREF\nint pipedes[2]; // [rsp+28h] [rbp-68h] BYREF\nchar *v13; // [rsp+30h] [rbp-60h]\nint v14; // [rsp+38h] [rbp-58h]\nint v15; // [rsp+3Ch] [rbp-54h]\nchar *v16; // [rsp+40h] [rbp-50h]\nint v17; // [rsp+48h] [rbp-48h]\nint v18; // [rsp+4Ch] [rbp-44h]\nchar *v19; // [rsp+50h] [rbp-40h]\nint v20; // [rsp+58h] [rbp-38h]\nint v21; // [rsp+5Ch] [rbp-34h]\nchar *v22; // [rsp+60h] [rbp-30h]\nint v23; // [rsp+68h] [rbp-28h]\nint v24; // [rsp+6Ch] [rbp-24h]\nchar *format; // [rsp+70h] [rbp-20h]\nint errnum; // [rsp+78h] [rbp-18h]\nint status; // [rsp+7Ch] [rbp-14h]\nchar *path; // [rsp+80h] [rbp-10h]\n__pid_t v29; // [rsp+8Ch] [rbp-4h]\n\nif ( pipe(pipedes) < 0 || pipe(v11) < 0 )\n{\nv3 = *_errno_location();\nstatus = 1;\nerrnum = v3;\nformat = \"pipe error\";\nerror(1, v3, \"pipe error\");\n}\nv29 = fork();\nif ( v29 < 0 )\n{\nv4 = *_errno_location();\nv24 = 1;\nv23 = v4;\nv22 = \"fork error\";\nerror(1, v4, \"fork error\");\n}\nif ( !v29 )\n{\nclose(pipedes[0]);\nclose(v11[1]);\nif ( dup2(v11[0], 0) < 0 )\n{\nv5 = *_errno_location();\nv21 = 1;\nv20 = v5;\nv19 = \"dup2 error\";\nerror(1, v5, \"dup2 error\");\n}\nif ( dup2(pipedes[1], 1) < 0 )\n{\nv6 = *_errno_location();\nv18 = 1;\nv17 = v6;\nv16 = \"dup2 error\";\nerror(1, v6, \"dup2 error\");\n}\nclose(v11[0]);\npath = (char *)get_shell();\nv7 = last_component(path);\nexecl(path, v7, \"-c\", a1, 0LL);\nv8 = *_errno_location();\nv15 = 1;\nv14 = v8;\nv13 = \"execl error\";\nerror(1, v8, \"execl error\");\n}\nclose(pipedes[1]);\nclose(v11[0]);\n*a2 = pipedes[0];\n*a3 = v11[1];\nreturn (unsigned int)v29;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1, _DWORD *a2, _DWORD *a3)\n{\nint v3; // eax\nint v4; // eax\nint v5; // eax\nint v6; // eax\nchar *v7; // rax\nint v8; // eax\nint v11[2]; // [rsp+20h] [rbp-70h] BYREF\nint pipedes[2]; // [rsp+28h] [rbp-68h] BYREF\nchar *v13; // [rsp+30h] [rbp-60h]\nint v14; // [rsp+38h] [rbp-58h]\nint v15; // [rsp+3Ch] [rbp-54h]\nchar *v16; // [rsp+40h] [rbp-50h]\nint v17; // [rsp+48h] [rbp-48h]\nint v18; // [rsp+4Ch] [rbp-44h]\nchar *v19; // [rsp+50h] [rbp-40h]\nint v20; // [rsp+58h] [rbp-38h]\nint v21; // [rsp+5Ch] [rbp-34h]\nchar *v22; // [rsp+60h] [rbp-30h]\nint v23; // [rsp+68h] [rbp-28h]\nint v24; // [rsp+6Ch] [rbp-24h]\nchar *format; // [rsp+70h] [rbp-20h]\nint errnum; // [rsp+78h] [rbp-18h]\nint status; // [rsp+7Ch] [rbp-14h]\nchar *path; // [rsp+80h] [rbp-10h]\n__pid_t v29; // [rsp+8Ch] [rbp-4h]\n\nif ( pipe(pipedes) < 0 || pipe(v11) < 0 )\n{\nv3 = *_errno_location();\nstatus = 1;\nerrnum = v3;\nformat = \"pipe error\";\nerror(1, v3, \"pipe error\");\n}\nv29 = fork();\nif ( v29 < 0 )\n{\nv4 = *_errno_location();\nv24 = 1;\nv23 = v4;\nv22 = \"fork error\";\nerror(1, v4, \"fork error\");\n}\nif ( !v29 )\n{\nclose(pipedes[0]);\nclose(v11[1]);\nif ( dup2(v11[0], 0) < 0 )\n{\nv5 = *_errno_location();\nv21 = 1;\nv20 = v5;\nv19 = \"dup2 error\";\nerror(1, v5, \"dup2 error\");\n}\nif ( dup2(pipedes[1], 1) < 0 )\n{\nv6 = *_errno_location();\nv18 = 1;\nv17 = v6;\nv16 = \"dup2 error\";\nerror(1, v6, \"dup2 error\");\n}\nclose(v11[0]);\npath = (char *)func0();\nv7 = func1(path);\nexecl(path, v7, \"-c\", a1, 0LL);\nv8 = *_errno_location();\nv15 = 1;\nv14 = v8;\nv13 = \"execl error\";\nerror(1, v8, \"execl error\");\n}\nclose(pipedes[1]);\nclose(v11[0]);\n*a2 = pipedes[0];\n*a3 = v11[1];\nreturn (unsigned int)v29;\n}",
"original_code": "int spawn_process(const char* cmd, int* in, int* out)\n{\n int in_fds[2], out_fds[2];\n if (pipe(in_fds) < 0 || pipe(out_fds) < 0) {\n error(1, (*__errno_location ()), \"pipe error\");\n }\n int pid = fork();\n if (pid < 0) {\n error(1, (*__errno_location ()), \"fork error\");\n }\n if (pid == 0) {\n close(in_fds[0]);\n close(out_fds[1]);\n if (dup2(out_fds[0], 0) < 0) {\n error(1, (*__errno_location ()), \"dup2 error\");\n }\n if (dup2(in_fds[1], 1) < 0) {\n error(1, (*__errno_location ()), \"dup2 error\");\n }\n close(out_fds[0]);\n char* shell = get_shell();\n execl(shell, last_component(shell), \"-c\", cmd, ((void *)0));\n error(1, (*__errno_location ()), \"execl error\");\n }\n close(in_fds[1]);\n close(out_fds[0]);\n *in = in_fds[0];\n *out = out_fds[1];\n return pid;\n}",
"canonical_original_code": "int spawn_process(char *cmd, int *in, int *out)\n{\n int in_fds[2]; int out_fds[2];\n if (pipe(in_fds) < 0 || pipe(out_fds) < 0) {\n error(1, (*__errno_location ()), \"pipe error\");\n }\n int pid = fork();\n if (pid < 0) {\n error(1, (*__errno_location ()), \"fork error\");\n }\n if (pid == 0) {\n close(in_fds[0]);\n close(out_fds[1]);\n if (dup2(out_fds[0], 0) < 0) {\n error(1, (*__errno_location ()), \"dup2 error\");\n }\n if (dup2(in_fds[1], 1) < 0) {\n error(1, (*__errno_location ()), \"dup2 error\");\n }\n close(out_fds[0]);\n char *shell = get_shell();\n execl(shell, last_component(shell), \"-c\", cmd, ((void *)0));\n error(1, (*__errno_location ()), \"execl error\");\n }\n close(in_fds[1]);\n close(out_fds[0]);\n *in = in_fds[0];\n *out = out_fds[1];\n return pid;\n}",
"variable_types": [
[
"cmd",
"char *"
],
[
"in",
"int *"
],
[
"out",
"int *"
],
[
"in_fds",
"int [2]"
],
[
"out_fds",
"int [2]"
],
[
"pid",
"int"
],
[
"shell",
"char *"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "15769cb1623e71719d5ca7d1996f982c834438f8eda1115b75e7438657fbb990"
}
] |
286ff8f912dc30d4bea862416dbc33224b82db8127c62e2bcd1d1bd5728183b4 | lilingxin/mapred | [
[
"event_handler",
"->"
],
[
"revent_handler",
"->"
],
[
"thread_init",
"->"
],
[
"thread_add",
"->"
],
[
"wthread_proc",
"->"
],
[
"rthread_proc",
"->"
],
[
"thread_start",
"->"
],
[
"thread_term",
"->"
]
] | [
[
"event_handler",
"__int64 __fastcall func0(int a1, __int64 a2, __int64 a3)\n{\n__int64 result; // rax\nint *v4; // rax\nchar *v5; // rax\nint *v6; // rax\nchar *v7; // rax\nsize_t n; // [rsp+10h] [rbp-30h] BYREF\nvoid *buf; // [rsp+18h] [rbp-28h] BYREF\n__int64 v10; // [rsp+20h] [rbp-20h]\nint v11; // [rsp+2Ch] [rbp-14h]\npthread_t *v12; // [rsp+30h] [rbp-10h]\nint v13; // [rsp+3Ch] [rbp-4h]\n\nv13 = *((_DWORD *)wet + 12);\nv12 = wet + 2;\nv11 = -1;\nbuf = 0LL;\nn = 0LL;\nresult = a3;\nv10 = a3;\nif ( v13 == 3 )\n{\nclose(a1);\nresult = event_del(v10);\n}\nelse if ( v13 <= 3 )\n{\nif ( v13 == 2 )\n{\nif ( write(a1, (const void *)v12[1], v12[2]) < 0 )\n{\nv4 = _errno_location();\nv5 = strerror(*v4);\nfprintf(stderr, \"write error, %s\\n\", v5);\n}\nresult = (__int64)update_stat(3);\n}\nelse if ( v13 )\n{\nif ( v13 == 1 )\n{\nif ( (unsigned int)get_line(v12, &buf, &n) )\n{\nresult = (__int64)update_stat(0);\n}\nelse\n{\nresult = write(a1, buf, n);\nif ( result < 0 )\n{\nv6 = _errno_location();\nv7 = strerror(*v6);\nfprintf(stderr, \"write error, %s\\n\", v7);\nresult = (__int64)update_stat(3);\n}\n}\n}\n}\nelse if ( (unsigned int)try_read_more(v12, 0LL) == 1 )\n{\nresult = (__int64)update_stat(2);\n}\nelse\n{\nresult = (__int64)update_stat(1);\n}\n}\nreturn result;\n}"
],
[
"revent_handler",
"__int64 __fastcall func1(unsigned int a1, __int64 a2, __int64 a3)\n{\n__int64 result; // rax\nsize_t n; // [rsp+10h] [rbp-20h] BYREF\nvoid *buf; // [rsp+18h] [rbp-18h] BYREF\n__int64 v6; // [rsp+20h] [rbp-10h]\n__int64 v7; // [rsp+28h] [rbp-8h]\n\nv7 = a3;\nv6 = a3 + 136;\nbuf = 0LL;\nn = 0LL;\nif ( (unsigned int)try_read_more(a3 + 136, a1) == 1 )\n{\nwrite(1, *(const void **)(v6 + 8), *(_QWORD *)(v6 + 16));\nresult = event_del(v7 + 8);\n}\nelse\n{\nwhile ( 1 )\n{\nresult = get_line(v6, &buf, &n);\nif ( (_DWORD)result )\nbreak;\nwrite(1, buf, n);\n}\n}\nreturn result;\n}"
],
[
"thread_init",
"__int64 __fastcall func2(int a1)\n{\npthread_t *v1; // rbx\npthread_t *v2; // rbx\n\nwet = (pthread_t *)malloc(((__int64)a1 << 7) + 56);\nv1 = wet;\nv1[1] = event_base_new();\n*((_DWORD *)wet + 13) = a1;\n*((_DWORD *)wet + 12) = 0;\ninit_buf(wet + 2, 4096LL);\nret = (pthread_t *)malloc(168LL * a1 + 24);\nv2 = ret;\nv2[1] = event_base_new();\n*((_DWORD *)ret + 4) = a1;\nreturn 0LL;\n}"
],
[
"thread_add",
"__int64 __fastcall func3(unsigned int a1, unsigned int a2)\n{\n__int64 result; // rax\npthread_t *v3; // [rsp+18h] [rbp-8h]\n\nif ( *((_DWORD *)wet + 13) > i_0 )\n{\nevent_set(&wet[16 * (__int64)i_0 + 7], a1, 20LL, event_handler, &wet[16 * (__int64)i_0 + 7]);\nevent_base_set(wet[1], &wet[16 * (__int64)i_0 + 7]);\nevent_add(&wet[16 * (__int64)i_0 + 7], 0LL);\nv3 = ret + 3;\nevent_set(&ret[21 * i_0 + 4], a2, 18LL, revent_handler, &ret[21 * i_0 + 3]);\nevent_base_set(ret[1], &v3[21 * i_0 + 1]);\nevent_add(&v3[21 * i_0 + 1], 0LL);\ninit_buf(&v3[21 * i_0 + 17], 4096LL);\n++i_0;\nresult = 0LL;\n}\nelse\n{\nfwrite(\"thread add error, out of bouder\\n\", 1uLL, 0x20uLL, stderr);\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}"
],
[
"wthread_proc",
"void *__fastcall func4(void *a1)\n{\nevent_base_loop(*((_QWORD *)a1 + 1), 0LL);\nreturn 0LL;\n}"
],
[
"rthread_proc",
"void *__fastcall func5(void *a1)\n{\nevent_base_loop(*((_QWORD *)a1 + 1), 0LL);\nreturn 0LL;\n}"
]
] | [
{
"name": "thread_start",
"canonical_name": "func6",
"repo": "lilingxin/mapred",
"decompiled_code": "__int64 thread_start()\n{\nif ( pthread_create(wet, 0LL, wthread_proc, wet) >= 0 && pthread_create(ret, 0LL, rthread_proc, ret) >= 0 )\nreturn 0LL;\nfwrite(\"pthread_create error\\n\", 1uLL, 0x15uLL, stderr);\nreturn 0xFFFFFFFFLL;\n}\n",
"canonical_decompiled_code": "__int64 func6()\n{\nif ( pthread_create(wet, 0LL, wthread_proc, wet) >= 0 && pthread_create(ret, 0LL, rthread_proc, ret) >= 0 )\nreturn 0LL;\nfwrite(\"pthread_create error\\n\", 1uLL, 0x15uLL, stderr);\nreturn 0xFFFFFFFFLL;\n}",
"original_code": "int thread_start()\n{\n if (pthread_create(&wet->id, ((void *)0), wthread_proc, (void*)wet) < 0) {\n fprintf(stderr, \"pthread_create error\\n\");\n return -1;\n }\n if (pthread_create(&ret->id, ((void *)0), rthread_proc, (void*)ret) < 0) {\n fprintf(stderr, \"pthread_create error\\n\");\n return -1;\n }\n return 0;\n}",
"canonical_original_code": "int thread_start()\n{\n if (pthread_create(&wet->id, ((void *)0), wthread_proc, (void *)wet) < 0) {\n fprintf(stderr, \"pthread_create error\\n\");\n return -1;\n }\n if (pthread_create(&ret->id, ((void *)0), rthread_proc, (void *)ret) < 0) {\n fprintf(stderr, \"pthread_create error\\n\");\n return -1;\n }\n return 0;\n}",
"variable_types": [],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "286ff8f912dc30d4bea862416dbc33224b82db8127c62e2bcd1d1bd5728183b4"
},
{
"name": "thread_term",
"canonical_name": "func7",
"repo": "lilingxin/mapred",
"decompiled_code": "__int64 thread_term()\n{\nvoid *thread_return; // [rsp+0h] [rbp-10h] BYREF\nint i; // [rsp+Ch] [rbp-4h]\n\nevent_base_free(wet[1]);\nterm_buf(wet + 2);\nfree(wet);\nthread_return = 0LL;\npthread_join(*ret, &thread_return);\nevent_base_free(ret[1]);\nfor ( i = 0; i < *((_DWORD *)ret + 4); ++i )\nterm_buf(&ret[21 * i + 20]);\nfree(ret);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 func7()\n{\nvoid *thread_return; // [rsp+0h] [rbp-10h] BYREF\nint i; // [rsp+Ch] [rbp-4h]\n\nevent_base_free(wet[1]);\nterm_buf(wet + 2);\nfree(wet);\nthread_return = 0LL;\npthread_join(*ret, &thread_return);\nevent_base_free(ret[1]);\nfor ( i = 0; i < *((_DWORD *)ret + 4); ++i )\nterm_buf(&ret[21 * i + 20]);\nfree(ret);\nreturn 0LL;\n}",
"original_code": "int thread_term()\n{\n event_base_free(wet->base);\n term_buf(&wet->buf);\n free(wet);\n void* retval = ((void *)0);\n pthread_join(ret->id, &retval);\n event_base_free(ret->base);\n for (int i = 0; i < ret->evno; ++i) {\n term_buf(&ret->evs[i].buf);\n }\n free(ret);\n return 0;\n}",
"canonical_original_code": "int thread_term()\n{\n event_base_free(wet->base);\n term_buf(&wet->buf);\n free(wet);\n void *retval = ((void *)0);\n pthread_join(ret->id, &retval);\n event_base_free(ret->base);\n for (int i = 0; i < ret->evno; ++i) {\n term_buf(&ret->evs[i].buf);\n }\n free(ret);\n return 0;\n}",
"variable_types": [
[
"retval",
"void *"
],
[
"i",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "286ff8f912dc30d4bea862416dbc33224b82db8127c62e2bcd1d1bd5728183b4"
}
] |
5a7e97ff47c48524e182960514f1e613a08f298904823fd9826d6c3a8302e0b6 | lilingxin/mapred | [
[
"usage",
"->",
"getopts"
],
[
"getopts",
"->",
"usage",
"main"
],
[
"sig_handler",
"->"
],
[
"main",
"->",
"getopts"
]
] | [] | [
{
"name": "usage",
"canonical_name": "func0",
"repo": "lilingxin/mapred",
"decompiled_code": "int __fastcall usage(const char *a1)\n{\nreturn fprintf(\nstdout,\n\"%s usage : \\n\"\n\"%s [option] [INPUT] \\n\"\n\"option is :\\n\"\n\" --mapper | -m the command to execute in shell\\n\"\n\" --count | -c the process num in background\\n\"\n\" --help | -h \\n\",\na1,\na1);\n}\n",
"canonical_decompiled_code": "int __fastcall func0(const char *a1)\n{\nreturn fprintf(\nstdout,\n\"%s usage : \\n\"\n\"%s [option] [INPUT] \\n\"\n\"option is :\\n\"\n\" --mapper | -m the command to execute in shell\\n\"\n\" --count | -c the process num in background\\n\"\n\" --help | -h \\n\",\na1,\na1);\n}",
"original_code": "static void usage(char* proc)\n{\n fprintf(stdout, \"%s usage : \\n\"\n \"%s [option] [INPUT] \\n\"\n \"option is :\\n\"\n \" --mapper | -m the command to execute in shell\\n\"\n \" --count | -c the process num in background\\n\"\n \" --help | -h \\n\"\n , proc, proc);\n}",
"canonical_original_code": "static void usage(char *proc)\n{\n fprintf(stdout, \"%s usage : \\n\"\n \"%s [option] [INPUT] \\n\"\n \"option is :\\n\"\n \" --mapper | -m the command to execute in shell\\n\"\n \" --count | -c the process num in background\\n\"\n \" --help | -h \\n\"\n , proc, proc);\n}",
"variable_types": [
[
"proc",
"char *"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "5a7e97ff47c48524e182960514f1e613a08f298904823fd9826d6c3a8302e0b6"
},
{
"name": "getopts",
"canonical_name": "func1",
"repo": "lilingxin/mapred",
"decompiled_code": "__int64 __fastcall getopts(int a1, char *const *a2)\n{\nint i; // eax\nsize_t v3; // rax\nint v4; // eax\nint v5; // eax\nstruct option longopts; // [rsp+10h] [rbp-90h] BYREF\nconst char *v8; // [rsp+30h] [rbp-70h]\nint v9; // [rsp+38h] [rbp-68h]\n__int64 v10; // [rsp+40h] [rbp-60h]\nint v11; // [rsp+48h] [rbp-58h]\nconst char *v12; // [rsp+50h] [rbp-50h]\nint v13; // [rsp+58h] [rbp-48h]\n__int64 v14; // [rsp+60h] [rbp-40h]\nint v15; // [rsp+68h] [rbp-38h]\nchar *format; // [rsp+70h] [rbp-30h]\nunsigned int lineno; // [rsp+7Ch] [rbp-24h]\nchar *fname; // [rsp+80h] [rbp-20h]\nint errnum; // [rsp+88h] [rbp-18h]\nint status; // [rsp+8Ch] [rbp-14h]\nint fd; // [rsp+90h] [rbp-10h]\nint v22; // [rsp+94h] [rbp-Ch]\nchar *shortopts; // [rsp+98h] [rbp-8h]\n\nshortopts = \"m:c:h\";\nlongopts.name = \"mapper\";\nlongopts.has_arg = 1;\nlongopts.flag = 0LL;\nlongopts.val = 109;\nv8 = \"count\";\nv9 = 1;\nv10 = 0LL;\nv11 = 99;\nv12 = \"help\";\nv13 = 0;\nv14 = 0LL;\nv15 = 104;\nv22 = -1;\nfor ( i = getopt_long(a1, a2, \"m:c:h\", &longopts, 0LL); ; i = getopt_long(a1, a2, shortopts, &longopts, 0LL) )\n{\nv22 = i;\nif ( i == -1 )\nbreak;\nif ( v22 == 109 )\n{\nmemset(&cmd, 0, 0x1000uLL);\nv3 = strlen(optarg);\nmemcpy(&cmd, optarg, v3);\n}\nelse if ( v22 <= 109 )\n{\nif ( v22 == 99 )\n{\ncount = atoi(optarg);\n}\nelse if ( v22 == 104 )\n{\nusage(*(const char **)a2);\n}\n}\n}\nif ( a1 > optind )\n{\nv4 = optind++;\nfd = open(a2[v4], 0);\nif ( fd < 0 || dup2(fd, 0) < 0 )\n{\nv5 = *_errno_location();\nstatus = 1;\nerrnum = v5;\nfname = \"main.c\";\nlineno = 68;\nformat = \"open file error\";\nerror_at_line(1, v5, \"main.c\", 0x44u, \"open file error\");\n}\nclose(fd);\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(int a1, char *const *a2)\n{\nint i; // eax\nsize_t v3; // rax\nint v4; // eax\nint v5; // eax\nstruct option longopts; // [rsp+10h] [rbp-90h] BYREF\nconst char *v8; // [rsp+30h] [rbp-70h]\nint v9; // [rsp+38h] [rbp-68h]\n__int64 v10; // [rsp+40h] [rbp-60h]\nint v11; // [rsp+48h] [rbp-58h]\nconst char *v12; // [rsp+50h] [rbp-50h]\nint v13; // [rsp+58h] [rbp-48h]\n__int64 v14; // [rsp+60h] [rbp-40h]\nint v15; // [rsp+68h] [rbp-38h]\nchar *format; // [rsp+70h] [rbp-30h]\nunsigned int lineno; // [rsp+7Ch] [rbp-24h]\nchar *fname; // [rsp+80h] [rbp-20h]\nint errnum; // [rsp+88h] [rbp-18h]\nint status; // [rsp+8Ch] [rbp-14h]\nint fd; // [rsp+90h] [rbp-10h]\nint v22; // [rsp+94h] [rbp-Ch]\nchar *shortopts; // [rsp+98h] [rbp-8h]\n\nshortopts = \"m:c:h\";\nlongopts.name = \"mapper\";\nlongopts.has_arg = 1;\nlongopts.flag = 0LL;\nlongopts.val = 109;\nv8 = \"count\";\nv9 = 1;\nv10 = 0LL;\nv11 = 99;\nv12 = \"help\";\nv13 = 0;\nv14 = 0LL;\nv15 = 104;\nv22 = -1;\nfor ( i = getopt_long(a1, a2, \"m:c:h\", &longopts, 0LL); ; i = getopt_long(a1, a2, shortopts, &longopts, 0LL) )\n{\nv22 = i;\nif ( i == -1 )\nbreak;\nif ( v22 == 109 )\n{\nmemset(&cmd, 0, 0x1000uLL);\nv3 = strlen(optarg);\nmemcpy(&cmd, optarg, v3);\n}\nelse if ( v22 <= 109 )\n{\nif ( v22 == 99 )\n{\ncount = atoi(optarg);\n}\nelse if ( v22 == 104 )\n{\nfunc0(*(const char **)a2);\n}\n}\n}\nif ( a1 > optind )\n{\nv4 = optind++;\nfd = open(a2[v4], 0);\nif ( fd < 0 || dup2(fd, 0) < 0 )\n{\nv5 = *_errno_location();\nstatus = 1;\nerrnum = v5;\nfname = \"main.c\";\nlineno = 68;\nformat = \"open file error\";\nerror_at_line(1, v5, \"main.c\", 0x44u, \"open file error\");\n}\nclose(fd);\n}\nreturn 0LL;\n}",
"original_code": "int getopts(int argc, char** argv)\n{\n char* short_opt = \"m:c:h\";\n struct option long_opt[] = {\n {\"mapper\", 1, ((void *)0), 'm'},\n {\"count\", 1, ((void *)0), 'c'},\n {\"help\", 0, ((void *)0), 'h'}\n };\n int o = -1;\n while ((o = getopt_long(argc, argv, short_opt, long_opt, ((void *)0))) != -1) {\n switch (o) {\n case 'm':\n memset(cmd, 0, 4096);\n memcpy(cmd, optarg, strlen(optarg));\n break;\n case 'c':\n count = atoi(optarg);\n break;\n case 'h':\n usage(argv[0]);\n break;\n }\n }\n if (optind < argc) {\n int fd = open(argv[optind++], 00);\n if (fd < 0 || dup2(fd, 0) < 0) {\n error_at_line(1, (*__errno_location ()), \"main.c\", 68, \"open file error\");\n }\n close(fd);\n }\n return 0;\n}",
"canonical_original_code": "int getopts(int argc, char **argv)\n{\n char *short_opt = \"m:c:h\";\n struct option long_opt[] = {\n {\"mapper\", 1, ((void *)0), 'm'},\n {\"count\", 1, ((void *)0), 'c'},\n {\"help\", 0, ((void *)0), 'h'}\n };\n int o = -1;\n while ((o = getopt_long(argc, argv, short_opt, long_opt, ((void *)0))) != -1) {\n switch (o) {\n case 'm':\n memset(cmd, 0, 4096);\n memcpy(cmd, optarg, strlen(optarg));\n break;\n case 'c':\n count = atoi(optarg);\n break;\n case 'h':\n usage(argv[0]);\n break;\n }\n }\n if (optind < argc) {\n int fd = open(argv[optind++], 00);\n if (fd < 0 || dup2(fd, 0) < 0) {\n error_at_line(1, (*__errno_location ()), \"main.c\", 68, \"open file error\");\n }\n close(fd);\n }\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char **"
],
[
"short_opt",
"char *"
],
[
"long_opt",
"struct option { char *name; int has_arg; int *flag; int val; } []"
],
[
"o",
"int"
],
[
"fd",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct option { char *name; int has_arg; int *flag; int val; }"
],
"binary_hash": "5a7e97ff47c48524e182960514f1e613a08f298904823fd9826d6c3a8302e0b6"
},
{
"name": "sig_handler",
"canonical_name": "func2",
"repo": "lilingxin/mapred",
"decompiled_code": "void __fastcall sig_handler(int a1)\n{\nint i; // [rsp+1Ch] [rbp-4h]\n\nif ( a1 == 3 || a1 == 15 || a1 == 2 )\n{\nfor ( i = 0; i < count; ++i )\nkill(pids[i], a1);\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func2(int a1)\n{\nint i; // [rsp+1Ch] [rbp-4h]\n\nif ( a1 == 3 || a1 == 15 || a1 == 2 )\n{\nfor ( i = 0; i < count; ++i )\nkill(pids[i], a1);\n}\n}",
"original_code": "void sig_handler(int signo)\n{\n if (signo == 3 || signo == 15\n || signo == 2) {\n for (int i = 0; i < count; ++i) {\n kill(pids[i], signo);\n }\n }\n}",
"canonical_original_code": "void sig_handler(int signo)\n{\n if (signo == 3 || signo == 15\n || signo == 2) {\n for (int i = 0; i < count; ++i) {\n kill(pids[i], signo);\n }\n }\n}",
"variable_types": [
[
"signo",
"int"
],
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "5a7e97ff47c48524e182960514f1e613a08f298904823fd9826d6c3a8302e0b6"
},
{
"name": "main",
"canonical_name": "main",
"repo": "lilingxin/mapred",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nunsigned int v4; // [rsp+10h] [rbp-10h] BYREF\nunsigned int v5; // [rsp+14h] [rbp-Ch] BYREF\n__pid_t v6; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nsignal(13, handler);\nsignal(3, sig_handler);\nsignal(2, sig_handler);\nsignal(15, sig_handler);\ngetopts(argc, (char *const *)argv);\nthread_init((unsigned int)count);\nv5 = 0;\nv4 = 0;\nfor ( i = 0; i < count; ++i )\n{\nv6 = spawn_process(&cmd, &v5, &v4);\nset_cloexec(v4);\nset_cloexec(v5);\nthread_add(v4, v5);\npids[i] = v6;\n}\nthread_start();\nwait_children();\nthread_term();\nreturn 0;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nunsigned int v4; // [rsp+10h] [rbp-10h] BYREF\nunsigned int v5; // [rsp+14h] [rbp-Ch] BYREF\n__pid_t v6; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nsignal(13, handler);\nsignal(3, sig_handler);\nsignal(2, sig_handler);\nsignal(15, sig_handler);\nfunc1(argc, (char *const *)argv);\nthread_init((unsigned int)count);\nv5 = 0;\nv4 = 0;\nfor ( i = 0; i < count; ++i )\n{\nv6 = spawn_process(&cmd, &v5, &v4);\nset_cloexec(v4);\nset_cloexec(v5);\nthread_add(v4, v5);\npids[i] = v6;\n}\nthread_start();\nwait_children();\nthread_term();\nreturn 0;\n}",
"original_code": "int main(int argc, char* argv[])\n{\n signal(13, ((__sighandler_t) 1));\n signal(3, sig_handler);\n signal(2, sig_handler);\n signal(15, sig_handler);\n getopts(argc, argv);\n thread_init(count);\n int in = 0, out = 0;\n for (int i = 0; i < count; ++i) {\n int pid = spawn_process(cmd, &in, &out);\n set_cloexec(out);\n set_cloexec(in);\n thread_add(out, in);\n pids[i] = pid;\n }\n thread_start();\n wait_children();\n thread_term();\n return 0;\n}",
"canonical_original_code": "int main(int argc, char *argv[])\n{\n signal(13, ((void (*)(int)) 1));\n signal(3, sig_handler);\n signal(2, sig_handler);\n signal(15, sig_handler);\n getopts(argc, argv);\n thread_init(count);\n int in = 0; int out = 0;\n for (int i = 0; i < count; ++i) {\n int pid = spawn_process(cmd, &in, &out);\n set_cloexec(out);\n set_cloexec(in);\n thread_add(out, in);\n pids[i] = pid;\n }\n thread_start();\n wait_children();\n thread_term();\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char *[]"
],
[
"in",
"int"
],
[
"out",
"int"
],
[
"i",
"int"
],
[
"pid",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "5a7e97ff47c48524e182960514f1e613a08f298904823fd9826d6c3a8302e0b6"
}
] |
6ee796c0cc1dc0c52fe4a5314a305322e3acb4046d32050281d7d46dae701c5a | lilingxin/mapred | [
[
"init_buf",
"->"
],
[
"term_buf",
"->"
],
[
"try_read_more",
"->"
],
[
"get_line",
"->"
]
] | [] | [
{
"name": "init_buf",
"canonical_name": "func0",
"repo": "lilingxin/mapred",
"decompiled_code": "__int64 __fastcall init_buf(void **a1, int a2)\n{\na1[3] = (void *)a2;\na1[2] = 0LL;\n*a1 = malloc((size_t)a1[3]);\nif ( !*a1 )\nreturn 1LL;\na1[1] = *a1;\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(void **a1, int a2)\n{\na1[3] = (void *)a2;\na1[2] = 0LL;\n*a1 = malloc((size_t)a1[3]);\nif ( !*a1 )\nreturn 1LL;\na1[1] = *a1;\nreturn 0LL;\n}",
"original_code": "int init_buf(struct buf_t* b, int alloc)\n{\n b->capacity = alloc;\n b->bytes = 0;\n b->ptr = (char*) malloc(b->capacity);\n if (!b->ptr) {\n return E_ERROR;\n }\n b->cur = b->ptr;\n return E_OK;\n}",
"canonical_original_code": "int init_buf(struct buf_t *b, int alloc)\n{\n b->capacity = alloc;\n b->bytes = 0;\n b->ptr = (char *) malloc(b->capacity);\n if (!b->ptr) {\n return E_ERROR;\n }\n b->cur = b->ptr;\n return E_OK;\n}",
"variable_types": [
[
"b",
"struct buf_t { char *ptr; char *cur; unsigned long bytes; unsigned long capacity; } *"
],
[
"alloc",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct buf_t { char *ptr; char *cur; unsigned long bytes; unsigned long capacity; }"
],
"binary_hash": "6ee796c0cc1dc0c52fe4a5314a305322e3acb4046d32050281d7d46dae701c5a"
},
{
"name": "term_buf",
"canonical_name": "func1",
"repo": "lilingxin/mapred",
"decompiled_code": "__int64 __fastcall term_buf(__int64 a1)\n{\nif ( *(_QWORD *)a1 )\nfree(*(void **)a1);\n*(_QWORD *)(a1 + 8) = 0LL;\n*(_QWORD *)a1 = *(_QWORD *)(a1 + 8);\n*(_QWORD *)(a1 + 16) = 0LL;\n*(_QWORD *)(a1 + 24) = *(_QWORD *)(a1 + 16);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1)\n{\nif ( *(_QWORD *)a1 )\nfree(*(void **)a1);\n*(_QWORD *)(a1 + 8) = 0LL;\n*(_QWORD *)a1 = *(_QWORD *)(a1 + 8);\n*(_QWORD *)(a1 + 16) = 0LL;\n*(_QWORD *)(a1 + 24) = *(_QWORD *)(a1 + 16);\nreturn 0LL;\n}",
"original_code": "int term_buf(struct buf_t* b)\n{\n if (b->ptr) {\n free(b->ptr);\n }\n b->ptr = b->cur = ((void *)0);\n b->capacity = b->bytes = 0;\n return E_OK;\n}",
"canonical_original_code": "int term_buf(struct buf_t *b)\n{\n if (b->ptr) {\n free(b->ptr);\n }\n b->ptr = b->cur = ((void *)0);\n b->capacity = b->bytes = 0;\n return E_OK;\n}",
"variable_types": [
[
"b",
"struct buf_t { char *ptr; char *cur; unsigned long bytes; unsigned long capacity; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct buf_t { char *ptr; char *cur; unsigned long bytes; unsigned long capacity; }"
],
"binary_hash": "6ee796c0cc1dc0c52fe4a5314a305322e3acb4046d32050281d7d46dae701c5a"
},
{
"name": "try_read_more",
"canonical_name": "func2",
"repo": "lilingxin/mapred",
"decompiled_code": "__int64 __fastcall try_read_more(__int64 a1, int a2)\n{\nint *v3; // rax\nchar *v4; // rax\nint errnum; // [rsp+28h] [rbp-18h]\nint v6; // [rsp+30h] [rbp-10h]\nvoid *v7; // [rsp+38h] [rbp-8h]\n\nif ( *(_QWORD *)(a1 + 8) != *(_QWORD *)a1 )\n{\nif ( *(_QWORD *)(a1 + 16) )\nmemmove(*(void **)a1, *(const void **)(a1 + 8), *(_QWORD *)(a1 + 16));\n*(_QWORD *)(a1 + 8) = *(_QWORD *)a1;\n}\nif ( *(_QWORD *)(a1 + 16) >= *(_QWORD *)(a1 + 24) )\n{\nv7 = realloc(*(void **)a1, 2LL * *(_QWORD *)(a1 + 24));\nif ( !v7 )\n{\nerrnum = *_errno_location();\nerror_at_line(1, errnum, \"buf.c\", 0x2Du, \"not enough memory, realloc buf\");\n}\n*(_QWORD *)a1 = v7;\n*(_QWORD *)(a1 + 8) = *(_QWORD *)a1;\n*(_QWORD *)(a1 + 24) *= 2LL;\n}\nv6 = read(\na2,\n(void *)(*(_QWORD *)(a1 + 16) + *(_QWORD *)(a1 + 8)),\n(int)(*(_QWORD *)(a1 + 24) - *(_QWORD *)(a1 + 16)));\nif ( v6 > 0 )\n*(_QWORD *)(a1 + 16) += v6;\nif ( !v6 )\nreturn 1LL;\nif ( v6 >= 0 )\nreturn 0LL;\nif ( *_errno_location() == 11 || *_errno_location() == 11 )\nreturn 0LL;\nv3 = _errno_location();\nv4 = strerror(*v3);\nfprintf(stderr, \"read error, %s\\n\", v4);\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, int a2)\n{\nint *v3; // rax\nchar *v4; // rax\nint errnum; // [rsp+28h] [rbp-18h]\nint v6; // [rsp+30h] [rbp-10h]\nvoid *v7; // [rsp+38h] [rbp-8h]\n\nif ( *(_QWORD *)(a1 + 8) != *(_QWORD *)a1 )\n{\nif ( *(_QWORD *)(a1 + 16) )\nmemmove(*(void **)a1, *(const void **)(a1 + 8), *(_QWORD *)(a1 + 16));\n*(_QWORD *)(a1 + 8) = *(_QWORD *)a1;\n}\nif ( *(_QWORD *)(a1 + 16) >= *(_QWORD *)(a1 + 24) )\n{\nv7 = realloc(*(void **)a1, 2LL * *(_QWORD *)(a1 + 24));\nif ( !v7 )\n{\nerrnum = *_errno_location();\nerror_at_line(1, errnum, \"buf.c\", 0x2Du, \"not enough memory, realloc buf\");\n}\n*(_QWORD *)a1 = v7;\n*(_QWORD *)(a1 + 8) = *(_QWORD *)a1;\n*(_QWORD *)(a1 + 24) *= 2LL;\n}\nv6 = read(\na2,\n(void *)(*(_QWORD *)(a1 + 16) + *(_QWORD *)(a1 + 8)),\n(int)(*(_QWORD *)(a1 + 24) - *(_QWORD *)(a1 + 16)));\nif ( v6 > 0 )\n*(_QWORD *)(a1 + 16) += v6;\nif ( !v6 )\nreturn 1LL;\nif ( v6 >= 0 )\nreturn 0LL;\nif ( *_errno_location() == 11 || *_errno_location() == 11 )\nreturn 0LL;\nv3 = _errno_location();\nv4 = strerror(*v3);\nfprintf(stderr, \"read error, %s\\n\", v4);\nreturn 1LL;\n}",
"original_code": "int try_read_more(struct buf_t* b, int fd)\n{\n if (b->cur != b->ptr) {\n if (b->bytes != 0) {\n memmove(b->ptr, b->cur, b->bytes);\n }\n b->cur = b->ptr;\n }\n if (b->bytes >= b->capacity) {\n char* new_ptr = (char*)realloc(b->ptr, b->capacity * 2);\n if (!new_ptr) {\n error_at_line(1, (*__errno_location ()), \"buf.c\", 45, \"not enough memory, realloc buf\");\n }\n b->cur = b->ptr = new_ptr;\n b->capacity *= 2;\n }\n int avail = b->capacity - b->bytes;\n int nread = read(fd, b->cur + b->bytes, avail);\n if (nread > 0) {\n b->bytes += nread;\n }\n if (nread == 0) return E_ERROR;\n if (nread < 0) {\n if ((*__errno_location ()) == 11 || (*__errno_location ()) == 11) {\n return E_OK;\n }\n fprintf(stderr, \"read error, %s\\n\", strerror((*__errno_location ())));\n return E_ERROR;\n }\n return E_OK;\n}",
"canonical_original_code": "int try_read_more(struct buf_t *b, int fd)\n{\n if (b->cur != b->ptr) {\n if (b->bytes != 0) {\n memmove(b->ptr, b->cur, b->bytes);\n }\n b->cur = b->ptr;\n }\n if (b->bytes >= b->capacity) {\n char *new_ptr = (char*)realloc(b->ptr, b->capacity * 2);\n if (!new_ptr) {\n error_at_line(1, (*__errno_location ()), \"buf.c\", 45, \"not enough memory, realloc buf\");\n }\n b->cur = b->ptr = new_ptr;\n b->capacity *= 2;\n }\n int avail = b->capacity - b->bytes;\n int nread = read(fd, b->cur + b->bytes, avail);\n if (nread > 0) {\n b->bytes += nread;\n }\n if (nread == 0) return E_ERROR;\n if (nread < 0) {\n if ((*__errno_location ()) == 11 || (*__errno_location ()) == 11) {\n return E_OK;\n }\n fprintf(stderr, \"read error, %s\\n\", strerror((*__errno_location ())));\n return E_ERROR;\n }\n return E_OK;\n}",
"variable_types": [
[
"b",
"struct buf_t { char *ptr; char *cur; unsigned long bytes; unsigned long capacity; } *"
],
[
"fd",
"int"
],
[
"new_ptr",
"char *"
],
[
"avail",
"int"
],
[
"nread",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct buf_t { char *ptr; char *cur; unsigned long bytes; unsigned long capacity; }"
],
"binary_hash": "6ee796c0cc1dc0c52fe4a5314a305322e3acb4046d32050281d7d46dae701c5a"
},
{
"name": "get_line",
"canonical_name": "func3",
"repo": "lilingxin/mapred",
"decompiled_code": "__int64 __fastcall get_line(__int64 a1, _QWORD *a2, _QWORD *a3)\n{\nchar *v5; // [rsp+28h] [rbp-8h]\nchar *v6; // [rsp+28h] [rbp-8h]\n\nv5 = (char *)memchr(*(const void **)(a1 + 8), 10, *(_QWORD *)(a1 + 16));\nif ( !v5 )\nreturn 2LL;\n*a2 = *(_QWORD *)(a1 + 8);\nv6 = v5 + 1;\n*a3 = &v6[-*(_QWORD *)(a1 + 8)];\n*(_QWORD *)(a1 + 8) = v6;\n*(_QWORD *)(a1 + 16) -= *a3;\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1, _QWORD *a2, _QWORD *a3)\n{\nchar *v5; // [rsp+28h] [rbp-8h]\nchar *v6; // [rsp+28h] [rbp-8h]\n\nv5 = (char *)memchr(*(const void **)(a1 + 8), 10, *(_QWORD *)(a1 + 16));\nif ( !v5 )\nreturn 2LL;\n*a2 = *(_QWORD *)(a1 + 8);\nv6 = v5 + 1;\n*a3 = &v6[-*(_QWORD *)(a1 + 8)];\n*(_QWORD *)(a1 + 8) = v6;\n*(_QWORD *)(a1 + 16) -= *a3;\nreturn 0LL;\n}",
"original_code": "int get_line(struct buf_t* b, char** line, size_t* len)\n{\n char* bp = (char*)memchr(b->cur, '\\n', b->bytes);\n if (bp == ((void *)0)) {\n return E_NEED_MORE;\n }\n *line = b->cur;\n *len = ++bp - b->cur;\n b->cur = bp;\n b->bytes -= *len;\n return E_OK;\n}",
"canonical_original_code": "int get_line(struct buf_t *b, char **line, unsigned long *len)\n{\n char *bp = (char*)memchr(b->cur, '\\n', b->bytes);\n if (bp == ((void *)0)) {\n return E_NEED_MORE;\n }\n *line = b->cur;\n *len = ++bp - b->cur;\n b->cur = bp;\n b->bytes -= *len;\n return E_OK;\n}",
"variable_types": [
[
"b",
"struct buf_t { char *ptr; char *cur; unsigned long bytes; unsigned long capacity; } *"
],
[
"line",
"char **"
],
[
"len",
"unsigned long *"
],
[
"bp",
"char *"
]
],
"return_type": "int",
"user_defined_types": [
"struct buf_t { char *ptr; char *cur; unsigned long bytes; unsigned long capacity; }"
],
"binary_hash": "6ee796c0cc1dc0c52fe4a5314a305322e3acb4046d32050281d7d46dae701c5a"
}
] |
6eaf06fc701952d457cd2376033dade45a2b29f61dafcd9f6cdbda4517d24850 | ptesarik/xcrash-scripts | [
[
"first_node",
"->",
"array_base_type",
"func_return_type",
"func_arg_type",
"is_host_type"
],
[
"ind_is_pointer",
"->",
"ind_base_type",
"is_host_type"
],
[
"build_ind",
"->"
],
[
"array_base_type",
"->",
"first_node",
"ind_base_type"
],
[
"func_return_type",
"->",
"first_node",
"ind_base_type"
],
[
"kr_param_type",
"->",
"func_arg_type"
],
[
"func_arg_type",
"->",
"first_node",
"kr_param_type",
"ind_base_type"
],
[
"ind_base_type",
"->",
"ind_is_pointer",
"array_base_type",
"func_return_type",
"func_arg_type",
"is_host_type"
],
[
"is_host_type",
"->",
"first_node",
"ind_base_type",
"ind_is_pointer"
]
] | [] | [
{
"name": "first_node",
"canonical_name": "func0",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall first_node(__int64 a1)\n{\nreturn *(_QWORD *)a1;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1)\n{\nreturn *(_QWORD *)a1;\n}",
"original_code": "static inline node_t *\nfirst_node(const struct list_head_xcrash *nodelist)\n{\n return ({ const struct list_head_xcrash *__mptr = (nodelist->next); (node_t *)( (char *)__mptr - __builtin_offsetof (node_t, list) );});\n}",
"canonical_original_code": "static inline struct node *first_node(struct list_head_xcrash *nodelist)\n{\n return ({ struct list_head_xcrash *__mptr = (nodelist->next); (struct node *)( (char *)__mptr - __builtin_offsetof (node_t, list) );});\n}",
"variable_types": [
[
"nodelist",
"struct list_head_xcrash *"
],
[
"__mptr",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "6eaf06fc701952d457cd2376033dade45a2b29f61dafcd9f6cdbda4517d24850"
},
{
"name": "ind_is_pointer",
"canonical_name": "func1",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "_BOOL8 __fastcall ind_is_pointer(char a1)\n{\nreturn a1 == -1 || a1 == -3;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func1(char a1)\n{\nreturn a1 == -1 || a1 == -3;\n}",
"original_code": "static inline int\nind_is_pointer(ind_t ind)\n{\n return (ind == ind_pointer || ind == ind_implicit);\n}",
"canonical_original_code": "static inline int ind_is_pointer(char ind)\n{\n return (ind == ind_pointer || ind == ind_implicit);\n}",
"variable_types": [
[
"ind",
"char"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "6eaf06fc701952d457cd2376033dade45a2b29f61dafcd9f6cdbda4517d24850"
},
{
"name": "build_ind",
"canonical_name": "func2",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall build_ind(__int64 a1, _QWORD *a2)\n{\n__int64 v3; // [rsp+8h] [rbp-18h]\n__int64 v4; // [rsp+10h] [rbp-10h]\nchar v5; // [rsp+1Fh] [rbp-1h]\n\nv3 = a1;\nif ( *(_DWORD *)(a1 + 16) )\n_assert_fail(\"type->type == nt_type\", \"indirect.c\", 0xEu, \"build_ind\");\nwhile ( 1 )\n{\nv4 = *(_QWORD *)(v3 + 48);\nif ( *(_DWORD *)(v4 + 16) )\nbreak;\nif ( *(_DWORD *)(v4 + 24) == 5 || *(_DWORD *)(v4 + 24) == 6 )\n{\nv5 = -1;\n}\nelse\n{\nif ( *(_DWORD *)(v4 + 24) != 7 )\n_assert_fail(\"0\", \"indirect.c\", 0x19u, \"build_ind\");\nv5 = -2;\n}\nif ( a2 )\n*(_BYTE *)--*a2 = v5;\nv3 = v4;\n}\nreturn *(_QWORD *)(v3 + 48);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, _QWORD *a2)\n{\n__int64 v3; // [rsp+8h] [rbp-18h]\n__int64 v4; // [rsp+10h] [rbp-10h]\nchar v5; // [rsp+1Fh] [rbp-1h]\n\nv3 = a1;\nif ( *(_DWORD *)(a1 + 16) )\n_assert_fail(\"type->type == nt_type\", \"indirect.c\", 0xEu, \"build_ind\");\nwhile ( 1 )\n{\nv4 = *(_QWORD *)(v3 + 48);\nif ( *(_DWORD *)(v4 + 16) )\nbreak;\nif ( *(_DWORD *)(v4 + 24) == 5 || *(_DWORD *)(v4 + 24) == 6 )\n{\nv5 = -1;\n}\nelse\n{\nif ( *(_DWORD *)(v4 + 24) != 7 )\n_assert_fail(\"0\", \"indirect.c\", 0x19u, \"build_ind\");\nv5 = -2;\n}\nif ( a2 )\n*(_BYTE *)--*a2 = v5;\nv3 = v4;\n}\nreturn *(_QWORD *)(v3 + 48);\n}",
"original_code": "node_t *\nbuild_ind(node_t *type, ind_t **indp)\n{\n ((void) sizeof ((type->type == nt_type) ? 1 : 0), __extension__ ({ if (type->type == nt_type) ; else __assert_fail (\"type->type == nt_type\", \"indirect.c\", 14, __extension__ __PRETTY_FUNCTION__); }));\n node_t *parent;\n while ((parent = type->parent)->type == nt_type) {\n ind_t ind;\n if (parent->t.category == type_pointer ||\n parent->t.category == type_array)\n ind = ind_pointer;\n else if (parent->t.category == type_func)\n ind = ind_return;\n else\n ((void) sizeof ((0) ? 1 : 0), __extension__ ({ if (0) ; else __assert_fail (\"0\", \"indirect.c\", 25, __extension__ __PRETTY_FUNCTION__); }));\n if (indp)\n *(--*indp) = ind;\n type = parent;\n }\n return parent;\n}",
"canonical_original_code": "struct node *build_ind(struct node *type, char **indp)\n{\n ((void) sizeof ((type->type == nt_type) ? 1 : 0), __extension__ ({ if (type->type == nt_type) ; else __assert_fail (\"type->type == nt_type\", \"indirect.c\", 14, __extension__ __PRETTY_FUNCTION__); }));\n struct node *parent;\n while ((parent = type->parent)->type == nt_type) {\n char ind;\n if (parent->t.category == type_pointer ||\n parent->t.category == type_array)\n ind = ind_pointer;\n else if (parent->t.category == type_func)\n ind = ind_return;\n else\n ((void) sizeof ((0) ? 1 : 0), __extension__ ({ if (0) ; else __assert_fail (\"0\", \"indirect.c\", 25, __extension__ __PRETTY_FUNCTION__); }));\n if (indp)\n *(--*indp) = ind;\n type = parent;\n }\n return parent;\n}",
"variable_types": [
[
"type",
"struct node *"
],
[
"indp",
"char **"
],
[
"parent",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"ind",
"char"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "6eaf06fc701952d457cd2376033dade45a2b29f61dafcd9f6cdbda4517d24850"
},
{
"name": "array_base_type",
"canonical_name": "func3",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall array_base_type(__int64 a1)\n{\n__int64 result; // rax\n\nif ( *(_DWORD *)(a1 + 24) == 5 || *(_DWORD *)(a1 + 24) == 6 )\nresult = first_node(a1 + 192);\nelse\nresult = 0LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1)\n{\n__int64 result; // rax\n\nif ( *(_DWORD *)(a1 + 24) == 5 || *(_DWORD *)(a1 + 24) == 6 )\nresult = func0(a1 + 192);\nelse\nresult = 0LL;\nreturn result;\n}",
"original_code": "static node_t *\narray_base_type(node_t *type)\n{\n return (type->t.category == type_pointer ||\n type->t.category == type_array)\n ? first_node(&type->child[cht_type])\n : ((void *)0);\n}",
"canonical_original_code": "static struct node *array_base_type(struct node *type)\n{\n return (type->t.category == type_pointer ||\n type->t.category == type_array)\n ? first_node(&type->child[cht_type])\n : ((void *)0);\n}",
"variable_types": [
[
"type",
"struct node *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "6eaf06fc701952d457cd2376033dade45a2b29f61dafcd9f6cdbda4517d24850"
},
{
"name": "func_return_type",
"canonical_name": "func4",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall func_return_type(__int64 a1)\n{\n__int64 result; // rax\n\nif ( *(_DWORD *)(a1 + 24) == 7 )\nresult = first_node(a1 + 192);\nelse\nresult = 0LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1)\n{\n__int64 result; // rax\n\nif ( *(_DWORD *)(a1 + 24) == 7 )\nresult = func0(a1 + 192);\nelse\nresult = 0LL;\nreturn result;\n}",
"original_code": "static node_t *\nfunc_return_type(node_t *type)\n{\n return (type->t.category == type_func)\n ? first_node(&type->child[cht_type])\n : ((void *)0);\n}",
"canonical_original_code": "static struct node *func_return_type(struct node *type)\n{\n return (type->t.category == type_func)\n ? first_node(&type->child[cht_type])\n : ((void *)0);\n}",
"variable_types": [
[
"type",
"struct node *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "6eaf06fc701952d457cd2376033dade45a2b29f61dafcd9f6cdbda4517d24850"
},
{
"name": "kr_param_type",
"canonical_name": "func5",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall kr_param_type(__int64 a1, __int64 a2)\n{\n__int64 result; // rax\n__int64 v3; // [rsp+18h] [rbp-18h]\n__int64 v4; // [rsp+20h] [rbp-10h]\n__int64 v5; // [rsp+28h] [rbp-8h]\n\nv5 = *(_QWORD *)(a1 + 48);\nif ( !v5 )\nreturn 0LL;\nv4 = *(_QWORD *)(v5 + 48);\nif ( !v4 )\nreturn 0LL;\nv3 = varscope_find(v4 + 240, 2LL, a2);\nif ( v3 )\nresult = nth_node(v3 + 192, 1LL);\nelse\nresult = 0LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1, __int64 a2)\n{\n__int64 result; // rax\n__int64 v3; // [rsp+18h] [rbp-18h]\n__int64 v4; // [rsp+20h] [rbp-10h]\n__int64 v5; // [rsp+28h] [rbp-8h]\n\nv5 = *(_QWORD *)(a1 + 48);\nif ( !v5 )\nreturn 0LL;\nv4 = *(_QWORD *)(v5 + 48);\nif ( !v4 )\nreturn 0LL;\nv3 = varscope_find(v4 + 240, 2LL, a2);\nif ( v3 )\nresult = nth_node(v3 + 192, 1LL);\nelse\nresult = 0LL;\nreturn result;\n}",
"original_code": "static node_t *\nkr_param_type(node_t *fntype, const char *name)\n{\n node_t *fnvar, *fndecl;\n if (! (fnvar = fntype->parent) )\n return ((void *)0);\n if (! (fndecl = fnvar->parent) )\n return ((void *)0);\n node_t *var = varscope_find(&fndecl->child[chd_body], nt_var, name);\n if (!var)\n return ((void *)0);\n return nth_node(&var->child[chv_type], 1);\n}",
"canonical_original_code": "static struct node *kr_param_type(struct node *fntype, char *name)\n{\n struct node *fnvar; struct node *fndecl;\n if (! (fnvar = fntype->parent) )\n return ((void *)0);\n if (! (fndecl = fnvar->parent) )\n return ((void *)0);\n struct node *var = varscope_find(&fndecl->child[chd_body], nt_var, name);\n if (!var)\n return ((void *)0);\n return nth_node(&var->child[chv_type], 1);\n}",
"variable_types": [
[
"fntype",
"struct node *"
],
[
"name",
"char *"
],
[
"fnvar",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"fndecl",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"var",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "6eaf06fc701952d457cd2376033dade45a2b29f61dafcd9f6cdbda4517d24850"
},
{
"name": "func_arg_type",
"canonical_name": "func6",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall func_arg_type(__int64 a1, unsigned int a2)\n{\n__int64 result; // rax\n__int64 v3; // [rsp+8h] [rbp-18h]\n__int64 v4; // [rsp+8h] [rbp-18h]\n__int64 v5; // [rsp+8h] [rbp-18h]\n__int64 v6; // [rsp+10h] [rbp-10h]\n__int64 v7; // [rsp+18h] [rbp-8h]\n\nv7 = nth_node(a1 + 208, a2);\nif ( !v7 )\nreturn 0LL;\nif ( *(_DWORD *)(v7 + 16) != 3 )\n_assert_fail(\"decl->type == nt_decl\", \"indirect.c\", 0x48u, \"func_arg_type\");\nv3 = first_node(v7 + 192);\nif ( v3 != v7 + 192 )\nreturn v3;\nv6 = first_node(v7 + 208);\nif ( v6 == v7 + 208 )\n_assert_fail(\"&var->list != &decl->child[chd_var]\", \"indirect.c\", 0x4Fu, \"func_arg_type\");\nv4 = first_node(v6 + 192);\nif ( v4 != v6 + 192 )\nreturn v4;\nv5 = kr_param_type(*(_QWORD *)(v7 + 48), *(_QWORD *)(v6 + 40) + 112LL);\nif ( v5 )\nresult = v5;\nelse\nresult = 0LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func6(__int64 a1, unsigned int a2)\n{\n__int64 result; // rax\n__int64 v3; // [rsp+8h] [rbp-18h]\n__int64 v4; // [rsp+8h] [rbp-18h]\n__int64 v5; // [rsp+8h] [rbp-18h]\n__int64 v6; // [rsp+10h] [rbp-10h]\n__int64 v7; // [rsp+18h] [rbp-8h]\n\nv7 = nth_node(a1 + 208, a2);\nif ( !v7 )\nreturn 0LL;\nif ( *(_DWORD *)(v7 + 16) != 3 )\n_assert_fail(\"decl->type == nt_decl\", \"indirect.c\", 0x48u, \"func_arg_type\");\nv3 = func0(v7 + 192);\nif ( v3 != v7 + 192 )\nreturn v3;\nv6 = func0(v7 + 208);\nif ( v6 == v7 + 208 )\n_assert_fail(\"&var->list != &decl->child[chd_var]\", \"indirect.c\", 0x4Fu, \"func_arg_type\");\nv4 = func0(v6 + 192);\nif ( v4 != v6 + 192 )\nreturn v4;\nv5 = func5(*(_QWORD *)(v7 + 48), *(_QWORD *)(v6 + 40) + 112LL);\nif ( v5 )\nresult = v5;\nelse\nresult = 0LL;\nreturn result;\n}",
"original_code": "static node_t *\nfunc_arg_type(node_t *type, int pos)\n{\n node_t *decl = nth_node(&type->child[cht_param], pos);\n if (!decl)\n return ((void *)0);\n ((void) sizeof ((decl->type == nt_decl) ? 1 : 0), __extension__ ({ if (decl->type == nt_decl) ; else __assert_fail (\"decl->type == nt_decl\", \"indirect.c\", 72, __extension__ __PRETTY_FUNCTION__); }));\n type = first_node(&decl->child[chd_type]);\n if (&type->list != &decl->child[chd_type])\n return type;\n node_t *var = first_node(&decl->child[chd_var]);\n ((void) sizeof ((&var->list != &decl->child[chd_var]) ? 1 : 0), __extension__ ({ if (&var->list != &decl->child[chd_var]) ; else __assert_fail (\"&var->list != &decl->child[chd_var]\", \"indirect.c\", 79, __extension__ __PRETTY_FUNCTION__); }));\n type = first_node(&var->child[chv_type]);\n if (&type->list != &var->child[chv_type])\n return type;\n if ( (type = kr_param_type(decl->parent, var->str->text)) )\n return type;\n return ((void *)0);\n}",
"canonical_original_code": "static struct node *func_arg_type(struct node *type, int pos)\n{\n struct node *decl = nth_node(&type->child[cht_param], pos);\n if (!decl)\n return ((void *)0);\n ((void) sizeof ((decl->type == nt_decl) ? 1 : 0), __extension__ ({ if (decl->type == nt_decl) ; else __assert_fail (\"decl->type == nt_decl\", \"indirect.c\", 72, __extension__ __PRETTY_FUNCTION__); }));\n type = first_node(&decl->child[chd_type]);\n if (&type->list != &decl->child[chd_type])\n return type;\n struct node *var = first_node(&decl->child[chd_var]);\n ((void) sizeof ((&var->list != &decl->child[chd_var]) ? 1 : 0), __extension__ ({ if (&var->list != &decl->child[chd_var]) ; else __assert_fail (\"&var->list != &decl->child[chd_var]\", \"indirect.c\", 79, __extension__ __PRETTY_FUNCTION__); }));\n type = first_node(&var->child[chv_type]);\n if (&type->list != &var->child[chv_type])\n return type;\n if ( (type = kr_param_type(decl->parent, var->str->text)) )\n return type;\n return ((void *)0);\n}",
"variable_types": [
[
"type",
"struct node *"
],
[
"pos",
"int"
],
[
"decl",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"var",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "6eaf06fc701952d457cd2376033dade45a2b29f61dafcd9f6cdbda4517d24850"
},
{
"name": "ind_base_type",
"canonical_name": "func7",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall ind_base_type(__int64 a1, char *a2)\n{\nwhile ( *a2 )\n{\nif ( ind_is_pointer(*a2) )\n{\na1 = array_base_type(a1);\n}\nelse if ( *a2 == -2 )\n{\na1 = func_return_type(a1);\n}\nelse\n{\nif ( !a2 )\n_assert_fail(\"ind > 0\", \"indirect.c\", 0x64u, \"ind_base_type\");\na1 = func_arg_type(a1, *a2);\n}\nif ( !a1 )\nbreak;\n++a2;\n}\nreturn a1;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(__int64 a1, char *a2)\n{\nwhile ( *a2 )\n{\nif ( func1(*a2) )\n{\na1 = func3(a1);\n}\nelse if ( *a2 == -2 )\n{\na1 = func4(a1);\n}\nelse\n{\nif ( !a2 )\n_assert_fail(\"ind > 0\", \"indirect.c\", 0x64u, \"ind_base_type\");\na1 = func6(a1, *a2);\n}\nif ( !a1 )\nbreak;\n++a2;\n}\nreturn a1;\n}",
"original_code": "node_t *\nind_base_type(node_t *type, const ind_t *ind)\n{\n while (*ind != ind_stop) {\n if (ind_is_pointer(*ind))\n type = array_base_type(type);\n else if (*ind == ind_return)\n type = func_return_type(type);\n else {\n ((void) sizeof ((ind > 0) ? 1 : 0), __extension__ ({ if (ind > 0) ; else __assert_fail (\"ind > 0\", \"indirect.c\", 100, __extension__ __PRETTY_FUNCTION__); }));\n type = func_arg_type(type, *ind);\n }\n if (!type)\n break;\n ++ind;\n }\n return type;\n}",
"canonical_original_code": "struct node *ind_base_type(struct node *type, char *ind)\n{\n while (*ind != ind_stop) {\n if (ind_is_pointer(*ind))\n type = array_base_type(type);\n else if (*ind == ind_return)\n type = func_return_type(type);\n else {\n ((void) sizeof ((ind > 0) ? 1 : 0), __extension__ ({ if (ind > 0) ; else __assert_fail (\"ind > 0\", \"indirect.c\", 100, __extension__ __PRETTY_FUNCTION__); }));\n type = func_arg_type(type, *ind);\n }\n if (!type)\n break;\n ++ind;\n }\n return type;\n}",
"variable_types": [
[
"type",
"struct node *"
],
[
"ind",
"char *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "6eaf06fc701952d457cd2376033dade45a2b29f61dafcd9f6cdbda4517d24850"
},
{
"name": "is_host_type",
"canonical_name": "func8",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall is_host_type(__int64 a1, char *a2)\n{\nint v2; // eax\n__int64 result; // rax\n__int64 v4; // rax\n__int64 v5; // [rsp+18h] [rbp-18h]\n__int64 v6; // [rsp+18h] [rbp-18h]\n__int64 v7; // [rsp+20h] [rbp-10h]\n__int64 v8; // [rsp+20h] [rbp-10h]\n__int64 v9; // [rsp+20h] [rbp-10h]\n__int64 v10; // [rsp+20h] [rbp-10h]\n__int64 v11; // [rsp+20h] [rbp-10h]\n__int64 v12; // [rsp+20h] [rbp-10h]\n__int64 v13; // [rsp+20h] [rbp-10h]\n__int64 v14; // [rsp+20h] [rbp-10h]\n__int64 v15; // [rsp+20h] [rbp-10h]\n__int64 v16; // [rsp+28h] [rbp-8h]\n__int64 v17; // [rsp+28h] [rbp-8h]\n__int64 v18; // [rsp+28h] [rbp-8h]\n\nv2 = *(_DWORD *)(a1 + 24);\nif ( v2 > 126 )\n{\nif ( v2 > 342 || v2 < 269 )\ngoto LABEL_44;\nswitch ( v2 )\n{\ncase 269:\ncase 270:\nLABEL_15:\nv9 = first_node(a1 + 192);\nreturn is_host_type(v9, a2);\ncase 273:\ncase 321:\nLABEL_31:\nv5 = varscope_find_expr(a1);\nif ( !v5 )\nreturn 1LL;\nv16 = first_node(v5 + 192);\nv4 = ind_base_type(v16, a2);\ngoto LABEL_46;\ncase 280:\nv7 = first_node(a1 + 192);\nif ( ind_is_pointer(*a2) )\nresult = is_host_type(v7, a2 + 1);\nelse\nresult = 1LL;\nreturn result;\ncase 281:\ncase 335:\nv8 = first_node(a1 + 192);\n*(a2 - 1) = -1;\nreturn is_host_type(v8, a2 - 1);\ncase 299:\ncase 341:\nreturn 0LL;\ncase 317:\ncase 318:\ncase 319:\nreturn 0LL;\ncase 320:\nreturn 1LL;\ncase 338:\nv15 = first_node(a1 + 192);\nv6 = varscope_find_expr(v15);\nif ( v6 )\n{\nv17 = first_node(v6 + 192);\nif ( *(_DWORD *)(v17 + 24) != 7 )\n_assert_fail(\"type->t.category == type_func\", \"indirect.c\", 0xC9u, \"is_host_type\");\nv18 = nth_node(v17 + 192, 1LL);\nif ( v18 )\n{\nv4 = ind_base_type(v18, a2);\nLABEL_46:\nif ( v4 )\nresult = *(_DWORD *)(v4 + 24) == 5 || *(_DWORD *)(v4 + 24) == 6;\nelse\nresult = 1LL;\n}\nelse\n{\nresult = 1LL;\n}\n}\nelse\n{\nresult = 1LL;\n}\nbreak;\ncase 342:\nv14 = nth_node(a1 + 208, 1LL);\nreturn v14 && (unsigned int)is_host_type(v14, a2);\ndefault:\ngoto LABEL_44;\n}\n}\nelse\n{\nif ( v2 < 33 )\n{\nLABEL_44:\nfprintf(stderr, \"%s: Operator %d not yet handled\\n\", \"is_host_type\", *(unsigned int *)(a1 + 24));\nreturn 1LL;\n}\nswitch ( v2 )\n{\ncase '!':\nreturn 1LL;\ncase '%':\ncase '/':\ncase '~':\ngoto LABEL_15;\ncase '&':\ncase '*':\ncase '+':\ncase '-':\ncase '^':\ncase '|':\nv10 = nth_node(a1 + 192, 1LL);\nif ( v10 && (unsigned int)is_host_type(v10, a2) )\n{\nresult = 1LL;\n}\nelse\n{\nv11 = nth_node(a1 + 208, 1LL);\nresult = v11 && (unsigned int)is_host_type(v11, a2);\n}\nbreak;\ncase '.':\ngoto LABEL_31;\ncase '?':\nv12 = nth_node(a1 + 224, 1LL);\nif ( v12 && (unsigned int)is_host_type(v12, a2) )\n{\nresult = 1LL;\n}\nelse\n{\nv13 = nth_node(a1 + 208, 1LL);\nresult = v13 && (unsigned int)is_host_type(v13, a2);\n}\nbreak;\ndefault:\ngoto LABEL_44;\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func8(__int64 a1, char *a2)\n{\nint v2; // eax\n__int64 result; // rax\n__int64 v4; // rax\n__int64 v5; // [rsp+18h] [rbp-18h]\n__int64 v6; // [rsp+18h] [rbp-18h]\n__int64 v7; // [rsp+20h] [rbp-10h]\n__int64 v8; // [rsp+20h] [rbp-10h]\n__int64 v9; // [rsp+20h] [rbp-10h]\n__int64 v10; // [rsp+20h] [rbp-10h]\n__int64 v11; // [rsp+20h] [rbp-10h]\n__int64 v12; // [rsp+20h] [rbp-10h]\n__int64 v13; // [rsp+20h] [rbp-10h]\n__int64 v14; // [rsp+20h] [rbp-10h]\n__int64 v15; // [rsp+20h] [rbp-10h]\n__int64 v16; // [rsp+28h] [rbp-8h]\n__int64 v17; // [rsp+28h] [rbp-8h]\n__int64 v18; // [rsp+28h] [rbp-8h]\n\nv2 = *(_DWORD *)(a1 + 24);\nif ( v2 > 126 )\n{\nif ( v2 > 342 || v2 < 269 )\ngoto LABEL_44;\nswitch ( v2 )\n{\ncase 269:\ncase 270:\nLABEL_15:\nv9 = func0(a1 + 192);\nreturn func8(v9, a2);\ncase 273:\ncase 321:\nLABEL_31:\nv5 = varscope_find_expr(a1);\nif ( !v5 )\nreturn 1LL;\nv16 = func0(v5 + 192);\nv4 = func7(v16, a2);\ngoto LABEL_46;\ncase 280:\nv7 = func0(a1 + 192);\nif ( func1(*a2) )\nresult = func8(v7, a2 + 1);\nelse\nresult = 1LL;\nreturn result;\ncase 281:\ncase 335:\nv8 = func0(a1 + 192);\n*(a2 - 1) = -1;\nreturn func8(v8, a2 - 1);\ncase 299:\ncase 341:\nreturn 0LL;\ncase 317:\ncase 318:\ncase 319:\nreturn 0LL;\ncase 320:\nreturn 1LL;\ncase 338:\nv15 = func0(a1 + 192);\nv6 = varscope_find_expr(v15);\nif ( v6 )\n{\nv17 = func0(v6 + 192);\nif ( *(_DWORD *)(v17 + 24) != 7 )\n_assert_fail(\"type->t.category == type_func\", \"indirect.c\", 0xC9u, \"is_host_type\");\nv18 = nth_node(v17 + 192, 1LL);\nif ( v18 )\n{\nv4 = func7(v18, a2);\nLABEL_46:\nif ( v4 )\nresult = *(_DWORD *)(v4 + 24) == 5 || *(_DWORD *)(v4 + 24) == 6;\nelse\nresult = 1LL;\n}\nelse\n{\nresult = 1LL;\n}\n}\nelse\n{\nresult = 1LL;\n}\nbreak;\ncase 342:\nv14 = nth_node(a1 + 208, 1LL);\nreturn v14 && (unsigned int)func8(v14, a2);\ndefault:\ngoto LABEL_44;\n}\n}\nelse\n{\nif ( v2 < 33 )\n{\nLABEL_44:\nfprintf(stderr, \"%s: Operator %d not yet handled\\n\", \"is_host_type\", *(unsigned int *)(a1 + 24));\nreturn 1LL;\n}\nswitch ( v2 )\n{\ncase '!':\nreturn 1LL;\ncase '%':\ncase '/':\ncase '~':\ngoto LABEL_15;\ncase '&':\ncase '*':\ncase '+':\ncase '-':\ncase '^':\ncase '|':\nv10 = nth_node(a1 + 192, 1LL);\nif ( v10 && (unsigned int)func8(v10, a2) )\n{\nresult = 1LL;\n}\nelse\n{\nv11 = nth_node(a1 + 208, 1LL);\nresult = v11 && (unsigned int)func8(v11, a2);\n}\nbreak;\ncase '.':\ngoto LABEL_31;\ncase '?':\nv12 = nth_node(a1 + 224, 1LL);\nif ( v12 && (unsigned int)func8(v12, a2) )\n{\nresult = 1LL;\n}\nelse\n{\nv13 = nth_node(a1 + 208, 1LL);\nresult = v13 && (unsigned int)func8(v13, a2);\n}\nbreak;\ndefault:\ngoto LABEL_44;\n}\n}\nreturn result;\n}",
"original_code": "int\nis_host_type(node_t *expr, ind_t *ind)\n{\n node_t *child, *var, *type;\n switch (expr->e.op) {\n case INT_CONST:\n case FLOAT_CONST:\n case CHAR_CONST:\n return 0;\n case '!':\n case STRING_CONST:\n return 1;\n case ADDR_OF:\n child = first_node(&expr->child[che_arg1]);\n if (!ind_is_pointer(*ind))\n return 1;\n ++ind;\n return is_host_type(child, ind);\n case DEREF_OP:\n case ARRAY:\n child = first_node(&expr->child[che_arg1]);\n *--ind = ind_pointer;\n return is_host_type(child, ind);\n case '~':\n case '/':\n case '%':\n case SHL_OP:\n case SHR_OP:\n child = first_node(&expr->child[che_arg1]);\n return is_host_type(child, ind);\n case '&':\n case '|':\n case '^':\n case '*':\n case '+':\n case '-':\n child = nth_node(&expr->child[che_arg1], 1);\n if (child && is_host_type(child, ind))\n return 1;\n child = nth_node(&expr->child[che_arg2], 1);\n if (child && is_host_type(child, ind))\n return 1;\n return 0;\n case '?':\n child = nth_node(&expr->child[che_arg3], 1);\n if (child && is_host_type(child, ind))\n return 1;\n child = nth_node(&expr->child[che_arg2], 1);\n if (child && is_host_type(child, ind))\n return 1;\n return 0;\n case SIZEOF_TYPE:\n case SIZEOF:\n return 0;\n case ID:\n case '.':\n case PTR_OP:\n if (! (var = varscope_find_expr(expr)) )\n return 1;\n type = first_node(&var->child[chv_type]);\n break;\n case TYPECAST:\n child = nth_node(&expr->child[che_arg2], 1);\n if (child && is_host_type(child, ind))\n return 1;\n return 0;\n case FUNC:\n child = first_node(&expr->child[che_arg1]);\n if (! (var = varscope_find_expr(child)) )\n return 1;\n type = first_node(&var->child[chv_type]);\n ((void) sizeof ((type->t.category == type_func) ? 1 : 0), __extension__ ({ if (type->t.category == type_func) ; else __assert_fail (\"type->t.category == type_func\", \"indirect.c\", 201, __extension__ __PRETTY_FUNCTION__); }));\n if (! (type = nth_node(&type->child[cht_type], 1)) )\n return 1;\n break;\n default:\n fprintf(stderr, \"%s: Operator %d not yet handled\\n\",\n __FUNCTION__, expr->e.op);\n return 1;\n }\n if (! (type = ind_base_type(type, ind)) )\n return 1;\n if (type->t.category == type_pointer ||\n type->t.category == type_array)\n return 1;\n return 0;\n}",
"canonical_original_code": "int is_host_type(struct node *expr, char *ind)\n{\n struct node *child; struct node *var; struct node *type;\n switch (expr->e.op) {\n case INT_CONST:\n case FLOAT_CONST:\n case CHAR_CONST:\n return 0;\n case '!':\n case STRING_CONST:\n return 1;\n case ADDR_OF:\n child = first_node(&expr->child[che_arg1]);\n if (!ind_is_pointer(*ind))\n return 1;\n ++ind;\n return is_host_type(child, ind);\n case DEREF_OP:\n case ARRAY:\n child = first_node(&expr->child[che_arg1]);\n *--ind = ind_pointer;\n return is_host_type(child, ind);\n case '~':\n case '/':\n case '%':\n case SHL_OP:\n case SHR_OP:\n child = first_node(&expr->child[che_arg1]);\n return is_host_type(child, ind);\n case '&':\n case '|':\n case '^':\n case '*':\n case '+':\n case '-':\n child = nth_node(&expr->child[che_arg1], 1);\n if (child && is_host_type(child, ind))\n return 1;\n child = nth_node(&expr->child[che_arg2], 1);\n if (child && is_host_type(child, ind))\n return 1;\n return 0;\n case '?':\n child = nth_node(&expr->child[che_arg3], 1);\n if (child && is_host_type(child, ind))\n return 1;\n child = nth_node(&expr->child[che_arg2], 1);\n if (child && is_host_type(child, ind))\n return 1;\n return 0;\n case SIZEOF_TYPE:\n case SIZEOF:\n return 0;\n case ID:\n case '.':\n case PTR_OP:\n if (! (var = varscope_find_expr(expr)) )\n return 1;\n type = first_node(&var->child[chv_type]);\n break;\n case TYPECAST:\n child = nth_node(&expr->child[che_arg2], 1);\n if (child && is_host_type(child, ind))\n return 1;\n return 0;\n case FUNC:\n child = first_node(&expr->child[che_arg1]);\n if (! (var = varscope_find_expr(child)) )\n return 1;\n type = first_node(&var->child[chv_type]);\n ((void) sizeof ((type->t.category == type_func) ? 1 : 0), __extension__ ({ if (type->t.category == type_func) ; else __assert_fail (\"type->t.category == type_func\", \"indirect.c\", 201, __extension__ __PRETTY_FUNCTION__); }));\n if (! (type = nth_node(&type->child[cht_type], 1)) )\n return 1;\n break;\n default:\n fprintf(stderr, \"%s: Operator %d not yet handled\\n\",\n __FUNCTION__, expr->e.op);\n return 1;\n }\n if (! (type = ind_base_type(type, ind)) )\n return 1;\n if (type->t.category == type_pointer ||\n type->t.category == type_array)\n return 1;\n return 0;\n}",
"variable_types": [
[
"expr",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"ind",
"char *"
],
[
"child",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"var",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"type",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "6eaf06fc701952d457cd2376033dade45a2b29f61dafcd9f6cdbda4517d24850"
}
] |
b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826 | ptesarik/xcrash-scripts | [
[
"list_empty",
"->",
"fill_varscope",
"expr_type",
"varscope_find_expr"
],
[
"first_node",
"->",
"resolve_typedef",
"expr_type",
"varscope_find_expr",
"find_symbol"
],
[
"is_header_file",
"->",
"find_var_scope"
],
[
"mkhash",
"->",
"varscope_add",
"varscope_find",
"varscope_find_next",
"varscope_remove"
],
[
"find_var_scope",
"->",
"is_header_file",
"varscope_add",
"varscope_remove",
"varscope_find_first_var",
"varscope_find_next_var"
],
[
"varscope_add",
"->",
"find_var_scope",
"mkhash",
"fill_varscope"
],
[
"fill_varscope",
"->",
"list_empty",
"varscope_add"
],
[
"init_varscope",
"->",
"free_varscope"
],
[
"free_varscope",
"->",
"init_varscope"
],
[
"varscope_find",
"->",
"mkhash",
"varscope_traverse",
"varscope_find_first_var",
"varscope_find_next_var",
"varscope_find_expr",
"find_global"
],
[
"varscope_find_next",
"->",
"mkhash",
"varscope_find_next_var",
"find_symbol"
],
[
"varscope_traverse",
"->",
"varscope_find",
"resolve_typedef",
"varscope_find_expr"
],
[
"varscope_remove",
"->",
"find_var_scope",
"mkhash"
],
[
"varscope_find_first_var",
"->",
"find_var_scope",
"varscope_find"
],
[
"varscope_find_next_var",
"->",
"find_var_scope",
"varscope_find_next",
"varscope_find",
"varscope_find_expr"
],
[
"resolve_typedef",
"->",
"varscope_traverse",
"first_node",
"varscope_find_expr",
"varscope_symbol"
],
[
"expr_type",
"->",
"first_node",
"varscope_find_expr",
"list_empty"
],
[
"varscope_find_expr",
"->",
"expr_type",
"varscope_traverse",
"list_empty",
"first_node",
"resolve_typedef",
"varscope_find",
"varscope_find_next_var"
],
[
"find_global",
"->",
"varscope_find",
"find_symbol"
],
[
"check_prefix",
"->",
"find_symbol"
],
[
"find_symbol",
"->",
"check_prefix",
"find_global",
"varscope_find_next",
"first_node",
"varscope_symbol"
],
[
"varscope_symbol",
"->",
"find_symbol",
"resolve_typedef"
]
] | [
[
"mkhash",
"__int64 __fastcall func3(_BYTE *a1, __int16 a2)\n{\nwhile ( *a1 )\na2 = 13 * a2 + (char)*a1++;\nreturn a2 & 0x1FFF;\n}"
],
[
"check_prefix",
"__int64 __fastcall func19(const char *a1, _DWORD *a2, _DWORD *a3)\n{\n*a3 = -1;\n*a2 = -1;\nfor ( p_2 = (__int64)&prefixes_1; *(_QWORD *)p_2; p_2 += 24LL )\n{\nif ( !strncmp(a1, *(const char **)p_2, *(_QWORD *)(p_2 + 8)) )\n{\n*a2 = *(_DWORD *)(p_2 + 16);\n*a3 = *(_DWORD *)(p_2 + 20);\nreturn *(_QWORD *)(p_2 + 8);\n}\n}\nreturn 0LL;\n}"
]
] | [
{
"name": "list_empty",
"canonical_name": "func0",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "_BOOL8 __fastcall list_empty(_QWORD *a1)\n{\nreturn a1 == (_QWORD *)*a1;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func0(_QWORD *a1)\n{\nreturn a1 == (_QWORD *)*a1;\n}",
"original_code": "static inline int list_empty(const struct list_head_xcrash *head)\n{\n return head->next == head;\n}",
"canonical_original_code": "static inline int list_empty(struct list_head_xcrash *head)\n{\n return head->next == head;\n}",
"variable_types": [
[
"head",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct list_head_xcrash { struct list_head_xcrash *next; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "first_node",
"canonical_name": "func1",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall first_node(__int64 a1)\n{\nreturn *(_QWORD *)a1;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1)\n{\nreturn *(_QWORD *)a1;\n}",
"original_code": "static inline node_t *\nfirst_node(const struct list_head_xcrash *nodelist)\n{\n return ({ const struct list_head_xcrash *__mptr = (nodelist->next); (node_t *)( (char *)__mptr - __builtin_offsetof (node_t, list) );});\n}",
"canonical_original_code": "static inline struct node *first_node(struct list_head_xcrash *nodelist)\n{\n return ({ struct list_head_xcrash *__mptr = (nodelist->next); (struct node *)( (char *)__mptr - __builtin_offsetof (node_t, list) );});\n}",
"variable_types": [
[
"nodelist",
"struct list_head_xcrash *"
],
[
"__mptr",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "is_header_file",
"canonical_name": "func2",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "_BOOL8 __fastcall is_header_file(const char **a1)\n{\nchar *v2; // [rsp+18h] [rbp-8h]\n\nif ( !*a1 )\nreturn 1LL;\nv2 = strrchr(*a1, 46);\nreturn v2 && v2[1] == 104 && !v2[2];\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func2(const char **a1)\n{\nchar *v2; // [rsp+18h] [rbp-8h]\n\nif ( !*a1 )\nreturn 1LL;\nv2 = strrchr(*a1, 46);\nreturn v2 && v2[1] == 104 && !v2[2];\n}",
"original_code": "static inline int\nis_header_file(struct parsed_file *pf)\n{\n if (pf->name) {\n char *suffix = strrchr(pf->name, '.');\n return suffix && suffix[1] == 'h' && !suffix[2];\n } else\n return 1;\n}",
"canonical_original_code": "static inline int is_header_file(struct parsed_file *pf)\n{\n if (pf->name) {\n char *suffix = strrchr(pf->name, '.');\n return suffix && suffix[1] == 'h' && !suffix[2];\n } else\n return 1;\n}",
"variable_types": [
[
"pf",
"struct parsed_file { char *name; struct list_head_xcrash { struct list_head_xcrash *next; } parsed; struct list_head_xcrash raw; struct loc { struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node { struct list_head_xcrash list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *text; } first; struct loc *parent; } loc; int clean; } *"
],
[
"suffix",
"char *"
]
],
"return_type": "int",
"user_defined_types": [
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "find_var_scope",
"canonical_name": "func4",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall find_var_scope(__int64 a1)\n{\n__int64 result; // rax\n__int64 v2; // [rsp+18h] [rbp-18h]\nconst char **v3; // [rsp+28h] [rbp-8h]\n\nv3 = *(const char ***)(a1 + 72);\nv2 = find_scope(a1, 0LL);\nif ( (const char **)v2 == v3 + 1 && is_header_file(v3) )\nresult = 0LL;\nelse\nresult = v2;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1)\n{\n__int64 result; // rax\n__int64 v2; // [rsp+18h] [rbp-18h]\nconst char **v3; // [rsp+28h] [rbp-8h]\n\nv3 = *(const char ***)(a1 + 72);\nv2 = find_scope(a1, 0LL);\nif ( (const char **)v2 == v3 + 1 && func2(v3) )\nresult = 0LL;\nelse\nresult = v2;\nreturn result;\n}",
"original_code": "struct list_head_xcrash *\nfind_var_scope(node_t *node)\n{\n struct parsed_file *pf = node->loc.first.pf;\n struct list_head_xcrash *tree = &pf->parsed;\n struct list_head_xcrash *scope = find_scope(node, ((void *)0));\n if (scope == tree && is_header_file(pf))\n return ((void *)0);\n return scope;\n}",
"canonical_original_code": "struct list_head_xcrash *find_var_scope(struct node *node)\n{\n struct parsed_file *pf = node->loc.first.pf;\n struct list_head_xcrash *tree = &pf->parsed;\n struct list_head_xcrash *scope = find_scope(node, ((void *)0));\n if (scope == tree && is_header_file(pf))\n return ((void *)0);\n return scope;\n}",
"variable_types": [
[
"node",
"struct node { struct list_head_xcrash list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"pf",
"struct parsed_file { char *name; struct list_head_xcrash { struct list_head_xcrash *next; } parsed; struct list_head_xcrash raw; struct loc { struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node { struct list_head_xcrash list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *text; } first; struct loc *parent; } loc; int clean; } *"
],
[
"tree",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
],
[
"scope",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
]
],
"return_type": "struct list_head_xcrash { struct list_head_xcrash *next; } *",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "varscope_add",
"canonical_name": "func5",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall varscope_add(__int64 a1)\n{\n__int64 result; // rax\n_QWORD *v2; // [rsp+20h] [rbp-10h]\n__int64 v3; // [rsp+28h] [rbp-8h]\n\nv3 = find_var_scope(a1);\nv2 = malloc(0x18uLL);\nLODWORD(result) = mkhash((_BYTE *)(*(_QWORD *)(a1 + 40) + 112LL), v3);\n*v2 = vshash[(unsigned int)result];\nv2[1] = a1;\nv2[2] = v3;\nresult = (unsigned int)result;\nvshash[(unsigned int)result] = (__int64)v2;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1)\n{\n__int64 result; // rax\n_QWORD *v2; // [rsp+20h] [rbp-10h]\n__int64 v3; // [rsp+28h] [rbp-8h]\n\nv3 = func4(a1);\nv2 = malloc(0x18uLL);\nLODWORD(result) = func3((_BYTE *)(*(_QWORD *)(a1 + 40) + 112LL), v3);\n*v2 = vshash[(unsigned int)result];\nv2[1] = a1;\nv2[2] = v3;\nresult = (unsigned int)result;\nvshash[(unsigned int)result] = (__int64)v2;\nreturn result;\n}",
"original_code": "static void\nvarscope_add(node_t *node)\n{\n struct list_head_xcrash *scope = find_var_scope(node);\n struct varscope *vs = malloc(sizeof(struct varscope));\n unsigned idx = mkhash(node->str->text, scope);\n vs->next = vshash[idx];\n vs->node = node;\n vs->scope = scope;\n vshash[idx] = vs;\n}",
"canonical_original_code": "static void varscope_add(struct node *node)\n{\n struct list_head_xcrash *scope = find_var_scope(node);\n struct varscope *vs = malloc(sizeof(struct varscope));\n unsigned int idx = mkhash(node->str->text, scope);\n vs->next = vshash[idx];\n vs->node = node;\n vs->scope = scope;\n vshash[idx] = vs;\n}",
"variable_types": [
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"scope",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
],
[
"vs",
"struct varscope { struct varscope *next; struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *node; struct list_head_xcrash *scope; } *"
],
[
"idx",
"unsigned int"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct varscope { struct varscope *next; struct node *node; struct list_head_xcrash *scope; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "fill_varscope",
"canonical_name": "func6",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall fill_varscope(__int64 a1)\n{\nif ( *(_DWORD *)(a1 + 16) == 2 && *(_QWORD *)(a1 + 40)\n|| !*(_DWORD *)(a1 + 16)\n&& *(_QWORD *)(a1 + 40)\n&& (*(_DWORD *)(a1 + 24) == 2 || *(_DWORD *)(a1 + 24) == 3 || *(_DWORD *)(a1 + 24) == 4)\n&& !list_empty((_QWORD *)(a1 + 192)) )\n{\nvarscope_add(a1);\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func6(__int64 a1)\n{\nif ( *(_DWORD *)(a1 + 16) == 2 && *(_QWORD *)(a1 + 40)\n|| !*(_DWORD *)(a1 + 16)\n&& *(_QWORD *)(a1 + 40)\n&& (*(_DWORD *)(a1 + 24) == 2 || *(_DWORD *)(a1 + 24) == 3 || *(_DWORD *)(a1 + 24) == 4)\n&& !func0((_QWORD *)(a1 + 192)) )\n{\nfunc5(a1);\n}\nreturn 0LL;\n}",
"original_code": "static enum walk_action\nfill_varscope(node_t *node, void *data)\n{\n if (node->type == nt_var && node->str)\n varscope_add(node);\n else if (node->type == nt_type && node->str &&\n (node->t.category == type_struct ||\n node->t.category == type_union ||\n node->t.category == type_enum) &&\n !list_empty(&node->child[cht_body]))\n varscope_add(node);\n return walk_continue;\n}",
"canonical_original_code": "static enum walk_action fill_varscope(struct node *node, void *data)\n{\n if (node->type == nt_var && node->str)\n varscope_add(node);\n else if (node->type == nt_type && node->str &&\n (node->t.category == type_struct ||\n node->t.category == type_union ||\n node->t.category == type_enum) &&\n !list_empty(&node->child[cht_body]))\n varscope_add(node);\n return walk_continue;\n}",
"variable_types": [
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"data",
"void *"
]
],
"return_type": "enum walk_action { walk_continue=0, walk_terminate=1, walk_skip_children=2 }",
"user_defined_types": [
"enum walk_action { walk_continue=0, walk_terminate=1, walk_skip_children=2 }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "init_varscope",
"canonical_name": "func7",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall init_varscope(int *a1)\n{\n__int64 result; // rax\n__int64 i; // [rsp+18h] [rbp-8h]\n\nfree_varscope();\nfor ( i = *((_QWORD *)a1 + 1); ; i += 104LL )\n{\nresult = *((_QWORD *)a1 + 1) + 104LL * *a1;\nif ( i == result )\nbreak;\nwalk_tree(i + 8, fill_varscope, 0LL);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(int *a1)\n{\n__int64 result; // rax\n__int64 i; // [rsp+18h] [rbp-8h]\n\nfunc8();\nfor ( i = *((_QWORD *)a1 + 1); ; i += 104LL )\n{\nresult = *((_QWORD *)a1 + 1) + 104LL * *a1;\nif ( i == result )\nbreak;\nwalk_tree(i + 8, fill_varscope, 0LL);\n}\nreturn result;\n}",
"original_code": "void\ninit_varscope(const struct file_array *files)\n{\n struct parsed_file *pf;\n free_varscope();\n for ((pf) = (files)->array; (pf) != &(files)->array[(files)->n]; ++(pf))\n walk_tree(&pf->parsed, fill_varscope, ((void *)0));\n}",
"canonical_original_code": "void init_varscope(struct file_array *files)\n{\n struct parsed_file *pf;\n free_varscope();\n for ((pf) = (files)->array; (pf) != &(files)->array[(files)->n]; ++(pf))\n walk_tree(&pf->parsed, fill_varscope, ((void *)0));\n}",
"variable_types": [
[
"files",
"struct file_array { int n; struct parsed_file { char *name; struct list_head_xcrash { struct list_head_xcrash *next; } parsed; struct list_head_xcrash raw; struct loc { struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node { struct list_head_xcrash list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *text; } first; struct loc *parent; } loc; int clean; } *array; } *"
],
[
"pf",
"struct parsed_file { char *name; struct list_head_xcrash { struct list_head_xcrash *next; } parsed; struct list_head_xcrash raw; struct loc { struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node { struct list_head_xcrash list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *text; } first; struct loc *parent; } loc; int clean; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct file_array { int n; struct parsed_file *array; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "free_varscope",
"canonical_name": "func8",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 free_varscope()\n{\n__int64 result; // rax\n_QWORD *v1; // [rsp+8h] [rbp-18h]\n_QWORD *ptr; // [rsp+10h] [rbp-10h]\nunsigned int i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i <= 0x1FFF; ++i )\n{\nfor ( ptr = (_QWORD *)vshash[i]; ptr; ptr = v1 )\n{\nv1 = (_QWORD *)*ptr;\nfree(ptr);\n}\nresult = i;\nvshash[i] = 0LL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 func8()\n{\n__int64 result; // rax\n_QWORD *v1; // [rsp+8h] [rbp-18h]\n_QWORD *ptr; // [rsp+10h] [rbp-10h]\nunsigned int i; // [rsp+1Ch] [rbp-4h]\n\nfor ( i = 0; i <= 0x1FFF; ++i )\n{\nfor ( ptr = (_QWORD *)vshash[i]; ptr; ptr = v1 )\n{\nv1 = (_QWORD *)*ptr;\nfree(ptr);\n}\nresult = i;\nvshash[i] = 0LL;\n}\nreturn result;\n}",
"original_code": "void\nfree_varscope(void)\n{\n unsigned idx;\n for (idx = 0; idx < 8192; ++idx) {\n struct varscope *vs, *vsnext;\n for (vs = vshash[idx]; vs; vs = vsnext) {\n vsnext = vs->next;\n free(vs);\n }\n vshash[idx] = ((void *)0);\n }\n}",
"canonical_original_code": "void free_varscope()\n{\n unsigned int idx;\n for (idx = 0; idx < 8192; ++idx) {\n struct varscope *vs; struct varscope *vsnext;\n for (vs = vshash[idx]; vs; vs = vsnext) {\n vsnext = vs->next;\n free(vs);\n }\n vshash[idx] = ((void *)0);\n }\n}",
"variable_types": [
[
"idx",
"unsigned int"
],
[
"vs",
"struct varscope { struct varscope *next; struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *node; struct list_head_xcrash *scope; } *"
],
[
"vsnext",
"struct varscope { struct varscope *next; struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *node; struct list_head_xcrash *scope; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct varscope { struct varscope *next; struct node *node; struct list_head_xcrash *scope; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "varscope_find",
"canonical_name": "func9",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall varscope_find(__int64 a1, int a2, char *a3)\n{\n_QWORD *i; // [rsp+28h] [rbp-8h]\n\nfor ( i = (_QWORD *)vshash[(unsigned int)mkhash(a3, a1)]; i; i = (_QWORD *)*i )\n{\nif ( a1 == i[2] && a2 == *(_DWORD *)(i[1] + 16LL) && !strcmp((const char *)(*(_QWORD *)(i[1] + 40LL) + 112LL), a3) )\nreturn i[1];\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func9(__int64 a1, int a2, char *a3)\n{\n_QWORD *i; // [rsp+28h] [rbp-8h]\n\nfor ( i = (_QWORD *)vshash[(unsigned int)func3(a3, a1)]; i; i = (_QWORD *)*i )\n{\nif ( a1 == i[2] && a2 == *(_DWORD *)(i[1] + 16LL) && !strcmp((const char *)(*(_QWORD *)(i[1] + 40LL) + 112LL), a3) )\nreturn i[1];\n}\nreturn 0LL;\n}",
"original_code": "node_t *\nvarscope_find(struct list_head_xcrash *scope,\n enum node_type type, const char *idname)\n{\n struct varscope *vs;\n unsigned idx = mkhash(idname, scope);\n for (vs = vshash[idx]; vs; vs = vs->next)\n if (vs->scope == scope &&\n vs->node->type == type &&\n !strcmp(vs->node->str->text, idname))\n return vs->node;\n return ((void *)0);\n}",
"canonical_original_code": "struct node *varscope_find(struct list_head_xcrash *scope, enum node_type type, char *idname)\n{\n struct varscope *vs;\n unsigned int idx = mkhash(idname, scope);\n for (vs = vshash[idx]; vs; vs = vs->next)\n if (vs->scope == scope &&\n vs->node->type == type &&\n !strcmp(vs->node->str->text, idname))\n return vs->node;\n return ((void *)0);\n}",
"variable_types": [
[
"scope",
"struct list_head_xcrash *"
],
[
"type",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }"
],
[
"idname",
"char *"
],
[
"vs",
"struct varscope { struct varscope *next; struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *node; struct list_head_xcrash *scope; } *"
],
[
"idx",
"unsigned int"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct varscope { struct varscope *next; struct node *node; struct list_head_xcrash *scope; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "varscope_find_next",
"canonical_name": "func10",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall varscope_find_next(__int64 a1, __int64 a2)\n{\nchar *s2; // [rsp+20h] [rbp-10h]\n_QWORD *i; // [rsp+28h] [rbp-8h]\n\ns2 = (char *)(*(_QWORD *)(a2 + 40) + 112LL);\nfor ( i = (_QWORD *)vshash[(unsigned int)mkhash(s2, a1)]; i && a2 != i[1]; i = (_QWORD *)*i )\n;\nif ( !i )\nreturn 0LL;\nwhile ( 1 )\n{\ni = (_QWORD *)*i;\nif ( !i )\nbreak;\nif ( a1 == i[2]\n&& *(_DWORD *)(i[1] + 16LL) == *(_DWORD *)(a2 + 16)\n&& !strcmp((const char *)(*(_QWORD *)(i[1] + 40LL) + 112LL), s2) )\n{\nreturn i[1];\n}\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func10(__int64 a1, __int64 a2)\n{\nchar *s2; // [rsp+20h] [rbp-10h]\n_QWORD *i; // [rsp+28h] [rbp-8h]\n\ns2 = (char *)(*(_QWORD *)(a2 + 40) + 112LL);\nfor ( i = (_QWORD *)vshash[(unsigned int)func3(s2, a1)]; i && a2 != i[1]; i = (_QWORD *)*i )\n;\nif ( !i )\nreturn 0LL;\nwhile ( 1 )\n{\ni = (_QWORD *)*i;\nif ( !i )\nbreak;\nif ( a1 == i[2]\n&& *(_DWORD *)(i[1] + 16LL) == *(_DWORD *)(a2 + 16)\n&& !strcmp((const char *)(*(_QWORD *)(i[1] + 40LL) + 112LL), s2) )\n{\nreturn i[1];\n}\n}\nreturn 0LL;\n}",
"original_code": "node_t *\nvarscope_find_next(struct list_head_xcrash *scope, const node_t *start)\n{\n const char *idname = start->str->text;\n unsigned idx = mkhash(idname, scope);\n struct varscope *vs;\n for (vs = vshash[idx]; vs; vs = vs->next)\n if (vs->node == start)\n break;\n if (!vs)\n return ((void *)0);\n while ( (vs = vs->next) )\n if (vs->scope == scope &&\n vs->node->type == start->type &&\n !strcmp(vs->node->str->text, idname))\n return vs->node;\n return ((void *)0);\n}",
"canonical_original_code": "struct node *varscope_find_next(struct list_head_xcrash *scope, struct node *start)\n{\n char *idname = start->str->text;\n unsigned int idx = mkhash(idname, scope);\n struct varscope *vs;\n for (vs = vshash[idx]; vs; vs = vs->next)\n if (vs->node == start)\n break;\n if (!vs)\n return ((void *)0);\n while ( (vs = vs->next) )\n if (vs->scope == scope &&\n vs->node->type == start->type &&\n !strcmp(vs->node->str->text, idname))\n return vs->node;\n return ((void *)0);\n}",
"variable_types": [
[
"scope",
"struct list_head_xcrash *"
],
[
"start",
"struct node *"
],
[
"idname",
"char *"
],
[
"idx",
"unsigned int"
],
[
"vs",
"struct varscope { struct varscope *next; struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *node; struct list_head_xcrash *scope; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct varscope { struct varscope *next; struct node *node; struct list_head_xcrash *scope; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "varscope_traverse",
"canonical_name": "func11",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall varscope_traverse(__int64 a1, __int64 a2, int a3, char *a4)\n{\n__int64 v7; // [rsp+10h] [rbp-20h] BYREF\n__int64 v8; // [rsp+18h] [rbp-18h]\n__int64 v9; // [rsp+20h] [rbp-10h]\n__int64 v10; // [rsp+28h] [rbp-8h]\n\nv8 = a1;\nv7 = a2;\ndo\n{\nif ( v7 )\n{\nv10 = find_scope(v7, &v7);\n}\nelse\n{\nv10 = v8;\nv8 = 0LL;\n}\nv9 = varscope_find(v10, a3, a4);\nif ( v9 )\nreturn v9;\n}\nwhile ( v10 );\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func11(__int64 a1, __int64 a2, int a3, char *a4)\n{\n__int64 v7; // [rsp+10h] [rbp-20h] BYREF\n__int64 v8; // [rsp+18h] [rbp-18h]\n__int64 v9; // [rsp+20h] [rbp-10h]\n__int64 v10; // [rsp+28h] [rbp-8h]\n\nv8 = a1;\nv7 = a2;\ndo\n{\nif ( v7 )\n{\nv10 = find_scope(v7, &v7);\n}\nelse\n{\nv10 = v8;\nv8 = 0LL;\n}\nv9 = func9(v10, a3, a4);\nif ( v9 )\nreturn v9;\n}\nwhile ( v10 );\nreturn 0LL;\n}",
"original_code": "node_t *\nvarscope_traverse(struct list_head_xcrash *tree, node_t *scopenode,\n enum node_type type, const char *idname)\n{\n node_t *ret;\n struct list_head_xcrash *scope;\n do {\n if (scopenode)\n scope = find_scope(scopenode, &scopenode);\n else {\n scope = tree;\n tree = ((void *)0);\n }\n if ( (ret = varscope_find(scope, type, idname)) )\n return ret;\n } while (scope);\n return ((void *)0);\n}",
"canonical_original_code": "struct node *varscope_traverse(struct list_head_xcrash *tree, struct node *scopenode, enum node_type type, char *idname)\n{\n struct node *ret;\n struct list_head_xcrash *scope;\n do {\n if (scopenode)\n scope = find_scope(scopenode, &scopenode);\n else {\n scope = tree;\n tree = ((void *)0);\n }\n if ( (ret = varscope_find(scope, type, idname)) )\n return ret;\n } while (scope);\n return ((void *)0);\n}",
"variable_types": [
[
"tree",
"struct list_head_xcrash *"
],
[
"scopenode",
"struct node *"
],
[
"type",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }"
],
[
"idname",
"char *"
],
[
"ret",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"scope",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "varscope_remove",
"canonical_name": "func12",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall varscope_remove(__int64 a1)\n{\n__int64 result; // rax\n__int16 v2; // [rsp+20h] [rbp-10h]\n__int64 *i; // [rsp+28h] [rbp-8h]\n\nv2 = find_var_scope(a1);\nfor ( i = &vshash[(unsigned int)mkhash((_BYTE *)(*(_QWORD *)(a1 + 40) + 112LL), v2)]; ; i = (__int64 *)*i )\n{\nresult = *i;\nif ( !*i )\nbreak;\nif ( a1 == *(_QWORD *)(*i + 8) )\n{\nresult = (__int64)i;\n*i = *(_QWORD *)*i;\nreturn result;\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func12(__int64 a1)\n{\n__int64 result; // rax\n__int16 v2; // [rsp+20h] [rbp-10h]\n__int64 *i; // [rsp+28h] [rbp-8h]\n\nv2 = func4(a1);\nfor ( i = &vshash[(unsigned int)func3((_BYTE *)(*(_QWORD *)(a1 + 40) + 112LL), v2)]; ; i = (__int64 *)*i )\n{\nresult = *i;\nif ( !*i )\nbreak;\nif ( a1 == *(_QWORD *)(*i + 8) )\n{\nresult = (__int64)i;\n*i = *(_QWORD *)*i;\nreturn result;\n}\n}\nreturn result;\n}",
"original_code": "void\nvarscope_remove(node_t *node)\n{\n struct list_head_xcrash *scope = find_var_scope(node);\n unsigned idx = mkhash(node->str->text, scope);\n struct varscope *vs, **prev = &vshash[idx];\n while (*prev) {\n vs = *prev;\n if (vs->node == node) {\n *prev = vs->next;\n break;\n }\n prev = &vs->next;\n }\n}",
"canonical_original_code": "void varscope_remove(struct node *node)\n{\n struct list_head_xcrash *scope = find_var_scope(node);\n unsigned int idx = mkhash(node->str->text, scope);\n struct varscope *vs; struct varscope **prev = &vshash[idx];\n while (*prev) {\n vs = *prev;\n if (vs->node == node) {\n *prev = vs->next;\n break;\n }\n prev = &vs->next;\n }\n}",
"variable_types": [
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"scope",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
],
[
"idx",
"unsigned int"
],
[
"vs",
"struct varscope { struct varscope *next; struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *node; struct list_head_xcrash *scope; } *"
],
[
"prev",
"struct varscope { struct varscope *next; struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *node; struct list_head_xcrash *scope; } **"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct varscope { struct varscope *next; struct node *node; struct list_head_xcrash *scope; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "varscope_find_first_var",
"canonical_name": "func13",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall varscope_find_first_var(__int64 a1)\n{\n__int64 v2; // [rsp+18h] [rbp-8h]\n\nv2 = find_var_scope(a1);\nreturn varscope_find(v2, *(_DWORD *)(a1 + 16), (char *)(*(_QWORD *)(a1 + 40) + 112LL));\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func13(__int64 a1)\n{\n__int64 v2; // [rsp+18h] [rbp-8h]\n\nv2 = func4(a1);\nreturn func9(v2, *(_DWORD *)(a1 + 16), (char *)(*(_QWORD *)(a1 + 40) + 112LL));\n}",
"original_code": "node_t *\nvarscope_find_first_var(node_t *var)\n{\n struct list_head_xcrash *scope = find_var_scope(var);\n return varscope_find(scope, var->type, var->str->text);\n}",
"canonical_original_code": "struct node *varscope_find_first_var(struct node *var)\n{\n struct list_head_xcrash *scope = find_var_scope(var);\n return varscope_find(scope, var->type, var->str->text);\n}",
"variable_types": [
[
"var",
"struct node *"
],
[
"scope",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "varscope_find_next_var",
"canonical_name": "func14",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall varscope_find_next_var(__int64 a1)\n{\n__int64 v2; // [rsp+10h] [rbp-10h]\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nv2 = find_var_scope(a1);\nv3 = varscope_find_next(v2, a1);\nif ( !v3 && v2 == *(_QWORD *)(a1 + 72) + 8LL )\nv3 = varscope_find(0LL, *(_DWORD *)(a1 + 16), (char *)(*(_QWORD *)(a1 + 40) + 112LL));\nreturn v3;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func14(__int64 a1)\n{\n__int64 v2; // [rsp+10h] [rbp-10h]\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nv2 = func4(a1);\nv3 = func10(v2, a1);\nif ( !v3 && v2 == *(_QWORD *)(a1 + 72) + 8LL )\nv3 = func9(0LL, *(_DWORD *)(a1 + 16), (char *)(*(_QWORD *)(a1 + 40) + 112LL));\nreturn v3;\n}",
"original_code": "node_t *\nvarscope_find_next_var(node_t *var)\n{\n struct list_head_xcrash *scope = find_var_scope(var);\n node_t *ret = varscope_find_next(scope, var);\n if (!ret && scope == &var->loc.first.pf->parsed)\n ret = varscope_find(((void *)0), var->type, var->str->text);\n return ret;\n}",
"canonical_original_code": "struct node *varscope_find_next_var(struct node *var)\n{\n struct list_head_xcrash *scope = find_var_scope(var);\n struct node *ret = varscope_find_next(scope, var);\n if (!ret && scope == &var->loc.first.pf->parsed)\n ret = varscope_find(((void *)0), var->type, var->str->text);\n return ret;\n}",
"variable_types": [
[
"var",
"struct node *"
],
[
"scope",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
],
[
"ret",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "resolve_typedef",
"canonical_name": "func15",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall resolve_typedef(__int64 a1, __int64 a2)\n{\n__int64 v4; // [rsp+18h] [rbp-8h]\n\nwhile ( !*(_DWORD *)(a2 + 16) && *(_DWORD *)(a2 + 24) == 1 )\n{\nv4 = varscope_traverse(a1, a2, 2, (char *)(*(_QWORD *)(a2 + 40) + 112LL));\nif ( !v4 )\nreturn 0LL;\na2 = first_node(v4 + 192);\nif ( (*(_DWORD *)(a2 + 28) & 0x20) == 0 )\nreturn 0LL;\n}\nreturn a2;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func15(__int64 a1, __int64 a2)\n{\n__int64 v4; // [rsp+18h] [rbp-8h]\n\nwhile ( !*(_DWORD *)(a2 + 16) && *(_DWORD *)(a2 + 24) == 1 )\n{\nv4 = func11(a1, a2, 2, (char *)(*(_QWORD *)(a2 + 40) + 112LL));\nif ( !v4 )\nreturn 0LL;\na2 = func1(v4 + 192);\nif ( (*(_DWORD *)(a2 + 28) & 0x20) == 0 )\nreturn 0LL;\n}\nreturn a2;\n}",
"original_code": "node_t *\nresolve_typedef(struct list_head_xcrash *tree, node_t *type)\n{\n while (type->type == nt_type && type->t.category == type_typedef) {\n node_t *var = varscope_traverse(tree, type,\n nt_var, type->str->text);\n if (!var)\n return ((void *)0);\n type = first_node(&var->child[chv_type]);\n if (! (type->t.flags & (1U << 5)))\n return ((void *)0);\n }\n return type;\n}",
"canonical_original_code": "struct node *resolve_typedef(struct list_head_xcrash *tree, struct node *type)\n{\n while (type->type == nt_type && type->t.category == type_typedef) {\n struct node *var = varscope_traverse(tree, type,\n nt_var, type->str->text);\n if (!var)\n return ((void *)0);\n type = first_node(&var->child[chv_type]);\n if (! (type->t.flags & (1U << 5)))\n return ((void *)0);\n }\n return type;\n}",
"variable_types": [
[
"tree",
"struct list_head_xcrash *"
],
[
"type",
"struct node *"
],
[
"var",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "expr_type",
"canonical_name": "func16",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall expr_type(__int64 a1)\n{\n__int64 v1; // rax\n__int64 result; // rax\n__int64 v3; // [rsp+10h] [rbp-10h]\n__int64 v4; // [rsp+18h] [rbp-8h]\n__int64 v5; // [rsp+18h] [rbp-8h]\n\nif ( *(_DWORD *)(a1 + 16) != 1 )\n_assert_fail(\"expr->type == nt_expr\", \"varscope.c\", 0xDFu, \"expr_type\");\nif ( *(_DWORD *)(a1 + 24) == 335 )\n{\nv1 = first_node(a1 + 192);\nv4 = varscope_find_expr(v1);\nif ( v4 )\n{\nif ( *(_DWORD *)(v4 + 16) != 2 )\n_assert_fail(\"var->type == nt_var\", \"varscope.c\", 0xE5u, \"expr_type\");\nif ( list_empty((_QWORD *)(v4 + 192)) )\n{\nresult = 0LL;\n}\nelse\n{\nv3 = first_node(v4 + 192);\nif ( *(_DWORD *)(v3 + 16) )\n_assert_fail(\"type->type == nt_type\", \"varscope.c\", 0xEBu, \"expr_type\");\nif ( *(_DWORD *)(v3 + 24) != 6 && *(_DWORD *)(v3 + 24) != 5 )\n_assert_fail(\n\"type->t.category == type_array || type->t.category == type_pointer\",\n\"varscope.c\",\n0xEEu,\n\"expr_type\");\nif ( list_empty((_QWORD *)(v3 + 192)) )\nresult = 0LL;\nelse\nresult = first_node(v3 + 192);\n}\n}\nelse\n{\nresult = 0LL;\n}\n}\nelse\n{\nv5 = varscope_find_expr(a1);\nif ( v5 )\n{\nif ( *(_DWORD *)(v5 + 16) != 2 )\n_assert_fail(\"var->type == nt_var\", \"varscope.c\", 0xF7u, \"expr_type\");\nif ( list_empty((_QWORD *)(v5 + 192)) )\nresult = 0LL;\nelse\nresult = first_node(v5 + 192);\n}\nelse\n{\nresult = 0LL;\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func16(__int64 a1)\n{\n__int64 v1; // rax\n__int64 result; // rax\n__int64 v3; // [rsp+10h] [rbp-10h]\n__int64 v4; // [rsp+18h] [rbp-8h]\n__int64 v5; // [rsp+18h] [rbp-8h]\n\nif ( *(_DWORD *)(a1 + 16) != 1 )\n_assert_fail(\"expr->type == nt_expr\", \"varscope.c\", 0xDFu, \"expr_type\");\nif ( *(_DWORD *)(a1 + 24) == 335 )\n{\nv1 = func1(a1 + 192);\nv4 = func17(v1);\nif ( v4 )\n{\nif ( *(_DWORD *)(v4 + 16) != 2 )\n_assert_fail(\"var->type == nt_var\", \"varscope.c\", 0xE5u, \"expr_type\");\nif ( func0((_QWORD *)(v4 + 192)) )\n{\nresult = 0LL;\n}\nelse\n{\nv3 = func1(v4 + 192);\nif ( *(_DWORD *)(v3 + 16) )\n_assert_fail(\"type->type == nt_type\", \"varscope.c\", 0xEBu, \"expr_type\");\nif ( *(_DWORD *)(v3 + 24) != 6 && *(_DWORD *)(v3 + 24) != 5 )\n_assert_fail(\n\"type->t.category == type_array || type->t.category == type_pointer\",\n\"varscope.c\",\n0xEEu,\n\"expr_type\");\nif ( func0((_QWORD *)(v3 + 192)) )\nresult = 0LL;\nelse\nresult = func1(v3 + 192);\n}\n}\nelse\n{\nresult = 0LL;\n}\n}\nelse\n{\nv5 = func17(a1);\nif ( v5 )\n{\nif ( *(_DWORD *)(v5 + 16) != 2 )\n_assert_fail(\"var->type == nt_var\", \"varscope.c\", 0xF7u, \"expr_type\");\nif ( func0((_QWORD *)(v5 + 192)) )\nresult = 0LL;\nelse\nresult = func1(v5 + 192);\n}\nelse\n{\nresult = 0LL;\n}\n}\nreturn result;\n}",
"original_code": "static node_t *\nexpr_type(node_t *expr)\n{\n node_t *var, *type;\n ((void) sizeof ((expr->type == nt_expr) ? 1 : 0), __extension__ ({ if (expr->type == nt_expr) ; else __assert_fail (\"expr->type == nt_expr\", \"varscope.c\", 223, __extension__ __PRETTY_FUNCTION__); }));\n if (expr->e.op == ARRAY) {\n var = first_node(&expr->child[che_arg1]);\n if (! (var = varscope_find_expr(var)) )\n return ((void *)0);\n ((void) sizeof ((var->type == nt_var) ? 1 : 0), __extension__ ({ if (var->type == nt_var) ; else __assert_fail (\"var->type == nt_var\", \"varscope.c\", 229, __extension__ __PRETTY_FUNCTION__); }));\n if (list_empty(&var->child[chv_type]))\n return ((void *)0);\n type = first_node(&var->child[chv_type]);\n ((void) sizeof ((type->type == nt_type) ? 1 : 0), __extension__ ({ if (type->type == nt_type) ; else __assert_fail (\"type->type == nt_type\", \"varscope.c\", 235, __extension__ __PRETTY_FUNCTION__); }));\n ((void) sizeof ((type->t.category == type_array || type->t.category == type_pointer) ? 1 : 0), __extension__ ({ if (type->t.category == type_array || type->t.category == type_pointer) ; else __assert_fail (\"type->t.category == type_array || type->t.category == type_pointer\", \"varscope.c\", 238, __extension__ __PRETTY_FUNCTION__); }));\n return !list_empty(&type->child[cht_type])\n ? first_node(&type->child[cht_type])\n : ((void *)0);\n } else {\n if (! (var = varscope_find_expr(expr)) )\n return ((void *)0);\n ((void) sizeof ((var->type == nt_var) ? 1 : 0), __extension__ ({ if (var->type == nt_var) ; else __assert_fail (\"var->type == nt_var\", \"varscope.c\", 247, __extension__ __PRETTY_FUNCTION__); }));\n return !list_empty(&var->child[chv_type])\n ? first_node(&var->child[chv_type])\n : ((void *)0);\n }\n}",
"canonical_original_code": "static struct node *expr_type(struct node *expr)\n{\n struct node *var; struct node *type;\n ((void) sizeof ((expr->type == nt_expr) ? 1 : 0), __extension__ ({ if (expr->type == nt_expr) ; else __assert_fail (\"expr->type == nt_expr\", \"varscope.c\", 223, __extension__ __PRETTY_FUNCTION__); }));\n if (expr->e.op == ARRAY) {\n var = first_node(&expr->child[che_arg1]);\n if (! (var = varscope_find_expr(var)) )\n return ((void *)0);\n ((void) sizeof ((var->type == nt_var) ? 1 : 0), __extension__ ({ if (var->type == nt_var) ; else __assert_fail (\"var->type == nt_var\", \"varscope.c\", 229, __extension__ __PRETTY_FUNCTION__); }));\n if (list_empty(&var->child[chv_type]))\n return ((void *)0);\n type = first_node(&var->child[chv_type]);\n ((void) sizeof ((type->type == nt_type) ? 1 : 0), __extension__ ({ if (type->type == nt_type) ; else __assert_fail (\"type->type == nt_type\", \"varscope.c\", 235, __extension__ __PRETTY_FUNCTION__); }));\n ((void) sizeof ((type->t.category == type_array || type->t.category == type_pointer) ? 1 : 0), __extension__ ({ if (type->t.category == type_array || type->t.category == type_pointer) ; else __assert_fail (\"type->t.category == type_array || type->t.category == type_pointer\", \"varscope.c\", 238, __extension__ __PRETTY_FUNCTION__); }));\n return !list_empty(&type->child[cht_type])\n ? first_node(&type->child[cht_type])\n : ((void *)0);\n } else {\n if (! (var = varscope_find_expr(expr)) )\n return ((void *)0);\n ((void) sizeof ((var->type == nt_var) ? 1 : 0), __extension__ ({ if (var->type == nt_var) ; else __assert_fail (\"var->type == nt_var\", \"varscope.c\", 247, __extension__ __PRETTY_FUNCTION__); }));\n return !list_empty(&var->child[chv_type])\n ? first_node(&var->child[chv_type])\n : ((void *)0);\n }\n}",
"variable_types": [
[
"expr",
"struct node *"
],
[
"var",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"type",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "varscope_find_expr",
"canonical_name": "func17",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall varscope_find_expr(__int64 a1)\n{\nint v2; // eax\n__int64 v3; // [rsp+20h] [rbp-30h]\n__int64 v4; // [rsp+28h] [rbp-28h]\n__int64 v5; // [rsp+30h] [rbp-20h]\n__int64 v6; // [rsp+38h] [rbp-18h]\n__int64 v7; // [rsp+40h] [rbp-10h]\n__int64 v8; // [rsp+48h] [rbp-8h]\n__int64 v9; // [rsp+48h] [rbp-8h]\n__int64 v10; // [rsp+48h] [rbp-8h]\n\nv6 = *(_QWORD *)(a1 + 72) + 8LL;\nif ( *(_DWORD *)(a1 + 16) != 1 )\nreturn 0LL;\nv2 = *(_DWORD *)(a1 + 24);\nif ( v2 == 321 )\n{\nv7 = varscope_traverse(v6, a1, 2, (char *)(*(_QWORD *)(a1 + 40) + 112LL));\n}\nelse\n{\nif ( v2 > 321 || v2 != 46 && v2 != 273 )\nreturn 0LL;\nif ( list_empty((_QWORD *)(a1 + 192)) )\nreturn 0LL;\nv5 = first_node(a1 + 192);\nv8 = expr_type(v5);\nif ( !v8 )\nreturn 0LL;\nif ( *(_DWORD *)(v8 + 16) )\n_assert_fail(\"type->type == nt_type\", \"varscope.c\", 0x117u, \"varscope_find_expr\");\nif ( *(_DWORD *)(a1 + 24) == 273 )\n{\nv9 = resolve_typedef(v6, v8);\nif ( !v9 )\nreturn 0LL;\nif ( *(_DWORD *)(v9 + 24) != 5 )\n_assert_fail(\"type->t.category == type_pointer\", \"varscope.c\", 0x11Du, \"varscope_find_expr\");\nv8 = first_node(v9 + 192);\n}\nv10 = resolve_typedef(v6, v8);\nif ( !v10 )\nreturn 0LL;\nif ( *(_DWORD *)(v10 + 24) != 2 && *(_DWORD *)(v10 + 24) != 3 && *(_DWORD *)(v10 + 24) != 4 )\n_assert_fail(\n\"type->t.category == type_struct || type->t.category == type_union || type->t.category == type_enum\",\n\"varscope.c\",\n0x124u,\n\"varscope_find_expr\");\nif ( list_empty((_QWORD *)(v10 + 192)) )\n{\nv10 = varscope_traverse(v6, v10, 0, (char *)(*(_QWORD *)(v10 + 40) + 112LL));\nif ( !v10 )\nreturn 0LL;\n}\nv4 = first_node(a1 + 208);\nv7 = varscope_find(v10 + 192, 2, (char *)(*(_QWORD *)(v4 + 40) + 112LL));\n}\nv3 = *(_QWORD *)(*(_QWORD *)(a1 + 88) + 64LL);\nwhile ( v7 && (unsigned int)cond_is_disjunct(v3, *(_QWORD *)(*(_QWORD *)(v7 + 88) + 64LL)) )\nv7 = varscope_find_next_var(v7);\nreturn v7;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func17(__int64 a1)\n{\nint v2; // eax\n__int64 v3; // [rsp+20h] [rbp-30h]\n__int64 v4; // [rsp+28h] [rbp-28h]\n__int64 v5; // [rsp+30h] [rbp-20h]\n__int64 v6; // [rsp+38h] [rbp-18h]\n__int64 v7; // [rsp+40h] [rbp-10h]\n__int64 v8; // [rsp+48h] [rbp-8h]\n__int64 v9; // [rsp+48h] [rbp-8h]\n__int64 v10; // [rsp+48h] [rbp-8h]\n\nv6 = *(_QWORD *)(a1 + 72) + 8LL;\nif ( *(_DWORD *)(a1 + 16) != 1 )\nreturn 0LL;\nv2 = *(_DWORD *)(a1 + 24);\nif ( v2 == 321 )\n{\nv7 = func11(v6, a1, 2, (char *)(*(_QWORD *)(a1 + 40) + 112LL));\n}\nelse\n{\nif ( v2 > 321 || v2 != 46 && v2 != 273 )\nreturn 0LL;\nif ( func0((_QWORD *)(a1 + 192)) )\nreturn 0LL;\nv5 = func1(a1 + 192);\nv8 = func16(v5);\nif ( !v8 )\nreturn 0LL;\nif ( *(_DWORD *)(v8 + 16) )\n_assert_fail(\"type->type == nt_type\", \"varscope.c\", 0x117u, \"varscope_find_expr\");\nif ( *(_DWORD *)(a1 + 24) == 273 )\n{\nv9 = func15(v6, v8);\nif ( !v9 )\nreturn 0LL;\nif ( *(_DWORD *)(v9 + 24) != 5 )\n_assert_fail(\"type->t.category == type_pointer\", \"varscope.c\", 0x11Du, \"varscope_find_expr\");\nv8 = func1(v9 + 192);\n}\nv10 = func15(v6, v8);\nif ( !v10 )\nreturn 0LL;\nif ( *(_DWORD *)(v10 + 24) != 2 && *(_DWORD *)(v10 + 24) != 3 && *(_DWORD *)(v10 + 24) != 4 )\n_assert_fail(\n\"type->t.category == type_struct || type->t.category == type_union || type->t.category == type_enum\",\n\"varscope.c\",\n0x124u,\n\"varscope_find_expr\");\nif ( func0((_QWORD *)(v10 + 192)) )\n{\nv10 = func11(v6, v10, 0, (char *)(*(_QWORD *)(v10 + 40) + 112LL));\nif ( !v10 )\nreturn 0LL;\n}\nv4 = func1(a1 + 208);\nv7 = func9(v10 + 192, 2, (char *)(*(_QWORD *)(v4 + 40) + 112LL));\n}\nv3 = *(_QWORD *)(*(_QWORD *)(a1 + 88) + 64LL);\nwhile ( v7 && (unsigned int)cond_is_disjunct(v3, *(_QWORD *)(*(_QWORD *)(v7 + 88) + 64LL)) )\nv7 = func14(v7);\nreturn v7;\n}",
"original_code": "node_t *\nvarscope_find_expr(node_t *expr)\n{\n struct list_head_xcrash *tree = &expr->loc.first.pf->parsed;\n node_t *left, *right, *type;\n node_t *ret;\n if (expr->type != nt_expr)\n return ((void *)0);\n switch (expr->e.op) {\n case ID:\n ret = varscope_traverse(tree, expr, nt_var, expr->str->text);\n break;\n case '.':\n case PTR_OP:\n if (list_empty(&expr->child[che_arg1]))\n return ((void *)0);\n left = first_node(&expr->child[che_arg1]);\n if (! (type = expr_type(left)) )\n return ((void *)0);\n ((void) sizeof ((type->type == nt_type) ? 1 : 0), __extension__ ({ if (type->type == nt_type) ; else __assert_fail (\"type->type == nt_type\", \"varscope.c\", 279, __extension__ __PRETTY_FUNCTION__); }));\n if (expr->e.op == PTR_OP) {\n if (! (type = resolve_typedef(tree, type)) )\n return ((void *)0);\n ((void) sizeof ((type->t.category == type_pointer) ? 1 : 0), __extension__ ({ if (type->t.category == type_pointer) ; else __assert_fail (\"type->t.category == type_pointer\", \"varscope.c\", 285, __extension__ __PRETTY_FUNCTION__); }));\n type = first_node(&type->child[che_arg1]);\n }\n if (! (type = resolve_typedef(tree, type)) )\n return ((void *)0);\n ((void) sizeof ((type->t.category == type_struct || type->t.category == type_union || type->t.category == type_enum) ? 1 : 0), __extension__ ({ if (type->t.category == type_struct || type->t.category == type_union || type->t.category == type_enum) ; else __assert_fail (\"type->t.category == type_struct || type->t.category == type_union || type->t.category == type_enum\", \"varscope.c\", 292, __extension__ __PRETTY_FUNCTION__); }));\n if (list_empty(&type->child[cht_body]) &&\n ! (type = varscope_traverse(tree, type,\n nt_type, type->str->text)) )\n return ((void *)0);\n right = first_node(&expr->child[che_arg2]);\n ret = varscope_find(&type->child[cht_body],\n nt_var, right->str->text);\n break;\n default:\n return ((void *)0);\n }\n node_t *expr_cond = expr->loc.first.text->cpp_cond;\n while (ret) {\n node_t *ret_cond = ret->loc.first.text->cpp_cond;\n if (!cond_is_disjunct(expr_cond, ret_cond))\n break;\n ret = varscope_find_next_var(ret);\n }\n return ret;\n}",
"canonical_original_code": "struct node *varscope_find_expr(struct node *expr)\n{\n struct list_head_xcrash *tree = &expr->loc.first.pf->parsed;\n struct node *left; struct node *right; struct node *type;\n struct node *ret;\n if (expr->type != nt_expr)\n return ((void *)0);\n switch (expr->e.op) {\n case ID:\n ret = varscope_traverse(tree, expr, nt_var, expr->str->text);\n break;\n case '.':\n case PTR_OP:\n if (list_empty(&expr->child[che_arg1]))\n return ((void *)0);\n left = first_node(&expr->child[che_arg1]);\n if (! (type = expr_type(left)) )\n return ((void *)0);\n ((void) sizeof ((type->type == nt_type) ? 1 : 0), __extension__ ({ if (type->type == nt_type) ; else __assert_fail (\"type->type == nt_type\", \"varscope.c\", 279, __extension__ __PRETTY_FUNCTION__); }));\n if (expr->e.op == PTR_OP) {\n if (! (type = resolve_typedef(tree, type)) )\n return ((void *)0);\n ((void) sizeof ((type->t.category == type_pointer) ? 1 : 0), __extension__ ({ if (type->t.category == type_pointer) ; else __assert_fail (\"type->t.category == type_pointer\", \"varscope.c\", 285, __extension__ __PRETTY_FUNCTION__); }));\n type = first_node(&type->child[che_arg1]);\n }\n if (! (type = resolve_typedef(tree, type)) )\n return ((void *)0);\n ((void) sizeof ((type->t.category == type_struct || type->t.category == type_union || type->t.category == type_enum) ? 1 : 0), __extension__ ({ if (type->t.category == type_struct || type->t.category == type_union || type->t.category == type_enum) ; else __assert_fail (\"type->t.category == type_struct || type->t.category == type_union || type->t.category == type_enum\", \"varscope.c\", 292, __extension__ __PRETTY_FUNCTION__); }));\n if (list_empty(&type->child[cht_body]) &&\n ! (type = varscope_traverse(tree, type,\n nt_type, type->str->text)) )\n return ((void *)0);\n right = first_node(&expr->child[che_arg2]);\n ret = varscope_find(&type->child[cht_body],\n nt_var, right->str->text);\n break;\n default:\n return ((void *)0);\n }\n struct node *expr_cond = expr->loc.first.text->cpp_cond;\n while (ret) {\n struct node *ret_cond = ret->loc.first.text->cpp_cond;\n if (!cond_is_disjunct(expr_cond, ret_cond))\n break;\n ret = varscope_find_next_var(ret);\n }\n return ret;\n}",
"variable_types": [
[
"expr",
"struct node *"
],
[
"tree",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
],
[
"left",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"right",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"type",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"ret",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"expr_cond",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"ret_cond",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "find_global",
"canonical_name": "func18",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall find_global(int *a1, __int64 a2, int a3, char *a4)\n{\n__int64 i; // [rsp+20h] [rbp-10h]\n__int64 v8; // [rsp+28h] [rbp-8h]\n\nv8 = varscope_find(a2, a3, a4);\nif ( !v8 && a2 )\nv8 = varscope_find(0LL, a3, a4);\nif ( v8 )\nreturn v8;\nfor ( i = *((_QWORD *)a1 + 1); i != *((_QWORD *)a1 + 1) + 104LL * *a1; i += 104LL )\n{\nv8 = varscope_find(i + 8, a3, a4);\nif ( v8 )\nbreak;\n}\nreturn v8;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func18(int *a1, __int64 a2, int a3, char *a4)\n{\n__int64 i; // [rsp+20h] [rbp-10h]\n__int64 v8; // [rsp+28h] [rbp-8h]\n\nv8 = func9(a2, a3, a4);\nif ( !v8 && a2 )\nv8 = func9(0LL, a3, a4);\nif ( v8 )\nreturn v8;\nfor ( i = *((_QWORD *)a1 + 1); i != *((_QWORD *)a1 + 1) + 104LL * *a1; i += 104LL )\n{\nv8 = func9(i + 8, a3, a4);\nif ( v8 )\nbreak;\n}\nreturn v8;\n}",
"original_code": "static node_t *\nfind_global(const struct file_array *files, struct list_head_xcrash *scope,\n enum node_type type, const char *idname)\n{\n node_t *ret = varscope_find(scope, type, idname);\n if (!ret && scope)\n ret = varscope_find(((void *)0), type, idname);\n if (ret)\n return ret;\n struct parsed_file *pf;\n for ((pf) = (files)->array; (pf) != &(files)->array[(files)->n]; ++(pf))\n if ( (ret = varscope_find(&pf->parsed, type, idname)) )\n break;\n return ret;\n}",
"canonical_original_code": "static struct node *find_global(struct file_array *files, struct list_head_xcrash *scope, enum node_type type, char *idname)\n{\n struct node *ret = varscope_find(scope, type, idname);\n if (!ret && scope)\n ret = varscope_find(((void *)0), type, idname);\n if (ret)\n return ret;\n struct parsed_file *pf;\n for ((pf) = (files)->array; (pf) != &(files)->array[(files)->n]; ++(pf))\n if ( (ret = varscope_find(&pf->parsed, type, idname)) )\n break;\n return ret;\n}",
"variable_types": [
[
"files",
"struct file_array { int n; struct parsed_file *array; } *"
],
[
"scope",
"struct list_head_xcrash *"
],
[
"type",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }"
],
[
"idname",
"char *"
],
[
"ret",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"pf",
"struct parsed_file { char *name; struct list_head_xcrash { struct list_head_xcrash *next; } parsed; struct list_head_xcrash raw; struct loc { struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node { struct list_head_xcrash list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *text; } first; struct loc *parent; } loc; int clean; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct file_array { int n; struct parsed_file *array; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "find_symbol",
"canonical_name": "func20",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall find_symbol(int *a1, __int64 a2, const char *a3)\n{\n__int64 v3; // rax\nchar *v5; // [rsp+8h] [rbp-38h]\nint v6; // [rsp+28h] [rbp-18h] BYREF\nint v7; // [rsp+2Ch] [rbp-14h] BYREF\n__int64 v8; // [rsp+30h] [rbp-10h]\n__int64 i; // [rsp+38h] [rbp-8h]\n\nv5 = (char *)&a3[check_prefix(a3, &v7, &v6)];\nif ( v7 == -1 )\n{\nv3 = find_global(a1, a2, 2, v5);\nif ( !v3 )\nv3 = find_global(a1, a2, 0, v5);\n}\nelse\n{\nv3 = find_global(a1, a2, v7, v5);\n}\nfor ( i = v3; i; i = varscope_find_next(a2, i) )\n{\nif ( v6 == -1 )\nreturn i;\nif ( !*(_DWORD *)(i + 16) && *(_DWORD *)(i + 24) == v6 )\nreturn i;\nif ( *(_DWORD *)(i + 16) == 2 )\n{\nv8 = first_node(i + 192);\nif ( v8 == i + 192 )\n_assert_fail(\"&type->list != &node->child[chv_type]\", \"varscope.c\", 0x189u, \"find_symbol\");\nif ( *(_DWORD *)(v8 + 16) )\n_assert_fail(\"type->type == nt_type\", \"varscope.c\", 0x18Au, \"find_symbol\");\nif ( (*(_DWORD *)(v8 + 28) & v6) != 0 )\nreturn i;\n}\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func20(int *a1, __int64 a2, const char *a3)\n{\n__int64 v3; // rax\nchar *v5; // [rsp+8h] [rbp-38h]\nint v6; // [rsp+28h] [rbp-18h] BYREF\nint v7; // [rsp+2Ch] [rbp-14h] BYREF\n__int64 v8; // [rsp+30h] [rbp-10h]\n__int64 i; // [rsp+38h] [rbp-8h]\n\nv5 = (char *)&a3[func19(a3, &v7, &v6)];\nif ( v7 == -1 )\n{\nv3 = func18(a1, a2, 2, v5);\nif ( !v3 )\nv3 = func18(a1, a2, 0, v5);\n}\nelse\n{\nv3 = func18(a1, a2, v7, v5);\n}\nfor ( i = v3; i; i = func10(a2, i) )\n{\nif ( v6 == -1 )\nreturn i;\nif ( !*(_DWORD *)(i + 16) && *(_DWORD *)(i + 24) == v6 )\nreturn i;\nif ( *(_DWORD *)(i + 16) == 2 )\n{\nv8 = func1(i + 192);\nif ( v8 == i + 192 )\n_assert_fail(\"&type->list != &node->child[chv_type]\", \"varscope.c\", 0x189u, \"find_symbol\");\nif ( *(_DWORD *)(v8 + 16) )\n_assert_fail(\"type->type == nt_type\", \"varscope.c\", 0x18Au, \"find_symbol\");\nif ( (*(_DWORD *)(v8 + 28) & v6) != 0 )\nreturn i;\n}\n}\nreturn 0LL;\n}",
"original_code": "static node_t *\nfind_symbol(const struct file_array *files, struct list_head_xcrash *scope,\n const char *spec)\n{\n enum node_type nodetype;\n int extra;\n spec += check_prefix(spec, &nodetype, &extra);\n node_t *node = (nodetype != -1)\n ? find_global(files, scope, nodetype, spec)\n : (find_global(files, scope, nt_var, spec)\n ?: find_global(files, scope, nt_type, spec));\n while (node) {\n if (extra == -1)\n return node;\n if (node->type == nt_type && node->t.category == extra)\n return node;\n if (node->type == nt_var) {\n node_t *type = first_node(&node->child[chv_type]);\n ((void) sizeof ((&type->list != &node->child[chv_type]) ? 1 : 0), __extension__ ({ if (&type->list != &node->child[chv_type]) ; else __assert_fail (\"&type->list != &node->child[chv_type]\", \"varscope.c\", 393, __extension__ __PRETTY_FUNCTION__); }));\n ((void) sizeof ((type->type == nt_type) ? 1 : 0), __extension__ ({ if (type->type == nt_type) ; else __assert_fail (\"type->type == nt_type\", \"varscope.c\", 394, __extension__ __PRETTY_FUNCTION__); }));\n if (type->t.flags & extra)\n return node;\n }\n node = varscope_find_next(scope, node);\n }\n return ((void *)0);\n}",
"canonical_original_code": "static struct node *find_symbol(struct file_array *files, struct list_head_xcrash *scope, char *spec)\n{\n enum node_type nodetype;\n int extra;\n spec += check_prefix(spec, &nodetype, &extra);\n struct node *node = (nodetype != -1)\n ? find_global(files, scope, nodetype, spec)\n : (find_global(files, scope, nt_var, spec)\n ?: find_global(files, scope, nt_type, spec));\n while (node) {\n if (extra == -1)\n return node;\n if (node->type == nt_type && node->t.category == extra)\n return node;\n if (node->type == nt_var) {\n struct node *type = first_node(&node->child[chv_type]);\n ((void) sizeof ((&type->list != &node->child[chv_type]) ? 1 : 0), __extension__ ({ if (&type->list != &node->child[chv_type]) ; else __assert_fail (\"&type->list != &node->child[chv_type]\", \"varscope.c\", 393, __extension__ __PRETTY_FUNCTION__); }));\n ((void) sizeof ((type->type == nt_type) ? 1 : 0), __extension__ ({ if (type->type == nt_type) ; else __assert_fail (\"type->type == nt_type\", \"varscope.c\", 394, __extension__ __PRETTY_FUNCTION__); }));\n if (type->t.flags & extra)\n return node;\n }\n node = varscope_find_next(scope, node);\n }\n return ((void *)0);\n}",
"variable_types": [
[
"files",
"struct file_array { int n; struct parsed_file *array; } *"
],
[
"scope",
"struct list_head_xcrash *"
],
[
"spec",
"char *"
],
[
"nodetype",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }"
],
[
"extra",
"int"
],
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"type",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct file_array { int n; struct parsed_file *array; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
},
{
"name": "varscope_symbol",
"canonical_name": "func21",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall varscope_symbol(int *a1, char *a2)\n{\nsize_t v2; // rax\nvoid *v3; // rsp\nchar *s; // [rsp+0h] [rbp-80h] BYREF\nint *v6; // [rsp+8h] [rbp-78h]\n__int64 v7; // [rsp+10h] [rbp-70h]\nchar *dest; // [rsp+18h] [rbp-68h]\nchar **v9; // [rsp+20h] [rbp-60h]\nsize_t v10; // [rsp+28h] [rbp-58h]\n__int64 v11; // [rsp+30h] [rbp-50h]\n__int64 v12; // [rsp+38h] [rbp-48h]\n__int64 v13; // [rsp+40h] [rbp-40h]\nchar *v14; // [rsp+48h] [rbp-38h]\n\nv6 = a1;\ns = a2;\nv2 = strlen(a2) + 1;\nv10 = v2 - 1;\nv3 = alloca(16 * ((v2 + 15) / 0x10));\nv9 = &s;\ndest = (char *)&s;\nstrcpy((char *)&s, s);\nv14 = strchr(dest, 58);\nif ( v14 )\n{\n*v14 = 0;\nv7 = find_file(v6, dest);\nif ( !v7 )\nreturn 0LL;\nv13 = v7 + 8;\n}\nelse\n{\nv14 = dest - 1;\nv13 = 0LL;\n}\nv12 = v13;\nv11 = 0LL;\ndo\n{\ndest = v14 + 1;\nv14 = strchr(v14 + 1, 46);\nif ( v14 )\n*v14 = 0;\nif ( v11 )\nv12 = node_scope(v11);\nv11 = find_symbol(v6, v12, dest);\nif ( !v11 )\nreturn 0LL;\nv11 = resolve_typedef(v13, v11);\nif ( !v11 )\nreturn 0LL;\n}\nwhile ( v14 && v14[1] );\nreturn v11;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func21(int *a1, char *a2)\n{\nsize_t v2; // rax\nvoid *v3; // rsp\nchar *s; // [rsp+0h] [rbp-80h] BYREF\nint *v6; // [rsp+8h] [rbp-78h]\n__int64 v7; // [rsp+10h] [rbp-70h]\nchar *dest; // [rsp+18h] [rbp-68h]\nchar **v9; // [rsp+20h] [rbp-60h]\nsize_t v10; // [rsp+28h] [rbp-58h]\n__int64 v11; // [rsp+30h] [rbp-50h]\n__int64 v12; // [rsp+38h] [rbp-48h]\n__int64 v13; // [rsp+40h] [rbp-40h]\nchar *v14; // [rsp+48h] [rbp-38h]\n\nv6 = a1;\ns = a2;\nv2 = strlen(a2) + 1;\nv10 = v2 - 1;\nv3 = alloca(16 * ((v2 + 15) / 0x10));\nv9 = &s;\ndest = (char *)&s;\nstrcpy((char *)&s, s);\nv14 = strchr(dest, 58);\nif ( v14 )\n{\n*v14 = 0;\nv7 = find_file(v6, dest);\nif ( !v7 )\nreturn 0LL;\nv13 = v7 + 8;\n}\nelse\n{\nv14 = dest - 1;\nv13 = 0LL;\n}\nv12 = v13;\nv11 = 0LL;\ndo\n{\ndest = v14 + 1;\nv14 = strchr(v14 + 1, 46);\nif ( v14 )\n*v14 = 0;\nif ( v11 )\nv12 = node_scope(v11);\nv11 = func20(v6, v12, dest);\nif ( !v11 )\nreturn 0LL;\nv11 = func15(v13, v11);\nif ( !v11 )\nreturn 0LL;\n}\nwhile ( v14 && v14[1] );\nreturn v11;\n}",
"original_code": "node_t *\nvarscope_symbol(const struct file_array *files, const char *name)\n{\n struct list_head_xcrash *tree;\n char localname[strlen(name) + 1];\n char *spec, *sep;\n spec = localname;\n strcpy(spec, name);\n if ( (sep = strchr(spec, ':')) ) {\n struct parsed_file *pf;\n *sep = 0;\n if (! (pf = find_file(files, spec)) )\n return ((void *)0);\n tree = &pf->parsed;\n } else {\n sep = spec - 1;\n tree = ((void *)0);\n }\n struct list_head_xcrash *scope = tree;\n node_t *node = ((void *)0);\n do {\n spec = sep + 1;\n if ( (sep = strchr(spec, '.')) )\n *sep = 0;\n if (node)\n scope = node_scope(node);\n if (! (node = find_symbol(files, scope, spec)) )\n return ((void *)0);\n if (! (node = resolve_typedef(tree, node)) )\n return ((void *)0);\n } while (sep && sep[1]);\n return node;\n}",
"canonical_original_code": "struct node *varscope_symbol(struct file_array *files, char *name)\n{\n struct list_head_xcrash *tree;\n char localname[-1];\n char *spec; char *sep;\n spec = localname;\n strcpy(spec, name);\n if ( (sep = strchr(spec, ':')) ) {\n struct parsed_file *pf;\n *sep = 0;\n if (! (pf = find_file(files, spec)) )\n return ((void *)0);\n tree = &pf->parsed;\n } else {\n sep = spec - 1;\n tree = ((void *)0);\n }\n struct list_head_xcrash *scope = tree;\n struct node *node = ((void *)0);\n do {\n spec = sep + 1;\n if ( (sep = strchr(spec, '.')) )\n *sep = 0;\n if (node)\n scope = node_scope(node);\n if (! (node = find_symbol(files, scope, spec)) )\n return ((void *)0);\n if (! (node = resolve_typedef(tree, node)) )\n return ((void *)0);\n } while (sep && sep[1]);\n return node;\n}",
"variable_types": [
[
"files",
"struct file_array { int n; struct parsed_file *array; } *"
],
[
"name",
"char *"
],
[
"tree",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
],
[
"localname",
"char [-1]"
],
[
"spec",
"char *"
],
[
"sep",
"char *"
],
[
"pf",
"struct parsed_file { char *name; struct list_head_xcrash { struct list_head_xcrash *next; } parsed; struct list_head_xcrash raw; struct loc { struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node { struct list_head_xcrash list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *text; } first; struct loc *parent; } loc; int clean; } *"
],
[
"scope",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
],
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct file_array { int n; struct parsed_file *array; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }"
],
"binary_hash": "b298887007b344c078d2cf0245e79ff862a388dfc3d4dcc8552f3644a1c8c826"
}
] |
bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165 | ptesarik/xcrash-scripts | [
[
"list_empty",
"->",
"dump_node"
],
[
"first_node",
"->",
"shortdump_type",
"shortdump_scope"
],
[
"dump_node_text",
"->",
"dump_node",
"shortdump_type"
],
[
"node_file_name",
"->",
"shortdump_var"
],
[
"dump_basic_type",
"->",
"dump_type"
],
[
"name_string",
"->",
"dump_type",
"dump_var"
],
[
"dump_type",
"->",
"dump_basic_type",
"name_string",
"dump_node",
"shortdump_type"
],
[
"dump_op",
"->",
"dump_expr"
],
[
"dump_expr",
"->",
"dump_op",
"dump_node"
],
[
"dump_var",
"->",
"name_string",
"dump_node"
],
[
"dump_child_pos",
"->",
"dump_node"
],
[
"dump_node",
"->",
"dump_node_text",
"dump_var",
"dump_expr",
"dump_type",
"list_empty",
"dump_child_pos"
],
[
"shortdump_type",
"->",
"dump_type",
"first_node",
"dump_node_text",
"shortdump_scope"
],
[
"shortdump_scope",
"->",
"first_node",
"shortdump_type",
"shortdump_var"
],
[
"shortdump_var",
"->",
"node_file_name",
"shortdump_scope",
"shortdump_varind"
],
[
"dump_ind",
"->",
"shortdump_varind"
],
[
"shortdump_varind",
"->",
"shortdump_var",
"dump_ind"
]
] | [] | [
{
"name": "list_empty",
"canonical_name": "func0",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "_BOOL8 __fastcall list_empty(_QWORD *a1)\n{\nreturn a1 == (_QWORD *)*a1;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func0(_QWORD *a1)\n{\nreturn a1 == (_QWORD *)*a1;\n}",
"original_code": "static inline int list_empty(const struct list_head_xcrash *head)\n{\n return head->next == head;\n}",
"canonical_original_code": "static inline int list_empty(struct list_head_xcrash *head)\n{\n return head->next == head;\n}",
"variable_types": [
[
"head",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct list_head_xcrash { struct list_head_xcrash *next; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "first_node",
"canonical_name": "func1",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall first_node(__int64 a1)\n{\nreturn *(_QWORD *)a1;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1)\n{\nreturn *(_QWORD *)a1;\n}",
"original_code": "static inline node_t *\nfirst_node(const struct list_head_xcrash *nodelist)\n{\n return ({ const struct list_head_xcrash *__mptr = (nodelist->next); (node_t *)( (char *)__mptr - __builtin_offsetof (node_t, list) );});\n}",
"canonical_original_code": "static inline struct node *first_node(struct list_head_xcrash *nodelist)\n{\n return ({ struct list_head_xcrash *__mptr = (nodelist->next); (struct node *)( (char *)__mptr - __builtin_offsetof (node_t, list) );});\n}",
"variable_types": [
[
"nodelist",
"struct list_head_xcrash *"
],
[
"__mptr",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "dump_node_text",
"canonical_name": "func2",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall dump_node_text(__int64 a1, unsigned int a2)\n{\nreturn dump_text(*(_QWORD *)(a1 + 88), *(_QWORD *)(a1 + 112), a2);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, unsigned int a2)\n{\nreturn dump_text(*(_QWORD *)(a1 + 88), *(_QWORD *)(a1 + 112), a2);\n}",
"original_code": "static inline void\ndump_node_text(node_t *node, int markup)\n{\n dump_text(node->loc.first.text, node->loc.last.text, markup);\n}",
"canonical_original_code": "static inline void dump_node_text(struct node *node, int markup)\n{\n dump_text(node->loc.first.text, node->loc.last.text, markup);\n}",
"variable_types": [
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"markup",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "node_file_name",
"canonical_name": "func3",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "const char *__fastcall node_file_name(__int64 a1)\n{\nconst char *result; // rax\n\nresult = **(const char ***)(a1 + 72);\nif ( !result )\nresult = \"<builtin>\";\nreturn result;\n}\n",
"canonical_decompiled_code": "const char *__fastcall func3(__int64 a1)\n{\nconst char *result; // rax\n\nresult = **(const char ***)(a1 + 72);\nif ( !result )\nresult = \"<builtin>\";\nreturn result;\n}",
"original_code": "static inline const char *\nnode_file_name(node_t *node)\n{\n return node->loc.first.pf->name ?: \"<builtin>\";\n}",
"canonical_original_code": "static inline char *node_file_name(struct node *node)\n{\n return node->loc.first.pf->name ?: \"<builtin>\";\n}",
"variable_types": [
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "char *",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "dump_basic_type",
"canonical_name": "func4",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "int __fastcall dump_basic_type(__int64 a1)\n{\n__int64 v1; // rax\nint v4; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nv4 = 0;\nLODWORD(v1) = 0;\nfor ( i = 0; i <= 9; ++i )\n{\nv1 = (*(_QWORD *)(a1 + 8) >> i) & 1LL;\nif ( v1 )\n{\nif ( v4++ )\nputc(32, fdump);\nLODWORD(v1) = fputs((&types_4)[i], fdump);\n}\n}\nreturn v1;\n}\n",
"canonical_decompiled_code": "int __fastcall func4(__int64 a1)\n{\n__int64 v1; // rax\nint v4; // [rsp+18h] [rbp-8h]\nint i; // [rsp+1Ch] [rbp-4h]\n\nv4 = 0;\nLODWORD(v1) = 0;\nfor ( i = 0; i <= 9; ++i )\n{\nv1 = (*(_QWORD *)(a1 + 8) >> i) & 1LL;\nif ( v1 )\n{\nif ( v4++ )\nputc(32, fdump);\nLODWORD(v1) = fputs((&types_4)[i], fdump);\n}\n}\nreturn v1;\n}",
"original_code": "static void\ndump_basic_type(type_t *type)\n{\n static const char *types[] = {\n [bt_char] = \"char\",\n [bt_double] = \"double\",\n [bt_float] = \"float\",\n [bt_int] = \"int\",\n [bt_long] = \"long\",\n [bt_longlong] = \"long\",\n [bt_short] = \"short\",\n [bt_signed] = \"signed\",\n [bt_unsigned] = \"unsigned\",\n [bt_void] = \"void\",\n };\n int i, n;\n for (i = n = 0; i < bt_max; ++i) {\n if (! (type->btype & (1UL << i)) )\n continue;\n if (n++)\n putc(' ', fdump);\n fputs(types[i], fdump);\n }\n}",
"canonical_original_code": "static void dump_basic_type(struct type *type)\n{\n static char *types[] = {\n [bt_char] = \"char\",\n [bt_double] = \"double\",\n [bt_float] = \"float\",\n [bt_int] = \"int\",\n [bt_long] = \"long\",\n [bt_longlong] = \"long\",\n [bt_short] = \"short\",\n [bt_signed] = \"signed\",\n [bt_unsigned] = \"unsigned\",\n [bt_void] = \"void\",\n };\n int i; int n;\n for (i = n = 0; i < bt_max; ++i) {\n if (! (type->btype & (1UL << i)) )\n continue;\n if (n++)\n putc(' ', fdump);\n fputs(types[i], fdump);\n }\n}",
"variable_types": [
[
"type",
"struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } *"
],
[
"types",
"char *[]"
],
[
"i",
"int"
],
[
"n",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "name_string",
"canonical_name": "func5",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "const char *__fastcall name_string(__int64 a1)\n{\nconst char *result; // rax\n\nif ( *(_QWORD *)(a1 + 40) )\nresult = (const char *)(*(_QWORD *)(a1 + 40) + 112LL);\nelse\nresult = \"<anonymous>\";\nreturn result;\n}\n",
"canonical_decompiled_code": "const char *__fastcall func5(__int64 a1)\n{\nconst char *result; // rax\n\nif ( *(_QWORD *)(a1 + 40) )\nresult = (const char *)(*(_QWORD *)(a1 + 40) + 112LL);\nelse\nresult = \"<anonymous>\";\nreturn result;\n}",
"original_code": "static const char *\nname_string(node_t *node)\n{\n return node->str ? node->str->text : \"<anonymous>\";\n}",
"canonical_original_code": "static char *name_string(struct node *node)\n{\n return node->str ? node->str->text : \"<anonymous>\";\n}",
"variable_types": [
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "char *",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "dump_type",
"canonical_name": "func6",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "int __fastcall dump_type(__int64 a1, int a2)\n{\nint result; // eax\nconst char *v3; // rax\nconst char *v4; // rax\nconst char *v5; // rax\n_DWORD *v6; // [rsp+18h] [rbp-8h]\n\nv6 = (_DWORD *)(a1 + 24);\nif ( a2 )\n{\nputc(91, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 0x40) != 0 )\nfwrite(\" const\", 1uLL, 6uLL, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 0x80) != 0 )\nfwrite(\" volatile\", 1uLL, 9uLL, fdump);\nfwrite(\" ] \", 1uLL, 3uLL, fdump);\nputc(91, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 1) != 0 )\nfwrite(\" auto\", 1uLL, 5uLL, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 2) != 0 )\nfwrite(\" register\", 1uLL, 9uLL, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 4) != 0 )\nfwrite(\" static\", 1uLL, 7uLL, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 8) != 0 )\nfwrite(\" extern\", 1uLL, 7uLL, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 0x10) != 0 )\nfwrite(\" inline\", 1uLL, 7uLL, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 0x20) != 0 )\nfwrite(\" typedef\", 1uLL, 8uLL, fdump);\nfwrite(\" ] \", 1uLL, 3uLL, fdump);\n}\nswitch ( *v6 )\n{\ncase 0:\nresult = dump_basic_type((__int64)v6);\nbreak;\ncase 1:\nresult = fputs((const char *)(*(_QWORD *)(a1 + 40) + 112LL), fdump);\nbreak;\ncase 2:\nv3 = name_string(a1);\nresult = fprintf(fdump, \"struct %s\", v3);\nbreak;\ncase 3:\nv4 = name_string(a1);\nresult = fprintf(fdump, \"union %s\", v4);\nbreak;\ncase 4:\nv5 = name_string(a1);\nresult = fprintf(fdump, \"enum %s\", v5);\nbreak;\ncase 5:\nresult = fwrite(\"ptr to \", 1uLL, 7uLL, fdump);\nbreak;\ncase 6:\nresult = fwrite(\"array\", 1uLL, 5uLL, fdump);\nbreak;\ncase 7:\nresult = fwrite(\"func\", 1uLL, 4uLL, fdump);\nbreak;\ncase 8:\nresult = fwrite(\"typeof \", 1uLL, 7uLL, fdump);\nbreak;\ndefault:\nresult = fwrite(\"UNKNOWN!\", 1uLL, 8uLL, fdump);\nbreak;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func6(__int64 a1, int a2)\n{\nint result; // eax\nconst char *v3; // rax\nconst char *v4; // rax\nconst char *v5; // rax\n_DWORD *v6; // [rsp+18h] [rbp-8h]\n\nv6 = (_DWORD *)(a1 + 24);\nif ( a2 )\n{\nputc(91, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 0x40) != 0 )\nfwrite(\" const\", 1uLL, 6uLL, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 0x80) != 0 )\nfwrite(\" volatile\", 1uLL, 9uLL, fdump);\nfwrite(\" ] \", 1uLL, 3uLL, fdump);\nputc(91, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 1) != 0 )\nfwrite(\" auto\", 1uLL, 5uLL, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 2) != 0 )\nfwrite(\" register\", 1uLL, 9uLL, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 4) != 0 )\nfwrite(\" static\", 1uLL, 7uLL, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 8) != 0 )\nfwrite(\" extern\", 1uLL, 7uLL, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 0x10) != 0 )\nfwrite(\" inline\", 1uLL, 7uLL, fdump);\nif ( (*(_DWORD *)(a1 + 28) & 0x20) != 0 )\nfwrite(\" typedef\", 1uLL, 8uLL, fdump);\nfwrite(\" ] \", 1uLL, 3uLL, fdump);\n}\nswitch ( *v6 )\n{\ncase 0:\nresult = func4((__int64)v6);\nbreak;\ncase 1:\nresult = fputs((const char *)(*(_QWORD *)(a1 + 40) + 112LL), fdump);\nbreak;\ncase 2:\nv3 = func5(a1);\nresult = fprintf(fdump, \"struct %s\", v3);\nbreak;\ncase 3:\nv4 = func5(a1);\nresult = fprintf(fdump, \"union %s\", v4);\nbreak;\ncase 4:\nv5 = func5(a1);\nresult = fprintf(fdump, \"enum %s\", v5);\nbreak;\ncase 5:\nresult = fwrite(\"ptr to \", 1uLL, 7uLL, fdump);\nbreak;\ncase 6:\nresult = fwrite(\"array\", 1uLL, 5uLL, fdump);\nbreak;\ncase 7:\nresult = fwrite(\"func\", 1uLL, 4uLL, fdump);\nbreak;\ncase 8:\nresult = fwrite(\"typeof \", 1uLL, 7uLL, fdump);\nbreak;\ndefault:\nresult = fwrite(\"UNKNOWN!\", 1uLL, 8uLL, fdump);\nbreak;\n}\nreturn result;\n}",
"original_code": "static void\ndump_type(node_t *node, int showflags)\n{\n type_t *type = &node->t;\n if (showflags) {\n putc('[', fdump);\n if (type->flags & (1U << 6))\n fputs(\" const\", fdump);\n if (type->flags & (1U << 7))\n fputs(\" volatile\", fdump);\n fputs(\" ] \", fdump);\n putc('[', fdump);\n if (type->flags & (1U << 0))\n fputs(\" auto\", fdump);\n if (type->flags & (1U << 1))\n fputs(\" register\", fdump);\n if (type->flags & (1U << 2))\n fputs(\" static\", fdump);\n if (type->flags & (1U << 3))\n fputs(\" extern\", fdump);\n if (type->flags & (1U << 4))\n fputs(\" inline\", fdump);\n if (type->flags & (1U << 5))\n fputs(\" typedef\", fdump);\n fputs(\" ] \", fdump);\n }\n switch(type->category) {\n case type_basic:\n dump_basic_type(type);\n break;\n case type_typedef:\n fputs(node->str->text, fdump);\n break;\n case type_struct:\n fprintf(fdump, \"struct %s\", name_string(node));\n break;\n case type_union:\n fprintf(fdump, \"union %s\", name_string(node));\n break;\n case type_enum:\n fprintf(fdump, \"enum %s\", name_string(node));\n break;\n case type_pointer:\n fputs(\"ptr to \", fdump);\n break;\n case type_array:\n fputs(\"array\", fdump);\n break;\n case type_func:\n fputs(\"func\", fdump);\n break;\n case type_typeof:\n fputs(\"typeof \", fdump);\n break;\n default:\n fputs(\"UNKNOWN!\", fdump);\n }\n}",
"canonical_original_code": "static void dump_type(struct node *node, int showflags)\n{\n struct type *type = &node->t;\n if (showflags) {\n putc('[', fdump);\n if (type->flags & (1U << 6))\n fputs(\" const\", fdump);\n if (type->flags & (1U << 7))\n fputs(\" volatile\", fdump);\n fputs(\" ] \", fdump);\n putc('[', fdump);\n if (type->flags & (1U << 0))\n fputs(\" auto\", fdump);\n if (type->flags & (1U << 1))\n fputs(\" register\", fdump);\n if (type->flags & (1U << 2))\n fputs(\" static\", fdump);\n if (type->flags & (1U << 3))\n fputs(\" extern\", fdump);\n if (type->flags & (1U << 4))\n fputs(\" inline\", fdump);\n if (type->flags & (1U << 5))\n fputs(\" typedef\", fdump);\n fputs(\" ] \", fdump);\n }\n switch(type->category) {\n case type_basic:\n dump_basic_type(type);\n break;\n case type_typedef:\n fputs(node->str->text, fdump);\n break;\n case type_struct:\n fprintf(fdump, \"struct %s\", name_string(node));\n break;\n case type_union:\n fprintf(fdump, \"union %s\", name_string(node));\n break;\n case type_enum:\n fprintf(fdump, \"enum %s\", name_string(node));\n break;\n case type_pointer:\n fputs(\"ptr to \", fdump);\n break;\n case type_array:\n fputs(\"array\", fdump);\n break;\n case type_func:\n fputs(\"func\", fdump);\n break;\n case type_typeof:\n fputs(\"typeof \", fdump);\n break;\n default:\n fputs(\"UNKNOWN!\", fdump);\n }\n}",
"variable_types": [
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"showflags",
"int"
],
[
"type",
"struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "dump_op",
"canonical_name": "func7",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "int __fastcall dump_op(int a1)\n{\nint result; // eax\n\nswitch ( a1 )\n{\ncase 63:\nresult = fwrite(&unk_18DE, 1uLL, 2uLL, fdump);\nbreak;\ncase 123:\ncase 336:\nresult = fwrite(\"block\", 1uLL, 5uLL, fdump);\nbreak;\ncase 258:\ncase 340:\nresult = fwrite(&unk_18E1, 1uLL, 3uLL, fdump);\nbreak;\ncase 259:\nresult = fwrite(&unk_18A4, 1uLL, 3uLL, fdump);\nbreak;\ncase 260:\nresult = fwrite(&unk_18A0, 1uLL, 3uLL, fdump);\nbreak;\ncase 261:\nresult = fwrite(&unk_18A8, 1uLL, 2uLL, fdump);\nbreak;\ncase 262:\nresult = fwrite(&unk_18AB, 1uLL, 2uLL, fdump);\nbreak;\ncase 263:\nresult = fwrite(&unk_18AE, 1uLL, 2uLL, fdump);\nbreak;\ncase 264:\nresult = fwrite(&unk_18B1, 1uLL, 2uLL, fdump);\nbreak;\ncase 265:\nresult = fwrite(&unk_18B4, 1uLL, 2uLL, fdump);\nbreak;\ncase 266:\nresult = fwrite(&unk_18B7, 1uLL, 2uLL, fdump);\nbreak;\ncase 267:\nresult = fwrite(&unk_18BA, 1uLL, 2uLL, fdump);\nbreak;\ncase 268:\nresult = fwrite(&unk_18BD, 1uLL, 2uLL, fdump);\nbreak;\ncase 269:\nresult = fwrite(&unk_18D5, 1uLL, 2uLL, fdump);\nbreak;\ncase 270:\nresult = fwrite(&unk_18D2, 1uLL, 2uLL, fdump);\nbreak;\ncase 271:\nresult = fwrite(&unk_18D8, 1uLL, 2uLL, fdump);\nbreak;\ncase 272:\nresult = fwrite(&unk_18DB, 1uLL, 2uLL, fdump);\nbreak;\ncase 273:\nresult = fwrite(&unk_18E5, 1uLL, 2uLL, fdump);\nbreak;\ncase 274:\nresult = fwrite(&unk_18C3, 1uLL, 2uLL, fdump);\nbreak;\ncase 275:\nresult = fwrite(&unk_18C0, 1uLL, 2uLL, fdump);\nbreak;\ncase 276:\nresult = fwrite(&unk_18CC, 1uLL, 2uLL, fdump);\nbreak;\ncase 277:\nresult = fwrite(&unk_18CF, 1uLL, 2uLL, fdump);\nbreak;\ncase 278:\nresult = fwrite(&unk_18C6, 1uLL, 2uLL, fdump);\nbreak;\ncase 279:\nresult = fwrite(&unk_18C9, 1uLL, 2uLL, fdump);\nbreak;\ncase 280:\nresult = fputc(38, fdump);\nbreak;\ncase 281:\nresult = fputc(42, fdump);\nbreak;\ncase 284:\nresult = fwrite(\"break\", 1uLL, 5uLL, fdump);\nbreak;\ncase 285:\nresult = fwrite(\"case\", 1uLL, 4uLL, fdump);\nbreak;\ncase 287:\nresult = fwrite(\"continue\", 1uLL, 8uLL, fdump);\nbreak;\ncase 288:\nresult = fwrite(\"default\", 1uLL, 7uLL, fdump);\nbreak;\ncase 289:\nresult = fwrite(\"dowhile\", 1uLL, 7uLL, fdump);\nbreak;\ncase 293:\nresult = fwrite(\"for\", 1uLL, 3uLL, fdump);\nbreak;\ncase 294:\nresult = fwrite(\"goto\", 1uLL, 4uLL, fdump);\nbreak;\ncase 295:\nresult = fwrite(\"if\", 1uLL, 2uLL, fdump);\nbreak;\ncase 298:\nresult = fwrite(\"return\", 1uLL, 6uLL, fdump);\nbreak;\ncase 299:\ncase 341:\nresult = fwrite(\"sizeof\", 1uLL, 6uLL, fdump);\nbreak;\ncase 302:\nresult = fwrite(\"switch\", 1uLL, 6uLL, fdump);\nbreak;\ncase 307:\nresult = fwrite(\"while\", 1uLL, 5uLL, fdump);\nbreak;\ncase 323:\nresult = fwrite(\"#if\", 1uLL, 3uLL, fdump);\nbreak;\ncase 324:\nresult = fwrite(\"#ifdef\", 1uLL, 6uLL, fdump);\nbreak;\ncase 325:\nresult = fwrite(\"#ifndef\", 1uLL, 7uLL, fdump);\nbreak;\ncase 326:\nresult = fwrite(\"#elif\", 1uLL, 5uLL, fdump);\nbreak;\ncase 327:\nresult = fwrite(\"#else\", 1uLL, 5uLL, fdump);\nbreak;\ncase 328:\nresult = fwrite(\"#endif\", 1uLL, 6uLL, fdump);\nbreak;\ncase 335:\nresult = fwrite(\"idx\", 1uLL, 3uLL, fdump);\nbreak;\ncase 337:\nresult = fwrite(\"concat\", 1uLL, 6uLL, fdump);\nbreak;\ncase 338:\nresult = fwrite(\"call\", 1uLL, 4uLL, fdump);\nbreak;\ncase 339:\nresult = fwrite(\"label\", 1uLL, 5uLL, fdump);\nbreak;\ncase 342:\nresult = fwrite(\"typecast\", 1uLL, 8uLL, fdump);\nbreak;\ndefault:\nif ( a1 > 255 )\nresult = fprintf(fdump, \"op%d\", (unsigned int)a1);\nelse\nresult = fputc(a1, fdump);\nbreak;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func7(int a1)\n{\nint result; // eax\n\nswitch ( a1 )\n{\ncase 63:\nresult = fwrite(&unk_18DE, 1uLL, 2uLL, fdump);\nbreak;\ncase 123:\ncase 336:\nresult = fwrite(\"block\", 1uLL, 5uLL, fdump);\nbreak;\ncase 258:\ncase 340:\nresult = fwrite(&unk_18E1, 1uLL, 3uLL, fdump);\nbreak;\ncase 259:\nresult = fwrite(&unk_18A4, 1uLL, 3uLL, fdump);\nbreak;\ncase 260:\nresult = fwrite(&unk_18A0, 1uLL, 3uLL, fdump);\nbreak;\ncase 261:\nresult = fwrite(&unk_18A8, 1uLL, 2uLL, fdump);\nbreak;\ncase 262:\nresult = fwrite(&unk_18AB, 1uLL, 2uLL, fdump);\nbreak;\ncase 263:\nresult = fwrite(&unk_18AE, 1uLL, 2uLL, fdump);\nbreak;\ncase 264:\nresult = fwrite(&unk_18B1, 1uLL, 2uLL, fdump);\nbreak;\ncase 265:\nresult = fwrite(&unk_18B4, 1uLL, 2uLL, fdump);\nbreak;\ncase 266:\nresult = fwrite(&unk_18B7, 1uLL, 2uLL, fdump);\nbreak;\ncase 267:\nresult = fwrite(&unk_18BA, 1uLL, 2uLL, fdump);\nbreak;\ncase 268:\nresult = fwrite(&unk_18BD, 1uLL, 2uLL, fdump);\nbreak;\ncase 269:\nresult = fwrite(&unk_18D5, 1uLL, 2uLL, fdump);\nbreak;\ncase 270:\nresult = fwrite(&unk_18D2, 1uLL, 2uLL, fdump);\nbreak;\ncase 271:\nresult = fwrite(&unk_18D8, 1uLL, 2uLL, fdump);\nbreak;\ncase 272:\nresult = fwrite(&unk_18DB, 1uLL, 2uLL, fdump);\nbreak;\ncase 273:\nresult = fwrite(&unk_18E5, 1uLL, 2uLL, fdump);\nbreak;\ncase 274:\nresult = fwrite(&unk_18C3, 1uLL, 2uLL, fdump);\nbreak;\ncase 275:\nresult = fwrite(&unk_18C0, 1uLL, 2uLL, fdump);\nbreak;\ncase 276:\nresult = fwrite(&unk_18CC, 1uLL, 2uLL, fdump);\nbreak;\ncase 277:\nresult = fwrite(&unk_18CF, 1uLL, 2uLL, fdump);\nbreak;\ncase 278:\nresult = fwrite(&unk_18C6, 1uLL, 2uLL, fdump);\nbreak;\ncase 279:\nresult = fwrite(&unk_18C9, 1uLL, 2uLL, fdump);\nbreak;\ncase 280:\nresult = fputc(38, fdump);\nbreak;\ncase 281:\nresult = fputc(42, fdump);\nbreak;\ncase 284:\nresult = fwrite(\"break\", 1uLL, 5uLL, fdump);\nbreak;\ncase 285:\nresult = fwrite(\"case\", 1uLL, 4uLL, fdump);\nbreak;\ncase 287:\nresult = fwrite(\"continue\", 1uLL, 8uLL, fdump);\nbreak;\ncase 288:\nresult = fwrite(\"default\", 1uLL, 7uLL, fdump);\nbreak;\ncase 289:\nresult = fwrite(\"dowhile\", 1uLL, 7uLL, fdump);\nbreak;\ncase 293:\nresult = fwrite(\"for\", 1uLL, 3uLL, fdump);\nbreak;\ncase 294:\nresult = fwrite(\"goto\", 1uLL, 4uLL, fdump);\nbreak;\ncase 295:\nresult = fwrite(\"if\", 1uLL, 2uLL, fdump);\nbreak;\ncase 298:\nresult = fwrite(\"return\", 1uLL, 6uLL, fdump);\nbreak;\ncase 299:\ncase 341:\nresult = fwrite(\"sizeof\", 1uLL, 6uLL, fdump);\nbreak;\ncase 302:\nresult = fwrite(\"switch\", 1uLL, 6uLL, fdump);\nbreak;\ncase 307:\nresult = fwrite(\"while\", 1uLL, 5uLL, fdump);\nbreak;\ncase 323:\nresult = fwrite(\"#if\", 1uLL, 3uLL, fdump);\nbreak;\ncase 324:\nresult = fwrite(\"#ifdef\", 1uLL, 6uLL, fdump);\nbreak;\ncase 325:\nresult = fwrite(\"#ifndef\", 1uLL, 7uLL, fdump);\nbreak;\ncase 326:\nresult = fwrite(\"#elif\", 1uLL, 5uLL, fdump);\nbreak;\ncase 327:\nresult = fwrite(\"#else\", 1uLL, 5uLL, fdump);\nbreak;\ncase 328:\nresult = fwrite(\"#endif\", 1uLL, 6uLL, fdump);\nbreak;\ncase 335:\nresult = fwrite(\"idx\", 1uLL, 3uLL, fdump);\nbreak;\ncase 337:\nresult = fwrite(\"concat\", 1uLL, 6uLL, fdump);\nbreak;\ncase 338:\nresult = fwrite(\"call\", 1uLL, 4uLL, fdump);\nbreak;\ncase 339:\nresult = fwrite(\"label\", 1uLL, 5uLL, fdump);\nbreak;\ncase 342:\nresult = fwrite(\"typecast\", 1uLL, 8uLL, fdump);\nbreak;\ndefault:\nif ( a1 > 255 )\nresult = fprintf(fdump, \"op%d\", (unsigned int)a1);\nelse\nresult = fputc(a1, fdump);\nbreak;\n}\nreturn result;\n}",
"original_code": "static void\ndump_op(int op)\n{\n switch(op) {\n case SHL_ASSIGN: fputs(\"<<=\", fdump); break;\n case SHR_ASSIGN: fputs(\">>=\", fdump); break;\n case ADD_ASSIGN: fputs(\"+=\", fdump); break;\n case SUB_ASSIGN: fputs(\"-=\", fdump); break;\n case MUL_ASSIGN: fputs(\"*=\", fdump); break;\n case DIV_ASSIGN: fputs(\"/=\", fdump); break;\n case MOD_ASSIGN: fputs(\"%=\", fdump); break;\n case AND_ASSIGN: fputs(\"&=\", fdump); break;\n case XOR_ASSIGN: fputs(\"^=\", fdump); break;\n case OR_ASSIGN: fputs(\"|=\", fdump); break;\n case OR_OP: fputs(\"||\", fdump); break;\n case AND_OP: fputs(\"&&\", fdump); break;\n case EQ_OP: fputs(\"==\", fdump); break;\n case NE_OP: fputs(\"!=\", fdump); break;\n case LE_OP: fputs(\"<=\", fdump); break;\n case GE_OP: fputs(\">=\", fdump); break;\n case SHL_OP: fputs(\"<<\", fdump); break;\n case SHR_OP: fputs(\">>\", fdump); break;\n case INC_OP: fputs(\"++\", fdump); break;\n case DEC_OP: fputs(\"--\", fdump); break;\n case '?': fputs(\"?:\", fdump); break;\n case RANGE: fputs(\"...\", fdump); break;\n case PTR_OP: fputs(\"=>\", fdump); break;\n case ADDR_OF: fputs(\"&\", fdump); break;\n case DEREF_OP: fputs(\"*\", fdump); break;\n case SIZEOF_TYPE:\n case SIZEOF: fputs(\"sizeof\", fdump); break;\n case FUNC: fputs(\"call\", fdump); break;\n case ARRAY: fputs(\"idx\", fdump); break;\n case '{': fputs(\"block\", fdump); break;\n case LABEL: fputs(\"label\", fdump); break;\n case CASE: fputs(\"case\", fdump); break;\n case DEFAULT: fputs(\"default\", fdump); break;\n case IF: fputs(\"if\", fdump); break;\n case SWITCH: fputs(\"switch\", fdump); break;\n case WHILE: fputs(\"while\", fdump); break;\n case DO: fputs(\"dowhile\", fdump); break;\n case FOR: fputs(\"for\", fdump); break;\n case GOTO: fputs(\"goto\", fdump); break;\n case CONTINUE: fputs(\"continue\", fdump); break;\n case BREAK: fputs(\"break\", fdump); break;\n case RETURN: fputs(\"return\", fdump); break;\n case ELLIPSIS: fputs(\"...\", fdump); break;\n case TYPECAST: fputs(\"typecast\", fdump); break;\n case CONCAT: fputs(\"concat\", fdump); break;\n case BLOCK: fputs(\"block\", fdump); break;\n case CPP_IF: fputs(\"#if\", fdump); break;\n case CPP_IFDEF: fputs(\"#ifdef\", fdump); break;\n case CPP_IFNDEF: fputs(\"#ifndef\", fdump); break;\n case CPP_ELIF: fputs(\"#elif\", fdump); break;\n case CPP_ELSE: fputs(\"#else\", fdump); break;\n case CPP_ENDIF: fputs(\"#endif\", fdump); break;\n default:\n if (op <= 255)\n fprintf(fdump, \"%c\", op);\n else\n fprintf(fdump, \"op%d\", op);\n }\n}",
"canonical_original_code": "static void dump_op(int op)\n{\n switch(op) {\n case SHL_ASSIGN: fputs(\"<<=\", fdump); break;\n case SHR_ASSIGN: fputs(\">>=\", fdump); break;\n case ADD_ASSIGN: fputs(\"+=\", fdump); break;\n case SUB_ASSIGN: fputs(\"-=\", fdump); break;\n case MUL_ASSIGN: fputs(\"*=\", fdump); break;\n case DIV_ASSIGN: fputs(\"/=\", fdump); break;\n case MOD_ASSIGN: fputs(\"%=\", fdump); break;\n case AND_ASSIGN: fputs(\"&=\", fdump); break;\n case XOR_ASSIGN: fputs(\"^=\", fdump); break;\n case OR_ASSIGN: fputs(\"|=\", fdump); break;\n case OR_OP: fputs(\"||\", fdump); break;\n case AND_OP: fputs(\"&&\", fdump); break;\n case EQ_OP: fputs(\"==\", fdump); break;\n case NE_OP: fputs(\"!=\", fdump); break;\n case LE_OP: fputs(\"<=\", fdump); break;\n case GE_OP: fputs(\">=\", fdump); break;\n case SHL_OP: fputs(\"<<\", fdump); break;\n case SHR_OP: fputs(\">>\", fdump); break;\n case INC_OP: fputs(\"++\", fdump); break;\n case DEC_OP: fputs(\"--\", fdump); break;\n case '?': fputs(\"?:\", fdump); break;\n case RANGE: fputs(\"...\", fdump); break;\n case PTR_OP: fputs(\"=>\", fdump); break;\n case ADDR_OF: fputs(\"&\", fdump); break;\n case DEREF_OP: fputs(\"*\", fdump); break;\n case SIZEOF_TYPE:\n case SIZEOF: fputs(\"sizeof\", fdump); break;\n case FUNC: fputs(\"call\", fdump); break;\n case ARRAY: fputs(\"idx\", fdump); break;\n case '{': fputs(\"block\", fdump); break;\n case LABEL: fputs(\"label\", fdump); break;\n case CASE: fputs(\"case\", fdump); break;\n case DEFAULT: fputs(\"default\", fdump); break;\n case IF: fputs(\"if\", fdump); break;\n case SWITCH: fputs(\"switch\", fdump); break;\n case WHILE: fputs(\"while\", fdump); break;\n case DO: fputs(\"dowhile\", fdump); break;\n case FOR: fputs(\"for\", fdump); break;\n case GOTO: fputs(\"goto\", fdump); break;\n case CONTINUE: fputs(\"continue\", fdump); break;\n case BREAK: fputs(\"break\", fdump); break;\n case RETURN: fputs(\"return\", fdump); break;\n case ELLIPSIS: fputs(\"...\", fdump); break;\n case TYPECAST: fputs(\"typecast\", fdump); break;\n case CONCAT: fputs(\"concat\", fdump); break;\n case BLOCK: fputs(\"block\", fdump); break;\n case CPP_IF: fputs(\"#if\", fdump); break;\n case CPP_IFDEF: fputs(\"#ifdef\", fdump); break;\n case CPP_IFNDEF: fputs(\"#ifndef\", fdump); break;\n case CPP_ELIF: fputs(\"#elif\", fdump); break;\n case CPP_ELSE: fputs(\"#else\", fdump); break;\n case CPP_ENDIF: fputs(\"#endif\", fdump); break;\n default:\n if (op <= 255)\n fprintf(fdump, \"%c\", op);\n else\n fprintf(fdump, \"op%d\", op);\n }\n}",
"variable_types": [
[
"op",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "dump_expr",
"canonical_name": "func8",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "int __fastcall dump_expr(__int64 a1)\n{\nint v1; // eax\n\nv1 = *(_DWORD *)(a1 + 24);\nif ( v1 <= 321 )\n{\nif ( v1 >= 319 )\nreturn fputs((const char *)(*(_QWORD *)(a1 + 40) + 112LL), fdump);\nif ( v1 == 317 )\nreturn fprintf(fdump, \"%ld\", *(_QWORD *)(a1 + 32));\nif ( v1 == 318 )\nreturn fprintf(fdump, \"%f\", *(double *)(a1 + 32));\n}\nreturn dump_op(*(_DWORD *)(a1 + 24));\n}\n",
"canonical_decompiled_code": "int __fastcall func8(__int64 a1)\n{\nint v1; // eax\n\nv1 = *(_DWORD *)(a1 + 24);\nif ( v1 <= 321 )\n{\nif ( v1 >= 319 )\nreturn fputs((const char *)(*(_QWORD *)(a1 + 40) + 112LL), fdump);\nif ( v1 == 317 )\nreturn fprintf(fdump, \"%ld\", *(_QWORD *)(a1 + 32));\nif ( v1 == 318 )\nreturn fprintf(fdump, \"%f\", *(double *)(a1 + 32));\n}\nreturn func7(*(_DWORD *)(a1 + 24));\n}",
"original_code": "static void\ndump_expr(node_t *node)\n{\n expr_t *expr = &node->e;\n switch (expr->op) {\n case INT_CONST:\n fprintf(fdump, \"%ld\", expr->num);\n break;\n case FLOAT_CONST:\n fprintf(fdump, \"%f\", expr->f);\n break;\n case ID:\n case STRING_CONST:\n case CHAR_CONST:\n fputs(node->str->text, fdump);\n break;\n default:\n dump_op(expr->op);\n }\n}",
"canonical_original_code": "static void dump_expr(struct node *node)\n{\n struct expr *expr = &node->e;\n switch (expr->op) {\n case INT_CONST:\n fprintf(fdump, \"%ld\", expr->num);\n break;\n case FLOAT_CONST:\n fprintf(fdump, \"%f\", expr->f);\n break;\n case ID:\n case STRING_CONST:\n case CHAR_CONST:\n fputs(node->str->text, fdump);\n break;\n default:\n dump_op(expr->op);\n }\n}",
"variable_types": [
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"expr",
"struct expr { int op; union { long num; double f; }; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct expr { int op; union { long num; double f; }; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "dump_var",
"canonical_name": "func9",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "int __fastcall dump_var(__int64 a1)\n{\nconst char *v1; // rax\n\nv1 = name_string(a1);\nreturn fprintf(fdump, \"name: %s\", v1);\n}\n",
"canonical_decompiled_code": "int __fastcall func9(__int64 a1)\n{\nconst char *v1; // rax\n\nv1 = func5(a1);\nreturn fprintf(fdump, \"name: %s\", v1);\n}",
"original_code": "static void\ndump_var(node_t *node)\n{\n fprintf(fdump, \"name: %s\", name_string(node));\n}",
"canonical_original_code": "static void dump_var(struct node *node)\n{\n fprintf(fdump, \"name: %s\", name_string(node));\n}",
"variable_types": [
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "dump_child_pos",
"canonical_name": "func10",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "unsigned int __fastcall dump_child_pos(__int64 a1, int a2)\n{\nunsigned int result; // eax\n\nresult = *(_DWORD *)(a1 + 16);\nif ( result == 3 )\n{\nif ( a2 > 3 )\nresult = fprintf(fdump, \"chd_%d\", (unsigned int)a2);\nelse\nresult = fputs((&chd_names_2)[a2], fdump);\n}\nelse\n{\nif ( result > 3 )\nreturn result;\nif ( result == 2 )\n{\nif ( a2 > 3 )\nresult = fprintf(fdump, \"chv_%d\", (unsigned int)a2);\nelse\nresult = fputs((&chv_names_3)[a2], fdump);\n}\nelse\n{\nif ( result )\nreturn fprintf(fdump, \"che_arg%d\", (unsigned int)(a2 + 1));\nif ( a2 == 2 )\nreturn fwrite(\"cht_attr\", 1uLL, 8uLL, fdump);\nif ( a2 > 2 )\nreturn fprintf(fdump, \"cht_%d\", (unsigned int)a2);\nif ( a2 )\n{\nif ( a2 != 1 )\nreturn fprintf(fdump, \"cht_%d\", (unsigned int)a2);\nif ( *(_DWORD *)(a1 + 24) == 6 )\nresult = fwrite(\"cht_size\", 1uLL, 8uLL, fdump);\nelse\nresult = fwrite(\"cht_param\", 1uLL, 9uLL, fdump);\n}\nelse if ( *(_DWORD *)(a1 + 24) == 2 || *(_DWORD *)(a1 + 24) == 3 || *(_DWORD *)(a1 + 24) == 4 )\n{\nresult = fwrite(\"cht_body\", 1uLL, 8uLL, fdump);\n}\nelse if ( *(_DWORD *)(a1 + 24) == 8 )\n{\nresult = fwrite(\"cht_expr\", 1uLL, 8uLL, fdump);\n}\nelse\n{\nresult = fwrite(\"cht_type\", 1uLL, 8uLL, fdump);\n}\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "unsigned int __fastcall func10(__int64 a1, int a2)\n{\nunsigned int result; // eax\n\nresult = *(_DWORD *)(a1 + 16);\nif ( result == 3 )\n{\nif ( a2 > 3 )\nresult = fprintf(fdump, \"chd_%d\", (unsigned int)a2);\nelse\nresult = fputs((&chd_names_2)[a2], fdump);\n}\nelse\n{\nif ( result > 3 )\nreturn result;\nif ( result == 2 )\n{\nif ( a2 > 3 )\nresult = fprintf(fdump, \"chv_%d\", (unsigned int)a2);\nelse\nresult = fputs((&chv_names_3)[a2], fdump);\n}\nelse\n{\nif ( result )\nreturn fprintf(fdump, \"che_arg%d\", (unsigned int)(a2 + 1));\nif ( a2 == 2 )\nreturn fwrite(\"cht_attr\", 1uLL, 8uLL, fdump);\nif ( a2 > 2 )\nreturn fprintf(fdump, \"cht_%d\", (unsigned int)a2);\nif ( a2 )\n{\nif ( a2 != 1 )\nreturn fprintf(fdump, \"cht_%d\", (unsigned int)a2);\nif ( *(_DWORD *)(a1 + 24) == 6 )\nresult = fwrite(\"cht_size\", 1uLL, 8uLL, fdump);\nelse\nresult = fwrite(\"cht_param\", 1uLL, 9uLL, fdump);\n}\nelse if ( *(_DWORD *)(a1 + 24) == 2 || *(_DWORD *)(a1 + 24) == 3 || *(_DWORD *)(a1 + 24) == 4 )\n{\nresult = fwrite(\"cht_body\", 1uLL, 8uLL, fdump);\n}\nelse if ( *(_DWORD *)(a1 + 24) == 8 )\n{\nresult = fwrite(\"cht_expr\", 1uLL, 8uLL, fdump);\n}\nelse\n{\nresult = fwrite(\"cht_type\", 1uLL, 8uLL, fdump);\n}\n}\n}\nreturn result;\n}",
"original_code": "static void\ndump_child_pos(node_t *parent, int pos)\n{\n static const char *const chv_names[] =\n { \"chv_type\", \"chv_bitsize\", \"chv_init\", \"chv_attr\" };\n static const char *const chd_names[] =\n { \"chd_type\", \"chd_var\", \"chd_decl\", \"chd_body\" };\n switch (parent->type) {\n case nt_type:\n switch (pos) {\n case 0:\n if (parent->t.category == type_struct ||\n parent->t.category == type_union ||\n parent->t.category == type_enum)\n fputs(\"cht_body\", fdump);\n else if (parent->t.category == type_typeof)\n fputs(\"cht_expr\", fdump);\n else\n fputs(\"cht_type\", fdump);\n break;\n case 1:\n if (parent->t.category == type_array)\n fputs(\"cht_size\", fdump);\n else\n fputs(\"cht_param\", fdump);\n break;\n case cht_attr:\n fputs(\"cht_attr\", fdump);\n break;\n default:\n fprintf(fdump, \"cht_%d\", pos);\n }\n break;\n case nt_expr:\n fprintf(fdump, \"che_arg%d\", pos + 1);\n break;\n case nt_var:\n if (pos < chv_max)\n fputs(chv_names[pos], fdump);\n else\n fprintf(fdump, \"chv_%d\", pos);\n break;\n case nt_decl:\n if (pos < chd_max)\n fputs(chd_names[pos], fdump);\n else\n fprintf(fdump, \"chd_%d\", pos);\n break;\n }\n}",
"canonical_original_code": "static void dump_child_pos(struct node *parent, int pos)\n{\n static char *chv_names[] = { \"chv_type\", \"chv_bitsize\", \"chv_init\", \"chv_attr\" };\n static char *chd_names[] = { \"chd_type\", \"chd_var\", \"chd_decl\", \"chd_body\" };\n switch (parent->type) {\n case nt_type:\n switch (pos) {\n case 0:\n if (parent->t.category == type_struct ||\n parent->t.category == type_union ||\n parent->t.category == type_enum)\n fputs(\"cht_body\", fdump);\n else if (parent->t.category == type_typeof)\n fputs(\"cht_expr\", fdump);\n else\n fputs(\"cht_type\", fdump);\n break;\n case 1:\n if (parent->t.category == type_array)\n fputs(\"cht_size\", fdump);\n else\n fputs(\"cht_param\", fdump);\n break;\n case cht_attr:\n fputs(\"cht_attr\", fdump);\n break;\n default:\n fprintf(fdump, \"cht_%d\", pos);\n }\n break;\n case nt_expr:\n fprintf(fdump, \"che_arg%d\", pos + 1);\n break;\n case nt_var:\n if (pos < chv_max)\n fputs(chv_names[pos], fdump);\n else\n fprintf(fdump, \"chv_%d\", pos);\n break;\n case nt_decl:\n if (pos < chd_max)\n fputs(chd_names[pos], fdump);\n else\n fprintf(fdump, \"chd_%d\", pos);\n break;\n }\n}",
"variable_types": [
[
"parent",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"pos",
"int"
],
[
"chv_names",
"char *[]"
],
[
"chd_names",
"char *[]"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "dump_node",
"canonical_name": "func11",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall dump_node(__int64 a1)\n{\nunsigned int v1; // eax\nint i; // [rsp+1Ch] [rbp-4h]\n\n++depth;\nfprintf(fdump, \"%*s(>>>\", indent * depth, (const char *)&unk_22AE);\ndump_node_text(a1, 1u);\nfprintf(fdump, \"<<<\\n%*s\", indent * depth, (const char *)&unk_22AE);\nv1 = *(_DWORD *)(a1 + 16);\nif ( v1 == 3 )\n{\nfwrite(\"decl\", 1uLL, 4uLL, fdump);\n}\nelse if ( v1 <= 3 )\n{\nif ( v1 == 2 )\n{\ndump_var(a1);\n}\nelse if ( v1 )\n{\ndump_expr(a1);\n}\nelse\n{\ndump_type(a1, 1);\n}\n}\nputc(10, fdump);\nfor ( i = 0; i < *(_DWORD *)(a1 + 184); ++i )\n{\nif ( !list_empty((_QWORD *)(16 * (i + 12LL) + a1)) )\n{\nfprintf(fdump, \"%*s[\", indent * depth, (const char *)&unk_22AE);\ndump_child_pos(a1, i);\nfwrite(\"]:\\n\", 1uLL, 3uLL, fdump);\n}\ndump_tree(16 * (i + 12LL) + a1);\n}\nfprintf(fdump, \"%*s)\\n\", indent * depth, (const char *)&unk_22AE);\nreturn (unsigned int)--depth;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func11(__int64 a1)\n{\nunsigned int v1; // eax\nint i; // [rsp+1Ch] [rbp-4h]\n\n++depth;\nfprintf(fdump, \"%*s(>>>\", indent * depth, (const char *)&unk_22AE);\nfunc2(a1, 1u);\nfprintf(fdump, \"<<<\\n%*s\", indent * depth, (const char *)&unk_22AE);\nv1 = *(_DWORD *)(a1 + 16);\nif ( v1 == 3 )\n{\nfwrite(\"decl\", 1uLL, 4uLL, fdump);\n}\nelse if ( v1 <= 3 )\n{\nif ( v1 == 2 )\n{\nfunc9(a1);\n}\nelse if ( v1 )\n{\nfunc8(a1);\n}\nelse\n{\nfunc6(a1, 1);\n}\n}\nputc(10, fdump);\nfor ( i = 0; i < *(_DWORD *)(a1 + 184); ++i )\n{\nif ( !func0((_QWORD *)(16 * (i + 12LL) + a1)) )\n{\nfprintf(fdump, \"%*s[\", indent * depth, (const char *)&unk_22AE);\nfunc10(a1, i);\nfwrite(\"]:\\n\", 1uLL, 3uLL, fdump);\n}\ndump_tree(16 * (i + 12LL) + a1);\n}\nfprintf(fdump, \"%*s)\\n\", indent * depth, (const char *)&unk_22AE);\nreturn (unsigned int)--depth;\n}",
"original_code": "static void\ndump_node(node_t *node)\n{\n int i;\n ++depth;\n fprintf(fdump, \"%*s(>>>\", depth*indent, \"\");\n dump_node_text(node, 1);\n fprintf(fdump, \"<<<\\n%*s\", depth*indent, \"\");\n switch (node->type) {\n case nt_type: dump_type(node, 1); break;\n case nt_expr: dump_expr(node); break;\n case nt_var: dump_var (node); break;\n case nt_decl: fputs(\"decl\", fdump); break;\n }\n putc('\\n', fdump);\n for (i = 0; i < node->nchild; ++i) {\n if (!list_empty(&node->child[i])) {\n fprintf(fdump, \"%*s[\", depth*indent, \"\");\n dump_child_pos(node, i);\n fprintf(fdump, \"]:\\n\");\n }\n dump_tree(&node->child[i]);\n }\n fprintf(fdump, \"%*s)\\n\", depth*indent, \"\");\n --depth;\n}",
"canonical_original_code": "static void dump_node(struct node *node)\n{\n int i;\n ++depth;\n fprintf(fdump, \"%*s(>>>\", depth*indent, \"\");\n dump_node_text(node, 1);\n fprintf(fdump, \"<<<\\n%*s\", depth*indent, \"\");\n switch (node->type) {\n case nt_type: dump_type(node, 1); break;\n case nt_expr: dump_expr(node); break;\n case nt_var: dump_var (node); break;\n case nt_decl: fputs(\"decl\", fdump); break;\n }\n putc('\\n', fdump);\n for (i = 0; i < node->nchild; ++i) {\n if (!list_empty(&node->child[i])) {\n fprintf(fdump, \"%*s[\", depth*indent, \"\");\n dump_child_pos(node, i);\n fprintf(fdump, \"]:\\n\");\n }\n dump_tree(&node->child[i]);\n }\n fprintf(fdump, \"%*s)\\n\", depth*indent, \"\");\n --depth;\n}",
"variable_types": [
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"i",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "shortdump_type",
"canonical_name": "func12",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall shortdump_type(__int64 a1)\n{\n__int64 result; // rax\n__int64 v2; // [rsp+10h] [rbp-10h]\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nif ( *(_DWORD *)(a1 + 16) )\n_assert_fail(\"type->type == nt_type\", \"dump.c\", 0x15Cu, \"shortdump_type\");\ndump_type(a1, 0);\nif ( *(_DWORD *)(a1 + 24) == 5\n|| *(_DWORD *)(a1 + 24) == 8\n|| *(_DWORD *)(a1 + 24) == 6\n|| (result = *(unsigned int *)(a1 + 24), (_DWORD)result == 7) )\n{\nresult = first_node(a1 + 192);\nv3 = result;\nif ( result != a1 + 192 )\n{\nif ( *(_DWORD *)(a1 + 24) == 6 )\n{\nv2 = first_node(a1 + 208);\nif ( v2 != a1 + 208 )\n{\nputc(91, fdump);\ndump_node_text(v2, 0);\nputc(93, fdump);\n}\nfwrite(\" of \", 1uLL, 4uLL, fdump);\n}\nelse if ( *(_DWORD *)(a1 + 24) == 7 )\n{\nfwrite(\" returning \", 1uLL, 0xBuLL, fdump);\n}\nresult = shortdump_type(v3);\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func12(__int64 a1)\n{\n__int64 result; // rax\n__int64 v2; // [rsp+10h] [rbp-10h]\n__int64 v3; // [rsp+18h] [rbp-8h]\n\nif ( *(_DWORD *)(a1 + 16) )\n_assert_fail(\"type->type == nt_type\", \"dump.c\", 0x15Cu, \"shortdump_type\");\nfunc6(a1, 0);\nif ( *(_DWORD *)(a1 + 24) == 5\n|| *(_DWORD *)(a1 + 24) == 8\n|| *(_DWORD *)(a1 + 24) == 6\n|| (result = *(unsigned int *)(a1 + 24), (_DWORD)result == 7) )\n{\nresult = func1(a1 + 192);\nv3 = result;\nif ( result != a1 + 192 )\n{\nif ( *(_DWORD *)(a1 + 24) == 6 )\n{\nv2 = func1(a1 + 208);\nif ( v2 != a1 + 208 )\n{\nputc(91, fdump);\nfunc2(v2, 0);\nputc(93, fdump);\n}\nfwrite(\" of \", 1uLL, 4uLL, fdump);\n}\nelse if ( *(_DWORD *)(a1 + 24) == 7 )\n{\nfwrite(\" returning \", 1uLL, 0xBuLL, fdump);\n}\nresult = func12(v3);\n}\n}\nreturn result;\n}",
"original_code": "void\nshortdump_type(node_t *type)\n{\n ((void) sizeof ((type->type == nt_type) ? 1 : 0), __extension__ ({ if (type->type == nt_type) ; else __assert_fail (\"type->type == nt_type\", \"dump.c\", 348, __extension__ __PRETTY_FUNCTION__); }));\n dump_type(type, 0);\n if (type->t.category == type_pointer ||\n type->t.category == type_typeof ||\n type->t.category == type_array ||\n type->t.category == type_func) {\n node_t *child = first_node(&type->child[cht_type]);\n if (&child->list == &type->child[cht_type])\n return;\n if (type->t.category == type_array) {\n node_t *size = first_node(&type->child[cht_size]);\n if (&size->list != &type->child[cht_size]) {\n putc('[', fdump);\n dump_node_text(size, 0);\n putc(']', fdump);\n }\n fputs(\" of \", fdump);\n } else if (type->t.category == type_func)\n fputs(\" returning \", fdump);\n shortdump_type(child);\n }\n}",
"canonical_original_code": "void shortdump_type(struct node *type)\n{\n ((void) sizeof ((type->type == nt_type) ? 1 : 0), __extension__ ({ if (type->type == nt_type) ; else __assert_fail (\"type->type == nt_type\", \"dump.c\", 348, __extension__ __PRETTY_FUNCTION__); }));\n dump_type(type, 0);\n if (type->t.category == type_pointer ||\n type->t.category == type_typeof ||\n type->t.category == type_array ||\n type->t.category == type_func) {\n struct node *child = first_node(&type->child[cht_type]);\n if (&child->list == &type->child[cht_type])\n return;\n if (type->t.category == type_array) {\n struct node *size = first_node(&type->child[cht_size]);\n if (&size->list != &type->child[cht_size]) {\n putc('[', fdump);\n dump_node_text(size, 0);\n putc(']', fdump);\n }\n fputs(\" of \", fdump);\n } else if (type->t.category == type_func)\n fputs(\" returning \", fdump);\n shortdump_type(child);\n }\n}",
"variable_types": [
[
"type",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"child",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"size",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "shortdump_scope",
"canonical_name": "func13",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "int __fastcall shortdump_scope(__int64 a1)\n{\nint result; // eax\n__int64 v2; // [rsp+18h] [rbp-18h] BYREF\n__int64 v3; // [rsp+20h] [rbp-10h]\n__int64 v4; // [rsp+28h] [rbp-8h]\n\nv4 = find_scope(a1, &v2);\nif ( !v4 )\nreturn fwrite(\"<global>\", 1uLL, 8uLL, fdump);\nif ( v4 == *(_QWORD *)(a1 + 72) + 8LL )\nreturn fwrite(\"<file>\", 1uLL, 6uLL, fdump);\nif ( *(_DWORD *)(v2 + 16) == 3 )\n{\nv3 = first_node(v2 + 208);\nif ( v3 == v2 + 208 )\nresult = fwrite(\"<novar>\", 1uLL, 7uLL, fdump);\nelse\nresult = fputs((const char *)(*(_QWORD *)(v3 + 40) + 112LL), fdump);\n}\nelse if ( *(_DWORD *)(v2 + 16) )\n{\nresult = fwrite(\"<unknown>\", 1uLL, 9uLL, fdump);\n}\nelse\n{\nresult = shortdump_type(v2);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __fastcall func13(__int64 a1)\n{\nint result; // eax\n__int64 v2; // [rsp+18h] [rbp-18h] BYREF\n__int64 v3; // [rsp+20h] [rbp-10h]\n__int64 v4; // [rsp+28h] [rbp-8h]\n\nv4 = find_scope(a1, &v2);\nif ( !v4 )\nreturn fwrite(\"<global>\", 1uLL, 8uLL, fdump);\nif ( v4 == *(_QWORD *)(a1 + 72) + 8LL )\nreturn fwrite(\"<file>\", 1uLL, 6uLL, fdump);\nif ( *(_DWORD *)(v2 + 16) == 3 )\n{\nv3 = func1(v2 + 208);\nif ( v3 == v2 + 208 )\nresult = fwrite(\"<novar>\", 1uLL, 7uLL, fdump);\nelse\nresult = fputs((const char *)(*(_QWORD *)(v3 + 40) + 112LL), fdump);\n}\nelse if ( *(_DWORD *)(v2 + 16) )\n{\nresult = fwrite(\"<unknown>\", 1uLL, 9uLL, fdump);\n}\nelse\n{\nresult = func12(v2);\n}\nreturn result;\n}",
"original_code": "void\nshortdump_scope(node_t *node)\n{\n node_t *parent;\n struct list_head_xcrash *scope = find_scope(node, &parent);\n if (!scope) {\n fputs(\"<global>\", fdump);\n return;\n }\n if (scope == &node->loc.first.pf->parsed) {\n fputs(\"<file>\", fdump);\n return;\n }\n if (parent->type == nt_decl) {\n node_t *var = first_node(&parent->child[chd_var]);\n if (&var->list == &parent->child[chd_var])\n fputs(\"<novar>\", fdump);\n else\n fputs(var->str->text, fdump);\n } else if (parent->type == nt_type)\n shortdump_type(parent);\n else\n fputs(\"<unknown>\", fdump);\n}",
"canonical_original_code": "void shortdump_scope(struct node *node)\n{\n struct node *parent;\n struct list_head_xcrash *scope = find_scope(node, &parent);\n if (!scope) {\n fputs(\"<global>\", fdump);\n return;\n }\n if (scope == &node->loc.first.pf->parsed) {\n fputs(\"<file>\", fdump);\n return;\n }\n if (parent->type == nt_decl) {\n struct node *var = first_node(&parent->child[chd_var]);\n if (&var->list == &parent->child[chd_var])\n fputs(\"<novar>\", fdump);\n else\n fputs(var->str->text, fdump);\n } else if (parent->type == nt_type)\n shortdump_type(parent);\n else\n fputs(\"<unknown>\", fdump);\n}",
"variable_types": [
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"parent",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"scope",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
],
[
"var",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "shortdump_var",
"canonical_name": "func14",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "int __fastcall shortdump_var(__int64 a1)\n{\nconst char *v1; // rax\n\nif ( *(_DWORD *)(a1 + 16) != 2 )\n_assert_fail(\"var->type == nt_var\", \"dump.c\", 0x192u, \"shortdump_var\");\nv1 = node_file_name(a1);\nfprintf(fdump, \"%s:\", v1);\nshortdump_scope(a1);\nreturn fprintf(fdump, \":%s\", (const char *)(*(_QWORD *)(a1 + 40) + 112LL));\n}\n",
"canonical_decompiled_code": "int __fastcall func14(__int64 a1)\n{\nconst char *v1; // rax\n\nif ( *(_DWORD *)(a1 + 16) != 2 )\n_assert_fail(\"var->type == nt_var\", \"dump.c\", 0x192u, \"shortdump_var\");\nv1 = func3(a1);\nfprintf(fdump, \"%s:\", v1);\nfunc13(a1);\nreturn fprintf(fdump, \":%s\", (const char *)(*(_QWORD *)(a1 + 40) + 112LL));\n}",
"original_code": "void\nshortdump_var(node_t *var)\n{\n ((void) sizeof ((var->type == nt_var) ? 1 : 0), __extension__ ({ if (var->type == nt_var) ; else __assert_fail (\"var->type == nt_var\", \"dump.c\", 402, __extension__ __PRETTY_FUNCTION__); }));\n fprintf(fdump, \"%s:\", node_file_name(var));\n shortdump_scope(var);\n fprintf(fdump, \":%s\", var->str->text);\n}",
"canonical_original_code": "void shortdump_var(struct node *var)\n{\n ((void) sizeof ((var->type == nt_var) ? 1 : 0), __extension__ ({ if (var->type == nt_var) ; else __assert_fail (\"var->type == nt_var\", \"dump.c\", 402, __extension__ __PRETTY_FUNCTION__); }));\n fprintf(fdump, \"%s:\", node_file_name(var));\n shortdump_scope(var);\n fprintf(fdump, \":%s\", var->str->text);\n}",
"variable_types": [
[
"var",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "dump_ind",
"canonical_name": "func15",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "size_t __fastcall dump_ind(char *a1)\n{\nchar *v1; // rax\nint v2; // eax\n\nwhile ( 1 )\n{\nv1 = a1++;\nv2 = *v1;\nif ( !v2 )\nreturn fwrite(\"base type\", 1uLL, 9uLL, fdump);\nif ( v2 > 0 )\ngoto LABEL_11;\nswitch ( v2 )\n{\ncase -1:\nLABEL_9:\nfwrite(\"pointer to \", 1uLL, 0xBuLL, fdump);\nbreak;\ncase -3:\nfwrite(\"implicit \", 1uLL, 9uLL, fdump);\ngoto LABEL_9;\ncase -2:\nfwrite(\"function returning \", 1uLL, 0x13uLL, fdump);\nbreak;\ndefault:\nLABEL_11:\nfprintf(fdump, \"function with arg #%d \", (unsigned int)*(a1 - 1));\nbreak;\n}\n}\n}\n",
"canonical_decompiled_code": "size_t __fastcall func15(char *a1)\n{\nchar *v1; // rax\nint v2; // eax\n\nwhile ( 1 )\n{\nv1 = a1++;\nv2 = *v1;\nif ( !v2 )\nreturn fwrite(\"base type\", 1uLL, 9uLL, fdump);\nif ( v2 > 0 )\ngoto LABEL_11;\nswitch ( v2 )\n{\ncase -1:\nLABEL_9:\nfwrite(\"pointer to \", 1uLL, 0xBuLL, fdump);\nbreak;\ncase -3:\nfwrite(\"implicit \", 1uLL, 9uLL, fdump);\ngoto LABEL_9;\ncase -2:\nfwrite(\"function returning \", 1uLL, 0x13uLL, fdump);\nbreak;\ndefault:\nLABEL_11:\nfprintf(fdump, \"function with arg #%d \", (unsigned int)*(a1 - 1));\nbreak;\n}\n}\n}",
"original_code": "void\ndump_ind(const ind_t *ind)\n{\n for (;;)\n switch(*ind++) {\n case ind_stop:\n fputs(\"base type\", fdump);\n return;\n case ind_implicit:\n fputs(\"implicit \", fdump);\n case ind_pointer:\n fputs(\"pointer to \", fdump);\n break;\n case ind_return:\n fputs(\"function returning \", fdump);\n break;\n default:\n fprintf(fdump, \"function with arg #%d \", ind[-1]);\n }\n}",
"canonical_original_code": "void dump_ind(char *ind)\n{\n for (;;)\n switch(*ind++) {\n case ind_stop:\n fputs(\"base type\", fdump);\n return;\n case ind_implicit:\n fputs(\"implicit \", fdump);\n case ind_pointer:\n fputs(\"pointer to \", fdump);\n break;\n case ind_return:\n fputs(\"function returning \", fdump);\n break;\n default:\n fprintf(fdump, \"function with arg #%d \", ind[-1]);\n }\n}",
"variable_types": [
[
"ind",
"char *"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
},
{
"name": "shortdump_varind",
"canonical_name": "func16",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "size_t __fastcall shortdump_varind(__int64 a1, char *a2)\n{\nshortdump_var(a1);\nfwrite(\" as \", 1uLL, 4uLL, fdump);\nreturn dump_ind(a2);\n}\n",
"canonical_decompiled_code": "size_t __fastcall func16(__int64 a1, char *a2)\n{\nfunc14(a1);\nfwrite(\" as \", 1uLL, 4uLL, fdump);\nreturn func15(a2);\n}",
"original_code": "void\nshortdump_varind(node_t *var, ind_t *ind)\n{\n shortdump_var(var);\n fputs(\" as \", fdump);\n dump_ind(ind);\n}",
"canonical_original_code": "void shortdump_varind(struct node *var, char *ind)\n{\n shortdump_var(var);\n fputs(\" as \", fdump);\n dump_ind(ind);\n}",
"variable_types": [
[
"var",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"ind",
"char *"
]
],
"return_type": "void",
"user_defined_types": [
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "bd42444118daccc3445c93f3373c939ac4ef01ff771c924f335bbcc57ed2b165"
}
] |
f3a08be43229e166322fb13e50aaff51f8591d5b0bdb685be007b1b090f6452e | ptesarik/xcrash-scripts | [
[
"list_empty",
"->",
"list_splice_tail",
"parse_file"
],
[
"_list_splice",
"->",
"list_splice_tail"
],
[
"list_splice_tail",
"->",
"list_empty",
"_list_splice",
"parse_file"
],
[
"first_node",
"->"
],
[
"init_predef_types",
"->"
],
[
"check_current_node",
"->",
"walk_tree",
"walk_tree_single"
],
[
"walk_children",
"->",
"walk_tree",
"walk_tree_single"
],
[
"walk_tree",
"->",
"walk_children",
"check_current_node"
],
[
"walk_tree_single",
"->",
"check_current_node",
"walk_children"
],
[
"dump_contents",
"->"
],
[
"parse_file",
"->",
"list_splice_tail",
"list_empty"
],
[
"init_file",
"->",
"main"
],
[
"get_basedir",
"->",
"main"
],
[
"parse_opt",
"->"
],
[
"main",
"->",
"get_basedir",
"init_file"
]
] | [
[
"_list_splice",
"__int64 __fastcall func1(__int64 *a1, _QWORD *a2, __int64 a3)\n{\n__int64 result; // rax\n_QWORD *v4; // [rsp+18h] [rbp-10h]\n__int64 v5; // [rsp+20h] [rbp-8h]\n\nv5 = *a1;\nv4 = (_QWORD *)a1[1];\n*(_QWORD *)(v5 + 8) = a2;\n*a2 = v5;\n*v4 = a3;\nresult = a3;\n*(_QWORD *)(a3 + 8) = v4;\nreturn result;\n}"
],
[
"dump_contents",
"__int64 __fastcall func9(__int64 **a1, FILE *a2)\n{\n__int64 **i; // [rsp+28h] [rbp-8h]\n\nfor ( i = (__int64 **)*a1; a1 != i; i = (__int64 **)*i )\n{\nif ( ((_BYTE)i[11] & 1) == 0 && (__int64 *)fwrite(i + 14, 1uLL, (size_t)i[12], a2) != i[12] )\nreturn 0xFFFFFFFFLL;\n}\nreturn 0LL;\n}"
],
[
"parse_file",
"__int64 __fastcall func10(const char **a1)\n{\nint *v1; // rax\nchar *v2; // rax\n__int64 result; // rax\nint *v4; // rax\nchar *v5; // rax\n__int64 v6[2]; // [rsp+10h] [rbp-D0h] BYREF\n__int64 *v7; // [rsp+20h] [rbp-C0h] BYREF\n__int64 v8; // [rsp+28h] [rbp-B8h]\n__int64 *v9; // [rsp+38h] [rbp-A8h]\nconst char *v10; // [rsp+40h] [rbp-A0h]\n__int64 *v11; // [rsp+48h] [rbp-98h]\n__int64 *v12; // [rsp+50h] [rbp-90h]\n__int64 *v13; // [rsp+58h] [rbp-88h]\n__int64 *v14; // [rsp+60h] [rbp-80h]\n__int64 *v15; // [rsp+68h] [rbp-78h]\n__int64 v16; // [rsp+70h] [rbp-70h]\n__int64 *v17; // [rsp+78h] [rbp-68h]\n__int64 *v18; // [rsp+80h] [rbp-60h]\n__int64 *v19; // [rsp+88h] [rbp-58h]\n__int64 *v20; // [rsp+90h] [rbp-50h]\n__int64 v21; // [rsp+98h] [rbp-48h]\nconst char *v22; // [rsp+A0h] [rbp-40h]\n__int64 *v23; // [rsp+A8h] [rbp-38h]\n__int64 *v24; // [rsp+B0h] [rbp-30h]\nunsigned int v25; // [rsp+BCh] [rbp-24h]\n__int64 *v26; // [rsp+C0h] [rbp-20h]\n__int64 *i; // [rsp+C8h] [rbp-18h]\n__int64 *v28; // [rsp+D0h] [rbp-10h]\n__int64 *v29; // [rsp+D8h] [rbp-8h]\n\nv6[0] = (__int64)v6;\nv6[1] = (__int64)v6;\nINIT_LIST_HEAD(&v7);\nif ( !*a1 )\n{\nfunc2((__int64 *)a1 + 3, (__int64)&v7);\nINIT_LIST_HEAD(a1 + 3);\n}\nv24 = (__int64 *)a1[1];\nv29 = v24;\nv23 = (__int64 *)*v24;\nv28 = v23;\nwhile ( v29 != (__int64 *)(a1 + 1) )\n{\nfreenode(v29);\nv29 = v28;\nv9 = (__int64 *)*v28;\nv28 = v9;\n}\nv22 = a1[3];\nfor ( i = (__int64 *)v22; i != (__int64 *)(a1 + 3); i = (__int64 *)v10 )\n{\nif ( i[8] && func0((_QWORD *)i[8]) )\nlist_add_tail((_QWORD *)i[8], (__int64)v6);\nv10 = (const char *)*i;\n}\nv21 = v6[0];\nv29 = (__int64 *)v6[0];\nv20 = *(__int64 **)v6[0];\nv28 = v20;\nwhile ( v29 != v6 )\n{\nfreenode(v29);\nv29 = v28;\nv11 = (__int64 *)*v28;\nv28 = v11;\n}\nv19 = (__int64 *)a1[3];\ni = v19;\nv18 = (__int64 *)*v19;\nv26 = v18;\nwhile ( i != (__int64 *)(a1 + 3) )\n{\nfreedynstr(i);\ni = v26;\nv12 = (__int64 *)*v26;\nv26 = v12;\n}\nif ( *a1 )\n{\nyyin = fopen(*a1, \"r\");\nif ( !yyin )\n{\nv1 = _errno_location();\nv2 = strerror(*v1);\nfprintf(stderr, \"Cannot open %s: %s\\n\", *a1, v2);\nif ( *_errno_location() == 2 )\nresult = 0LL;\nelse\nresult = 0xFFFFFFFFLL;\nreturn result;\n}\n}\nelse\n{\nyyin = 0LL;\n}\nif ( *a1 )\nfprintf(stderr, \"Parsing file %s\\n\", *a1);\nINIT_LIST_HEAD(&parsed_tree);\nINIT_LIST_HEAD(&raw_contents);\nif ( yyin )\n{\nlex_input_last = 0LL;\nlex_input_first = 0LL;\n}\nelse\n{\nv17 = v7;\nlex_input_first = v7;\nv16 = v8;\nlex_input_last = v8;\n}\nstart_symbol = 0;\nv25 = yyparse(a1 + 5);\nif ( yyin && yyin != stdin && fclose(yyin) )\n{\nv4 = _errno_location();\nv5 = strerror(*v4);\nfprintf(stderr, \"Cannot close %s: %s\\n\", *a1, v5);\nv25 = -1;\n}\nyylex_destroy();\nif ( v25 )\n{\nfprintf(stderr, \"Parser failed with %d\\n\", v25);\n}\nelse\n{\nlist_add_tail(a1 + 1, (__int64)&parsed_tree);\nlist_del_init((__int64)&parsed_tree);\nlist_add_tail(a1 + 3, (__int64)&raw_contents);\nlist_del_init((__int64)&raw_contents);\n*((_DWORD *)a1 + 24) = 1;\n}\nv15 = v7;\ni = v7;\nv14 = (__int64 *)*v7;\nv26 = v14;\nwhile ( i != (__int64 *)&v7 )\n{\nfreedynstr(i);\ni = v26;\nv13 = (__int64 *)*v26;\nv26 = v13;\n}\nreturn v25;\n}"
],
[
"parse_opt",
"__int64 __fastcall func13(int a1, const char *a2, __int64 a3)\n{\nsize_t v3; // rax\nchar *v5; // [rsp+20h] [rbp-10h]\nvoid **v6; // [rsp+28h] [rbp-8h]\n\nv6 = *(void ***)(a3 + 40);\nif ( a1 == 120 )\n{\nLABEL_7:\nv3 = strlen(a2);\nv5 = (char *)malloc(v3 + 17);\nstrcpy(v5 + 16, a2);\nlist_add_tail(v5, (__int64)(v6 + 1));\nreturn 0LL;\n}\nif ( a1 > 120 )\nreturn 7LL;\nif ( a1 != 100 )\n{\nif ( a1 != 112 )\nreturn 7LL;\ngoto LABEL_7;\n}\nfree(*v6);\n*v6 = strdup(a2);\nreturn 0LL;\n}"
]
] | [
{
"name": "list_empty",
"canonical_name": "func0",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "_BOOL8 __fastcall list_empty(_QWORD *a1)\n{\nreturn a1 == (_QWORD *)*a1;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func0(_QWORD *a1)\n{\nreturn a1 == (_QWORD *)*a1;\n}",
"original_code": "static inline int list_empty(const struct list_head_xcrash *head)\n{\n return head->next == head;\n}",
"canonical_original_code": "static inline int list_empty(struct list_head_xcrash *head)\n{\n return head->next == head;\n}",
"variable_types": [
[
"head",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct list_head_xcrash { struct list_head_xcrash *next; }"
],
"binary_hash": "f3a08be43229e166322fb13e50aaff51f8591d5b0bdb685be007b1b090f6452e"
},
{
"name": "list_splice_tail",
"canonical_name": "func2",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall list_splice_tail(__int64 *a1, __int64 a2)\n{\n__int64 result; // rax\n\nresult = list_empty(a1);\nif ( !(_DWORD)result )\nresult = _list_splice(a1, *(_QWORD **)(a2 + 8), a2);\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 *a1, __int64 a2)\n{\n__int64 result; // rax\n\nresult = func0(a1);\nif ( !(_DWORD)result )\nresult = func1(a1, *(_QWORD **)(a2 + 8), a2);\nreturn result;\n}",
"original_code": "static inline void list_splice_tail(struct list_head_xcrash *list,\n struct list_head_xcrash *head)\n{\n if (!list_empty(list))\n __list_splice(list, head->prev, head);\n}",
"canonical_original_code": "static inline void list_splice_tail(struct list_head_xcrash *list, struct list_head_xcrash *head)\n{\n if (!list_empty(list))\n __list_splice(list, head->prev, head);\n}",
"variable_types": [
[
"list",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
],
[
"head",
"struct list_head_xcrash *"
]
],
"return_type": "void",
"user_defined_types": [
"struct list_head_xcrash { struct list_head_xcrash *next; }"
],
"binary_hash": "f3a08be43229e166322fb13e50aaff51f8591d5b0bdb685be007b1b090f6452e"
},
{
"name": "first_node",
"canonical_name": "func3",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall first_node(__int64 a1)\n{\nreturn *(_QWORD *)a1;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1)\n{\nreturn *(_QWORD *)a1;\n}",
"original_code": "static inline node_t *\nfirst_node(const struct list_head_xcrash *nodelist)\n{\n return ({ const struct list_head_xcrash *__mptr = (nodelist->next); (node_t *)( (char *)__mptr - __builtin_offsetof (node_t, list) );});\n}",
"canonical_original_code": "static inline struct node *first_node(struct list_head_xcrash *nodelist)\n{\n return ({ struct list_head_xcrash *__mptr = (nodelist->next); (struct node *)( (char *)__mptr - __builtin_offsetof (node_t, list) );});\n}",
"variable_types": [
[
"nodelist",
"struct list_head_xcrash *"
],
[
"__mptr",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "f3a08be43229e166322fb13e50aaff51f8591d5b0bdb685be007b1b090f6452e"
},
{
"name": "init_predef_types",
"canonical_name": "func4",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "char *init_predef_types()\n{\nchar *result; // rax\nchar **i; // [rsp+8h] [rbp-8h]\n\ncleartypedefs();\nfor ( i = predef_types; ; ++i )\n{\nresult = *i;\nif ( !*i )\nbreak;\naddtypedef(*i);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "char *func4()\n{\nchar *result; // rax\nchar **i; // [rsp+8h] [rbp-8h]\n\ncleartypedefs();\nfor ( i = predef_types; ; ++i )\n{\nresult = *i;\nif ( !*i )\nbreak;\naddtypedef(*i);\n}\nreturn result;\n}",
"original_code": "void init_predef_types(void)\n{\n const char **p;\n cleartypedefs();\n for (p = predef_types; *p; ++p)\n addtypedef(*p);\n}",
"canonical_original_code": "void init_predef_types()\n{\n char **p;\n cleartypedefs();\n for (p = predef_types; *p; ++p)\n addtypedef(*p);\n}",
"variable_types": [
[
"p",
"char **"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "f3a08be43229e166322fb13e50aaff51f8591d5b0bdb685be007b1b090f6452e"
},
{
"name": "check_current_node",
"canonical_name": "func5",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall check_current_node(__int64 a1, __int64 a2, __int64 a3)\n{\nif ( *(_QWORD *)(a3 + 8) == a1 )\nreturn a1;\nif ( a2 == *(_QWORD *)(a3 + 8) )\nreturn 0LL;\nreturn *(_QWORD *)a2;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1, __int64 a2, __int64 a3)\n{\nif ( *(_QWORD *)(a3 + 8) == a1 )\nreturn a1;\nif ( a2 == *(_QWORD *)(a3 + 8) )\nreturn 0LL;\nreturn *(_QWORD *)a2;\n}",
"original_code": "static node_t *\ncheck_current_node(node_t *node,\n struct list_head_xcrash *prev, struct list_head_xcrash *next)\n{\n if (next->prev == &node->list)\n return node;\n if (next->prev == prev)\n return ((void *)0);\n return ({ const struct list_head_xcrash *__mptr = (prev->next); (node_t *)( (char *)__mptr - __builtin_offsetof (node_t, list) );});\n}",
"canonical_original_code": "static struct node *check_current_node(struct node *node, struct list_head_xcrash *prev, struct list_head_xcrash *next)\n{\n if (next->prev == &node->list)\n return node;\n if (next->prev == prev)\n return ((void *)0);\n return ({ struct list_head_xcrash *__mptr = (prev->next); (struct node *)( (char *)__mptr - __builtin_offsetof (node_t, list) );});\n}",
"variable_types": [
[
"node",
"struct node *"
],
[
"prev",
"struct list_head_xcrash *"
],
[
"next",
"struct list_head_xcrash *"
],
[
"__mptr",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
]
],
"return_type": "struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *",
"user_defined_types": [
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "f3a08be43229e166322fb13e50aaff51f8591d5b0bdb685be007b1b090f6452e"
},
{
"name": "walk_children",
"canonical_name": "func6",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall walk_children(__int64 a1, __int64 a2, __int64 a3)\n{\nint i; // [rsp+2Ch] [rbp-4h]\n\nfor ( i = 0; i < *(_DWORD *)(a1 + 184); ++i )\n{\nif ( (unsigned int)walk_tree(16 * (i + 12LL) + a1, a2, a3) == 1 )\nreturn 1LL;\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func6(__int64 a1, __int64 a2, __int64 a3)\n{\nint i; // [rsp+2Ch] [rbp-4h]\n\nfor ( i = 0; i < *(_DWORD *)(a1 + 184); ++i )\n{\nif ( (unsigned int)func7(16 * (i + 12LL) + a1, a2, a3) == 1 )\nreturn 1LL;\n}\nreturn 0LL;\n}",
"original_code": "static inline enum walk_action\nwalk_children(node_t *node, walkfn *fn, void *data)\n{\n int i;\n for (i = 0; i < node->nchild; ++i)\n if (walk_tree(&node->child[i], fn, data) == walk_terminate)\n return walk_terminate;\n return walk_continue;\n}",
"canonical_original_code": "static inline enum walk_action walk_children(struct node *node, enum walk_action (*fn)(struct node *, void *), void *data)\n{\n int i;\n for (i = 0; i < node->nchild; ++i)\n if (walk_tree(&node->child[i], fn, data) == walk_terminate)\n return walk_terminate;\n return walk_continue;\n}",
"variable_types": [
[
"node",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"fn",
"enum walk_action { walk_continue=0, walk_terminate=1, walk_skip_children=2 } (*)(struct node *, void *)"
],
[
"data",
"void *"
],
[
"i",
"int"
]
],
"return_type": "enum walk_action { walk_continue=0, walk_terminate=1, walk_skip_children=2 }",
"user_defined_types": [
"enum walk_action { walk_continue=0, walk_terminate=1, walk_skip_children=2 }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "f3a08be43229e166322fb13e50aaff51f8591d5b0bdb685be007b1b090f6452e"
},
{
"name": "walk_tree",
"canonical_name": "func7",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall walk_tree(_QWORD ***a1, __int64 (__fastcall *a2)(_QWORD *, __int64), __int64 a3)\n{\nint v5; // [rsp+34h] [rbp-2Ch]\n__int64 v6; // [rsp+48h] [rbp-18h]\n_QWORD *v7; // [rsp+50h] [rbp-10h]\n_QWORD *v8; // [rsp+58h] [rbp-8h]\n__int64 v9; // [rsp+58h] [rbp-8h]\n\nv6 = (__int64)a1;\nv8 = *a1;\nv7 = **a1;\nwhile ( a1 != v8 )\n{\nv5 = a2(v8, a3);\nif ( v5 == 1 )\nreturn 1LL;\nv9 = check_current_node((__int64)v8, v6, (__int64)v7);\nif ( v9 )\n{\nif ( v5 != 2 && (unsigned int)walk_children(v9, (__int64)a2, a3) == 1 )\nreturn 1LL;\nv6 = v9;\n}\nv8 = v7;\nv7 = (_QWORD *)*v7;\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(_QWORD ***a1, __int64 (__fastcall *a2)(_QWORD *, __int64), __int64 a3)\n{\nint v5; // [rsp+34h] [rbp-2Ch]\n__int64 v6; // [rsp+48h] [rbp-18h]\n_QWORD *v7; // [rsp+50h] [rbp-10h]\n_QWORD *v8; // [rsp+58h] [rbp-8h]\n__int64 v9; // [rsp+58h] [rbp-8h]\n\nv6 = (__int64)a1;\nv8 = *a1;\nv7 = **a1;\nwhile ( a1 != v8 )\n{\nv5 = a2(v8, a3);\nif ( v5 == 1 )\nreturn 1LL;\nv9 = func5((__int64)v8, v6, (__int64)v7);\nif ( v9 )\n{\nif ( v5 != 2 && (unsigned int)func6(v9, (__int64)a2, a3) == 1 )\nreturn 1LL;\nv6 = v9;\n}\nv8 = v7;\nv7 = (_QWORD *)*v7;\n}\nreturn 0LL;\n}",
"original_code": "enum walk_action\nwalk_tree(struct list_head_xcrash *tree, walkfn *fn, void *data)\n{\n node_t *item, *next;\n struct list_head_xcrash *prev = tree;\n for (item = ({ const struct list_head_xcrash *__mptr = ((tree)->next); (typeof(*item) *)( (char *)__mptr - __builtin_offsetof (typeof(*item), list) );}), next = ({ const struct list_head_xcrash *__mptr = (item->list.next); (typeof(*item) *)( (char *)__mptr - __builtin_offsetof (typeof(*item), list) );}); &item->list != (tree); item = next, next = ({ const struct list_head_xcrash *__mptr = (next->list.next); (typeof(*next) *)( (char *)__mptr - __builtin_offsetof (typeof(*next), list) );})) {\n enum walk_action act = fn(item, data);\n if (act == walk_terminate)\n return walk_terminate;\n if (! (item = check_current_node(item, prev, &next->list)) )\n continue;\n if (act != walk_skip_children &&\n walk_children(item, fn, data) == walk_terminate)\n return walk_terminate;\n prev = &item->list;\n }\n return walk_continue;\n}",
"canonical_original_code": "enum walk_action walk_tree(struct list_head_xcrash *tree, enum walk_action (*fn)(struct node *, void *), void *data)\n{\n struct node *item; struct node *next;\n struct list_head_xcrash *prev = tree;\n for (item = ({ struct list_head_xcrash *__mptr = ((tree)->next); (typeof(*item) *)( (char *)__mptr - __builtin_offsetof (typeof(*item), list) );}), next = ({ struct list_head_xcrash *__mptr = (item->list.next); (typeof(*item) *)( (char *)__mptr - __builtin_offsetof (typeof(*item), list) );}); &item->list != (tree); item = next, next = ({ struct list_head_xcrash *__mptr = (next->list.next); (typeof(*next) *)( (char *)__mptr - __builtin_offsetof (typeof(*next), list) );})) {\n enum walk_action act = fn(item, data);\n if (act == walk_terminate)\n return walk_terminate;\n if (! (item = check_current_node(item, prev, &next->list)) )\n continue;\n if (act != walk_skip_children &&\n walk_children(item, fn, data) == walk_terminate)\n return walk_terminate;\n prev = &item->list;\n }\n return walk_continue;\n}",
"variable_types": [
[
"tree",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
],
[
"fn",
"enum walk_action { walk_continue=0, walk_terminate=1, walk_skip_children=2 } (*)(struct node { struct list_head_xcrash list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *, void *)"
],
[
"data",
"void *"
],
[
"item",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"next",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"prev",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
],
[
"__mptr",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
],
[
"act",
"enum walk_action { walk_continue=0, walk_terminate=1, walk_skip_children=2 }"
]
],
"return_type": "enum walk_action { walk_continue=0, walk_terminate=1, walk_skip_children=2 }",
"user_defined_types": [
"enum walk_action { walk_continue=0, walk_terminate=1, walk_skip_children=2 }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "f3a08be43229e166322fb13e50aaff51f8591d5b0bdb685be007b1b090f6452e"
},
{
"name": "walk_tree_single",
"canonical_name": "func8",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall walk_tree_single(__int64 *a1, __int64 (__fastcall *a2)(__int64 *, __int64), __int64 a3)\n{\nunsigned int v3; // eax\n__int64 result; // rax\n__int64 v6; // [rsp+18h] [rbp-18h]\n__int64 v7; // [rsp+20h] [rbp-10h]\n__int64 v8; // [rsp+28h] [rbp-8h]\n\nv8 = a1[1];\nv7 = *a1;\nv3 = a2(a1, a3);\nif ( v3 == 2 )\nreturn 0LL;\nif ( v3 <= 2 && v3 )\nreturn 1LL;\nv6 = check_current_node((__int64)a1, v8, v7);\nif ( v6 )\nresult = walk_children(v6, (__int64)a2, a3);\nelse\nresult = 0LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func8(__int64 *a1, __int64 (__fastcall *a2)(__int64 *, __int64), __int64 a3)\n{\nunsigned int v3; // eax\n__int64 result; // rax\n__int64 v6; // [rsp+18h] [rbp-18h]\n__int64 v7; // [rsp+20h] [rbp-10h]\n__int64 v8; // [rsp+28h] [rbp-8h]\n\nv8 = a1[1];\nv7 = *a1;\nv3 = a2(a1, a3);\nif ( v3 == 2 )\nreturn 0LL;\nif ( v3 <= 2 && v3 )\nreturn 1LL;\nv6 = func5((__int64)a1, v8, v7);\nif ( v6 )\nresult = func6(v6, (__int64)a2, a3);\nelse\nresult = 0LL;\nreturn result;\n}",
"original_code": "enum walk_action\nwalk_tree_single(node_t *tree, walkfn *fn, void *data)\n{\n struct list_head_xcrash *prev = tree->list.prev,\n *next = tree->list.next;\n switch (fn(tree, data)) {\n case walk_terminate: return walk_terminate;\n case walk_skip_children: return walk_continue;\n case walk_continue: break;\n }\n if (! (tree = check_current_node(tree, prev, next)) )\n return walk_continue;\n return walk_children(tree, fn, data);\n}",
"canonical_original_code": "enum walk_action walk_tree_single(struct node *tree, enum walk_action (*fn)(struct node *, void *), void *data)\n{\n struct list_head_xcrash *prev = tree->list.prev; struct list_head_xcrash *next = tree->list.next;\n switch (fn(tree, data)) {\n case walk_terminate: return walk_terminate;\n case walk_skip_children: return walk_continue;\n case walk_continue: break;\n }\n if (! (tree = check_current_node(tree, prev, next)) )\n return walk_continue;\n return walk_children(tree, fn, data);\n}",
"variable_types": [
[
"tree",
"struct node { struct list_head_xcrash { struct list_head_xcrash *next; } list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc { struct pos_t { struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; } *pf; int line; unsigned short column; struct dynstr *text; } first; struct loc *parent; } loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *"
],
[
"fn",
"enum walk_action { walk_continue=0, walk_terminate=1, walk_skip_children=2 } (*)(struct node *, void *)"
],
[
"data",
"void *"
],
[
"prev",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
],
[
"next",
"struct list_head_xcrash { struct list_head_xcrash *next; } *"
]
],
"return_type": "enum walk_action { walk_continue=0, walk_terminate=1, walk_skip_children=2 }",
"user_defined_types": [
"enum walk_action { walk_continue=0, walk_terminate=1, walk_skip_children=2 }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }"
],
"binary_hash": "f3a08be43229e166322fb13e50aaff51f8591d5b0bdb685be007b1b090f6452e"
},
{
"name": "init_file",
"canonical_name": "func11",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "__int64 __fastcall init_file(__int64 a1, __int64 a2)\n{\n__int64 result; // rax\n\n*(_QWORD *)a1 = a2;\nINIT_LIST_HEAD((_QWORD *)(a1 + 8));\nINIT_LIST_HEAD((_QWORD *)(a1 + 24));\n*(_QWORD *)(a1 + 40) = a1;\n*(_QWORD *)(a1 + 64) = a1;\nresult = a1;\n*(_DWORD *)(a1 + 96) = 1;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func11(__int64 a1, __int64 a2)\n{\n__int64 result; // rax\n\n*(_QWORD *)a1 = a2;\nINIT_LIST_HEAD((_QWORD *)(a1 + 8));\nINIT_LIST_HEAD((_QWORD *)(a1 + 24));\n*(_QWORD *)(a1 + 40) = a1;\n*(_QWORD *)(a1 + 64) = a1;\nresult = a1;\n*(_DWORD *)(a1 + 96) = 1;\nreturn result;\n}",
"original_code": "static void\ninit_file(struct parsed_file *pf, const char *name)\n{\n pf->name = name;\n INIT_LIST_HEAD(&pf->parsed);\n INIT_LIST_HEAD(&pf->raw);\n pf->loc.first.pf = pf;\n pf->loc.last.pf = pf;\n pf->clean = 1;\n}",
"canonical_original_code": "static void init_file(struct parsed_file *pf, char *name)\n{\n pf->name = name;\n INIT_LIST_HEAD(&pf->parsed);\n INIT_LIST_HEAD(&pf->raw);\n pf->loc.first.pf = pf;\n pf->loc.last.pf = pf;\n pf->clean = 1;\n}",
"variable_types": [
[
"pf",
"struct parsed_file { char *name; struct list_head_xcrash { struct list_head_xcrash *next; } parsed; struct list_head_xcrash raw; struct loc { struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node { struct list_head_xcrash list; enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 } type; union { struct type { enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 } category; unsigned int flags; unsigned long btype; } t; struct expr { int op; union { long num; double f; }; } e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; } *cpp_cond; struct macro_exp { int refcount; struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; } *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; } *exp; int token; int refcount; union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; } flags; unsigned long len; char text[]; } *text; } first; struct loc *parent; } loc; int clean; } *"
],
[
"name",
"char *"
]
],
"return_type": "void",
"user_defined_types": [
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }"
],
"binary_hash": "f3a08be43229e166322fb13e50aaff51f8591d5b0bdb685be007b1b090f6452e"
},
{
"name": "get_basedir",
"canonical_name": "func12",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "const char *__fastcall get_basedir(const char *a1)\n{\nchar *v2; // [rsp+10h] [rbp-10h]\nvoid *dest; // [rsp+18h] [rbp-8h]\n\nv2 = strrchr(a1, 47);\nif ( !v2 )\nreturn \"./\";\ndest = malloc(v2 - a1 + 2);\nmemcpy(dest, a1, v2 - a1 + 1);\n*((_BYTE *)dest + v2 - a1 + 1) = 0;\nreturn (const char *)dest;\n}\n",
"canonical_decompiled_code": "const char *__fastcall func12(const char *a1)\n{\nchar *v2; // [rsp+10h] [rbp-10h]\nvoid *dest; // [rsp+18h] [rbp-8h]\n\nv2 = strrchr(a1, 47);\nif ( !v2 )\nreturn \"./\";\ndest = malloc(v2 - a1 + 2);\nmemcpy(dest, a1, v2 - a1 + 1);\n*((_BYTE *)dest + v2 - a1 + 1) = 0;\nreturn (const char *)dest;\n}",
"original_code": "static char *\nget_basedir(const char *path)\n{\n char *p, *ret;\n if ( (p = strrchr(path, '/')) ) {\n ret = malloc(p - path + 2);\n memcpy(ret, path, p - path + 1);\n ret[p - path + 1] = 0;\n } else\n ret = \"./\";\n return ret;\n}",
"canonical_original_code": "static char *get_basedir(char *path)\n{\n char *p; char *ret;\n if ( (p = strrchr(path, '/')) ) {\n ret = malloc(p - path + 2);\n memcpy(ret, path, p - path + 1);\n ret[p - path + 1] = 0;\n } else\n ret = \"./\";\n return ret;\n}",
"variable_types": [
[
"path",
"char *"
],
[
"p",
"char *"
],
[
"ret",
"char *"
]
],
"return_type": "char *",
"user_defined_types": [],
"binary_hash": "f3a08be43229e166322fb13e50aaff51f8591d5b0bdb685be007b1b090f6452e"
},
{
"name": "main",
"canonical_name": "main",
"repo": "ptesarik/xcrash-scripts",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nint result; // eax\nint v4; // eax\nconst char *v5; // rcx\nint v6; // eax\nint v7; // [rsp+1Ch] [rbp-24h] BYREF\nconst char *input; // [rsp+20h] [rbp-20h] BYREF\n__int64 v9; // [rsp+28h] [rbp-18h] BYREF\nint v10; // [rsp+3Ch] [rbp-4h]\n\nINIT_LIST_HEAD(&v9);\ninput = get_basedir(*argv);\nargp_parse(&argp, argc, (char **)argv, 0, &v7, &input);\nfiles = argc - v7 + 1;\nqword_12A8 = (__int64)calloc(files, 0x68uLL);\nif ( qword_12A8 )\n{\nv10 = 1;\ninit_builtin_file(qword_12A8);\nwhile ( v10 < files )\n{\nv4 = v7++;\nv5 = argv[v4];\nv6 = v10++;\ninit_file(qword_12A8 + 104LL * v6, (__int64)v5);\n}\nresult = xform_files(&input, &files);\n}\nelse\n{\nperror(\"Cannot allocate file array\");\nresult = 1;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nint result; // eax\nint v4; // eax\nconst char *v5; // rcx\nint v6; // eax\nint v7; // [rsp+1Ch] [rbp-24h] BYREF\nconst char *input; // [rsp+20h] [rbp-20h] BYREF\n__int64 v9; // [rsp+28h] [rbp-18h] BYREF\nint v10; // [rsp+3Ch] [rbp-4h]\n\nINIT_LIST_HEAD(&v9);\ninput = func12(*argv);\nargp_parse(&argp, argc, (char **)argv, 0, &v7, &input);\nfiles = argc - v7 + 1;\nqword_12A8 = (__int64)calloc(files, 0x68uLL);\nif ( qword_12A8 )\n{\nv10 = 1;\ninit_builtin_file(qword_12A8);\nwhile ( v10 < files )\n{\nv4 = v7++;\nv5 = argv[v4];\nv6 = v10++;\nfunc11(qword_12A8 + 104LL * v6, (__int64)v5);\n}\nresult = xform_files(&input, &files);\n}\nelse\n{\nperror(\"Cannot allocate file array\");\nresult = 1;\n}\nreturn result;\n}",
"original_code": "int main(int argc, char **argv)\n{\n struct arguments arguments;\n int argf, i;\n INIT_LIST_HEAD(&arguments.xform_names);\n arguments.basedir = get_basedir(argv[0]);\n argp_parse(&argp, argc, argv, 0, &argf, &arguments);\n files.n = argc - argf + 1;\n if (! (files.array = calloc(files.n, sizeof(struct parsed_file))) ) {\n perror(\"Cannot allocate file array\");\n return 1;\n }\n i = 0;\n init_builtin_file(&files.array[i++]);\n while(i < files.n)\n init_file(&files.array[i++], argv[argf++]);\n return xform_files(&arguments, &files);\n}",
"canonical_original_code": "int main(int argc, char **argv)\n{\n struct arguments arguments;\n int argf; int i;\n INIT_LIST_HEAD(&arguments.xform_names);\n arguments.basedir = get_basedir(argv[0]);\n argp_parse(&argp, argc, argv, 0, &argf, &arguments);\n files.n = argc - argf + 1;\n if (! (files.array = calloc(files.n, sizeof(struct parsed_file))) ) {\n perror(\"Cannot allocate file array\");\n return 1;\n }\n i = 0;\n init_builtin_file(&files.array[i++]);\n while(i < files.n)\n init_file(&files.array[i++], argv[argf++]);\n return xform_files(&arguments, &files);\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char **"
],
[
"arguments",
"struct arguments { char *basedir; struct list_head_xcrash { struct list_head_xcrash *next; } xform_names; }"
],
[
"argf",
"int"
],
[
"i",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct arguments { char *basedir; struct list_head_xcrash xform_names; }",
"struct parsed_file { char *name; struct list_head_xcrash parsed; struct list_head_xcrash raw; struct loc loc; int clean; }",
"struct list_head_xcrash { struct list_head_xcrash *next; }",
"struct loc { struct pos_t first; struct loc *parent; }",
"struct pos_t { struct parsed_file *pf; int line; unsigned short column; struct dynstr *text; }",
"struct dynstr { struct list_head_xcrash list; struct list_head_xcrash node_first; struct list_head_xcrash dup_list; struct node *cpp_cond; struct macro_exp *exp; int token; int refcount; union dynstr_flags_t flags; unsigned long len; char text[]; }",
"union dynstr_flags_t { struct { int fake; int macro; }; unsigned int val; }",
"struct node { struct list_head_xcrash list; enum node_type type; union { struct type t; struct expr e; }; struct dynstr *str; struct node *parent; struct list_head_xcrash dup_list; struct loc loc; struct list_head_xcrash first_list; struct list_head_xcrash user_list; void *user_data; int nchild; struct list_head_xcrash child[]; }",
"struct macro_exp { int refcount; struct hashed_macro *hm; struct dynstr *first; struct dynstr *exp_first; struct { struct dynstr *first; } params[]; }",
"enum node_type { nt_type=0, nt_expr=1, nt_var=2, nt_decl=3 }",
"struct type { enum type_category category; unsigned int flags; unsigned long btype; }",
"struct expr { int op; union { long num; double f; }; }",
"struct hashed_macro { struct hashed_macro *next; char *name; struct list_head_xcrash params; int nparams; struct node *cpp_cond; struct loc loc; int undef; int hidden; int hasparam; int isparam; int noexpand; int variadic; }",
"enum type_category { type_basic=0, type_typedef=1, type_struct=2, type_union=3, type_enum=4, type_pointer=5, type_array=6, type_func=7, type_typeof=8 }"
],
"binary_hash": "f3a08be43229e166322fb13e50aaff51f8591d5b0bdb685be007b1b090f6452e"
}
] |
0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606 | tzcoolman/FACS-OLD | [
[
"bloom_init",
"->"
],
[
"bloom_destroy",
"->"
],
[
"bloom_check",
"->",
"bloom_test"
],
[
"bloom_add",
"->",
"bloom_test"
],
[
"bloom_test",
"->",
"bloom_check",
"bloom_add",
"bloom_hash",
"test",
"set"
],
[
"bloom_hash",
"->",
"bloom_test"
],
[
"set",
"->",
"bloom_test",
"finder"
],
[
"test",
"->",
"bloom_test",
"finder"
],
[
"finder",
"->",
"set",
"test"
],
[
"report_capacity",
"->"
],
[
"prefix_make",
"->",
"save_bloom"
],
[
"save_bloom",
"->",
"prefix_make"
],
[
"load_bloom",
"->"
],
[
"write_result",
"->"
],
[
"rev_trans",
"->"
],
[
"mmaping",
"->"
],
[
"build_help",
"->"
],
[
"check_help",
"->"
],
[
"remove_help",
"->"
],
[
"remove_l_help",
"->"
]
] | [] | [
{
"name": "bloom_init",
"canonical_name": "func0",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall bloom_init(__int64 a1, __int64 a2, __int64 a3, int a4, __int64 a5, double a6)\n{\n__int64 result; // rax\n__int64 v7; // rax\ndouble v8; // xmm0_8\n__int64 v9; // rdx\ndouble v10; // xmm0_8\nunsigned __int64 v11; // rax\n\nif ( a2 )\n{\n*(_QWORD *)(a1 + 24) = find_close_prime(a2);\nif ( a4 > 0 )\n{\n*(_DWORD *)(a1 + 32) = a4;\nif ( a5 )\n*(_QWORD *)(a1 + 8) = a5;\nelse\n*(_QWORD *)(a1 + 8) = &hash5;\n*(_QWORD *)(a1 + 16) = 0LL;\nif ( a3 && a6 != 0.0 )\n{\n*(_QWORD *)(a1 + 40) = a3;\n*(double *)(a1 + 48) = a6;\n}\nelse\n{\nv7 = *(_QWORD *)(a1 + 24);\nif ( v7 < 0 )\n{\nv9 = *(_QWORD *)(a1 + 24) & 1LL | ((unsigned __int64)v7 >> 1);\nv8 = (double)(int)v9 + (double)(int)v9;\n}\nelse\n{\nv8 = (double)(int)v7;\n}\nv10 = v8 * 0.7 / (double)a4;\nif ( v10 >= 9.223372036854776e18 )\nv11 = (unsigned int)(int)(v10 - 9.223372036854776e18) ^ 0x8000000000000000LL;\nelse\nv11 = (unsigned int)(int)v10;\n*(_QWORD *)(a1 + 40) = v11;\n*(double *)(a1 + 48) = powf(2.0, -(float)a4);\n}\nif ( a2 >= 0 )\n{\n*(_QWORD *)a1 = malloc((*(_QWORD *)(a1 + 24) >> 3) + 1LL);\nif ( *(_QWORD *)a1 )\n{\nmemset(*(void **)a1, 0, (*(_QWORD *)(a1 + 24) >> 3) + 1LL);\nresult = 0LL;\n}\nelse\n{\nperror(\"malloc\");\nresult = 0xFFFFFFFFLL;\n}\n}\nelse\n{\nfwrite(\"overflow2\\n\", 1uLL, 0xAuLL, stderr);\nresult = 4294967294LL;\n}\n}\nelse\n{\nresult = 0xFFFFFFFFLL;\n}\n}\nelse\n{\nfwrite(\"overflow1\\n\", 1uLL, 0xAuLL, stderr);\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(__int64 a1, __int64 a2, __int64 a3, int a4, __int64 a5, double a6)\n{\n__int64 result; // rax\n__int64 v7; // rax\ndouble v8; // xmm0_8\n__int64 v9; // rdx\ndouble v10; // xmm0_8\nunsigned __int64 v11; // rax\n\nif ( a2 )\n{\n*(_QWORD *)(a1 + 24) = find_close_prime(a2);\nif ( a4 > 0 )\n{\n*(_DWORD *)(a1 + 32) = a4;\nif ( a5 )\n*(_QWORD *)(a1 + 8) = a5;\nelse\n*(_QWORD *)(a1 + 8) = &hash5;\n*(_QWORD *)(a1 + 16) = 0LL;\nif ( a3 && a6 != 0.0 )\n{\n*(_QWORD *)(a1 + 40) = a3;\n*(double *)(a1 + 48) = a6;\n}\nelse\n{\nv7 = *(_QWORD *)(a1 + 24);\nif ( v7 < 0 )\n{\nv9 = *(_QWORD *)(a1 + 24) & 1LL | ((unsigned __int64)v7 >> 1);\nv8 = (double)(int)v9 + (double)(int)v9;\n}\nelse\n{\nv8 = (double)(int)v7;\n}\nv10 = v8 * 0.7 / (double)a4;\nif ( v10 >= 9.223372036854776e18 )\nv11 = (unsigned int)(int)(v10 - 9.223372036854776e18) ^ 0x8000000000000000LL;\nelse\nv11 = (unsigned int)(int)v10;\n*(_QWORD *)(a1 + 40) = v11;\n*(double *)(a1 + 48) = powf(2.0, -(float)a4);\n}\nif ( a2 >= 0 )\n{\n*(_QWORD *)a1 = malloc((*(_QWORD *)(a1 + 24) >> 3) + 1LL);\nif ( *(_QWORD *)a1 )\n{\nmemset(*(void **)a1, 0, (*(_QWORD *)(a1 + 24) >> 3) + 1LL);\nresult = 0LL;\n}\nelse\n{\nperror(\"malloc\");\nresult = 0xFFFFFFFFLL;\n}\n}\nelse\n{\nfwrite(\"overflow2\\n\", 1uLL, 0xAuLL, stderr);\nresult = 4294967294LL;\n}\n}\nelse\n{\nresult = 0xFFFFFFFFLL;\n}\n}\nelse\n{\nfwrite(\"overflow1\\n\", 1uLL, 0xAuLL, stderr);\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}",
"original_code": "int\nbloom_init (bloom * bloom, unsigned long long size, unsigned long long capacity, double error_rate,\n int hashes, hash_t hash, int flags)\n{\n if (size < 1)\n {\n fprintf (stderr, \"overflow1\\n\");\n return -1;\n }\n else\n {\n bloom->stat.elements = find_close_prime (size);\n }\n if (hashes < 1)\n {\n return -1;\n }\n else\n {\n bloom->stat.ideal_hashes = hashes;\n }\n if (hash == ((void *)0))\n {\n bloom->hash = (hash_t) hash5;\n }\n else\n {\n bloom->hash = hash;\n }\n bloom->inserts = 0;\n if (capacity == 0 || error_rate == 0)\n {\n bloom->stat.capacity = 0.7 * bloom->stat.elements / hashes;\n bloom->stat.e = powf (2.0, (float) -1 * hashes);\n }\n else\n {\n bloom->stat.capacity = capacity;\n bloom->stat.e = error_rate;\n }\n if ((size > 0x7fffffffffffffffL))\n {\n fprintf (stderr, \"overflow2\\n\");\n return -2;\n }\n if ((bloom->vector = (char *) malloc (sizeof (char) *\n ((long long) (bloom->stat.elements /\n 8) + 1))) == ((void *)0))\n {\n perror (\"malloc\");\n return -1;\n }\n else\n memset (bloom->vector, 0,\n sizeof (char) * ((long long) (bloom->stat.elements / 8) + 1));\n return 0;\n}",
"canonical_original_code": "int bloom_init(struct bloom *bloom, unsigned long long size, unsigned long long capacity, double error_rate, int hashes, unsigned long long (*hash)(char *str), int flags)\n{\n if (size < 1)\n {\n fprintf (stderr, \"overflow1\\n\");\n return -1;\n }\n else\n {\n bloom->stat.elements = find_close_prime (size);\n }\n if (hashes < 1)\n {\n return -1;\n }\n else\n {\n bloom->stat.ideal_hashes = hashes;\n }\n if (hash == ((void *)0))\n {\n bloom->hash = (unsigned long long (*)(char *str)) hash5;\n }\n else\n {\n bloom->hash = hash;\n }\n bloom->inserts = 0;\n if (capacity == 0 || error_rate == 0)\n {\n bloom->stat.capacity = 0.7 * bloom->stat.elements / hashes;\n bloom->stat.e = powf (2.0, (float) -1 * hashes);\n }\n else\n {\n bloom->stat.capacity = capacity;\n bloom->stat.e = error_rate;\n }\n if ((size > 0x7fffffffffffffffL))\n {\n fprintf (stderr, \"overflow2\\n\");\n return -2;\n }\n if ((bloom->vector = (char *) malloc (sizeof (char) *\n ((long long) (bloom->stat.elements /\n 8) + 1))) == ((void *)0))\n {\n perror (\"malloc\");\n return -1;\n }\n else\n memset (bloom->vector, 0,\n sizeof (char) * ((long long) (bloom->stat.elements / 8) + 1));\n return 0;\n}",
"variable_types": [
[
"bloom",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"size",
"unsigned long long"
],
[
"capacity",
"unsigned long long"
],
[
"error_rate",
"double"
],
[
"hashes",
"int"
],
[
"hash",
"unsigned long long (*)(char *str)"
],
[
"flags",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "bloom_destroy",
"canonical_name": "func1",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall bloom_destroy(__int64 a1)\n{\n__int64 result; // rax\n\nmemset(*(void **)a1, 0, (*(_QWORD *)(a1 + 24) >> 3) + 1LL);\nfree(*(void **)a1);\nresult = a1;\n*(_QWORD *)a1 = 0LL;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1)\n{\n__int64 result; // rax\n\nmemset(*(void **)a1, 0, (*(_QWORD *)(a1 + 24) >> 3) + 1LL);\nfree(*(void **)a1);\nresult = a1;\n*(_QWORD *)a1 = 0LL;\nreturn result;\n}",
"original_code": "void\nbloom_destroy (bloom * bloom)\n{\n memset (bloom->vector, 0,\n sizeof (char) * ((long long) (bloom->stat.elements / 8) + 1));\n free (bloom->vector);\n bloom->vector = ((void *)0);\n}",
"canonical_original_code": "void bloom_destroy(struct bloom *bloom)\n{\n memset (bloom->vector, 0,\n sizeof (char) * ((long long) (bloom->stat.elements / 8) + 1));\n free (bloom->vector);\n bloom->vector = ((void *)0);\n}",
"variable_types": [
[
"bloom",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "bloom_check",
"canonical_name": "func2",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall bloom_check(__int64 a1, __int64 a2)\n{\nreturn bloom_test(a1, a2, 0LL);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, __int64 a2)\n{\nreturn func4(a1, a2, 0LL);\n}",
"original_code": "int\nbloom_check (bloom * bloom, char *str)\n{\n return bloom_test (bloom, str, 0);\n}",
"canonical_original_code": "int bloom_check(struct bloom *bloom, char *str)\n{\n return bloom_test (bloom, str, 0);\n}",
"variable_types": [
[
"bloom",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"str",
"char *"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "bloom_add",
"canonical_name": "func3",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall bloom_add(__int64 a1, __int64 a2)\n{\nunsigned int v3; // [rsp+1Ch] [rbp-4h]\n\nv3 = bloom_test(a1, a2, 1LL);\nif ( !v3 )\n++*(_QWORD *)(a1 + 16);\nreturn v3;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1, __int64 a2)\n{\nunsigned int v3; // [rsp+1Ch] [rbp-4h]\n\nv3 = func4(a1, a2, 1LL);\nif ( !v3 )\n++*(_QWORD *)(a1 + 16);\nreturn v3;\n}",
"original_code": "int\nbloom_add (bloom * bloom, char *str)\n{\n int ret;\n ret = bloom_test (bloom, str, 1);\n if (ret == 0)\n {\n bloom->inserts++;\n }\n return ret;\n}",
"canonical_original_code": "int bloom_add(struct bloom *bloom, char *str)\n{\n int ret;\n ret = bloom_test (bloom, str, 1);\n if (ret == 0)\n {\n bloom->inserts++;\n }\n return ret;\n}",
"variable_types": [
[
"bloom",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"str",
"char *"
],
[
"ret",
"int"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "bloom_test",
"canonical_name": "func4",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall bloom_test(__int64 a1, __int64 a2, int a3)\n{\n__int64 v5; // [rsp+20h] [rbp-10h]\nunsigned int v6; // [rsp+28h] [rbp-8h]\nunsigned int i; // [rsp+2Ch] [rbp-4h]\n\nv6 = 1;\nfor ( i = 0; (signed int)i < *(_DWORD *)(a1 + 32); ++i )\n{\nv5 = bloom_hash(a1, a2, i, *(unsigned int *)(a1 + 56));\nif ( !(unsigned int)test(*(_QWORD *)a1, v5) )\n{\nv6 = 0;\nif ( a3 != 1 )\nreturn 0LL;\nset(*(_QWORD *)a1, v5);\n}\n}\nreturn v6;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(__int64 a1, __int64 a2, int a3)\n{\n__int64 v5; // [rsp+20h] [rbp-10h]\nunsigned int v6; // [rsp+28h] [rbp-8h]\nunsigned int i; // [rsp+2Ch] [rbp-4h]\n\nv6 = 1;\nfor ( i = 0; (signed int)i < *(_DWORD *)(a1 + 32); ++i )\n{\nv5 = func5(a1, a2, i, *(unsigned int *)(a1 + 56));\nif ( !(unsigned int)func7(*(_QWORD *)a1, v5) )\n{\nv6 = 0;\nif ( a3 != 1 )\nreturn 0LL;\nfunc6(*(_QWORD *)a1, v5);\n}\n}\nreturn v6;\n}",
"original_code": "int\nbloom_test (bloom * bloom, char *str, int mode)\n{\n int i, hit;\n unsigned long long ret;\n hit = 1;\n for (i = 0; i < bloom->stat.ideal_hashes; i++)\n {\n ret = bloom_hash (bloom, str, i, bloom->k_mer);\n if (!test (bloom->vector, ret))\n {\n hit = 0;\n if (mode == 1)\n {\n set (bloom->vector, ret);\n }\n else\n {\n return hit;\n }\n }\n }\n return hit;\n}",
"canonical_original_code": "int bloom_test(struct bloom *bloom, char *str, int mode)\n{\n int i; int hit;\n unsigned long long ret;\n hit = 1;\n for (i = 0; i < bloom->stat.ideal_hashes; i++)\n {\n ret = bloom_hash (bloom, str, i, bloom->k_mer);\n if (!test (bloom->vector, ret))\n {\n hit = 0;\n if (mode == 1)\n {\n set (bloom->vector, ret);\n }\n else\n {\n return hit;\n }\n }\n }\n return hit;\n}",
"variable_types": [
[
"bloom",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"str",
"char *"
],
[
"mode",
"int"
],
[
"i",
"int"
],
[
"hit",
"int"
],
[
"ret",
"unsigned long long"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "bloom_hash",
"canonical_name": "func5",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "unsigned __int64 __fastcall bloom_hash(__int64 a1, __int64 a2, int a3, unsigned int a4)\n{\nreturn (unsigned __int64)hash5(a2, (unsigned int)seed[a3], a4) % *(_QWORD *)(a1 + 24);\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func5(__int64 a1, __int64 a2, int a3, unsigned int a4)\n{\nreturn (unsigned __int64)hash5(a2, (unsigned int)seed[a3], a4) % *(_QWORD *)(a1 + 24);\n}",
"original_code": "unsigned long long\nbloom_hash (bloom * bloom, char *str, int i, int length)\n{\n unsigned long long ret = 0;\n ret = (unsigned long long) hash5 (str, seed[i], length) % (unsigned long long) bloom->stat.elements;\n return ret;\n}",
"canonical_original_code": "unsigned long long bloom_hash(struct bloom *bloom, char *str, int i, int length)\n{\n unsigned long long ret = 0;\n ret = (unsigned long long) hash5 (str, seed[i], length) % (unsigned long long) bloom->stat.elements;\n return ret;\n}",
"variable_types": [
[
"bloom",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"str",
"char *"
],
[
"i",
"int"
],
[
"length",
"int"
],
[
"ret",
"unsigned long long"
]
],
"return_type": "unsigned long long",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "set",
"canonical_name": "func6",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall set(__int64 a1, __int64 a2)\n{\n__int64 v3; // [rsp+10h] [rbp-10h] BYREF\nchar v4; // [rsp+18h] [rbp-8h]\n\nfinder(a2, &v3);\n*(_BYTE *)(v3 + a1) += v4;\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func6(__int64 a1, __int64 a2)\n{\n__int64 v3; // [rsp+10h] [rbp-10h] BYREF\nchar v4; // [rsp+18h] [rbp-8h]\n\nfunc8(a2, &v3);\n*(_BYTE *)(v3 + a1) += v4;\nreturn 0LL;\n}",
"original_code": "int\nset (char *big, unsigned long long index)\n{\n deref dr;\n finder (index, &dr);\n big[dr.index] += dr.spot;\n return 0;\n}",
"canonical_original_code": "int set(char *big, unsigned long long index)\n{\n struct deref dr;\n finder (index, &dr);\n big[dr.index] += dr.spot;\n return 0;\n}",
"variable_types": [
[
"big",
"char *"
],
[
"index",
"unsigned long long"
],
[
"dr",
"struct deref { unsigned long long index; char spot; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct deref { unsigned long long index; char spot; }"
],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "test",
"canonical_name": "func7",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "_BOOL8 __fastcall test(__int64 a1, __int64 a2)\n{\n__int64 v3; // [rsp+10h] [rbp-20h] BYREF\nunsigned __int8 v4; // [rsp+18h] [rbp-18h]\n\nfinder(a2, &v3);\nreturn (*(_BYTE *)(v3 + a1) & v4) == v4;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func7(__int64 a1, __int64 a2)\n{\n__int64 v3; // [rsp+10h] [rbp-20h] BYREF\nunsigned __int8 v4; // [rsp+18h] [rbp-18h]\n\nfunc8(a2, &v3);\nreturn (*(_BYTE *)(v3 + a1) & v4) == v4;\n}",
"original_code": "int\ntest (char *big, unsigned long long index)\n{\n deref dr;\n char bucket;\n finder (index, &dr);\n bucket = big[dr.index];\n if ((bucket & dr.spot) == dr.spot)\n {\n return 1;\n }\n else\n {\n return 0;\n }\n}",
"canonical_original_code": "int test(char *big, unsigned long long index)\n{\n struct deref dr;\n char bucket;\n finder (index, &dr);\n bucket = big[dr.index];\n if ((bucket & dr.spot) == dr.spot)\n {\n return 1;\n }\n else\n {\n return 0;\n }\n}",
"variable_types": [
[
"big",
"char *"
],
[
"index",
"unsigned long long"
],
[
"dr",
"struct deref { unsigned long long index; char spot; }"
],
[
"bucket",
"char"
]
],
"return_type": "int",
"user_defined_types": [
"struct deref { unsigned long long index; char spot; }"
],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "finder",
"canonical_name": "func8",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall finder(unsigned __int64 a1, __int64 a2)\n{\n*(_QWORD *)a2 = a1 >> 3;\n*(_BYTE *)(a2 + 8) = 1 << (a1 & 7);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func8(unsigned __int64 a1, __int64 a2)\n{\n*(_QWORD *)a2 = a1 >> 3;\n*(_BYTE *)(a2 + 8) = 1 << (a1 & 7);\nreturn 0LL;\n}",
"original_code": "int\nfinder (unsigned long long index, deref * dr)\n{\n dr->index = (unsigned long long) (index >> 3);\n dr->spot = 1<<(index & 0x07);\n return 0;\n}",
"canonical_original_code": "int finder(unsigned long long index, struct deref *dr)\n{\n dr->index = (unsigned long long) (index >> 3);\n dr->spot = 1<<(index & 0x07);\n return 0;\n}",
"variable_types": [
[
"index",
"unsigned long long"
],
[
"dr",
"struct deref { unsigned long long index; char spot; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct deref { unsigned long long index; char spot; }"
],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "report_capacity",
"canonical_name": "func9",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall report_capacity(__int64 a1)\n{\nreturn *(_QWORD *)(a1 + 40);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func9(__int64 a1)\n{\nreturn *(_QWORD *)(a1 + 40);\n}",
"original_code": "unsigned long long\nreport_capacity (bloom * bloom)\n{\n return bloom->stat.capacity;\n}",
"canonical_original_code": "unsigned long long report_capacity(struct bloom *bloom)\n{\n return bloom->stat.capacity;\n}",
"variable_types": [
[
"bloom",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
]
],
"return_type": "unsigned long long",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "prefix_make",
"canonical_name": "func10",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "char *__fastcall prefix_make(const char *a1, __int64 a2, const char *a3)\n{\nchar *v3; // rax\nchar *v4; // rax\nconst char *v7; // [rsp+20h] [rbp-10h]\nchar *dest; // [rsp+28h] [rbp-8h]\n\nv7 = strrchr(a1, 47);\ndest = (char *)malloc(0x12CuLL);\nmemset(dest, 0, 0x12CuLL);\nif ( !(unsigned int)is_dir(a3) )\n{\nif ( a3 )\n{\nstrcat(dest, a3);\nreturn dest;\n}\nif ( !v7 )\n{\nv4 = strrchr(a1, 46);\nstrncat(dest, a1, v4 - a1);\nreturn dest;\n}\ngoto LABEL_3;\n}\nstrcat(dest, a3);\nif ( v7 )\n{\nLABEL_3:\nv3 = strrchr(v7, 46);\nstrncat(dest, v7, v3 - v7);\n}\nreturn dest;\n}\n",
"canonical_decompiled_code": "char *__fastcall func10(const char *a1, __int64 a2, const char *a3)\n{\nchar *v3; // rax\nchar *v4; // rax\nconst char *v7; // [rsp+20h] [rbp-10h]\nchar *dest; // [rsp+28h] [rbp-8h]\n\nv7 = strrchr(a1, 47);\ndest = (char *)malloc(0x12CuLL);\nmemset(dest, 0, 0x12CuLL);\nif ( !(unsigned int)is_dir(a3) )\n{\nif ( a3 )\n{\nstrcat(dest, a3);\nreturn dest;\n}\nif ( !v7 )\n{\nv4 = strrchr(a1, 46);\nstrncat(dest, a1, v4 - a1);\nreturn dest;\n}\ngoto LABEL_3;\n}\nstrcat(dest, a3);\nif ( v7 )\n{\nLABEL_3:\nv3 = strrchr(v7, 46);\nstrncat(dest, v7, v3 - v7);\n}\nreturn dest;\n}",
"original_code": "char*\nprefix_make (char *filename, char *prefix, char *target)\n{\n char *position1 = strrchr (filename, '/');\n char *bloom_file = (char *) malloc (300 * sizeof (char));\n memset (bloom_file, 0, 300);\n if (is_dir(target)) {\n strcat (bloom_file,target);\n if (position1!=((void *)0))\n strncat (bloom_file,position1,strrchr(position1,'.')-position1);\n } else if (target) {\n strcat (bloom_file,target);\n }\n else if (target!=((void *)0) && prefix!=((void *)0)) {\n if (position1!=((void *)0))\n strncat (bloom_file,position1,strrchr(position1,'.')-position1);\n else\n strncat (bloom_file,filename,strrchr(filename,'.')-filename);\n strcat (bloom_file, \".bloom\");\n bloom_file++;\n }\n else\n {\n if (position1!=((void *)0))\n strncat (bloom_file,position1,strrchr(position1,'.')-position1);\n else\n strncat (bloom_file,filename,strrchr(filename,'.')-filename);\n }\n return bloom_file;\n}",
"canonical_original_code": "char *prefix_make(char *filename, char *prefix, char *target)\n{\n char *position1 = strrchr (filename, '/');\n char *bloom_file = (char *) malloc (300 * sizeof (char));\n memset (bloom_file, 0, 300);\n if (is_dir(target)) {\n strcat (bloom_file,target);\n if (position1!=((void *)0))\n strncat (bloom_file,position1,strrchr(position1,'.')-position1);\n } else if (target) {\n strcat (bloom_file,target);\n }\n else if (target!=((void *)0) && prefix!=((void *)0)) {\n if (position1!=((void *)0))\n strncat (bloom_file,position1,strrchr(position1,'.')-position1);\n else\n strncat (bloom_file,filename,strrchr(filename,'.')-filename);\n strcat (bloom_file, \".bloom\");\n bloom_file++;\n }\n else\n {\n if (position1!=((void *)0))\n strncat (bloom_file,position1,strrchr(position1,'.')-position1);\n else\n strncat (bloom_file,filename,strrchr(filename,'.')-filename);\n }\n return bloom_file;\n}",
"variable_types": [
[
"filename",
"char *"
],
[
"prefix",
"char *"
],
[
"target",
"char *"
],
[
"position1",
"char *"
],
[
"bloom_file",
"char *"
]
],
"return_type": "char *",
"user_defined_types": [],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "save_bloom",
"canonical_name": "func11",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall save_bloom(const char *a1, void **a2, __int64 a3, const char *a4)\n{\n__int64 result; // rax\nint *v5; // rax\nchar *v6; // rbx\nint *v7; // rax\nint fd; // [rsp+24h] [rbp-2Ch]\n__int64 v11; // [rsp+28h] [rbp-28h]\nunsigned __int64 length; // [rsp+30h] [rbp-20h]\nchar *s; // [rsp+38h] [rbp-18h]\n\ns = prefix_make(a1, a3, a4);\nif ( a3 || a4 )\n{\nif ( (unsigned int)is_dir(a4) )\nstrcat(s, \".bloom\");\n}\nelse\n{\nstrcat(s++, \".bloom\");\n}\nfd = open64(s, 66, 420LL);\nif ( fd >= 0 )\n{\nif ( ftruncate64(fd, ((unsigned __int64)a2[3] >> 3) + 4LL * (*((_DWORD *)a2 + 8) + 1) + 73) >= 0 )\n{\nif ( write(fd, a2, 0x48uLL) < 0 )\n{\nperror(\" error writing bloom file \");\nexit(1);\n}\nlength = ((unsigned __int64)a2[3] >> 3) + 1;\nv11 = 0LL;\nwhile ( length > 0x77359400 )\n{\nif ( write(fd, (char *)*a2 + v11, 0x77359400uLL) < 0 )\n{\nperror(\" error writing bloom file \");\nexit(1);\n}\nlength -= 2000000000LL;\nv11 += 2000000000LL;\n}\nif ( write(fd, (char *)*a2 + v11, length) < 0 )\n{\nperror(\" error writing bloom file \");\nexit(1);\n}\nclose(fd);\nmemset(*a2, 0, ((unsigned __int64)a2[3] >> 3) + 1);\nresult = 0LL;\n}\nelse\n{\nv5 = _errno_location();\nv6 = strerror(*v5);\nv7 = _errno_location();\nprintf(\"[%d]-ftruncate64 error: %s/n\", (unsigned int)*v7, v6);\nclose(fd);\nresult = 0LL;\n}\n}\nelse\n{\nperror(s);\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func11(const char *a1, void **a2, __int64 a3, const char *a4)\n{\n__int64 result; // rax\nint *v5; // rax\nchar *v6; // rbx\nint *v7; // rax\nint fd; // [rsp+24h] [rbp-2Ch]\n__int64 v11; // [rsp+28h] [rbp-28h]\nunsigned __int64 length; // [rsp+30h] [rbp-20h]\nchar *s; // [rsp+38h] [rbp-18h]\n\ns = func10(a1, a3, a4);\nif ( a3 || a4 )\n{\nif ( (unsigned int)is_dir(a4) )\nstrcat(s, \".bloom\");\n}\nelse\n{\nstrcat(s++, \".bloom\");\n}\nfd = open64(s, 66, 420LL);\nif ( fd >= 0 )\n{\nif ( ftruncate64(fd, ((unsigned __int64)a2[3] >> 3) + 4LL * (*((_DWORD *)a2 + 8) + 1) + 73) >= 0 )\n{\nif ( write(fd, a2, 0x48uLL) < 0 )\n{\nperror(\" error writing bloom file \");\nexit(1);\n}\nlength = ((unsigned __int64)a2[3] >> 3) + 1;\nv11 = 0LL;\nwhile ( length > 0x77359400 )\n{\nif ( write(fd, (char *)*a2 + v11, 0x77359400uLL) < 0 )\n{\nperror(\" error writing bloom file \");\nexit(1);\n}\nlength -= 2000000000LL;\nv11 += 2000000000LL;\n}\nif ( write(fd, (char *)*a2 + v11, length) < 0 )\n{\nperror(\" error writing bloom file \");\nexit(1);\n}\nclose(fd);\nmemset(*a2, 0, ((unsigned __int64)a2[3] >> 3) + 1);\nresult = 0LL;\n}\nelse\n{\nv5 = _errno_location();\nv6 = strerror(*v5);\nv7 = _errno_location();\nprintf(\"[%d]-ftruncate64 error: %s/n\", (unsigned int)*v7, v6);\nclose(fd);\nresult = 0LL;\n}\n}\nelse\n{\nperror(s);\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}",
"original_code": "int\nsave_bloom (char *filename, bloom * bl, char *prefix, char *target)\n{\n char *bloom_file = ((void *)0);\n int fd;\n bloom_file = prefix_make(filename, prefix, target);\n if (prefix==((void *)0) && target==((void *)0))\n {\n strcat (bloom_file,\".bloom\");\n bloom_file++;\n }\n else if (is_dir(target))\n strcat (bloom_file,\".bloom\");\n fd = open (bloom_file, 02 | 0100 | 0, 0644);\n if (fd < 0)\n {\n perror (bloom_file);\n return -1;\n }\n unsigned long long total_size =\n sizeof (bloom) + sizeof (char) * ((long long) (bl->stat.elements / 8) +\n 1) +\n sizeof (int) * (bl->stat.ideal_hashes + 1);\n if (ftruncate64 (fd, total_size) < 0)\n {\n printf (\"[%d]-ftruncate64 error: %s/n\", (*__errno_location ()), strerror ((*__errno_location ())));\n close (fd);\n return 0;\n }\n if(write (fd, bl, sizeof (bloom)) < 0) {\n perror (\" error writing bloom file \");\n exit (1);\n }\n total_size = (long long) (bl->stat.elements / 8) + 1;\n unsigned long long off = 0;\n while (total_size > 2000000000)\n {\n if(write(fd, bl->vector + off, sizeof (char) * 2000000000) < 0) {\n perror (\" error writing bloom file \");\n exit (1);\n }\n total_size -= 2000000000;\n off += 2000000000;\n }\n if (write (fd, bl->vector + off, sizeof (char) * total_size) < 0){\n perror (\" error writing bloom file \");\n exit (1);\n };\n close (fd);\n memset (bl->vector, 0,\n sizeof (char) * ((long long) (bl->stat.elements / 8) + 1));\n return 0;\n}",
"canonical_original_code": "int save_bloom(char *filename, struct bloom *bl, char *prefix, char *target)\n{\n char *bloom_file = ((void *)0);\n int fd;\n bloom_file = prefix_make(filename, prefix, target);\n if (prefix==((void *)0) && target==((void *)0))\n {\n strcat (bloom_file,\".bloom\");\n bloom_file++;\n }\n else if (is_dir(target))\n strcat (bloom_file,\".bloom\");\n fd = open (bloom_file, 02 | 0100 | 0, 0644);\n if (fd < 0)\n {\n perror (bloom_file);\n return -1;\n }\n unsigned long long total_size = sizeof (bloom) + sizeof (char) * ((long long) (bl->stat.elements / 8) +\n 1) +\n sizeof (int) * (bl->stat.ideal_hashes + 1);\n if (ftruncate64 (fd, total_size) < 0)\n {\n printf (\"[%d]-ftruncate64 error: %s/n\", (*__errno_location ()), strerror ((*__errno_location ())));\n close (fd);\n return 0;\n }\n if(write (fd, bl, sizeof (bloom)) < 0) {\n perror (\" error writing bloom file \");\n exit (1);\n }\n total_size = (long long) (bl->stat.elements / 8) + 1;\n unsigned long long off = 0;\n while (total_size > 2000000000)\n {\n if(write(fd, bl->vector + off, sizeof (char) * 2000000000) < 0) {\n perror (\" error writing bloom file \");\n exit (1);\n }\n total_size -= 2000000000;\n off += 2000000000;\n }\n if (write (fd, bl->vector + off, sizeof (char) * total_size) < 0){\n perror (\" error writing bloom file \");\n exit (1);\n };\n close (fd);\n memset (bl->vector, 0,\n sizeof (char) * ((long long) (bl->stat.elements / 8) + 1));\n return 0;\n}",
"variable_types": [
[
"filename",
"char *"
],
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"prefix",
"char *"
],
[
"target",
"char *"
],
[
"bloom_file",
"char *"
],
[
"fd",
"int"
],
[
"total_size",
"unsigned long long"
],
[
"off",
"unsigned long long"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "load_bloom",
"canonical_name": "func12",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall load_bloom(const char *a1, void **a2)\n{\n__int64 result; // rax\nunsigned int v3; // [rsp+18h] [rbp-18h]\nint fd; // [rsp+1Ch] [rbp-14h]\nunsigned __int64 nbytes; // [rsp+20h] [rbp-10h]\n__int64 v6; // [rsp+28h] [rbp-8h]\n\nfd = open64(a1, 0, 420LL);\nif ( fd >= 0 )\n{\nif ( read(fd, a2, 0x48uLL) < 0 )\nperror(\"Problem reading bloom filter\");\n*a2 = malloc(((unsigned __int64)a2[3] >> 3) + 1);\nv6 = 0LL;\nfor ( nbytes = ((unsigned __int64)a2[3] >> 3) + 1; nbytes > 0x77359400; nbytes -= 2000000000LL )\n{\nif ( (int)read(fd, (char *)*a2 + v6, 0x77359400uLL) < 0 )\nperror(\"Problem reading bloom filter\");\nv6 += 2000000000LL;\n}\nv3 = read(fd, (char *)*a2 + v6, nbytes);\nclose(fd);\nresult = v3;\n}\nelse\n{\nperror(a1);\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func12(const char *a1, void **a2)\n{\n__int64 result; // rax\nunsigned int v3; // [rsp+18h] [rbp-18h]\nint fd; // [rsp+1Ch] [rbp-14h]\nunsigned __int64 nbytes; // [rsp+20h] [rbp-10h]\n__int64 v6; // [rsp+28h] [rbp-8h]\n\nfd = open64(a1, 0, 420LL);\nif ( fd >= 0 )\n{\nif ( read(fd, a2, 0x48uLL) < 0 )\nperror(\"Problem reading bloom filter\");\n*a2 = malloc(((unsigned __int64)a2[3] >> 3) + 1);\nv6 = 0LL;\nfor ( nbytes = ((unsigned __int64)a2[3] >> 3) + 1; nbytes > 0x77359400; nbytes -= 2000000000LL )\n{\nif ( (int)read(fd, (char *)*a2 + v6, 0x77359400uLL) < 0 )\nperror(\"Problem reading bloom filter\");\nv6 += 2000000000LL;\n}\nv3 = read(fd, (char *)*a2 + v6, nbytes);\nclose(fd);\nresult = v3;\n}\nelse\n{\nperror(a1);\nresult = 0xFFFFFFFFLL;\n}\nreturn result;\n}",
"original_code": "int\nload_bloom (char *filename, bloom * bl)\n{\n int fd = 0;\n int ret;\n fd = open64 (filename, 00, 0644);\n if (fd < 0) {\n perror (filename);\n return -1;\n }\n if (read (fd, bl, sizeof (bloom)) < 0){\n perror(\"Problem reading bloom filter\");\n };\n bl->vector = (char *) malloc (sizeof (char) * ((long long) (bl->stat.elements / 8) + 1));\n unsigned long long off = 0, total_size = ((long long) (bl->stat.elements / 8) + 1);\n while (total_size > 2000000000) {\n ret = read(fd, bl->vector + off, sizeof (char) * 2000000000);\n if (ret < 0)\n perror(\"Problem reading bloom filter\");\n total_size -= 2000000000;\n off += 2000000000;\n }\n ret = read (fd, bl->vector + off, sizeof (char) * total_size);\n close (fd);\n return ret;\n}",
"canonical_original_code": "int load_bloom(char *filename, struct bloom *bl)\n{\n int fd = 0;\n int ret;\n fd = open64 (filename, 00, 0644);\n if (fd < 0) {\n perror (filename);\n return -1;\n }\n if (read (fd, bl, sizeof (bloom)) < 0){\n perror(\"Problem reading bloom filter\");\n };\n bl->vector = (char *) malloc (sizeof (char) * ((long long) (bl->stat.elements / 8) + 1));\n unsigned long long off = 0; unsigned long long total_size = ((long long) (bl->stat.elements / 8) + 1);\n while (total_size > 2000000000) {\n ret = read(fd, bl->vector + off, sizeof (char) * 2000000000);\n if (ret < 0)\n perror(\"Problem reading bloom filter\");\n total_size -= 2000000000;\n off += 2000000000;\n }\n ret = read (fd, bl->vector + off, sizeof (char) * total_size);\n close (fd);\n return ret;\n}",
"variable_types": [
[
"filename",
"char *"
],
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"fd",
"int"
],
[
"ret",
"int"
],
[
"off",
"unsigned long long"
],
[
"total_size",
"unsigned long long"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "write_result",
"canonical_name": "func13",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "int __fastcall write_result(const char *a1, const char *a2)\n{\nsize_t v2; // rax\nint fd; // [rsp+1Ch] [rbp-4h]\n\nfd = open64(a1, 66, 448LL);\nv2 = strlen(a2);\nif ( write(fd, a2, v2) < 0 )\n{\nperror(\" error writing result file \");\nexit(1);\n}\nreturn close(fd);\n}\n",
"canonical_decompiled_code": "int __fastcall func13(const char *a1, const char *a2)\n{\nsize_t v2; // rax\nint fd; // [rsp+1Ch] [rbp-4h]\n\nfd = open64(a1, 66, 448LL);\nv2 = strlen(a2);\nif ( write(fd, a2, v2) < 0 )\n{\nperror(\" error writing result file \");\nexit(1);\n}\nreturn close(fd);\n}",
"original_code": "void\nwrite_result (char *filename, char *detail)\n{\n int fd;\n fd = open (filename, 0100 | 02, (0400|0200|0100));\n if (write (fd, detail, strlen (detail)) < 0) {\n perror (\" error writing result file \");\n exit (1);\n }\n close (fd);\n}",
"canonical_original_code": "void write_result(char *filename, char *detail)\n{\n int fd;\n fd = open (filename, 0100 | 02, (0400|0200|0100));\n if (write (fd, detail, strlen (detail)) < 0) {\n perror (\" error writing result file \");\n exit (1);\n }\n close (fd);\n}",
"variable_types": [
[
"filename",
"char *"
],
[
"detail",
"char *"
],
[
"fd",
"int"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "rev_trans",
"canonical_name": "func14",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "size_t __fastcall rev_trans(const char *a1)\n{\nsize_t result; // rax\nchar *s; // [rsp+8h] [rbp-28h]\nchar v3; // [rsp+17h] [rbp-19h]\nint i; // [rsp+18h] [rbp-18h]\nint v5; // [rsp+1Ch] [rbp-14h]\n\ns = (char *)a1;\nv5 = 0;\nfor ( i = strlen(a1) - 1; v5 < i; --i )\n{\nv3 = a1[v5];\na1[v5] = a1[i];\na1[i] = v3;\n++v5;\n}\nwhile ( 1 )\n{\nresult = strlen(s);\nif ( !result )\nreturn result;\nswitch ( *s )\n{\ncase 'A':\n*s = 84;\nbreak;\ncase 'C':\n*s = 71;\nbreak;\ncase 'G':\n*s = 67;\nbreak;\ncase 'T':\n*s = 65;\nbreak;\ncase 'a':\n*s = 116;\nbreak;\ncase 'c':\n*s = 103;\nbreak;\ncase 'g':\n*s = 99;\nbreak;\ncase 't':\n*s = 97;\nbreak;\ndefault:\nbreak;\n}\n++s;\n}\n}\n",
"canonical_decompiled_code": "size_t __fastcall func14(const char *a1)\n{\nsize_t result; // rax\nchar *s; // [rsp+8h] [rbp-28h]\nchar v3; // [rsp+17h] [rbp-19h]\nint i; // [rsp+18h] [rbp-18h]\nint v5; // [rsp+1Ch] [rbp-14h]\n\ns = (char *)a1;\nv5 = 0;\nfor ( i = strlen(a1) - 1; v5 < i; --i )\n{\nv3 = a1[v5];\na1[v5] = a1[i];\na1[i] = v3;\n++v5;\n}\nwhile ( 1 )\n{\nresult = strlen(s);\nif ( !result )\nreturn result;\nswitch ( *s )\n{\ncase 'A':\n*s = 84;\nbreak;\ncase 'C':\n*s = 71;\nbreak;\ncase 'G':\n*s = 67;\nbreak;\ncase 'T':\n*s = 65;\nbreak;\ncase 'a':\n*s = 116;\nbreak;\ncase 'c':\n*s = 103;\nbreak;\ncase 'g':\n*s = 99;\nbreak;\ncase 't':\n*s = 97;\nbreak;\ndefault:\nbreak;\n}\n++s;\n}\n}",
"original_code": "void\nrev_trans (char *s)\n{\n int i;\n int j;\n for (i = 0, j = strlen (s) - 1; i < j; ++i, --j)\n {\n char c = s[i];\n s[i] = s[j];\n s[j] = c;\n }\n i = 0;\n while (i < strlen (s))\n {\n switch (s[i])\n {\n case 'A':\n s[0] = 'T';\n break;\n case 'C':\n s[0] = 'G';\n break;\n case 'G':\n s[0] = 'C';\n break;\n case 'T':\n s[0] = 'A';\n break;\n case 'a':\n s[0] = 't';\n break;\n case 'c':\n s[0] = 'g';\n break;\n case 'g':\n s[0] = 'c';\n break;\n case 't':\n s[0] = 'a';\n break;\n }\n s++;\n }\n}",
"canonical_original_code": "void rev_trans(char *s)\n{\n int i;\n int j;\n for (i = 0, j = strlen (s) - 1; i < j; ++i, --j)\n {\n char c = s[i];\n s[i] = s[j];\n s[j] = c;\n }\n i = 0;\n while (i < strlen (s))\n {\n switch (s[i])\n {\n case 'A':\n s[0] = 'T';\n break;\n case 'C':\n s[0] = 'G';\n break;\n case 'G':\n s[0] = 'C';\n break;\n case 'T':\n s[0] = 'A';\n break;\n case 'a':\n s[0] = 't';\n break;\n case 'c':\n s[0] = 'g';\n break;\n case 'g':\n s[0] = 'c';\n break;\n case 't':\n s[0] = 'a';\n break;\n }\n s++;\n }\n}",
"variable_types": [
[
"s",
"char *"
],
[
"i",
"int"
],
[
"j",
"int"
],
[
"c",
"char"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "mmaping",
"canonical_name": "func15",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "void *__fastcall mmaping(const char *a1)\n{\nstruct stat64 buf; // [rsp+10h] [rbp-A0h] BYREF\nvoid *v3; // [rsp+A0h] [rbp-10h]\nint fd; // [rsp+ACh] [rbp-4h]\n\nfd = open64(a1, 0);\nif ( fd < 0 )\n{\nperror(\" open source \");\nexit(1);\n}\nif ( fstat64(fd, &buf) < 0 )\n{\nperror(\" fstat source \");\nexit(1);\n}\nv3 = mmap64(0LL, buf.st_size, 1, 16385, fd, 0LL);\nif ( v3 == (void *)-1LL )\n{\nperror(\" mmap source \");\nexit(1);\n}\nreturn v3;\n}\n",
"canonical_decompiled_code": "void *__fastcall func15(const char *a1)\n{\nstruct stat64 buf; // [rsp+10h] [rbp-A0h] BYREF\nvoid *v3; // [rsp+A0h] [rbp-10h]\nint fd; // [rsp+ACh] [rbp-4h]\n\nfd = open64(a1, 0);\nif ( fd < 0 )\n{\nperror(\" open source \");\nexit(1);\n}\nif ( fstat64(fd, &buf) < 0 )\n{\nperror(\" fstat source \");\nexit(1);\n}\nv3 = mmap64(0LL, buf.st_size, 1, 16385, fd, 0LL);\nif ( v3 == (void *)-1LL )\n{\nperror(\" mmap source \");\nexit(1);\n}\nreturn v3;\n}",
"original_code": "char *\nmmaping (char *source)\n{\n struct stat statbuf;\n int src;\n char *sm;\n if ((src = open(source, 00 | 0)) < 0)\n {\n perror (\" open source \");\n exit (1);\n }\n if (fstat (src, &statbuf) < 0)\n {\n perror (\" fstat source \");\n exit (1);\n }\n sm =\n mmap (0, (long long) statbuf.st_size, 0x1, 0x01 | 0x04000,\n src, 0);\n if (((void *) -1) == sm)\n {\n perror (\" mmap source \");\n exit (1);\n }\n return sm;\n}",
"canonical_original_code": "char *mmaping(char *source)\n{\n struct stat statbuf;\n int src;\n char *sm;\n if ((src = open(source, 00 | 0)) < 0)\n {\n perror (\" open source \");\n exit (1);\n }\n if (fstat (src, &statbuf) < 0)\n {\n perror (\" fstat source \");\n exit (1);\n }\n sm =\n mmap (0, (long long) statbuf.st_size, 0x1, 0x01 | 0x04000,\n src, 0);\n if (((void *) -1) == sm)\n {\n perror (\" mmap source \");\n exit (1);\n }\n return sm;\n}",
"variable_types": [
[
"source",
"char *"
],
[
"statbuf",
"struct stat { unsigned long st_dev; unsigned long st_ino; unsigned long st_nlink; unsigned int st_mode; unsigned int st_uid; unsigned int st_gid; int __pad0; unsigned long st_rdev; long st_size; long st_blksize; long st_blocks; struct timespec { long tv_sec; long tv_nsec; } st_atim; struct timespec st_mtim; struct timespec st_ctim; long __glibc_reserved[3]; }"
],
[
"src",
"int"
],
[
"sm",
"char *"
]
],
"return_type": "char *",
"user_defined_types": [
"struct stat { unsigned long st_dev; unsigned long st_ino; unsigned long st_nlink; unsigned int st_mode; unsigned int st_uid; unsigned int st_gid; int __pad0; unsigned long st_rdev; long st_size; long st_blksize; long st_blocks; struct timespec st_atim; struct timespec st_mtim; struct timespec st_ctim; long __glibc_reserved[3]; }",
"struct timespec { long tv_sec; long tv_nsec; }"
],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "build_help",
"canonical_name": "func16",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "void __noreturn build_help()\n{\nputs(\"USAGE\");\nputs(\"##########################################################################\");\nputs(\"---Bloom build----\");\nputs(\"# ./facs build [option] [option] [option] [option] <option>\");\nputs(\"#\");\nputs(\"# Options:\");\nputs(\"# -r reference file name or directory name\");\nputs(\"# -l a list containing multiple reference filenames\");\nputs(\"!!! either -r or -l can only be allowed each time !!!\");\nputs(\"# -k k_mer size (default size 21)\");\nputs(\"# -e error rate (default rate 0.0005)\");\nputs(\"# -h show help documents\");\nputs(\"# -o output file name (default file is saved as the same as binary file)\");\nputs(\"##########################################################################\");\nexit(1);\n}\n",
"canonical_decompiled_code": "void __noreturn func16()\n{\nputs(\"USAGE\");\nputs(\"##########################################################################\");\nputs(\"---Bloom build----\");\nputs(\"# ./facs build [option] [option] [option] [option] <option>\");\nputs(\"#\");\nputs(\"# Options:\");\nputs(\"# -r reference file name or directory name\");\nputs(\"# -l a list containing multiple reference filenames\");\nputs(\"!!! either -r or -l can only be allowed each time !!!\");\nputs(\"# -k k_mer size (default size 21)\");\nputs(\"# -e error rate (default rate 0.0005)\");\nputs(\"# -h show help documents\");\nputs(\"# -o output file name (default file is saved as the same as binary file)\");\nputs(\"##########################################################################\");\nexit(1);\n}",
"original_code": "void\nbuild_help ()\n{\n printf (\"USAGE\\n\");\n printf\n (\"##########################################################################\\n\");\n printf (\"---Bloom build----\\n\");\n printf (\"# ./facs build [option] [option] [option] [option] <option>\\n\");\n printf (\"#\\n\");\n printf (\"# Options:\\n\");\n printf (\"# -r reference file name or directory name\\n\");\n printf (\"# -l a list containing multiple reference filenames\\n\");\n printf (\"!!! either -r or -l can only be allowed each time !!!\\n\");\n printf (\"# -k k_mer size (default size 21)\\n\");\n printf (\"# -e error rate (default rate 0.0005)\\n\");\n printf (\"# -h show help documents\\n\");\n printf\n (\"# -o output file name (default file is saved as the same as binary file)\\n\");\n printf\n (\"##########################################################################\\n\");\n exit (1);\n}",
"canonical_original_code": "void build_help()\n{\n printf (\"USAGE\\n\");\n printf\n (\"##########################################################################\\n\");\n printf (\"---Bloom build----\\n\");\n printf (\"# ./facs build [option] [option] [option] [option] <option>\\n\");\n printf (\"#\\n\");\n printf (\"# Options:\\n\");\n printf (\"# -r reference file name or directory name\\n\");\n printf (\"# -l a list containing multiple reference filenames\\n\");\n printf (\"!!! either -r or -l can only be allowed each time !!!\\n\");\n printf (\"# -k k_mer size (default size 21)\\n\");\n printf (\"# -e error rate (default rate 0.0005)\\n\");\n printf (\"# -h show help documents\\n\");\n printf\n (\"# -o output file name (default file is saved as the same as binary file)\\n\");\n printf\n (\"##########################################################################\\n\");\n exit (1);\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "check_help",
"canonical_name": "func17",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "void __noreturn check_help()\n{\nputs(\"USAGE\");\nputs(\"##########################################################################\");\nputs(\"---contamination check---\");\nputs(\"# ./facs check [option] [option] [option] [option] [option] <option>\");\nprintf(\"# Either query dataset is compressed or larger than 2GB, use:\");\nputs(\"# ./facs query [option] [option] [option] [option] [option] <option>\");\nputs(\"#\");\nputs(\"# Options:\");\nputs(\"# -t tolerant rate (The program will automatically select a value if you don't provide any.)\");\nputs(\"# -s sampling rate (default rate 1)\");\nputs(\"# -q query file name\");\nputs(\"# -l a list containing all bloom files\");\nputs(\"# -r single reference bloom filter file or directory\");\nputs(\"!!! either -r or -l can only be allowed each time !!!\");\nputs(\"# -h help documents\");\nputs(\"# -o output file name (default file is saved as the same path as the binary file)\");\nputs(\"##########################################################################\");\nexit(1);\n}\n",
"canonical_decompiled_code": "void __noreturn func17()\n{\nputs(\"USAGE\");\nputs(\"##########################################################################\");\nputs(\"---contamination check---\");\nputs(\"# ./facs check [option] [option] [option] [option] [option] <option>\");\nprintf(\"# Either query dataset is compressed or larger than 2GB, use:\");\nputs(\"# ./facs query [option] [option] [option] [option] [option] <option>\");\nputs(\"#\");\nputs(\"# Options:\");\nputs(\"# -t tolerant rate (The program will automatically select a value if you don't provide any.)\");\nputs(\"# -s sampling rate (default rate 1)\");\nputs(\"# -q query file name\");\nputs(\"# -l a list containing all bloom files\");\nputs(\"# -r single reference bloom filter file or directory\");\nputs(\"!!! either -r or -l can only be allowed each time !!!\");\nputs(\"# -h help documents\");\nputs(\"# -o output file name (default file is saved as the same path as the binary file)\");\nputs(\"##########################################################################\");\nexit(1);\n}",
"original_code": "void\ncheck_help ()\n{\n printf (\"USAGE\\n\");\n printf\n (\"##########################################################################\\n\");\n printf (\"---contamination check---\\n\");\n printf (\"# ./facs check [option] [option] [option] [option] [option] <option>\\n\");\n printf (\"# Either query dataset is compressed or larger than 2GB, use:\");\n printf (\"# ./facs query [option] [option] [option] [option] [option] <option>\\n\");\n printf (\"#\\n\");\n printf (\"# Options:\\n\");\n printf (\"# -t tolerant rate (The program will automatically select a value if you don't provide any.)\\n\");\n printf (\"# -s sampling rate (default rate 1)\\n\");\n printf (\"# -q query file name\\n\");\n printf (\"# -l a list containing all bloom files\\n\");\n printf (\"# -r single reference bloom filter file or directory\\n\");\n printf (\"!!! either -r or -l can only be allowed each time !!!\\n\");\n printf (\"# -h help documents\\n\");\n printf\n (\"# -o output file name (default file is saved as the same path as the binary file)\\n\");\n printf\n (\"##########################################################################\\n\");\n exit (1);\n}",
"canonical_original_code": "void check_help()\n{\n printf (\"USAGE\\n\");\n printf\n (\"##########################################################################\\n\");\n printf (\"---contamination check---\\n\");\n printf (\"# ./facs check [option] [option] [option] [option] [option] <option>\\n\");\n printf (\"# Either query dataset is compressed or larger than 2GB, use:\");\n printf (\"# ./facs query [option] [option] [option] [option] [option] <option>\\n\");\n printf (\"#\\n\");\n printf (\"# Options:\\n\");\n printf (\"# -t tolerant rate (The program will automatically select a value if you don't provide any.)\\n\");\n printf (\"# -s sampling rate (default rate 1)\\n\");\n printf (\"# -q query file name\\n\");\n printf (\"# -l a list containing all bloom files\\n\");\n printf (\"# -r single reference bloom filter file or directory\\n\");\n printf (\"!!! either -r or -l can only be allowed each time !!!\\n\");\n printf (\"# -h help documents\\n\");\n printf\n (\"# -o output file name (default file is saved as the same path as the binary file)\\n\");\n printf\n (\"##########################################################################\\n\");\n exit (1);\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "remove_help",
"canonical_name": "func18",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "void __noreturn remove_help()\n{\nputs(\"USAGE\");\nputs(\"##########################################################################\");\nputs(\"---contamination remove---\");\nputs(\"# ./facs remove [option] [option] [option] [option] <option>\");\nputs(\"#\");\nputs(\"# Options:\");\nputs(\"# -t tolerant rate (The program will automatically select a value if you don't provide any.)\");\nputs(\"# -q query file name\");\nputs(\"# -l a list containing all bloom files\");\nputs(\"# -r reference bloom filter file or dir\");\nputs(\"!!! either -r or -l can only be allowed each time !!!\");\nputs(\"# -h help documents\");\nputs(\"# -o output file name (default file is saved as the same path as the binary file)\");\nputs(\"##########################################################################\");\nexit(1);\n}\n",
"canonical_decompiled_code": "void __noreturn func18()\n{\nputs(\"USAGE\");\nputs(\"##########################################################################\");\nputs(\"---contamination remove---\");\nputs(\"# ./facs remove [option] [option] [option] [option] <option>\");\nputs(\"#\");\nputs(\"# Options:\");\nputs(\"# -t tolerant rate (The program will automatically select a value if you don't provide any.)\");\nputs(\"# -q query file name\");\nputs(\"# -l a list containing all bloom files\");\nputs(\"# -r reference bloom filter file or dir\");\nputs(\"!!! either -r or -l can only be allowed each time !!!\");\nputs(\"# -h help documents\");\nputs(\"# -o output file name (default file is saved as the same path as the binary file)\");\nputs(\"##########################################################################\");\nexit(1);\n}",
"original_code": "void\nremove_help ()\n{\n printf (\"USAGE\\n\");\n printf\n (\"##########################################################################\\n\");\n printf (\"---contamination remove---\\n\");\n printf (\"# ./facs remove [option] [option] [option] [option] <option>\\n\");\n printf (\"#\\n\");\n printf (\"# Options:\\n\");\n printf (\"# -t tolerant rate (The program will automatically select a value if you don't provide any.)\\n\");\n printf (\"# -q query file name\\n\");\n printf (\"# -l a list containing all bloom files\\n\");\n printf (\"# -r reference bloom filter file or dir\\n\");\n printf (\"!!! either -r or -l can only be allowed each time !!!\\n\");\n printf (\"# -h help documents\\n\");\n printf\n (\"# -o output file name (default file is saved as the same path as the binary file)\\n\");\n printf\n (\"##########################################################################\\n\");\n exit (1);\n}",
"canonical_original_code": "void remove_help()\n{\n printf (\"USAGE\\n\");\n printf\n (\"##########################################################################\\n\");\n printf (\"---contamination remove---\\n\");\n printf (\"# ./facs remove [option] [option] [option] [option] <option>\\n\");\n printf (\"#\\n\");\n printf (\"# Options:\\n\");\n printf (\"# -t tolerant rate (The program will automatically select a value if you don't provide any.)\\n\");\n printf (\"# -q query file name\\n\");\n printf (\"# -l a list containing all bloom files\\n\");\n printf (\"# -r reference bloom filter file or dir\\n\");\n printf (\"!!! either -r or -l can only be allowed each time !!!\\n\");\n printf (\"# -h help documents\\n\");\n printf\n (\"# -o output file name (default file is saved as the same path as the binary file)\\n\");\n printf\n (\"##########################################################################\\n\");\n exit (1);\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
},
{
"name": "remove_l_help",
"canonical_name": "func19",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "void __noreturn remove_l_help()\n{\nputs(\"USAGE\");\nputs(\"##########################################################################\");\nputs(\"---contamination remove list mode---\");\nputs(\"Similar with mode remove but with slight difference\");\nputs(\"Reads will be classified to the most like reference if\\nmultiple reference files exist\");\nputs(\"# ./facs classify [option] [option] [option] [option] <option>\");\nputs(\"#\");\nputs(\"# Options:\");\nputs(\"# -t tolerant rate\");\nputs(\"# -q query file name\");\nputs(\"# -l a list containing all bloom files\");\nputs(\"# -r reference bloom filter file or dir\");\nputs(\"!!! either -r or -l can only be allowed each time !!!\");\nputs(\"# -h help documents\");\nputs(\"# -o output file name (default file is saved as the same path as the binary file)\");\nputs(\"##########################################################################\");\nexit(1);\n}\n",
"canonical_decompiled_code": "void __noreturn func19()\n{\nputs(\"USAGE\");\nputs(\"##########################################################################\");\nputs(\"---contamination remove list mode---\");\nputs(\"Similar with mode remove but with slight difference\");\nputs(\"Reads will be classified to the most like reference if\\nmultiple reference files exist\");\nputs(\"# ./facs classify [option] [option] [option] [option] <option>\");\nputs(\"#\");\nputs(\"# Options:\");\nputs(\"# -t tolerant rate\");\nputs(\"# -q query file name\");\nputs(\"# -l a list containing all bloom files\");\nputs(\"# -r reference bloom filter file or dir\");\nputs(\"!!! either -r or -l can only be allowed each time !!!\");\nputs(\"# -h help documents\");\nputs(\"# -o output file name (default file is saved as the same path as the binary file)\");\nputs(\"##########################################################################\");\nexit(1);\n}",
"original_code": "void\nremove_l_help ()\n{\n printf (\"USAGE\\n\");\n printf (\"##########################################################################\\n\");\n printf (\"---contamination remove list mode---\\n\");\n printf (\"Similar with mode remove but with slight difference\\n\");\n printf (\"Reads will be classified to the most like reference if\\nmultiple reference files exist\\n\");\n printf (\"# ./facs classify [option] [option] [option] [option] <option>\\n\");\n printf (\"#\\n\");\n printf (\"# Options:\\n\");\n printf (\"# -t tolerant rate\\n\");\n printf (\"# -q query file name\\n\");\n printf (\"# -l a list containing all bloom files\\n\");\n printf (\"# -r reference bloom filter file or dir\\n\");\n printf (\"!!! either -r or -l can only be allowed each time !!!\\n\");\n printf (\"# -h help documents\\n\");\n printf (\"# -o output file name (default file is saved as the same path as the binary file)\\n\");\n printf (\"##########################################################################\\n\");\n exit (1);\n}",
"canonical_original_code": "void remove_l_help()\n{\n printf (\"USAGE\\n\");\n printf (\"##########################################################################\\n\");\n printf (\"---contamination remove list mode---\\n\");\n printf (\"Similar with mode remove but with slight difference\\n\");\n printf (\"Reads will be classified to the most like reference if\\nmultiple reference files exist\\n\");\n printf (\"# ./facs classify [option] [option] [option] [option] <option>\\n\");\n printf (\"#\\n\");\n printf (\"# Options:\\n\");\n printf (\"# -t tolerant rate\\n\");\n printf (\"# -q query file name\\n\");\n printf (\"# -l a list containing all bloom files\\n\");\n printf (\"# -r reference bloom filter file or dir\\n\");\n printf (\"!!! either -r or -l can only be allowed each time !!!\\n\");\n printf (\"# -h help documents\\n\");\n printf (\"# -o output file name (default file is saved as the same path as the binary file)\\n\");\n printf (\"##########################################################################\\n\");\n exit (1);\n}",
"variable_types": [],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "0e7d7b979b9890a6d851756a94f60c53c6420849e052fa8afd7f8ae0a36b5606"
}
] |
1ddefe144f8e857a88dc29936c80f16d9e57b44514f2c831a1cd2711d135c63c | tzcoolman/FACS-OLD | [
[
"remove_main",
"->",
"remove_reads"
],
[
"remove_reads",
"->",
"remove_main",
"save_result"
],
[
"fastq_process_m",
"->",
"remove_reads__omp_fn_1"
],
[
"fasta_process_m",
"->",
"remove_reads__omp_fn_1"
],
[
"save_result",
"->",
"remove_reads"
],
[
"remove_reads__omp_fn_0",
"->"
],
[
"remove_reads__omp_fn_1",
"->",
"fasta_process_m",
"fastq_process_m"
]
] | [
[
"remove_reads__omp_fn_0",
"__int64 __fastcall func5(__int64 *a1)\n{\n__int64 result; // rax\n__int64 v2[6]; // [rsp+10h] [rbp-50h] BYREF\n__int64 v3; // [rsp+40h] [rbp-20h]\n__int64 v4; // [rsp+48h] [rbp-18h]\n__int64 v5; // [rsp+50h] [rbp-10h]\n__int64 v6; // [rsp+58h] [rbp-8h]\n\nv6 = a1[3];\nv5 = a1[2];\nv4 = *a1;\nv3 = a1[4];\nresult = GOMP_single_start();\nif ( (_BYTE)result == 1 )\n{\nwhile ( a1[1] != v5 )\n{\nv2[3] = a1[1];\nv2[2] = v6;\nv2[1] = v5;\nv2[0] = v4;\nv2[4] = v3;\nGOMP_task(remove_reads__omp_fn_1, v2, 0LL, 40LL, 8LL, 1LL, 0LL, 0LL, 0LL);\n}\nresult = (__int64)a1;\na1[1] = *(_QWORD *)(a1[1] + 24);\n}\nreturn result;\n}"
],
[
"remove_reads__omp_fn_1",
"void __fastcall func6(__int64 a1)\n{\nfloat v1; // [rsp+18h] [rbp-28h]\n__int64 v2; // [rsp+20h] [rbp-20h]\n__int64 v3; // [rsp+28h] [rbp-18h]\n__int64 v4; // [rsp+30h] [rbp-10h]\n_QWORD *v5; // [rsp+38h] [rbp-8h]\n\nv5 = *(_QWORD **)(a1 + 24);\nv4 = *(_QWORD *)(a1 + 16);\nv3 = *(_QWORD *)(a1 + 8);\nv2 = *(_QWORD *)a1;\nv1 = *(float *)(a1 + 32);\nif ( *v5 )\n{\nif ( *(_DWORD *)(a1 + 36) == 1 )\nfunc3(v2, (__int64)v5, v3, v4, v1);\nelse\nfunc2(v2, (__int64)v5, v3, v4, v1);\n}\n}"
]
] | [
{
"name": "remove_main",
"canonical_name": "func0",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall remove_main(int a1, char *const *a2)\n{\nunsigned int v2; // xmm0_4\nint v4; // [rsp+14h] [rbp-2Ch]\nchar *v5; // [rsp+18h] [rbp-28h]\nchar *v6; // [rsp+20h] [rbp-20h]\nchar *v7; // [rsp+28h] [rbp-18h]\nchar *v8; // [rsp+30h] [rbp-10h]\nunsigned int v9; // [rsp+3Ch] [rbp-4h]\n\nif ( a1 <= 1 )\nremove_help();\nv9 = 0;\nv8 = 0LL;\nv7 = 0LL;\nv6 = 0LL;\nv5 = 0LL;\nwhile ( 1 )\n{\nv4 = getopt(a1, a2, \"t:r:o:q:l:h\");\nif ( v4 == -1 )\nreturn remove_reads(v5, v8, v7, v6, *(double *)_mm_cvtsi32_si128(v9).m128i_i64);\nswitch ( v4 )\n{\ncase '?':\ngoto LABEL_16;\ncase 'h':\nremove_help();\nLABEL_16:\nprintf(\"Unknown option: -%c\\n\", (unsigned int)(char)optopt);\nremove_help();\nbreak;\ncase 'l':\nif ( optarg )\nv7 = optarg;\nbreak;\ncase 'o':\nif ( optarg )\nv6 = optarg;\nbreak;\ncase 'q':\nif ( optarg )\nv5 = optarg;\nbreak;\ncase 'r':\nif ( optarg )\nv8 = optarg;\nbreak;\ncase 't':\nif ( optarg )\n{\n*(float *)&v2 = atof(optarg);\nv9 = v2;\n}\nbreak;\ndefault:\ncontinue;\n}\n}\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(int a1, char *const *a2)\n{\nunsigned int v2; // xmm0_4\nint v4; // [rsp+14h] [rbp-2Ch]\nchar *v5; // [rsp+18h] [rbp-28h]\nchar *v6; // [rsp+20h] [rbp-20h]\nchar *v7; // [rsp+28h] [rbp-18h]\nchar *v8; // [rsp+30h] [rbp-10h]\nunsigned int v9; // [rsp+3Ch] [rbp-4h]\n\nif ( a1 <= 1 )\nremove_help();\nv9 = 0;\nv8 = 0LL;\nv7 = 0LL;\nv6 = 0LL;\nv5 = 0LL;\nwhile ( 1 )\n{\nv4 = getopt(a1, a2, \"t:r:o:q:l:h\");\nif ( v4 == -1 )\nreturn func1(v5, v8, v7, v6, *(double *)_mm_cvtsi32_si128(v9).m128i_i64);\nswitch ( v4 )\n{\ncase '?':\ngoto LABEL_16;\ncase 'h':\nremove_help();\nLABEL_16:\nprintf(\"Unknown option: -%c\\n\", (unsigned int)(char)optopt);\nremove_help();\nbreak;\ncase 'l':\nif ( optarg )\nv7 = optarg;\nbreak;\ncase 'o':\nif ( optarg )\nv6 = optarg;\nbreak;\ncase 'q':\nif ( optarg )\nv5 = optarg;\nbreak;\ncase 'r':\nif ( optarg )\nv8 = optarg;\nbreak;\ncase 't':\nif ( optarg )\n{\n*(float *)&v2 = atof(optarg);\nv9 = v2;\n}\nbreak;\ndefault:\ncontinue;\n}\n}\n}",
"original_code": "int remove_main(int argc, char** argv)\n{\n if (argc < 2) remove_help();\n int opt;\n float tole_rate = 0;\n char* ref = ((void *)0);\n char* list = ((void *)0);\n char* target_path = ((void *)0);\n char* source = ((void *)0);\n while ((opt = getopt (argc, argv, \"t:r:o:q:l:h\")) != -1) {\n switch (opt) {\n case 't':\n (optarg) && ((tole_rate = atof(optarg)), 1);\n break;\n case 'o':\n (optarg) && ((target_path = optarg), 1);\n break;\n case 'q':\n (optarg) && (source = optarg, 1);\n break;\n case 'r':\n (optarg) && (ref = optarg, 1);\n break;\n case 'l':\n (optarg) && (list = optarg, 1);\n break;\n case 'h':\n remove_help();\n case '?':\n printf (\"Unknown option: -%c\\n\", (char) optopt);\n remove_help();\n }\n }\n return remove_reads(source, ref, list, target_path, tole_rate);\n}",
"canonical_original_code": "int remove_main(int argc, char **argv)\n{\n if (argc < 2) remove_help();\n int opt;\n float tole_rate = 0;\n char *ref = ((void *)0);\n char *list = ((void *)0);\n char *target_path = ((void *)0);\n char *source = ((void *)0);\n while ((opt = getopt (argc, argv, \"t:r:o:q:l:h\")) != -1) {\n switch (opt) {\n case 't':\n (optarg) && ((tole_rate = atof(optarg)), 1);\n break;\n case 'o':\n (optarg) && ((target_path = optarg), 1);\n break;\n case 'q':\n (optarg) && (source = optarg, 1);\n break;\n case 'r':\n (optarg) && (ref = optarg, 1);\n break;\n case 'l':\n (optarg) && (list = optarg, 1);\n break;\n case 'h':\n remove_help();\n case '?':\n printf (\"Unknown option: -%c\\n\", (char) optopt);\n remove_help();\n }\n }\n return remove_reads(source, ref, list, target_path, tole_rate);\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char **"
],
[
"opt",
"int"
],
[
"tole_rate",
"float"
],
[
"ref",
"char *"
],
[
"list",
"char *"
],
[
"target_path",
"char *"
],
[
"source",
"char *"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "1ddefe144f8e857a88dc29936c80f16d9e57b44514f2c831a1cd2711d135c63c"
},
{
"name": "remove_reads",
"canonical_name": "func1",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall remove_reads(__int64 a1, __int64 a2, __int64 a3, int a4, float a5)\n{\nsize_t v5; // rax\nsize_t v6; // rax\nsize_t v7; // rax\nsize_t v8; // rax\n__m128i v9; // xmm0\nsize_t v10; // rax\nvoid *v15; // [rsp+60h] [rbp-70h] BYREF\n_QWORD *v16; // [rsp+68h] [rbp-68h]\nvoid *v17; // [rsp+70h] [rbp-60h]\n_QWORD *v18; // [rsp+78h] [rbp-58h]\nfloat v19; // [rsp+80h] [rbp-50h]\nint v20; // [rsp+84h] [rbp-4Ch]\nchar *v21; // [rsp+88h] [rbp-48h]\nvoid *v22; // [rsp+90h] [rbp-40h]\nchar *s; // [rsp+98h] [rbp-38h]\n_QWORD *v24; // [rsp+A0h] [rbp-30h]\nvoid *v25; // [rsp+A8h] [rbp-28h]\nunsigned int *v26; // [rsp+B0h] [rbp-20h]\nint v27; // [rsp+BCh] [rbp-14h]\n_QWORD *v28; // [rsp+C0h] [rbp-10h]\n_QWORD *v29; // [rsp+C8h] [rbp-8h]\n\nv26 = (unsigned int *)malloc(0x48uLL);\nv29 = malloc(0x20uLL);\nv25 = malloc(0x20uLL);\nv29[3] = v25;\nv24 = v29;\nmalloc(0x38uLL);\nv28 = (_QWORD *)make_list(a2, a3);\ns = (char *)mmaping(a1);\nv27 = get_parainfo(s, v29);\nv5 = strlen(s);\nclean = malloc(v5);\nv6 = strlen(s);\ncontam = malloc(v6);\nv22 = clean;\nv21 = (char *)contam;\nwhile ( v28 )\n{\nv7 = strlen(s);\nmemset(v22, 0, v7);\nv8 = strlen(s);\nmemset(v21, 0, v8);\nload_bloom(*v28, v26);\nv9 = 0LL;\nif ( a5 == 0.0 )\n{\n*(double *)v9.m128i_i64 = mco_suggestion(v26[14]);\na5 = COERCE_FLOAT(_mm_cvtsi128_si32(v9));\n}\nv18 = v28;\nv17 = v25;\nv15 = v26;\nv20 = v27;\nv19 = a5;\nv16 = v29;\nGOMP_parallel(remove_reads__omp_fn_0, &v15, 0LL, 0LL);\nv29 = v16;\nsave_result(a1, *v28, v27, a4, (int)clean, (int)v22, (__int64)contam, v21);\nv28 = (_QWORD *)v28[6];\nv29 = v24;\nbloom_destroy(v26);\n}\nv10 = strlen(s);\nmunmap(s, v10);\nputs(\"finish processing...\");\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1, __int64 a2, __int64 a3, int a4, float a5)\n{\nsize_t v5; // rax\nsize_t v6; // rax\nsize_t v7; // rax\nsize_t v8; // rax\n__m128i v9; // xmm0\nsize_t v10; // rax\nvoid *v15; // [rsp+60h] [rbp-70h] BYREF\n_QWORD *v16; // [rsp+68h] [rbp-68h]\nvoid *v17; // [rsp+70h] [rbp-60h]\n_QWORD *v18; // [rsp+78h] [rbp-58h]\nfloat v19; // [rsp+80h] [rbp-50h]\nint v20; // [rsp+84h] [rbp-4Ch]\nchar *v21; // [rsp+88h] [rbp-48h]\nvoid *v22; // [rsp+90h] [rbp-40h]\nchar *s; // [rsp+98h] [rbp-38h]\n_QWORD *v24; // [rsp+A0h] [rbp-30h]\nvoid *v25; // [rsp+A8h] [rbp-28h]\nunsigned int *v26; // [rsp+B0h] [rbp-20h]\nint v27; // [rsp+BCh] [rbp-14h]\n_QWORD *v28; // [rsp+C0h] [rbp-10h]\n_QWORD *v29; // [rsp+C8h] [rbp-8h]\n\nv26 = (unsigned int *)malloc(0x48uLL);\nv29 = malloc(0x20uLL);\nv25 = malloc(0x20uLL);\nv29[3] = v25;\nv24 = v29;\nmalloc(0x38uLL);\nv28 = (_QWORD *)make_list(a2, a3);\ns = (char *)mmaping(a1);\nv27 = get_parainfo(s, v29);\nv5 = strlen(s);\nclean = malloc(v5);\nv6 = strlen(s);\ncontam = malloc(v6);\nv22 = clean;\nv21 = (char *)contam;\nwhile ( v28 )\n{\nv7 = strlen(s);\nmemset(v22, 0, v7);\nv8 = strlen(s);\nmemset(v21, 0, v8);\nload_bloom(*v28, v26);\nv9 = 0LL;\nif ( a5 == 0.0 )\n{\n*(double *)v9.m128i_i64 = mco_suggestion(v26[14]);\na5 = COERCE_FLOAT(_mm_cvtsi128_si32(v9));\n}\nv18 = v28;\nv17 = v25;\nv15 = v26;\nv20 = v27;\nv19 = a5;\nv16 = v29;\nGOMP_parallel(remove_reads__omp_fn_0, &v15, 0LL, 0LL);\nv29 = v16;\nfunc4(a1, *v28, v27, a4, (int)clean, (int)v22, (__int64)contam, v21);\nv28 = (_QWORD *)v28[6];\nv29 = v24;\nbloom_destroy(v26);\n}\nv10 = strlen(s);\nmunmap(s, v10);\nputs(\"finish processing...\");\nreturn 0LL;\n}",
"original_code": "int remove_reads(char *source, char *ref, char *list, char *prefix, float tole_rate)\n{\n int type = 1;\n char *position;\n char *clean2;\n char *contam2;\n bloom *bl_2 = (bloom *) malloc(sizeof(bloom));\n Queue *head = (Queue *) malloc(sizeof(Queue));\n Queue *tail = (Queue *) malloc(sizeof(Queue));\n head->next = tail;\n Queue *head2 = head;\n F_set *File_head = (F_set *) malloc(sizeof(F_set));\n File_head = make_list (ref, list);\n position = mmaping (source);\n type = get_parainfo (position, head);\n clean = (char *) malloc (strlen (position) * sizeof (char));\n contam = (char *) malloc (strlen (position) * sizeof (char));\n clean2 = clean;\n contam2 = contam;\n while (File_head)\n {\n memset (clean2, 0, strlen (position));\n memset (contam2, 0, strlen (position));\n load_bloom (File_head->filename, bl_2);\n if (tole_rate==0)\n tole_rate = mco_suggestion (bl_2->k_mer);\n \n#pragma omp parallel\n {\n \n#pragma omp single nowait\n {\n while (head != tail)\n {\n \n#pragma omp task firstprivate(head)\n {\n if (head->location!=((void *)0)) {\n if (type == 1)\n fasta_process_m (bl_2, head, tail, tole_rate, File_head);\n else\n fastq_process_m (bl_2, head, tail, tole_rate, File_head);\n }\n }\n }\n head = head->next;\n }\n }\n save_result (source, File_head->filename, type, prefix, clean, clean2,\n contam, contam2);\n File_head = File_head->next;\n head = head2;\n bloom_destroy (bl_2);\n }\n munmap (position, strlen (position));\n printf (\"finish processing...\\n\");\n return 0;\n}",
"canonical_original_code": "int remove_reads(char *source, char *ref, char *list, char *prefix, float tole_rate)\n{\n int type = 1;\n char *position;\n char *clean2;\n char *contam2;\n struct bloom *bl_2 = (bloom *) malloc(sizeof(bloom));\n struct info *head = (Queue *) malloc(sizeof(Queue));\n struct info *tail = (Queue *) malloc(sizeof(Queue));\n head->next = tail;\n struct info *head2 = head;\n struct file_list *File_head = (F_set *) malloc(sizeof(F_set));\n File_head = make_list (ref, list);\n position = mmaping (source);\n type = get_parainfo (position, head);\n clean = (char *) malloc (strlen (position) * sizeof (char));\n contam = (char *) malloc (strlen (position) * sizeof (char));\n clean2 = clean;\n contam2 = contam;\n while (File_head)\n {\n memset (clean2, 0, strlen (position));\n memset (contam2, 0, strlen (position));\n load_bloom (File_head->filename, bl_2);\n if (tole_rate==0)\n tole_rate = mco_suggestion (bl_2->k_mer);\n \n#pragma omp parallel\n {\n \n#pragma omp single nowait\n {\n while (head != tail)\n {\n \n#pragma omp task firstprivate(head)\n {\n if (head->location!=((void *)0)) {\n if (type == 1)\n fasta_process_m (bl_2, head, tail, tole_rate, File_head);\n else\n fastq_process_m (bl_2, head, tail, tole_rate, File_head);\n }\n }\n }\n head = head->next;\n }\n }\n save_result (source, File_head->filename, type, prefix, clean, clean2,\n contam, contam2);\n File_head = File_head->next;\n head = head2;\n bloom_destroy (bl_2);\n }\n munmap (position, strlen (position));\n printf (\"finish processing...\\n\");\n return 0;\n}",
"variable_types": [
[
"source",
"char *"
],
[
"ref",
"char *"
],
[
"list",
"char *"
],
[
"prefix",
"char *"
],
[
"tole_rate",
"float"
],
[
"type",
"int"
],
[
"position",
"char *"
],
[
"clean2",
"char *"
],
[
"contam2",
"char *"
],
[
"bl_2",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"head",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"tail",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"head2",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"File_head",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct info { char *location; short *score; short *number; struct info *next; }",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "1ddefe144f8e857a88dc29936c80f16d9e57b44514f2c831a1cd2711d135c63c"
},
{
"name": "fastq_process_m",
"canonical_name": "func2",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "void __fastcall fastq_process_m(__int64 a1, __int64 a2, __int64 a3, __int64 a4, float a5)\n{\nunsigned int v5; // eax\nint v7; // [rsp+3Ch] [rbp-34h]\nchar *src; // [rsp+40h] [rbp-30h]\nchar *v9; // [rsp+50h] [rbp-20h]\nchar *v10; // [rsp+58h] [rbp-18h]\nchar *s; // [rsp+60h] [rbp-10h]\nchar *sa; // [rsp+60h] [rbp-10h]\nint v13; // [rsp+68h] [rbp-8h]\nint v14; // [rsp+6Ch] [rbp-4h]\n\nv14 = 0;\nv13 = 0;\ns = *(char **)a2;\nif ( *(_QWORD *)(a2 + 24) )\n{\nif ( a3 == *(_QWORD *)(a2 + 24) )\nv10 = &s[strlen(s)];\nelse\nv10 = **(char ***)(a2 + 24);\nwhile ( 1 )\n{\nif ( s == v10 )\nreturn;\n++v14;\nsrc = s;\nif ( !s )\nreturn;\nsa = strchr(s, 10) + 1;\nv9 = strstr(sa, \"\\n@\");\nif ( !v9 )\nv9 = &sa[strlen(sa)];\nv5 = (unsigned int)strchr(sa, 10);\nv7 = fastq_read_check(\nsa,\nv5 - (unsigned int)sa,\n110LL,\na1,\na4,\n*(double *)_mm_cvtsi32_si128(LODWORD(a5)).m128i_i64);\nif ( v7 )\n{\nif ( v7 <= 0 )\ngoto LABEL_16;\nGOMP_critical_start();\n++v13;\nmemcpy(contam, src, v9 - src);\ncontam = (char *)contam + v9 - src;\nif ( *v9 )\n{\n*(_BYTE *)contam = 10;\ncontam = (char *)contam + 1;\n}\n}\nelse\n{\nGOMP_critical_start();\nmemcpy(clean, src, v9 - src);\nclean = (char *)clean + v9 - src;\nif ( *v9 )\n{\n*(_BYTE *)clean = 10;\nclean = (char *)clean + 1;\n}\n}\nGOMP_critical_end();\nLABEL_16:\nif ( !*v9 )\nreturn;\ns = v9 + 1;\n}\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func2(__int64 a1, __int64 a2, __int64 a3, __int64 a4, float a5)\n{\nunsigned int v5; // eax\nint v7; // [rsp+3Ch] [rbp-34h]\nchar *src; // [rsp+40h] [rbp-30h]\nchar *v9; // [rsp+50h] [rbp-20h]\nchar *v10; // [rsp+58h] [rbp-18h]\nchar *s; // [rsp+60h] [rbp-10h]\nchar *sa; // [rsp+60h] [rbp-10h]\nint v13; // [rsp+68h] [rbp-8h]\nint v14; // [rsp+6Ch] [rbp-4h]\n\nv14 = 0;\nv13 = 0;\ns = *(char **)a2;\nif ( *(_QWORD *)(a2 + 24) )\n{\nif ( a3 == *(_QWORD *)(a2 + 24) )\nv10 = &s[strlen(s)];\nelse\nv10 = **(char ***)(a2 + 24);\nwhile ( 1 )\n{\nif ( s == v10 )\nreturn;\n++v14;\nsrc = s;\nif ( !s )\nreturn;\nsa = strchr(s, 10) + 1;\nv9 = strstr(sa, \"\\n@\");\nif ( !v9 )\nv9 = &sa[strlen(sa)];\nv5 = (unsigned int)strchr(sa, 10);\nv7 = fastq_read_check(\nsa,\nv5 - (unsigned int)sa,\n110LL,\na1,\na4,\n*(double *)_mm_cvtsi32_si128(LODWORD(a5)).m128i_i64);\nif ( v7 )\n{\nif ( v7 <= 0 )\ngoto LABEL_16;\nGOMP_critical_start();\n++v13;\nmemcpy(contam, src, v9 - src);\ncontam = (char *)contam + v9 - src;\nif ( *v9 )\n{\n*(_BYTE *)contam = 10;\ncontam = (char *)contam + 1;\n}\n}\nelse\n{\nGOMP_critical_start();\nmemcpy(clean, src, v9 - src);\nclean = (char *)clean + v9 - src;\nif ( *v9 )\n{\n*(_BYTE *)clean = 10;\nclean = (char *)clean + 1;\n}\n}\nGOMP_critical_end();\nLABEL_16:\nif ( !*v9 )\nreturn;\ns = v9 + 1;\n}\n}\n}",
"original_code": "void\nfastq_process_m (bloom * bl, Queue * info, Queue * tail, float tole_rate, F_set *File_head)\n{\n int read_num = 0, read_contam = 0;\n char *p = info->location;\n char *next, *temp_start, *temp_end, *temp_piece = ((void *)0);\n if (info->next == ((void *)0))\n return;\n else if (info->next != tail)\n next = info->next->location;\n else\n next = strchr (p, '\\0');\n while (p != next)\n {\n read_num++;\n temp_start = p;\n if (p == '\\0' || p == ((void *)0))\n break;\n p = strchr (p, '\\n') + 1;\n temp_end = strstr (p, \"\\n@\");\n if (!temp_end)\n temp_end = strchr (p, '\\0');\n int result =\n fastq_read_check (p, strchr (p, '\\n') - p, 'n', bl, tole_rate, File_head);\n if (result == 0)\n {\n \n#pragma omp critical\n {\n memcpy (clean, temp_start, temp_end - temp_start);\n clean += (temp_end - temp_start);\n if (*temp_end != '\\0')\n {\n clean[0] = '\\n';\n clean++;\n }\n }\n }\n else if (result > 0)\n {\n \n#pragma omp critical\n {\n read_contam++;\n memcpy (contam, temp_start, temp_end - temp_start);\n contam += (temp_end - temp_start);\n if (*temp_end != '\\0')\n {\n contam[0] = '\\n';\n contam++;\n }\n }\n }\n if (*temp_end == '\\0')\n break;\n p = temp_end + 1;\n }\n if (temp_piece)\n free (temp_piece);\n}",
"canonical_original_code": "void fastq_process_m(struct bloom *bl, struct info *info, struct info *tail, float tole_rate, struct file_list *File_head)\n{\n int read_num = 0; int read_contam = 0;\n char *p = info->location;\n char *next; char *temp_start; char *temp_end; char *temp_piece = ((void *)0);\n if (info->next == ((void *)0))\n return;\n else if (info->next != tail)\n next = info->next->location;\n else\n next = strchr (p, '\\0');\n while (p != next)\n {\n read_num++;\n temp_start = p;\n if (p == '\\0' || p == ((void *)0))\n break;\n p = strchr (p, '\\n') + 1;\n temp_end = strstr (p, \"\\n@\");\n if (!temp_end)\n temp_end = strchr (p, '\\0');\n int result = fastq_read_check (p, strchr (p, '\\n') - p, 'n', bl, tole_rate, File_head);\n if (result == 0)\n {\n \n#pragma omp critical\n {\n memcpy (clean, temp_start, temp_end - temp_start);\n clean += (temp_end - temp_start);\n if (*temp_end != '\\0')\n {\n clean[0] = '\\n';\n clean++;\n }\n }\n }\n else if (result > 0)\n {\n \n#pragma omp critical\n {\n read_contam++;\n memcpy (contam, temp_start, temp_end - temp_start);\n contam += (temp_end - temp_start);\n if (*temp_end != '\\0')\n {\n contam[0] = '\\n';\n contam++;\n }\n }\n }\n if (*temp_end == '\\0')\n break;\n p = temp_end + 1;\n }\n if (temp_piece)\n free (temp_piece);\n}",
"variable_types": [
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"info",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"tail",
"struct info *"
],
[
"tole_rate",
"float"
],
[
"File_head",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; } *"
],
[
"read_num",
"int"
],
[
"read_contam",
"int"
],
[
"p",
"char *"
],
[
"next",
"char *"
],
[
"temp_start",
"char *"
],
[
"temp_end",
"char *"
],
[
"temp_piece",
"char *"
],
[
"result",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct info { char *location; short *score; short *number; struct info *next; }",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "1ddefe144f8e857a88dc29936c80f16d9e57b44514f2c831a1cd2711d135c63c"
},
{
"name": "fasta_process_m",
"canonical_name": "func3",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "int __fastcall fasta_process_m(__int64 a1, __int64 a2, __int64 a3, __int64 a4, float a5)\n{\n__int64 v5; // rax\nint v9; // [rsp+3Ch] [rbp-24h]\nchar *v10; // [rsp+40h] [rbp-20h]\nchar *v11; // [rsp+48h] [rbp-18h]\nchar *s; // [rsp+50h] [rbp-10h]\nunsigned int v13; // [rsp+58h] [rbp-8h]\nunsigned int v14; // [rsp+5Ch] [rbp-4h]\n\nputs(\"fasta processing...\");\nv14 = 0;\nv13 = 0;\ns = *(char **)a2;\nv5 = *(_QWORD *)(a2 + 24);\nif ( v5 )\n{\nif ( a3 == *(_QWORD *)(a2 + 24) )\nv11 = &s[strlen(s)];\nelse\nv11 = **(char ***)(a2 + 24);\nwhile ( s != v11 )\n{\n++v14;\nv10 = strchr(s + 1, 62);\nif ( !v10 )\nv10 = v11;\nv9 = fasta_read_check(s, v10, 110LL, a1, a4, *(double *)_mm_cvtsi32_si128(LODWORD(a5)).m128i_i64);\nif ( v9 )\n{\nif ( v9 > 0 )\n{\nGOMP_critical_start();\n++v13;\nmemcpy(contam, s, v10 - s);\ncontam = (char *)contam + v10 - s;\nGOMP_critical_end();\n}\n}\nelse\n{\nGOMP_critical_start();\nmemcpy(clean, s, v10 - s);\nclean = (char *)clean + v10 - s;\nGOMP_critical_end();\n}\ns = v10;\n}\nLODWORD(v5) = printf(\"all->%d\\ncontam->%d\\n\", v14, v13);\n}\nreturn v5;\n}\n",
"canonical_decompiled_code": "int __fastcall func3(__int64 a1, __int64 a2, __int64 a3, __int64 a4, float a5)\n{\n__int64 v5; // rax\nint v9; // [rsp+3Ch] [rbp-24h]\nchar *v10; // [rsp+40h] [rbp-20h]\nchar *v11; // [rsp+48h] [rbp-18h]\nchar *s; // [rsp+50h] [rbp-10h]\nunsigned int v13; // [rsp+58h] [rbp-8h]\nunsigned int v14; // [rsp+5Ch] [rbp-4h]\n\nputs(\"fasta processing...\");\nv14 = 0;\nv13 = 0;\ns = *(char **)a2;\nv5 = *(_QWORD *)(a2 + 24);\nif ( v5 )\n{\nif ( a3 == *(_QWORD *)(a2 + 24) )\nv11 = &s[strlen(s)];\nelse\nv11 = **(char ***)(a2 + 24);\nwhile ( s != v11 )\n{\n++v14;\nv10 = strchr(s + 1, 62);\nif ( !v10 )\nv10 = v11;\nv9 = fasta_read_check(s, v10, 110LL, a1, a4, *(double *)_mm_cvtsi32_si128(LODWORD(a5)).m128i_i64);\nif ( v9 )\n{\nif ( v9 > 0 )\n{\nGOMP_critical_start();\n++v13;\nmemcpy(contam, s, v10 - s);\ncontam = (char *)contam + v10 - s;\nGOMP_critical_end();\n}\n}\nelse\n{\nGOMP_critical_start();\nmemcpy(clean, s, v10 - s);\nclean = (char *)clean + v10 - s;\nGOMP_critical_end();\n}\ns = v10;\n}\nLODWORD(v5) = printf(\"all->%d\\ncontam->%d\\n\", v14, v13);\n}\nreturn v5;\n}",
"original_code": "void\nfasta_process_m (bloom * bl, Queue * info, Queue * tail, float tole_rate, F_set *File_head)\n{\n printf (\"fasta processing...\\n\");\n int read_num = 0, read_contam = 0;\n char *p = info->location;\n char *next;\n char *temp = p;\n if (info->next == ((void *)0))\n return;\n else if (info->next != tail)\n next = info->next->location;\n else\n next = strchr (p, '\\0');\n while (p != next)\n {\n read_num++;\n temp = strchr (p + 1, '>');\n if (!temp)\n temp = next;\n int result = fasta_read_check (p, temp, 'n', bl, tole_rate, File_head);\n if (result == 0)\n {\n \n#pragma omp critical\n {\n memcpy (clean, p, temp - p);\n clean += (temp - p);\n }\n }\n else if (result > 0)\n {\n \n#pragma omp critical\n {\n read_contam++;\n memcpy (contam, p, temp - p);\n contam += (temp - p);\n }\n }\n p = temp;\n }\n printf (\"all->%d\\ncontam->%d\\n\", read_num, read_contam);\n}",
"canonical_original_code": "void fasta_process_m(struct bloom *bl, struct info *info, struct info *tail, float tole_rate, struct file_list *File_head)\n{\n printf (\"fasta processing...\\n\");\n int read_num = 0; int read_contam = 0;\n char *p = info->location;\n char *next;\n char *temp = p;\n if (info->next == ((void *)0))\n return;\n else if (info->next != tail)\n next = info->next->location;\n else\n next = strchr (p, '\\0');\n while (p != next)\n {\n read_num++;\n temp = strchr (p + 1, '>');\n if (!temp)\n temp = next;\n int result = fasta_read_check (p, temp, 'n', bl, tole_rate, File_head);\n if (result == 0)\n {\n \n#pragma omp critical\n {\n memcpy (clean, p, temp - p);\n clean += (temp - p);\n }\n }\n else if (result > 0)\n {\n \n#pragma omp critical\n {\n read_contam++;\n memcpy (contam, p, temp - p);\n contam += (temp - p);\n }\n }\n p = temp;\n }\n printf (\"all->%d\\ncontam->%d\\n\", read_num, read_contam);\n}",
"variable_types": [
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"info",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"tail",
"struct info *"
],
[
"tole_rate",
"float"
],
[
"File_head",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; } *"
],
[
"read_num",
"int"
],
[
"read_contam",
"int"
],
[
"p",
"char *"
],
[
"next",
"char *"
],
[
"temp",
"char *"
],
[
"result",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct info { char *location; short *score; short *number; struct info *next; }",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "1ddefe144f8e857a88dc29936c80f16d9e57b44514f2c831a1cd2711d135c63c"
},
{
"name": "save_result",
"canonical_name": "func4",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "char *__fastcall save_result(const char *a1, const char *a2, int a3, const char *a4, int a5, char *a6, __int64 a7, char *a8)\n{\nchar *v8; // rax\nchar *v9; // rax\nsize_t v10; // rax\nsize_t v11; // rax\nchar *v16; // [rsp+30h] [rbp-30h]\nchar *dest; // [rsp+38h] [rbp-28h]\nchar *v18; // [rsp+40h] [rbp-20h]\nchar *s; // [rsp+48h] [rbp-18h]\nchar *v20; // [rsp+50h] [rbp-10h]\nchar *v21; // [rsp+50h] [rbp-10h]\nchar *src; // [rsp+58h] [rbp-8h]\nchar *srca; // [rsp+58h] [rbp-8h]\n\nprintf(\"source->%s\\n\", a1);\nprintf(\"obj_file->%s\\n\", a2);\nprintf(\"prefix->%s\\n\", a4);\ns = (char *)malloc(0x190uLL);\nv18 = (char *)malloc(0x190uLL);\ndest = (char *)malloc(0xC8uLL);\nv16 = (char *)malloc(0xC8uLL);\nmemset(s, 0, 0x190uLL);\nmemset(v18, 0, 0x190uLL);\nmemset(dest, 0, 0xC8uLL);\nmemset(v16, 0, 0xC8uLL);\nsrc = strrchr(a1, 47);\nv20 = strrchr(a2, 47);\nif ( src )\nsrca = src + 1;\nelse\nsrca = 0LL;\nif ( v20 )\nv21 = v20 + 1;\nelse\nv21 = 0LL;\nv8 = strrchr(a1, 46);\nif ( srca )\nstrncat(dest, srca, v8 - srca);\nelse\nstrncat(dest, a1, v8 - a1);\nv9 = strrchr(a2, 46);\nif ( v21 )\nstrncat(v16, v21, v9 - v21);\nelse\nstrncat(v16, a2, v9 - a2);\nif ( a4 )\n{\nstrcat(s, a4);\nstrcat(v18, a4);\n}\nelse if ( srca )\n{\nstrncat(s, a1, srca - a1);\nstrncat(v18, a1, srca - a1);\n}\nstrcat(s, dest);\nstrcat(v18, dest);\n*(_WORD *)&s[strlen(s)] = 95;\n*(_WORD *)&v18[strlen(v18)] = 95;\nstrcat(s, v16);\nstrcat(v18, v16);\n*(_QWORD *)&s[strlen(s)] = 0x6D61746E6F635FLL;\nstrcat(v18, \"_clean\");\nif ( a3 == 1 )\n{\nstrcat(s, \".fasta\");\nstrcat(v18, \".fasta\");\n}\nelse\n{\nstrcat(s, \".fastq\");\nstrcat(v18, \".fastq\");\n}\nprintf(\"match->%s\\n\", s);\nprintf(\"mis->%s\\n\", v18);\nwrite_result(s, a8);\nwrite_result(v18, a6);\nfree(s);\nfree(v18);\nfree(dest);\nfree(v16);\nv10 = strlen(a8);\nmemset(a8, 0, v10);\nv11 = strlen(a6);\nmemset(a6, 0, v11);\nreturn a8;\n}\n",
"canonical_decompiled_code": "char *__fastcall func4(const char *a1, const char *a2, int a3, const char *a4, int a5, char *a6, __int64 a7, char *a8)\n{\nchar *v8; // rax\nchar *v9; // rax\nsize_t v10; // rax\nsize_t v11; // rax\nchar *v16; // [rsp+30h] [rbp-30h]\nchar *dest; // [rsp+38h] [rbp-28h]\nchar *v18; // [rsp+40h] [rbp-20h]\nchar *s; // [rsp+48h] [rbp-18h]\nchar *v20; // [rsp+50h] [rbp-10h]\nchar *v21; // [rsp+50h] [rbp-10h]\nchar *src; // [rsp+58h] [rbp-8h]\nchar *srca; // [rsp+58h] [rbp-8h]\n\nprintf(\"source->%s\\n\", a1);\nprintf(\"obj_file->%s\\n\", a2);\nprintf(\"prefix->%s\\n\", a4);\ns = (char *)malloc(0x190uLL);\nv18 = (char *)malloc(0x190uLL);\ndest = (char *)malloc(0xC8uLL);\nv16 = (char *)malloc(0xC8uLL);\nmemset(s, 0, 0x190uLL);\nmemset(v18, 0, 0x190uLL);\nmemset(dest, 0, 0xC8uLL);\nmemset(v16, 0, 0xC8uLL);\nsrc = strrchr(a1, 47);\nv20 = strrchr(a2, 47);\nif ( src )\nsrca = src + 1;\nelse\nsrca = 0LL;\nif ( v20 )\nv21 = v20 + 1;\nelse\nv21 = 0LL;\nv8 = strrchr(a1, 46);\nif ( srca )\nstrncat(dest, srca, v8 - srca);\nelse\nstrncat(dest, a1, v8 - a1);\nv9 = strrchr(a2, 46);\nif ( v21 )\nstrncat(v16, v21, v9 - v21);\nelse\nstrncat(v16, a2, v9 - a2);\nif ( a4 )\n{\nstrcat(s, a4);\nstrcat(v18, a4);\n}\nelse if ( srca )\n{\nstrncat(s, a1, srca - a1);\nstrncat(v18, a1, srca - a1);\n}\nstrcat(s, dest);\nstrcat(v18, dest);\n*(_WORD *)&s[strlen(s)] = 95;\n*(_WORD *)&v18[strlen(v18)] = 95;\nstrcat(s, v16);\nstrcat(v18, v16);\n*(_QWORD *)&s[strlen(s)] = 0x6D61746E6F635FLL;\nstrcat(v18, \"_clean\");\nif ( a3 == 1 )\n{\nstrcat(s, \".fasta\");\nstrcat(v18, \".fasta\");\n}\nelse\n{\nstrcat(s, \".fastq\");\nstrcat(v18, \".fastq\");\n}\nprintf(\"match->%s\\n\", s);\nprintf(\"mis->%s\\n\", v18);\nwrite_result(s, a8);\nwrite_result(v18, a6);\nfree(s);\nfree(v18);\nfree(dest);\nfree(v16);\nv10 = strlen(a8);\nmemset(a8, 0, v10);\nv11 = strlen(a6);\nmemset(a6, 0, v11);\nreturn a8;\n}",
"original_code": "void\nsave_result (char *source, char *obj_file, int type, char *prefix,\n char *clean, char *clean2, char *contam, char *contam2)\n{\n printf (\"source->%s\\n\",source);\n printf (\"obj_file->%s\\n\",obj_file);\n printf (\"prefix->%s\\n\",prefix);\n char *so = ((void *)0), *obj = ((void *)0);\n char *match = (char *) malloc (400 * sizeof (char)),\n *mismatch = (char *) malloc (400 * sizeof (char)),\n *so_name = (char *) malloc (200 * sizeof (char)),\n *obj_name = (char *) malloc (200 * sizeof (char));\n memset (match, 0, 400);\n memset (mismatch, 0, 400);\n memset (so_name, 0, 200);\n memset (obj_name, 0, 200);\n so = strrchr (source, '/');\n obj = strrchr (obj_file,'/');\n if (so)\n so += 1;\n else\n so = ((void *)0);\n if (obj)\n obj += 1;\n else\n obj = ((void *)0);\n if (so)\n strncat (so_name, so, strrchr (source, '.') - so);\n else\n strncat (so_name, source, strrchr (source, '.') - source);\n if (obj)\n strncat (obj_name, obj, strrchr (obj_file, '.') - obj);\n else\n strncat (obj_name, obj_file, strrchr (obj_file, '.') - obj_file);\n if (prefix)\n {\n strcat (match, prefix);\n strcat (mismatch, prefix);\n }\n else if (so)\n {\n strncat (match, source, so - source);\n strncat (mismatch, source, so - source);\n }\n strcat (match, so_name);\n strcat (mismatch, so_name);\n strcat (match, \"_\");\n strcat (mismatch, \"_\");\n strcat (match, obj_name);\n strcat (mismatch, obj_name);\n strcat (match, \"_contam\");\n strcat (mismatch, \"_clean\");\n if (type == 1)\n {\n strcat (match, \".fasta\");\n strcat (mismatch, \".fasta\");\n }\n else\n {\n strcat (match, \".fastq\");\n strcat (mismatch, \".fastq\");\n }\n printf (\"match->%s\\n\", match);\n printf (\"mis->%s\\n\", mismatch);\n write_result (match, contam2);\n write_result (mismatch, clean2);\n free (match);\n free (mismatch);\n free (so_name);\n free (obj_name);\n memset (contam2, 0, strlen (contam2));\n memset (clean2, 0, strlen (clean2));\n clean = clean2;\n contam = contam2;\n}",
"canonical_original_code": "void save_result(char *source, char *obj_file, int type, char *prefix, char *clean, char *clean2, char *contam, char *contam2)\n{\n printf (\"source->%s\\n\",source);\n printf (\"obj_file->%s\\n\",obj_file);\n printf (\"prefix->%s\\n\",prefix);\n char *so = ((void *)0); char *obj = ((void *)0);\n char *match = (char *) malloc (400 * sizeof (char)); char *mismatch = (char *) malloc (400 * sizeof (char)); char *so_name = (char *) malloc (200 * sizeof (char)); char *obj_name = (char *) malloc (200 * sizeof (char));\n memset (match, 0, 400);\n memset (mismatch, 0, 400);\n memset (so_name, 0, 200);\n memset (obj_name, 0, 200);\n so = strrchr (source, '/');\n obj = strrchr (obj_file,'/');\n if (so)\n so += 1;\n else\n so = ((void *)0);\n if (obj)\n obj += 1;\n else\n obj = ((void *)0);\n if (so)\n strncat (so_name, so, strrchr (source, '.') - so);\n else\n strncat (so_name, source, strrchr (source, '.') - source);\n if (obj)\n strncat (obj_name, obj, strrchr (obj_file, '.') - obj);\n else\n strncat (obj_name, obj_file, strrchr (obj_file, '.') - obj_file);\n if (prefix)\n {\n strcat (match, prefix);\n strcat (mismatch, prefix);\n }\n else if (so)\n {\n strncat (match, source, so - source);\n strncat (mismatch, source, so - source);\n }\n strcat (match, so_name);\n strcat (mismatch, so_name);\n strcat (match, \"_\");\n strcat (mismatch, \"_\");\n strcat (match, obj_name);\n strcat (mismatch, obj_name);\n strcat (match, \"_contam\");\n strcat (mismatch, \"_clean\");\n if (type == 1)\n {\n strcat (match, \".fasta\");\n strcat (mismatch, \".fasta\");\n }\n else\n {\n strcat (match, \".fastq\");\n strcat (mismatch, \".fastq\");\n }\n printf (\"match->%s\\n\", match);\n printf (\"mis->%s\\n\", mismatch);\n write_result (match, contam2);\n write_result (mismatch, clean2);\n free (match);\n free (mismatch);\n free (so_name);\n free (obj_name);\n memset (contam2, 0, strlen (contam2));\n memset (clean2, 0, strlen (clean2));\n clean = clean2;\n contam = contam2;\n}",
"variable_types": [
[
"source",
"char *"
],
[
"obj_file",
"char *"
],
[
"type",
"int"
],
[
"prefix",
"char *"
],
[
"clean",
"char *"
],
[
"clean2",
"char *"
],
[
"contam",
"char *"
],
[
"contam2",
"char *"
],
[
"so",
"char *"
],
[
"obj",
"char *"
],
[
"match",
"char *"
],
[
"mismatch",
"char *"
],
[
"so_name",
"char *"
],
[
"obj_name",
"char *"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "1ddefe144f8e857a88dc29936c80f16d9e57b44514f2c831a1cd2711d135c63c"
}
] |
7f21540061b2b05e88649977fbb4c95a30a0a184a32c90f08a1a2f18927c19e4 | tzcoolman/FACS-OLD | [
[
"fastq_read_check",
"->",
"fastq_full_check"
],
[
"fastq_full_check",
"->",
"fastq_read_check"
],
[
"fasta_read_check",
"->",
"fasta_full_check"
],
[
"fasta_full_check",
"->",
"fasta_read_check"
],
[
"get_parainfo",
"->",
"fastq_relocate"
],
[
"jump",
"->"
],
[
"fastq_relocate",
"->",
"get_parainfo",
"fq_read_length"
],
[
"dx_add",
"->"
],
[
"fq_read_length",
"->",
"fastq_relocate"
]
] | [] | [
{
"name": "fastq_read_check",
"canonical_name": "func0",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall fastq_read_check(char *a1, unsigned int a2, char a3, __int64 a4, __int64 a5, float a6)\n{\n__int64 result; // rax\nvoid *dest; // [rsp+38h] [rbp-28h]\nint v11; // [rsp+44h] [rbp-1Ch]\nchar *v12; // [rsp+48h] [rbp-18h]\nint v13; // [rsp+50h] [rbp-10h]\nint v14; // [rsp+54h] [rbp-Ch]\nchar *src; // [rsp+58h] [rbp-8h]\n\nsrc = a1;\nv14 = a2;\nv13 = 0;\ndest = malloc(*(int *)(a4 + 56) + 1LL);\nwhile ( v14 > *(_DWORD *)(a4 + 56) && v13 != 1 )\n{\nif ( v14 < *(_DWORD *)(a4 + 56) )\n{\nmemcpy(dest, &v12[v14], *(int *)(a4 + 56));\nsrc += *(_DWORD *)(a4 + 56) - v14;\nv13 = 1;\n}\nelse\n{\nmemcpy(dest, src, *(int *)(a4 + 56));\n*((_BYTE *)dest + *(int *)(a4 + 56)) = 0;\nsrc += *(int *)(a4 + 56);\nv12 = src;\nv14 -= *(_DWORD *)(a4 + 56);\n}\nif ( a3 == 114 )\nrev_trans(dest);\nif ( (unsigned int)bloom_check(a4, dest) )\n{\nv11 = fastq_full_check(a4, a1, a2, (unsigned int)a3, a5, *(double *)_mm_cvtsi32_si128(LODWORD(a6)).m128i_i64);\nif ( v11 > 0 )\nreturn (unsigned int)v11;\nif ( a3 == 110 )\nbreak;\n}\n}\nif ( a3 == 114 )\nresult = 0LL;\nelse\nresult = fastq_read_check(a1, a2, 114LL, a4, a5, *(double *)_mm_cvtsi32_si128(LODWORD(a6)).m128i_i64);\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(char *a1, unsigned int a2, char a3, __int64 a4, __int64 a5, float a6)\n{\n__int64 result; // rax\nvoid *dest; // [rsp+38h] [rbp-28h]\nint v11; // [rsp+44h] [rbp-1Ch]\nchar *v12; // [rsp+48h] [rbp-18h]\nint v13; // [rsp+50h] [rbp-10h]\nint v14; // [rsp+54h] [rbp-Ch]\nchar *src; // [rsp+58h] [rbp-8h]\n\nsrc = a1;\nv14 = a2;\nv13 = 0;\ndest = malloc(*(int *)(a4 + 56) + 1LL);\nwhile ( v14 > *(_DWORD *)(a4 + 56) && v13 != 1 )\n{\nif ( v14 < *(_DWORD *)(a4 + 56) )\n{\nmemcpy(dest, &v12[v14], *(int *)(a4 + 56));\nsrc += *(_DWORD *)(a4 + 56) - v14;\nv13 = 1;\n}\nelse\n{\nmemcpy(dest, src, *(int *)(a4 + 56));\n*((_BYTE *)dest + *(int *)(a4 + 56)) = 0;\nsrc += *(int *)(a4 + 56);\nv12 = src;\nv14 -= *(_DWORD *)(a4 + 56);\n}\nif ( a3 == 114 )\nrev_trans(dest);\nif ( (unsigned int)bloom_check(a4, dest) )\n{\nv11 = func1(a4, a1, a2, (unsigned int)a3, a5, *(double *)_mm_cvtsi32_si128(LODWORD(a6)).m128i_i64);\nif ( v11 > 0 )\nreturn (unsigned int)v11;\nif ( a3 == 110 )\nbreak;\n}\n}\nif ( a3 == 114 )\nresult = 0LL;\nelse\nresult = func0(a1, a2, 114LL, a4, a5, *(double *)_mm_cvtsi32_si128(LODWORD(a6)).m128i_i64);\nreturn result;\n}",
"original_code": "int\nfastq_read_check (char *begin, int length, char model, bloom * bl, float tole_rate, F_set *File_head)\n{\n char *p = begin;\n int distance = length;\n int signal = 0, result = 0;\n char *previous, *key = (char *) malloc (bl->k_mer * sizeof (char) + 1);\n while (distance > bl->k_mer)\n {\n if (signal == 1)\n break;\n if (distance >= bl->k_mer)\n {\n memcpy (key, p, sizeof (char) * bl->k_mer);\n key[bl->k_mer] = '\\0';\n p += bl->k_mer;\n previous = p;\n distance -= bl->k_mer;\n }\n else\n {\n memcpy (key, previous + distance, sizeof (char) * bl->k_mer);\n p += (bl->k_mer - distance);\n signal = 1;\n }\n if (model == 'r')\n rev_trans (key);\n if (bloom_check (bl, key))\n {\n result = fastq_full_check (bl, begin, length, model, tole_rate, File_head);\n if (result > 0)\n return result;\n else if (model == 'n')\n break;\n }\n }\n if (model == 'r')\n return 0;\n else\n return fastq_read_check (begin, length, 'r', bl, tole_rate, File_head);\n}",
"canonical_original_code": "int fastq_read_check(char *begin, int length, char model, struct bloom *bl, float tole_rate, struct file_list *File_head)\n{\n char *p = begin;\n int distance = length;\n int signal = 0; int result = 0;\n char *previous; char *key = (char *) malloc (bl->k_mer * sizeof (char) + 1);\n while (distance > bl->k_mer)\n {\n if (signal == 1)\n break;\n if (distance >= bl->k_mer)\n {\n memcpy (key, p, sizeof (char) * bl->k_mer);\n key[bl->k_mer] = '\\0';\n p += bl->k_mer;\n previous = p;\n distance -= bl->k_mer;\n }\n else\n {\n memcpy (key, previous + distance, sizeof (char) * bl->k_mer);\n p += (bl->k_mer - distance);\n signal = 1;\n }\n if (model == 'r')\n rev_trans (key);\n if (bloom_check (bl, key))\n {\n result = fastq_full_check (bl, begin, length, model, tole_rate, File_head);\n if (result > 0)\n return result;\n else if (model == 'n')\n break;\n }\n }\n if (model == 'r')\n return 0;\n else\n return fastq_read_check (begin, length, 'r', bl, tole_rate, File_head);\n}",
"variable_types": [
[
"begin",
"char *"
],
[
"length",
"int"
],
[
"model",
"char"
],
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"tole_rate",
"float"
],
[
"File_head",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; } *"
],
[
"p",
"char *"
],
[
"distance",
"int"
],
[
"signal",
"int"
],
[
"result",
"int"
],
[
"previous",
"char *"
],
[
"key",
"char *"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "7f21540061b2b05e88649977fbb4c95a30a0a184a32c90f08a1a2f18927c19e4"
},
{
"name": "fastq_full_check",
"canonical_name": "func1",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall fastq_full_check(__int64 a1, char *a2, int a3, char a4, __int64 a5, float a6)\n{\n__int64 result; // rax\nint v9; // [rsp+1Ch] [rbp-44h]\nfloat v11; // [rsp+3Ch] [rbp-24h]\nvoid *dest; // [rsp+40h] [rbp-20h]\n__int16 v14; // [rsp+4Ch] [rbp-14h]\n__int16 v15; // [rsp+4Eh] [rbp-12h]\nint v16; // [rsp+50h] [rbp-10h]\nint v17; // [rsp+54h] [rbp-Ch]\nunsigned int v18; // [rsp+58h] [rbp-8h]\nint v19; // [rsp+5Ch] [rbp-4h]\n\nv9 = a3;\nv19 = 0;\nv18 = 0;\nv17 = 1;\nv16 = 0;\ndest = malloc(*(int *)(a1 + 56) + 1LL);\nv15 = 0;\nv14 = 0;\nwhile ( v9 >= *(_DWORD *)(a1 + 56) )\n{\nmemcpy(dest, a2, *(int *)(a1 + 56));\n*((_BYTE *)dest + *(int *)(a1 + 56)) = 0;\n++a2;\nif ( a4 == 114 )\nrev_trans(dest);\nif ( v19 >= *(_DWORD *)(a1 + 56) )\n{\nv17 = 1;\nv19 = 0;\n}\nif ( strlen((const char *)dest) == *(_DWORD *)(a1 + 56) )\n{\nif ( (unsigned int)bloom_check(a1, dest) )\n{\n++v16;\nif ( v15 == 1 )\n{\n++v14;\n}\nelse\n{\nv14 += *(_DWORD *)(a1 + 56);\nv15 = 1;\n}\nif ( v17 == 1 )\n{\nv18 += *(_DWORD *)(a1 + 56) - 1;\nv17 = 0;\n}\nelse\n{\n++v18;\n}\n}\nelse\n{\nv15 = 0;\n}\n++v19;\n}\n--v9;\n}\nfree(dest);\nv11 = (float)(v16 * *(_DWORD *)(a1 + 56) + v14) / (float)(a3 * *(_DWORD *)(a1 + 56) - 2 * *(_DWORD *)(a1 + 60) + v14);\n_InterlockedAdd64((volatile signed __int64 *)(a5 + 32), v16);\n_InterlockedAdd64((volatile signed __int64 *)(a5 + 40), a3 - *(_DWORD *)(a1 + 56));\nif ( v11 < a6 )\nresult = 0LL;\nelse\nresult = v18;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1, char *a2, int a3, char a4, __int64 a5, float a6)\n{\n__int64 result; // rax\nint v9; // [rsp+1Ch] [rbp-44h]\nfloat v11; // [rsp+3Ch] [rbp-24h]\nvoid *dest; // [rsp+40h] [rbp-20h]\n__int16 v14; // [rsp+4Ch] [rbp-14h]\n__int16 v15; // [rsp+4Eh] [rbp-12h]\nint v16; // [rsp+50h] [rbp-10h]\nint v17; // [rsp+54h] [rbp-Ch]\nunsigned int v18; // [rsp+58h] [rbp-8h]\nint v19; // [rsp+5Ch] [rbp-4h]\n\nv9 = a3;\nv19 = 0;\nv18 = 0;\nv17 = 1;\nv16 = 0;\ndest = malloc(*(int *)(a1 + 56) + 1LL);\nv15 = 0;\nv14 = 0;\nwhile ( v9 >= *(_DWORD *)(a1 + 56) )\n{\nmemcpy(dest, a2, *(int *)(a1 + 56));\n*((_BYTE *)dest + *(int *)(a1 + 56)) = 0;\n++a2;\nif ( a4 == 114 )\nrev_trans(dest);\nif ( v19 >= *(_DWORD *)(a1 + 56) )\n{\nv17 = 1;\nv19 = 0;\n}\nif ( strlen((const char *)dest) == *(_DWORD *)(a1 + 56) )\n{\nif ( (unsigned int)bloom_check(a1, dest) )\n{\n++v16;\nif ( v15 == 1 )\n{\n++v14;\n}\nelse\n{\nv14 += *(_DWORD *)(a1 + 56);\nv15 = 1;\n}\nif ( v17 == 1 )\n{\nv18 += *(_DWORD *)(a1 + 56) - 1;\nv17 = 0;\n}\nelse\n{\n++v18;\n}\n}\nelse\n{\nv15 = 0;\n}\n++v19;\n}\n--v9;\n}\nfree(dest);\nv11 = (float)(v16 * *(_DWORD *)(a1 + 56) + v14) / (float)(a3 * *(_DWORD *)(a1 + 56) - 2 * *(_DWORD *)(a1 + 60) + v14);\n_InterlockedAdd64((volatile signed __int64 *)(a5 + 32), v16);\n_InterlockedAdd64((volatile signed __int64 *)(a5 + 40), a3 - *(_DWORD *)(a1 + 56));\nif ( v11 < a6 )\nresult = 0LL;\nelse\nresult = v18;\nreturn result;\n}",
"original_code": "int\nfastq_full_check (bloom * bl, char *p, int distance, char model,\n float tole_rate, F_set *File_head)\n{\n int length = distance;\n int count = 0, match_s = 0, mark = 1, match_time = 0;\n float result;\n char *key = (char *) malloc (bl->k_mer * sizeof (char) + 1);\n short prev = 0, conse = 0;\n while (distance >= bl->k_mer)\n {\n memcpy (key, p, sizeof (char) * bl->k_mer);\n key[bl->k_mer] = '\\0';\n p += 1;\n if (model == 'r')\n rev_trans (key);\n if (count >= bl->k_mer)\n {\n mark = 1;\n count = 0;\n }\n if (strlen (key) == bl->k_mer)\n {\n if (bloom_check (bl, key))\n {\n match_time++;\n if (prev == 1)\n conse++;\n else\n {\n conse+=bl->k_mer;\n prev = 1;\n }\n if (mark == 1)\n {\n match_s += (bl->k_mer - 1);\n mark = 0;\n }\n else\n match_s++;\n }\n else\n {\n prev = 0;\n }\n count++;\n }\n distance--;\n }\n free (key);\n result = (float)(match_time*bl->k_mer+conse)/(float)(length*bl->k_mer-2*bl->dx+conse);\n \n#pragma omp atomic\n File_head->hits+=match_time;\n \n#pragma omp atomic\n File_head->all_k+=(length-bl->k_mer);\n if (result >= tole_rate)\n return match_s;\n else\n return 0;\n}",
"canonical_original_code": "int fastq_full_check(struct bloom *bl, char *p, int distance, char model, float tole_rate, struct file_list *File_head)\n{\n int length = distance;\n int count = 0; int match_s = 0; int mark = 1; int match_time = 0;\n float result;\n char *key = (char *) malloc (bl->k_mer * sizeof (char) + 1);\n short prev = 0; short conse = 0;\n while (distance >= bl->k_mer)\n {\n memcpy (key, p, sizeof (char) * bl->k_mer);\n key[bl->k_mer] = '\\0';\n p += 1;\n if (model == 'r')\n rev_trans (key);\n if (count >= bl->k_mer)\n {\n mark = 1;\n count = 0;\n }\n if (strlen (key) == bl->k_mer)\n {\n if (bloom_check (bl, key))\n {\n match_time++;\n if (prev == 1)\n conse++;\n else\n {\n conse+=bl->k_mer;\n prev = 1;\n }\n if (mark == 1)\n {\n match_s += (bl->k_mer - 1);\n mark = 0;\n }\n else\n match_s++;\n }\n else\n {\n prev = 0;\n }\n count++;\n }\n distance--;\n }\n free (key);\n result = (float)(match_time*bl->k_mer+conse)/(float)(length*bl->k_mer-2*bl->dx+conse);\n \n#pragma omp atomic\n File_head->hits+=match_time;\n \n#pragma omp atomic\n File_head->all_k+=(length-bl->k_mer);\n if (result >= tole_rate)\n return match_s;\n else\n return 0;\n}",
"variable_types": [
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"p",
"char *"
],
[
"distance",
"int"
],
[
"model",
"char"
],
[
"tole_rate",
"float"
],
[
"File_head",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; } *"
],
[
"length",
"int"
],
[
"count",
"int"
],
[
"match_s",
"int"
],
[
"mark",
"int"
],
[
"match_time",
"int"
],
[
"result",
"float"
],
[
"key",
"char *"
],
[
"prev",
"short"
],
[
"conse",
"short"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "7f21540061b2b05e88649977fbb4c95a30a0a184a32c90f08a1a2f18927c19e4"
},
{
"name": "fasta_read_check",
"canonical_name": "func2",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall fasta_read_check(__int64 a1, _BYTE *a2, char a3, __int64 a4, __int64 a5, float a6)\n{\nchar *v6; // rax\n__int64 result; // rax\nint v8; // eax\n__int64 v9; // rbx\nsize_t v10; // rbx\nsize_t v11; // rax\nsize_t v12; // rbx\n__int64 v13; // r12\nsize_t v14; // rax\nint v18; // [rsp+3Ch] [rbp-44h]\nchar *v19; // [rsp+40h] [rbp-40h]\nchar *dest; // [rsp+48h] [rbp-38h]\nchar *s; // [rsp+50h] [rbp-30h]\nint v22; // [rsp+5Ch] [rbp-24h]\nint v23; // [rsp+60h] [rbp-20h]\nint v24; // [rsp+64h] [rbp-1Ch]\n_BYTE *v25; // [rsp+68h] [rbp-18h]\n\nv6 = strchr((const char *)(a1 + 1), 10);\nv25 = v6 + 1;\nif ( v6 == (char *)-1LL || *v25 == 62 )\nreturn 1LL;\ns = (char *)malloc(*(_DWORD *)(a4 + 56) + 1);\ndest = (char *)malloc(*(_DWORD *)(a4 + 56) + 1);\ns[*(int *)(a4 + 56)] = 0;\nwhile ( v25 != a2 )\n{\nwhile ( v24 < *(_DWORD *)(a4 + 56) )\n{\nif ( v25[v23] == 62 || !v25[v23] )\n{\n--v23;\nbreak;\n}\nif ( v25[v23] == 13 || v25[v23] == 10 )\n{\n++v22;\n}\nelse\n{\nv8 = v24++;\ns[v8] = v25[v23];\n}\n++v23;\n}\nif ( !v23 )\nbreak;\nif ( strlen(s) == *(_DWORD *)(a4 + 56) )\n{\nmemcpy(dest, s, *(_DWORD *)(a4 + 56) + 1);\n}\nelse\n{\nv19 = (char *)malloc(*(int *)(a4 + 56));\nv9 = *(int *)(a4 + 56);\nv10 = v9 - strlen(s);\nv11 = strlen(s);\nmemcpy(v19, &dest[v11], v10);\nv12 = strlen(s) + 1;\nv13 = *(int *)(a4 + 56);\nv14 = strlen(s);\nmemcpy(&v19[v13 - v14], s, v12);\nfree(s);\ns = v19;\n}\nv25 += v23;\nv24 = 0;\nv23 = 0;\nif ( a3 == 114 )\nrev_trans(s);\nif ( (unsigned int)bloom_check(a4, s) )\n{\nv18 = fasta_full_check(a4, a1, a2, (unsigned int)a3, a5, *(double *)_mm_cvtsi32_si128(LODWORD(a6)).m128i_i64);\nif ( v18 > 0 )\nreturn (unsigned int)v18;\nif ( a3 == 110 )\nbreak;\n}\n}\nif ( a3 == 114 )\nresult = 0LL;\nelse\nresult = fasta_read_check(a1, a2, 114LL, a4, a5, *(double *)_mm_cvtsi32_si128(LODWORD(a6)).m128i_i64);\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, _BYTE *a2, char a3, __int64 a4, __int64 a5, float a6)\n{\nchar *v6; // rax\n__int64 result; // rax\nint v8; // eax\n__int64 v9; // rbx\nsize_t v10; // rbx\nsize_t v11; // rax\nsize_t v12; // rbx\n__int64 v13; // r12\nsize_t v14; // rax\nint v18; // [rsp+3Ch] [rbp-44h]\nchar *v19; // [rsp+40h] [rbp-40h]\nchar *dest; // [rsp+48h] [rbp-38h]\nchar *s; // [rsp+50h] [rbp-30h]\nint v22; // [rsp+5Ch] [rbp-24h]\nint v23; // [rsp+60h] [rbp-20h]\nint v24; // [rsp+64h] [rbp-1Ch]\n_BYTE *v25; // [rsp+68h] [rbp-18h]\n\nv6 = strchr((const char *)(a1 + 1), 10);\nv25 = v6 + 1;\nif ( v6 == (char *)-1LL || *v25 == 62 )\nreturn 1LL;\ns = (char *)malloc(*(_DWORD *)(a4 + 56) + 1);\ndest = (char *)malloc(*(_DWORD *)(a4 + 56) + 1);\ns[*(int *)(a4 + 56)] = 0;\nwhile ( v25 != a2 )\n{\nwhile ( v24 < *(_DWORD *)(a4 + 56) )\n{\nif ( v25[v23] == 62 || !v25[v23] )\n{\n--v23;\nbreak;\n}\nif ( v25[v23] == 13 || v25[v23] == 10 )\n{\n++v22;\n}\nelse\n{\nv8 = v24++;\ns[v8] = v25[v23];\n}\n++v23;\n}\nif ( !v23 )\nbreak;\nif ( strlen(s) == *(_DWORD *)(a4 + 56) )\n{\nmemcpy(dest, s, *(_DWORD *)(a4 + 56) + 1);\n}\nelse\n{\nv19 = (char *)malloc(*(int *)(a4 + 56));\nv9 = *(int *)(a4 + 56);\nv10 = v9 - strlen(s);\nv11 = strlen(s);\nmemcpy(v19, &dest[v11], v10);\nv12 = strlen(s) + 1;\nv13 = *(int *)(a4 + 56);\nv14 = strlen(s);\nmemcpy(&v19[v13 - v14], s, v12);\nfree(s);\ns = v19;\n}\nv25 += v23;\nv24 = 0;\nv23 = 0;\nif ( a3 == 114 )\nrev_trans(s);\nif ( (unsigned int)bloom_check(a4, s) )\n{\nv18 = func3(a4, a1, a2, (unsigned int)a3, a5, *(double *)_mm_cvtsi32_si128(LODWORD(a6)).m128i_i64);\nif ( v18 > 0 )\nreturn (unsigned int)v18;\nif ( a3 == 110 )\nbreak;\n}\n}\nif ( a3 == 114 )\nresult = 0LL;\nelse\nresult = func2(a1, a2, 114LL, a4, a5, *(double *)_mm_cvtsi32_si128(LODWORD(a6)).m128i_i64);\nreturn result;\n}",
"original_code": "int\nfasta_read_check (char *begin, char *next, char model, bloom * bl,\n float tole_rate, F_set *File_head)\n{\n char *p = strchr (begin + 1, '\\n') + 1;\n if (!p || *p == '>')\n return 1;\n int n, m, result, count_enter;\n char *key = (char *) malloc ((bl->k_mer + 1) * sizeof (char));\n char *pre_key = (char *) malloc ((bl->k_mer + 1) * sizeof (char));\n key[bl->k_mer] = '\\0';\n while (p != next)\n {\n while (n < bl->k_mer)\n {\n if (p[m] == '>' || p[m] == '\\0')\n {\n m--;\n break;\n }\n if (p[m] != '\\r' && p[m] != '\\n')\n key[n++] = p[m];\n else\n count_enter++;\n m++;\n }\n if (m == 0)\n break;\n if (strlen (key) == bl->k_mer)\n memcpy (pre_key, key, sizeof (char) * (bl->k_mer + 1));\n else\n {\n char *temp_key = (char *) malloc (bl->k_mer * sizeof (char));\n memcpy (temp_key, pre_key + strlen (key), bl->k_mer - strlen (key));\n memcpy (temp_key + bl->k_mer - strlen (key), key,\n sizeof (char) * (strlen (key) + 1));\n free (key);\n key = temp_key;\n }\n p += m;\n n = 0;\n m = 0;\n if (model == 'r')\n rev_trans (key);\n if (bloom_check (bl, key))\n {\n result = fasta_full_check (bl, begin, next, model, tole_rate, File_head);\n if (result > 0)\n return result;\n else if (model == 'n')\n break;\n }\n }\n if (model == 'r')\n return 0;\n else\n return fasta_read_check (begin, next, 'r', bl, tole_rate, File_head);\n}",
"canonical_original_code": "int fasta_read_check(char *begin, char *next, char model, struct bloom *bl, float tole_rate, struct file_list *File_head)\n{\n char *p = strchr (begin + 1, '\\n') + 1;\n if (!p || *p == '>')\n return 1;\n int n; int m; int result; int count_enter;\n char *key = (char *) malloc ((bl->k_mer + 1) * sizeof (char));\n char *pre_key = (char *) malloc ((bl->k_mer + 1) * sizeof (char));\n key[bl->k_mer] = '\\0';\n while (p != next)\n {\n while (n < bl->k_mer)\n {\n if (p[m] == '>' || p[m] == '\\0')\n {\n m--;\n break;\n }\n if (p[m] != '\\r' && p[m] != '\\n')\n key[n++] = p[m];\n else\n count_enter++;\n m++;\n }\n if (m == 0)\n break;\n if (strlen (key) == bl->k_mer)\n memcpy (pre_key, key, sizeof (char) * (bl->k_mer + 1));\n else\n {\n char *temp_key = (char *) malloc (bl->k_mer * sizeof (char));\n memcpy (temp_key, pre_key + strlen (key), bl->k_mer - strlen (key));\n memcpy (temp_key + bl->k_mer - strlen (key), key,\n sizeof (char) * (strlen (key) + 1));\n free (key);\n key = temp_key;\n }\n p += m;\n n = 0;\n m = 0;\n if (model == 'r')\n rev_trans (key);\n if (bloom_check (bl, key))\n {\n result = fasta_full_check (bl, begin, next, model, tole_rate, File_head);\n if (result > 0)\n return result;\n else if (model == 'n')\n break;\n }\n }\n if (model == 'r')\n return 0;\n else\n return fasta_read_check (begin, next, 'r', bl, tole_rate, File_head);\n}",
"variable_types": [
[
"begin",
"char *"
],
[
"next",
"char *"
],
[
"model",
"char"
],
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"tole_rate",
"float"
],
[
"File_head",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; } *"
],
[
"p",
"char *"
],
[
"n",
"int"
],
[
"m",
"int"
],
[
"result",
"int"
],
[
"count_enter",
"int"
],
[
"key",
"char *"
],
[
"pre_key",
"char *"
],
[
"temp_key",
"char *"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "7f21540061b2b05e88649977fbb4c95a30a0a184a32c90f08a1a2f18927c19e4"
},
{
"name": "fasta_full_check",
"canonical_name": "func3",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall fasta_full_check(__int64 a1, __int64 a2, char *a3, char a4, __int64 a5, float a6)\n{\nint v6; // eax\n__int64 result; // rax\nchar *v11; // [rsp+20h] [rbp-50h]\nfloat v12; // [rsp+3Ch] [rbp-34h]\nchar *s; // [rsp+40h] [rbp-30h]\nchar *i; // [rsp+48h] [rbp-28h]\nchar *v15; // [rsp+48h] [rbp-28h]\n__int16 v16; // [rsp+50h] [rbp-20h]\n__int16 v17; // [rsp+52h] [rbp-1Eh]\nint v18; // [rsp+54h] [rbp-1Ch]\nint v19; // [rsp+58h] [rbp-18h]\nint v20; // [rsp+5Ch] [rbp-14h]\nint v21; // [rsp+60h] [rbp-10h]\nint v22; // [rsp+64h] [rbp-Ch]\nint v23; // [rsp+68h] [rbp-8h]\nunsigned int v24; // [rsp+6Ch] [rbp-4h]\n\nv24 = 0;\nv23 = 0;\nv22 = 1;\nv21 = 0;\nv20 = 0;\nv19 = 0;\nv18 = 0;\nv17 = 0;\nv16 = 0;\ns = (char *)malloc(*(_DWORD *)(a1 + 56) + 1);\nv11 = strchr((const char *)(a2 + 1), 10) + 1;\nfor ( i = v11; i != a3; ++i )\n{\nif ( *i == 10 )\n++v19;\n}\nv15 = v11;\nwhile ( *v15 != 62 && *v15 )\n{\nwhile ( v21 < *(_DWORD *)(a1 + 56) && v15[v20] != 62 && v15[v20] )\n{\nif ( v15[v20] != 13 && v15[v20] != 10 )\n{\nv6 = v21++;\ns[v6] = v15[v20];\n}\n++v20;\n}\ns[v21] = 0;\nif ( a4 == 114 )\nrev_trans(s);\nif ( v23 >= *(_DWORD *)(a1 + 56) )\n{\nv22 = 1;\nv23 = 0;\n}\nif ( strlen(s) == *(_DWORD *)(a1 + 56) )\n{\nif ( (unsigned int)bloom_check(a1, s) )\n{\n++v18;\nif ( v17 == 1 )\n{\n++v16;\n}\nelse\n{\nv16 += *(_DWORD *)(a1 + 56);\nv17 = 1;\n}\nif ( v22 == 1 )\n{\nv24 += *(_DWORD *)(a1 + 56) - 1;\nv22 = 0;\n}\nelse\n{\n++v24;\n}\n}\nelse\n{\nv17 = 0;\n}\n++v23;\n}\nif ( *++v15 == 10 )\n++v15;\nv21 = 0;\nv20 = 0;\n}\nv12 = (float)(v18 * *(_DWORD *)(a1 + 56) + v16)\n/ (float)(*(_DWORD *)(a1 + 56) * ((int)a3 - (int)v11 - v19) - 2 * *(_DWORD *)(a1 + 60) + v16);\n_InterlockedAdd64((volatile signed __int64 *)(a5 + 32), v18);\n_InterlockedAdd64((volatile signed __int64 *)(a5 + 40), a3 - v11 - v19 - *(int *)(a1 + 56));\nif ( v12 < a6 )\nresult = 0LL;\nelse\nresult = v24;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1, __int64 a2, char *a3, char a4, __int64 a5, float a6)\n{\nint v6; // eax\n__int64 result; // rax\nchar *v11; // [rsp+20h] [rbp-50h]\nfloat v12; // [rsp+3Ch] [rbp-34h]\nchar *s; // [rsp+40h] [rbp-30h]\nchar *i; // [rsp+48h] [rbp-28h]\nchar *v15; // [rsp+48h] [rbp-28h]\n__int16 v16; // [rsp+50h] [rbp-20h]\n__int16 v17; // [rsp+52h] [rbp-1Eh]\nint v18; // [rsp+54h] [rbp-1Ch]\nint v19; // [rsp+58h] [rbp-18h]\nint v20; // [rsp+5Ch] [rbp-14h]\nint v21; // [rsp+60h] [rbp-10h]\nint v22; // [rsp+64h] [rbp-Ch]\nint v23; // [rsp+68h] [rbp-8h]\nunsigned int v24; // [rsp+6Ch] [rbp-4h]\n\nv24 = 0;\nv23 = 0;\nv22 = 1;\nv21 = 0;\nv20 = 0;\nv19 = 0;\nv18 = 0;\nv17 = 0;\nv16 = 0;\ns = (char *)malloc(*(_DWORD *)(a1 + 56) + 1);\nv11 = strchr((const char *)(a2 + 1), 10) + 1;\nfor ( i = v11; i != a3; ++i )\n{\nif ( *i == 10 )\n++v19;\n}\nv15 = v11;\nwhile ( *v15 != 62 && *v15 )\n{\nwhile ( v21 < *(_DWORD *)(a1 + 56) && v15[v20] != 62 && v15[v20] )\n{\nif ( v15[v20] != 13 && v15[v20] != 10 )\n{\nv6 = v21++;\ns[v6] = v15[v20];\n}\n++v20;\n}\ns[v21] = 0;\nif ( a4 == 114 )\nrev_trans(s);\nif ( v23 >= *(_DWORD *)(a1 + 56) )\n{\nv22 = 1;\nv23 = 0;\n}\nif ( strlen(s) == *(_DWORD *)(a1 + 56) )\n{\nif ( (unsigned int)bloom_check(a1, s) )\n{\n++v18;\nif ( v17 == 1 )\n{\n++v16;\n}\nelse\n{\nv16 += *(_DWORD *)(a1 + 56);\nv17 = 1;\n}\nif ( v22 == 1 )\n{\nv24 += *(_DWORD *)(a1 + 56) - 1;\nv22 = 0;\n}\nelse\n{\n++v24;\n}\n}\nelse\n{\nv17 = 0;\n}\n++v23;\n}\nif ( *++v15 == 10 )\n++v15;\nv21 = 0;\nv20 = 0;\n}\nv12 = (float)(v18 * *(_DWORD *)(a1 + 56) + v16)\n/ (float)(*(_DWORD *)(a1 + 56) * ((int)a3 - (int)v11 - v19) - 2 * *(_DWORD *)(a1 + 60) + v16);\n_InterlockedAdd64((volatile signed __int64 *)(a5 + 32), v18);\n_InterlockedAdd64((volatile signed __int64 *)(a5 + 40), a3 - v11 - v19 - *(int *)(a1 + 56));\nif ( v12 < a6 )\nresult = 0LL;\nelse\nresult = v24;\nreturn result;\n}",
"original_code": "int\nfasta_full_check (bloom * bl, char *begin, char *next, char model,\n float tole_rate, F_set *File_head)\n{\n int match_s = 0, count = 0, mark = 1;\n int n = 0, m = 0, count_enter = 0, match_time = 0;\n short previous = 0, conse = 0;\n float result;\n char *key = (char *) malloc ((bl->k_mer + 1) * sizeof (char));\n begin = strchr (begin + 1, '\\n') + 1;\n char *p = begin;\n while (p != next)\n {\n if (*p == '\\n')\n count_enter++;\n p++;\n }\n p = begin;\n while (*p != '>' && *p != '\\0')\n {\n while (n < bl->k_mer)\n {\n if (p[m] == '>' || p[m] == '\\0')\n {\n m--;\n break;\n }\n if (p[m] != '\\r' && p[m] != '\\n')\n key[n++] = p[m];\n m++;\n }\n key[n] = '\\0';\n if (model == 'r')\n rev_trans (key);\n if (count >= bl->k_mer)\n {\n mark = 1;\n count = 0;\n }\n if (strlen (key) == bl->k_mer)\n {\n if (bloom_check (bl, key))\n {\n match_time++;\n if (previous == 1)\n conse++;\n else\n {\n conse+=bl->k_mer;\n previous = 1;\n }\n if (mark == 1)\n {\n match_s += (bl->k_mer - 1);\n mark = 0;\n }\n else\n match_s++;\n }\n else\n {\n previous = 0;\n }\n count++;\n }\n p++;\n if (p[0] == '\\n')\n p++;\n n = 0;\n m = 0;\n }\n result = (float)(match_time*bl->k_mer+conse)/(float)((next-begin-count_enter)*bl->k_mer-2*bl->dx+conse);\n \n#pragma omp atomic\n File_head->hits+=match_time;\n \n#pragma omp atomic\n File_head->all_k+=(next-begin-count_enter-bl->k_mer);\n if (result >= tole_rate)\n return match_s;\n else\n return 0;\n}",
"canonical_original_code": "int fasta_full_check(struct bloom *bl, char *begin, char *next, char model, float tole_rate, struct file_list *File_head)\n{\n int match_s = 0; int count = 0; int mark = 1;\n int n = 0; int m = 0; int count_enter = 0; int match_time = 0;\n short previous = 0; short conse = 0;\n float result;\n char *key = (char *) malloc ((bl->k_mer + 1) * sizeof (char));\n begin = strchr (begin + 1, '\\n') + 1;\n char *p = begin;\n while (p != next)\n {\n if (*p == '\\n')\n count_enter++;\n p++;\n }\n p = begin;\n while (*p != '>' && *p != '\\0')\n {\n while (n < bl->k_mer)\n {\n if (p[m] == '>' || p[m] == '\\0')\n {\n m--;\n break;\n }\n if (p[m] != '\\r' && p[m] != '\\n')\n key[n++] = p[m];\n m++;\n }\n key[n] = '\\0';\n if (model == 'r')\n rev_trans (key);\n if (count >= bl->k_mer)\n {\n mark = 1;\n count = 0;\n }\n if (strlen (key) == bl->k_mer)\n {\n if (bloom_check (bl, key))\n {\n match_time++;\n if (previous == 1)\n conse++;\n else\n {\n conse+=bl->k_mer;\n previous = 1;\n }\n if (mark == 1)\n {\n match_s += (bl->k_mer - 1);\n mark = 0;\n }\n else\n match_s++;\n }\n else\n {\n previous = 0;\n }\n count++;\n }\n p++;\n if (p[0] == '\\n')\n p++;\n n = 0;\n m = 0;\n }\n result = (float)(match_time*bl->k_mer+conse)/(float)((next-begin-count_enter)*bl->k_mer-2*bl->dx+conse);\n \n#pragma omp atomic\n File_head->hits+=match_time;\n \n#pragma omp atomic\n File_head->all_k+=(next-begin-count_enter-bl->k_mer);\n if (result >= tole_rate)\n return match_s;\n else\n return 0;\n}",
"variable_types": [
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"begin",
"char *"
],
[
"next",
"char *"
],
[
"model",
"char"
],
[
"tole_rate",
"float"
],
[
"File_head",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; } *"
],
[
"match_s",
"int"
],
[
"count",
"int"
],
[
"mark",
"int"
],
[
"n",
"int"
],
[
"m",
"int"
],
[
"count_enter",
"int"
],
[
"match_time",
"int"
],
[
"previous",
"short"
],
[
"conse",
"short"
],
[
"result",
"float"
],
[
"key",
"char *"
],
[
"p",
"char *"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "7f21540061b2b05e88649977fbb4c95a30a0a184a32c90f08a1a2f18927c19e4"
},
{
"name": "get_parainfo",
"canonical_name": "func4",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall get_parainfo(const char *a1, __int64 a2)\n{\nunsigned int v2; // eax\n__int16 i; // [rsp+16h] [rbp-4Ah] BYREF\n_QWORD *v5; // [rsp+18h] [rbp-48h]\n_QWORD *v6; // [rsp+20h] [rbp-40h]\nchar *v7; // [rsp+28h] [rbp-38h]\nunsigned int v8; // [rsp+30h] [rbp-30h]\nint v9; // [rsp+34h] [rbp-2Ch]\n__int64 v10; // [rsp+38h] [rbp-28h]\nint v11; // [rsp+44h] [rbp-1Ch]\nchar *v12; // [rsp+48h] [rbp-18h]\nchar *v13; // [rsp+50h] [rbp-10h]\nunsigned int v14; // [rsp+5Ch] [rbp-4h]\n\nv14 = 0;\nv13 = 0LL;\nv12 = (char *)a1;\nv9 = omp_get_num_procs();\ni = 0;\nv11 = 0;\nv10 = a2;\nv8 = 0;\nif ( a1 )\n{\nv11 = strlen(a1) / v9;\nif ( *a1 == 62 )\n{\nv14 = 1;\n}\nelse\n{\nif ( *a1 != 64 )\n{\nperror(\"wrong format\\n\");\nexit(-1);\n}\nv14 = 2;\n}\n}\nif ( v14 == 1 )\n{\nfor ( i = 0; v9 > i; ++i )\n{\nv5 = malloc(0x20uLL);\nif ( !i && *a1 != 62 )\nv12 = strchr(a1, 62);\nif ( i )\nv12 = strchr(&a1[v11 * i], 62);\n*v5 = v12;\nv5[2] = &i;\nv5[3] = *(_QWORD *)(v10 + 24);\n*(_QWORD *)(v10 + 24) = v5;\nv10 = *(_QWORD *)(v10 + 24);\n}\n}\nelse\n{\nfor ( i = 0; v9 > i; ++i )\n{\nv7 = strchr(a1, 10);\nv2 = (unsigned int)strchr(v7 + 1, 10);\nv8 = v2 - ((_DWORD)v7 + 1);\nv6 = malloc(0x20uLL);\n*v6 = 0LL;\nif ( i )\nv12 = (char *)fastq_relocate(a1, (unsigned int)(v11 * i), v8);\nif ( v13 != v12 )\n{\nv13 = v12;\n*v6 = v12;\nv6[2] = &i;\nv6[3] = *(_QWORD *)(v10 + 24);\n*(_QWORD *)(v10 + 24) = v6;\nv10 = *(_QWORD *)(v10 + 24);\n}\n}\n}\nreturn v14;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func4(const char *a1, __int64 a2)\n{\nunsigned int v2; // eax\n__int16 i; // [rsp+16h] [rbp-4Ah] BYREF\n_QWORD *v5; // [rsp+18h] [rbp-48h]\n_QWORD *v6; // [rsp+20h] [rbp-40h]\nchar *v7; // [rsp+28h] [rbp-38h]\nunsigned int v8; // [rsp+30h] [rbp-30h]\nint v9; // [rsp+34h] [rbp-2Ch]\n__int64 v10; // [rsp+38h] [rbp-28h]\nint v11; // [rsp+44h] [rbp-1Ch]\nchar *v12; // [rsp+48h] [rbp-18h]\nchar *v13; // [rsp+50h] [rbp-10h]\nunsigned int v14; // [rsp+5Ch] [rbp-4h]\n\nv14 = 0;\nv13 = 0LL;\nv12 = (char *)a1;\nv9 = omp_get_num_procs();\ni = 0;\nv11 = 0;\nv10 = a2;\nv8 = 0;\nif ( a1 )\n{\nv11 = strlen(a1) / v9;\nif ( *a1 == 62 )\n{\nv14 = 1;\n}\nelse\n{\nif ( *a1 != 64 )\n{\nperror(\"wrong format\\n\");\nexit(-1);\n}\nv14 = 2;\n}\n}\nif ( v14 == 1 )\n{\nfor ( i = 0; v9 > i; ++i )\n{\nv5 = malloc(0x20uLL);\nif ( !i && *a1 != 62 )\nv12 = strchr(a1, 62);\nif ( i )\nv12 = strchr(&a1[v11 * i], 62);\n*v5 = v12;\nv5[2] = &i;\nv5[3] = *(_QWORD *)(v10 + 24);\n*(_QWORD *)(v10 + 24) = v5;\nv10 = *(_QWORD *)(v10 + 24);\n}\n}\nelse\n{\nfor ( i = 0; v9 > i; ++i )\n{\nv7 = strchr(a1, 10);\nv2 = (unsigned int)strchr(v7 + 1, 10);\nv8 = v2 - ((_DWORD)v7 + 1);\nv6 = malloc(0x20uLL);\n*v6 = 0LL;\nif ( i )\nv12 = (char *)func6(a1, (unsigned int)(v11 * i), v8);\nif ( v13 != v12 )\n{\nv13 = v12;\n*v6 = v12;\nv6[2] = &i;\nv6[3] = *(_QWORD *)(v10 + 24);\n*(_QWORD *)(v10 + 24) = v6;\nv10 = *(_QWORD *)(v10 + 24);\n}\n}\n}\nreturn v14;\n}",
"original_code": "int\nget_parainfo (char *full, Queue * head)\n{\n int type = 0;\n char *previous = ((void *)0);\n char *temp = full;\n int cores = omp_get_num_procs ();\n short add = 0;\n int offset = 0;\n Queue *pos = head;\n int length = 0;\n if (full != ((void *)0)) {\n offset = strlen(full) / cores;\n if (*full == '>')\n type = 1;\n else if (*full == '@')\n type = 2;\n else\n {\n perror (\"wrong format\\n\");\n exit (-1);\n }\n }\n if (type == 1) {\n for (add = 0; add < cores; add++) {\n Queue *x = (Queue *) malloc(sizeof(Queue));\n if (add == 0 && *full != '>')\n temp = strchr (full, '>');\n if (add != 0)\n temp = strchr (full + offset * add, '>');\n x->location = temp;\n x->number = &add;\n x->next = pos->next;\n pos->next = x;\n pos = pos->next;\n }\n } else {\n for (add = 0; add < cores; add++) {\n char *tx = strchr(full,'\\n');\n length = strchr(tx+1,'\\n')-(tx+1);\n Queue *x = (Queue *) malloc(sizeof(Queue));\n x->location = ((void *)0);\n if (add != 0)\n temp = fastq_relocate(full, offset*add, length);\n if (previous!=temp) {\n previous = temp;\n x->location = temp;\n x->number = &add;\n x->next = pos->next;\n pos->next = x;\n pos = pos->next;\n }\n }\n }\n return type;\n}",
"canonical_original_code": "int get_parainfo(char *full, struct info *head)\n{\n int type = 0;\n char *previous = ((void *)0);\n char *temp = full;\n int cores = omp_get_num_procs ();\n short add = 0;\n int offset = 0;\n struct info *pos = head;\n int length = 0;\n if (full != ((void *)0)) {\n offset = strlen(full) / cores;\n if (*full == '>')\n type = 1;\n else if (*full == '@')\n type = 2;\n else\n {\n perror (\"wrong format\\n\");\n exit (-1);\n }\n }\n if (type == 1) {\n for (add = 0; add < cores; add++) {\n struct info *x = (Queue *) malloc(sizeof(Queue));\n if (add == 0 && *full != '>')\n temp = strchr (full, '>');\n if (add != 0)\n temp = strchr (full + offset * add, '>');\n x->location = temp;\n x->number = &add;\n x->next = pos->next;\n pos->next = x;\n pos = pos->next;\n }\n } else {\n for (add = 0; add < cores; add++) {\n char *tx = strchr(full,'\\n');\n length = strchr(tx+1,'\\n')-(tx+1);\n struct info *x = (Queue *) malloc(sizeof(Queue));\n x->location = ((void *)0);\n if (add != 0)\n temp = fastq_relocate(full, offset*add, length);\n if (previous!=temp) {\n previous = temp;\n x->location = temp;\n x->number = &add;\n x->next = pos->next;\n pos->next = x;\n pos = pos->next;\n }\n }\n }\n return type;\n}",
"variable_types": [
[
"full",
"char *"
],
[
"head",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"type",
"int"
],
[
"previous",
"char *"
],
[
"temp",
"char *"
],
[
"cores",
"int"
],
[
"add",
"short"
],
[
"offset",
"int"
],
[
"pos",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"length",
"int"
],
[
"x",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"tx",
"char *"
]
],
"return_type": "int",
"user_defined_types": [
"struct info { char *location; short *score; short *number; struct info *next; }"
],
"binary_hash": "7f21540061b2b05e88649977fbb4c95a30a0a184a32c90f08a1a2f18927c19e4"
},
{
"name": "jump",
"canonical_name": "func5",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "char *__fastcall jump(__int64 a1, int a2, float a3)\n{\nchar *v3; // rax\nchar *v4; // rax\nchar *v6; // [rsp+8h] [rbp-18h]\nchar *s; // [rsp+18h] [rbp-8h]\n\nv6 = (char *)a1;\nif ( (float)(rand() % 10) >= (float)(a3 * 10.0) )\n{\nif ( a2 == 1 )\n{\ns = strchr((const char *)(a1 + 1), 62);\n}\nelse\n{\nv3 = strstr((const char *)(a1 + 1), \"\\n+\");\nv4 = strchr(v3 + 1, 10);\ns = strchr(v4 + 1, 10) + 1;\n}\nif ( s )\nv6 = s;\n}\nreturn v6;\n}\n",
"canonical_decompiled_code": "char *__fastcall func5(__int64 a1, int a2, float a3)\n{\nchar *v3; // rax\nchar *v4; // rax\nchar *v6; // [rsp+8h] [rbp-18h]\nchar *s; // [rsp+18h] [rbp-8h]\n\nv6 = (char *)a1;\nif ( (float)(rand() % 10) >= (float)(a3 * 10.0) )\n{\nif ( a2 == 1 )\n{\ns = strchr((const char *)(a1 + 1), 62);\n}\nelse\n{\nv3 = strstr((const char *)(a1 + 1), \"\\n+\");\nv4 = strchr(v3 + 1, 10);\ns = strchr(v4 + 1, 10) + 1;\n}\nif ( s )\nv6 = s;\n}\nreturn v6;\n}",
"original_code": "char *\njump (char *target, int type, float sampling_rate)\n{\n float seed = rand () % 10;\n if (seed >= (float) sampling_rate * 10)\n {\n char *point;\n if (type == 1)\n point = strchr (target + 1, '>');\n else\n {\n point = strstr (target + 1, \"\\n+\") + 1;\n point = strchr (point,'\\n')+1;\n point = strchr (point,'\\n')+1;\n }\n if (point)\n target = point;\n }\n return target;\n}",
"canonical_original_code": "char *jump(char *target, int type, float sampling_rate)\n{\n float seed = rand () % 10;\n if (seed >= (float) sampling_rate * 10)\n {\n char *point;\n if (type == 1)\n point = strchr (target + 1, '>');\n else\n {\n point = strstr (target + 1, \"\\n+\") + 1;\n point = strchr (point,'\\n')+1;\n point = strchr (point,'\\n')+1;\n }\n if (point)\n target = point;\n }\n return target;\n}",
"variable_types": [
[
"target",
"char *"
],
[
"type",
"int"
],
[
"sampling_rate",
"float"
],
[
"seed",
"float"
],
[
"point",
"char *"
]
],
"return_type": "char *",
"user_defined_types": [],
"binary_hash": "7f21540061b2b05e88649977fbb4c95a30a0a184a32c90f08a1a2f18927c19e4"
},
{
"name": "fastq_relocate",
"canonical_name": "func6",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "char *__fastcall fastq_relocate(__int64 a1, int a2)\n{\nunsigned int v3; // [rsp+14h] [rbp-Ch]\nchar *v4; // [rsp+18h] [rbp-8h]\n\nv4 = 0LL;\nif ( a1 && a2 )\n{\nv4 = strstr((const char *)(a2 + a1), \"\\n+\");\nif ( !v4 )\nreturn 0LL;\nv3 = (unsigned int)strchr(v4 + 1, 10) - (_DWORD)v4 + 1;\nfq_read_length(v4 - 1);\nif ( v3 )\nv4 = strchr(v4 + 1, 10) + 1;\nif ( v4 )\nv4 = strchr(v4 + 1, 10) + 1;\n}\nreturn v4;\n}\n",
"canonical_decompiled_code": "char *__fastcall func6(__int64 a1, int a2)\n{\nunsigned int v3; // [rsp+14h] [rbp-Ch]\nchar *v4; // [rsp+18h] [rbp-8h]\n\nv4 = 0LL;\nif ( a1 && a2 )\n{\nv4 = strstr((const char *)(a2 + a1), \"\\n+\");\nif ( !v4 )\nreturn 0LL;\nv3 = (unsigned int)strchr(v4 + 1, 10) - (_DWORD)v4 + 1;\nfunc8(v4 - 1);\nif ( v3 )\nv4 = strchr(v4 + 1, 10) + 1;\nif ( v4 )\nv4 = strchr(v4 + 1, 10) + 1;\n}\nreturn v4;\n}",
"original_code": "char *fastq_relocate (char *data, int offset, int length){\n char *target=((void *)0);\n int current_length = 0, read_length = 0;\n if(data != ((void *)0) && offset != 0)\n {\n target = strstr (data + offset, \"\\n+\");\n if (!target)\n return ((void *)0);\n else {\n current_length = strchr(target+1,'\\n')-target+1;\n read_length = fq_read_length (target-1);\n if (read_length=current_length)\n target = strchr (target+1,'\\n')+1;\n if (target!=((void *)0))\n target = strchr (target+1,'\\n')+1;\n }\n }\n return target;\n}",
"canonical_original_code": "char *fastq_relocate(char *data, int offset, int length){\n char *target = ((void *)0);\n int current_length = 0; int read_length = 0;\n if(data != ((void *)0) && offset != 0)\n {\n target = strstr (data + offset, \"\\n+\");\n if (!target)\n return ((void *)0);\n else {\n current_length = strchr(target+1,'\\n')-target+1;\n read_length = fq_read_length (target-1);\n if (read_length=current_length)\n target = strchr (target+1,'\\n')+1;\n if (target!=((void *)0))\n target = strchr (target+1,'\\n')+1;\n }\n }\n return target;\n}",
"variable_types": [
[
"data",
"char *"
],
[
"offset",
"int"
],
[
"length",
"int"
],
[
"target",
"char *"
],
[
"current_length",
"int"
],
[
"read_length",
"int"
]
],
"return_type": "char *",
"user_defined_types": [],
"binary_hash": "7f21540061b2b05e88649977fbb4c95a30a0a184a32c90f08a1a2f18927c19e4"
},
{
"name": "dx_add",
"canonical_name": "func7",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall dx_add(int a1)\n{\nunsigned int v2; // [rsp+Ch] [rbp-8h]\nint i; // [rsp+10h] [rbp-4h]\n\nv2 = 0;\nfor ( i = 1; i < a1; ++i )\nv2 += i;\nreturn v2;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(int a1)\n{\nunsigned int v2; // [rsp+Ch] [rbp-8h]\nint i; // [rsp+10h] [rbp-4h]\n\nv2 = 0;\nfor ( i = 1; i < a1; ++i )\nv2 += i;\nreturn v2;\n}",
"original_code": "int\ndx_add (int k_mer)\n{\n int x;\n int y = 0;\n for (x=1;x<k_mer;x++)\n y+=x;\n return y;\n}",
"canonical_original_code": "int dx_add(int k_mer)\n{\n int x;\n int y = 0;\n for (x=1;x<k_mer;x++)\n y+=x;\n return y;\n}",
"variable_types": [
[
"k_mer",
"int"
],
[
"x",
"int"
],
[
"y",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "7f21540061b2b05e88649977fbb4c95a30a0a184a32c90f08a1a2f18927c19e4"
},
{
"name": "fq_read_length",
"canonical_name": "func8",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall fq_read_length(_BYTE *a1)\n{\n_BYTE *i; // [rsp+0h] [rbp-18h]\n\nfor ( i = a1; *i != 10; --i )\n;\nreturn a1 - i;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func8(_BYTE *a1)\n{\n_BYTE *i; // [rsp+0h] [rbp-18h]\n\nfor ( i = a1; *i != 10; --i )\n;\nreturn a1 - i;\n}",
"original_code": "int fq_read_length (char *data)\n{\nchar *origin = data;\nwhile (*data!='\\n')\n data--;\nreturn origin-data;\n}",
"canonical_original_code": "int fq_read_length(char *data)\n{\nchar *origin = data;\nwhile (*data!='\\n')\n data--;\nreturn origin-data;\n}",
"variable_types": [
[
"data",
"char *"
],
[
"origin",
"char *"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "7f21540061b2b05e88649977fbb4c95a30a0a184a32c90f08a1a2f18927c19e4"
}
] |
88ee99794fdd9de9d710918cca90e5c8483fc1e2264fcab5385df935eae5390c | tzcoolman/FACS-OLD | [
[
"get_mu",
"->"
],
[
"get_sigma",
"->"
],
[
"get_size",
"->"
],
[
"kmer_suggestion",
"->"
],
[
"mco_suggestion",
"->"
],
[
"get_suggestion",
"->",
"get_rec"
],
[
"find_close_prime",
"->",
"is_prime",
"get_rec"
],
[
"get_rec",
"->",
"get_suggestion",
"find_close_prime"
],
[
"is_prime",
"->",
"find_close_prime"
]
] | [] | [
{
"name": "get_mu",
"canonical_name": "func0",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "double __fastcall get_mu(__int64 a1, double a2)\n{\ndouble v2; // xmm0_8\n\nif ( a1 < 0 )\nv2 = (double)(int)(a1 & 1 | ((unsigned __int64)a1 >> 1)) + (double)(int)(a1 & 1 | ((unsigned __int64)a1 >> 1));\nelse\nv2 = (double)(int)a1;\nreturn v2 * a2;\n}\n",
"canonical_decompiled_code": "double __fastcall func0(__int64 a1, double a2)\n{\ndouble v2; // xmm0_8\n\nif ( a1 < 0 )\nv2 = (double)(int)(a1 & 1 | ((unsigned __int64)a1 >> 1)) + (double)(int)(a1 & 1 | ((unsigned __int64)a1 >> 1));\nelse\nv2 = (double)(int)a1;\nreturn v2 * a2;\n}",
"original_code": "double get_mu (unsigned long long num_hit, double prob)\n{\n return ((double)num_hit)*prob;\n}",
"canonical_original_code": "double get_mu(unsigned long long num_hit, double prob)\n{\n return ((double)num_hit)*prob;\n}",
"variable_types": [
[
"num_hit",
"unsigned long long"
],
[
"prob",
"double"
]
],
"return_type": "double",
"user_defined_types": [],
"binary_hash": "88ee99794fdd9de9d710918cca90e5c8483fc1e2264fcab5385df935eae5390c"
},
{
"name": "get_sigma",
"canonical_name": "func1",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "double __fastcall get_sigma(__int64 a1, double a2)\n{\ndouble v2; // xmm0_8\n\nif ( a1 < 0 )\nv2 = (double)(int)(a1 & 1 | ((unsigned __int64)a1 >> 1)) + (double)(int)(a1 & 1 | ((unsigned __int64)a1 >> 1));\nelse\nv2 = (double)(int)a1;\nreturn (1.0 - a2) * (v2 * a2);\n}\n",
"canonical_decompiled_code": "double __fastcall func1(__int64 a1, double a2)\n{\ndouble v2; // xmm0_8\n\nif ( a1 < 0 )\nv2 = (double)(int)(a1 & 1 | ((unsigned __int64)a1 >> 1)) + (double)(int)(a1 & 1 | ((unsigned __int64)a1 >> 1));\nelse\nv2 = (double)(int)a1;\nreturn (1.0 - a2) * (v2 * a2);\n}",
"original_code": "double get_sigma (unsigned long long num_hit, double prob)\n{\n return (double)num_hit*prob*(1-prob);\n}",
"canonical_original_code": "double get_sigma(unsigned long long num_hit, double prob)\n{\n return (double)num_hit*prob*(1-prob);\n}",
"variable_types": [
[
"num_hit",
"unsigned long long"
],
[
"prob",
"double"
]
],
"return_type": "double",
"user_defined_types": [],
"binary_hash": "88ee99794fdd9de9d710918cca90e5c8483fc1e2264fcab5385df935eae5390c"
},
{
"name": "get_size",
"canonical_name": "func2",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__off_t __fastcall get_size(const char *a1)\n{\nstruct stat64 buf; // [rsp+10h] [rbp-A0h] BYREF\nint fd[2]; // [rsp+A8h] [rbp-8h]\n\n*(_QWORD *)fd = open64(a1, 0);\nif ( *(__int64 *)fd < 0 )\n{\nputs(\"open file error...\");\nexit(-1);\n}\nfstat64(fd[0], &buf);\nreturn buf.st_size;\n}\n",
"canonical_decompiled_code": "__off_t __fastcall func2(const char *a1)\n{\nstruct stat64 buf; // [rsp+10h] [rbp-A0h] BYREF\nint fd[2]; // [rsp+A8h] [rbp-8h]\n\n*(_QWORD *)fd = open64(a1, 0);\nif ( *(__int64 *)fd < 0 )\n{\nputs(\"open file error...\");\nexit(-1);\n}\nfstat64(fd[0], &buf);\nreturn buf.st_size;\n}",
"original_code": "long long get_size (char *filename)\n{\nlong long tim;\nstruct stat statbuf;\nif ((tim=open(filename, 00))<0)\n {\n printf(\"open file error...\\n\");\n exit(-1);\n }\nfstat (tim, &statbuf);\nreturn statbuf.st_size;\n}",
"canonical_original_code": "long long get_size(char *filename)\n{\nlong long tim;\nstruct stat statbuf;\nif ((tim=open(filename, 00))<0)\n {\n printf(\"open file error...\\n\");\n exit(-1);\n }\nfstat (tim, &statbuf);\nreturn statbuf.st_size;\n}",
"variable_types": [
[
"filename",
"char *"
],
[
"tim",
"long long"
],
[
"statbuf",
"struct stat { unsigned long st_dev; unsigned long st_ino; unsigned long st_nlink; unsigned int st_mode; unsigned int st_uid; unsigned int st_gid; int __pad0; unsigned long st_rdev; long st_size; long st_blksize; long st_blocks; struct timespec { long tv_sec; long tv_nsec; } st_atim; struct timespec st_mtim; struct timespec st_ctim; long __glibc_reserved[3]; }"
]
],
"return_type": "long long",
"user_defined_types": [
"struct stat { unsigned long st_dev; unsigned long st_ino; unsigned long st_nlink; unsigned int st_mode; unsigned int st_uid; unsigned int st_gid; int __pad0; unsigned long st_rdev; long st_size; long st_blksize; long st_blocks; struct timespec st_atim; struct timespec st_mtim; struct timespec st_ctim; long __glibc_reserved[3]; }",
"struct timespec { long tv_sec; long tv_nsec; }"
],
"binary_hash": "88ee99794fdd9de9d710918cca90e5c8483fc1e2264fcab5385df935eae5390c"
},
{
"name": "kmer_suggestion",
"canonical_name": "func3",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall kmer_suggestion(__int64 a1)\n{\nif ( a1 <= 10485759 )\nreturn 15LL;\nif ( a1 <= 20971519 )\nreturn 16LL;\nif ( a1 <= 52428799 )\nreturn 17LL;\nif ( a1 <= 104857599 )\nreturn 18LL;\nif ( a1 > 524287999 )\nreturn 20LL;\nreturn 19LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1)\n{\nif ( a1 <= 10485759 )\nreturn 15LL;\nif ( a1 <= 20971519 )\nreturn 16LL;\nif ( a1 <= 52428799 )\nreturn 17LL;\nif ( a1 <= 104857599 )\nreturn 18LL;\nif ( a1 > 524287999 )\nreturn 20LL;\nreturn 19LL;\n}",
"original_code": "int kmer_suggestion (long long size)\n{\n if (size<10*1048576)\n {\n return 15;\n }\n else if (size<20*1048576)\n {\n return 16;\n }\n else if (size<50*1048576)\n {\n return 17;\n }\n else if (size<100*1048576)\n {\n return 18;\n }\n else if (size<500*1048576)\n {\n return 19;\n }\n else\n {\n return 20;\n }\n}",
"canonical_original_code": "int kmer_suggestion(long long size)\n{\n if (size<10*1048576)\n {\n return 15;\n }\n else if (size<20*1048576)\n {\n return 16;\n }\n else if (size<50*1048576)\n {\n return 17;\n }\n else if (size<100*1048576)\n {\n return 18;\n }\n else if (size<500*1048576)\n {\n return 19;\n }\n else\n {\n return 20;\n }\n}",
"variable_types": [
[
"size",
"long long"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "88ee99794fdd9de9d710918cca90e5c8483fc1e2264fcab5385df935eae5390c"
},
{
"name": "mco_suggestion",
"canonical_name": "func4",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "float __fastcall mco_suggestion(int a1)\n{\nfloat result; // xmm0_4\n\nswitch ( a1 )\n{\ncase 15:\nresult = 0.40000001;\nbreak;\ncase 16:\nresult = 0.30000001;\nbreak;\ncase 17:\nresult = 0.30000001;\nbreak;\ncase 18:\nresult = 0.30000001;\nbreak;\ncase 19:\nresult = 0.40000001;\nbreak;\ncase 20:\nresult = 0.30000001;\nbreak;\ndefault:\nresult = 0.40000001;\nbreak;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "float __fastcall func4(int a1)\n{\nfloat result; // xmm0_4\n\nswitch ( a1 )\n{\ncase 15:\nresult = 0.40000001;\nbreak;\ncase 16:\nresult = 0.30000001;\nbreak;\ncase 17:\nresult = 0.30000001;\nbreak;\ncase 18:\nresult = 0.30000001;\nbreak;\ncase 19:\nresult = 0.40000001;\nbreak;\ncase 20:\nresult = 0.30000001;\nbreak;\ndefault:\nresult = 0.40000001;\nbreak;\n}\nreturn result;\n}",
"original_code": "float mco_suggestion (int k_mer)\n{\nswitch (k_mer)\n {\n case 15:\n return 0.4;\n case 16:\n return 0.3;\n case 17:\n return 0.3;\n case 18:\n return 0.3;\n case 19:\n return 0.4;\n case 20:\n return 0.3;\n default:\n return 0.4;\n }\n}",
"canonical_original_code": "float mco_suggestion(int k_mer)\n{\nswitch (k_mer)\n {\n case 15:\n return 0.4;\n case 16:\n return 0.3;\n case 17:\n return 0.3;\n case 18:\n return 0.3;\n case 19:\n return 0.4;\n case 20:\n return 0.3;\n default:\n return 0.4;\n }\n}",
"variable_types": [
[
"k_mer",
"int"
]
],
"return_type": "float",
"user_defined_types": [],
"binary_hash": "88ee99794fdd9de9d710918cca90e5c8483fc1e2264fcab5385df935eae5390c"
},
{
"name": "get_suggestion",
"canonical_name": "func5",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall get_suggestion(__int64 a1, __int64 a2, double a3)\n{\n*(_QWORD *)(a1 + 16) = a2;\n*(double *)(a1 + 24) = a3;\nget_rec(a1);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1, __int64 a2, double a3)\n{\n*(_QWORD *)(a1 + 16) = a2;\n*(double *)(a1 + 24) = a3;\nfunc7(a1);\nreturn 0LL;\n}",
"original_code": "int\nget_suggestion (struct bloomstat *stats, unsigned long long n, double e)\n{\n stats->capacity = n;\n stats->e = e;\n get_rec (stats);\n return 0;\n}",
"canonical_original_code": "int get_suggestion(struct bloomstat *stats, unsigned long long n, double e)\n{\n stats->capacity = n;\n stats->e = e;\n get_rec (stats);\n return 0;\n}",
"variable_types": [
[
"stats",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } *"
],
[
"n",
"unsigned long long"
],
[
"e",
"double"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "88ee99794fdd9de9d710918cca90e5c8483fc1e2264fcab5385df935eae5390c"
},
{
"name": "find_close_prime",
"canonical_name": "func6",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall find_close_prime(__int64 a1)\n{\n__int64 v2; // [rsp+8h] [rbp-8h]\n\nv2 = a1;\nif ( (a1 & 1) == 0 )\nv2 = a1 + 1;\nwhile ( !(unsigned int)is_prime(v2) )\nv2 += 2LL;\nreturn v2;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func6(__int64 a1)\n{\n__int64 v2; // [rsp+8h] [rbp-8h]\n\nv2 = a1;\nif ( (a1 & 1) == 0 )\nv2 = a1 + 1;\nwhile ( !(unsigned int)func8(v2) )\nv2 += 2LL;\nreturn v2;\n}",
"original_code": "unsigned long long\nfind_close_prime (unsigned long long m)\n{\n if ((m % 2) == 0)\n m += 1;\n while (!is_prime (m))\n {\n m += 2;\n }\n return m;\n}",
"canonical_original_code": "unsigned long long find_close_prime(unsigned long long m)\n{\n if ((m % 2) == 0)\n m += 1;\n while (!is_prime (m))\n {\n m += 2;\n }\n return m;\n}",
"variable_types": [
[
"m",
"unsigned long long"
]
],
"return_type": "unsigned long long",
"user_defined_types": [],
"binary_hash": "88ee99794fdd9de9d710918cca90e5c8483fc1e2264fcab5385df935eae5390c"
},
{
"name": "get_rec",
"canonical_name": "func7",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall get_rec(__int64 a1)\n{\n__int64 result; // rax\n\n*(_DWORD *)(a1 + 8) = (int)((double)(int)log(*(double *)(a1 + 24)) / -0.6931471805599453);\n*(_QWORD *)a1 = find_close_prime(13 * *(int *)(a1 + 8) * *(_QWORD *)(a1 + 16) / 9uLL);\nresult = a1;\n*(_DWORD *)(a1 + 8) = 9LL * *(_QWORD *)a1 / (unsigned __int64)(13LL * *(_QWORD *)(a1 + 16));\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func7(__int64 a1)\n{\n__int64 result; // rax\n\n*(_DWORD *)(a1 + 8) = (int)((double)(int)log(*(double *)(a1 + 24)) / -0.6931471805599453);\n*(_QWORD *)a1 = func6(13 * *(int *)(a1 + 8) * *(_QWORD *)(a1 + 16) / 9uLL);\nresult = a1;\n*(_DWORD *)(a1 + 8) = 9LL * *(_QWORD *)a1 / (unsigned __int64)(13LL * *(_QWORD *)(a1 + 16));\nreturn result;\n}",
"original_code": "void\nget_rec (struct bloomstat *stat)\n{\n stat->ideal_hashes = (int) log (stat->e) / log (0.5);\n stat->elements =\n find_close_prime ((unsigned long long) 13 * stat->capacity *\n (unsigned long long) stat->ideal_hashes / (unsigned long long) 9);\n stat->ideal_hashes = 9 * stat->elements / (13 * stat->capacity);\n}",
"canonical_original_code": "void get_rec(struct bloomstat *stat)\n{\n stat->ideal_hashes = (int) log (stat->e) / log (0.5);\n stat->elements =\n find_close_prime ((unsigned long long) 13 * stat->capacity *\n (unsigned long long) stat->ideal_hashes / (unsigned long long) 9);\n stat->ideal_hashes = 9 * stat->elements / (13 * stat->capacity);\n}",
"variable_types": [
[
"stat",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "88ee99794fdd9de9d710918cca90e5c8483fc1e2264fcab5385df935eae5390c"
},
{
"name": "is_prime",
"canonical_name": "func8",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "unsigned __int64 __fastcall is_prime(unsigned __int64 a1)\n{\ndouble v1; // xmm0_8\nunsigned __int64 v3; // [rsp+10h] [rbp-10h]\nunsigned __int64 v4; // [rsp+18h] [rbp-8h]\n\nv1 = sqrt((double)a1);\nif ( v1 >= 9.223372036854776e18 )\nv3 = (unsigned int)(int)(v1 - 9.223372036854776e18) ^ 0x8000000000000000LL;\nelse\nv3 = (unsigned int)(int)v1;\nv4 = 3LL;\nif ( (a1 & 1) == 0 && a1 != 2 )\nreturn 0LL;\nwhile ( a1 % v4 && v4 < v3 )\n{\nif ( !(a1 % (v4 + 2)) )\nreturn 0LL;\nif ( !(a1 % (v4 + 4)) )\nreturn 0LL;\nv4 += 8LL;\n}\nreturn (int)a1 % v4;\n}\n",
"canonical_decompiled_code": "unsigned __int64 __fastcall func8(unsigned __int64 a1)\n{\ndouble v1; // xmm0_8\nunsigned __int64 v3; // [rsp+10h] [rbp-10h]\nunsigned __int64 v4; // [rsp+18h] [rbp-8h]\n\nv1 = sqrt((double)a1);\nif ( v1 >= 9.223372036854776e18 )\nv3 = (unsigned int)(int)(v1 - 9.223372036854776e18) ^ 0x8000000000000000LL;\nelse\nv3 = (unsigned int)(int)v1;\nv4 = 3LL;\nif ( (a1 & 1) == 0 && a1 != 2 )\nreturn 0LL;\nwhile ( a1 % v4 && v4 < v3 )\n{\nif ( !(a1 % (v4 + 2)) )\nreturn 0LL;\nif ( !(a1 % (v4 + 4)) )\nreturn 0LL;\nv4 += 8LL;\n}\nreturn (int)a1 % v4;\n}",
"original_code": "int\nis_prime (unsigned long long m)\n{\n unsigned long long a = (unsigned long long) ((long double)sqrt((double)(long double) m));\n unsigned long long currval = 3;\n if (m % 2 == 0 && m != 2)\n return 0;\n while (m % currval != 0 && currval < a)\n {\n if (m % (currval + 2) == 0)\n return 0;\n if (m % (currval + 4) == 0)\n return 0;\n currval += 8;\n }\n return (int) m % currval;\n}",
"canonical_original_code": "int is_prime(unsigned long long m)\n{\n unsigned long long a = (unsigned long long) ((long double)sqrt((double)(long double) m));\n unsigned long long currval = 3;\n if (m % 2 == 0 && m != 2)\n return 0;\n while (m % currval != 0 && currval < a)\n {\n if (m % (currval + 2) == 0)\n return 0;\n if (m % (currval + 4) == 0)\n return 0;\n currval += 8;\n }\n return (int) m % currval;\n}",
"variable_types": [
[
"m",
"unsigned long long"
],
[
"a",
"unsigned long long"
],
[
"currval",
"unsigned long long"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "88ee99794fdd9de9d710918cca90e5c8483fc1e2264fcab5385df935eae5390c"
}
] |
99d11d67e9acc0c38bf21101d3924860e16dfa3b378c2e015c660cbee3cc3a5b | tzcoolman/FACS-OLD | [
[
"query_usage",
"->",
"bq_main"
],
[
"bq_main",
"->",
"query_usage",
"query"
],
[
"query",
"->",
"bq_main",
"CHUNKer",
"clean_list"
],
[
"strrstr",
"->",
"CHUNKer",
"CHUNKgz"
],
[
"clean_list",
"->",
"query"
],
[
"CHUNKer",
"->",
"query",
"strrstr"
],
[
"CHUNKgz",
"->",
"strrstr"
],
[
"query__omp_fn_0",
"->"
],
[
"query__omp_fn_1",
"->"
]
] | [
[
"query__omp_fn_0",
"__int64 __fastcall func7(__int64 a1)\n{\n__int64 result; // rax\n__int128 v2; // [rsp+10h] [rbp-70h] BYREF\n__int64 v3; // [rsp+20h] [rbp-60h]\n__int64 v4; // [rsp+28h] [rbp-58h]\n__int64 v5; // [rsp+30h] [rbp-50h]\n__int64 v6; // [rsp+38h] [rbp-48h]\nint v7; // [rsp+40h] [rbp-40h]\n__int128 v8; // [rsp+50h] [rbp-30h]\nint v9; // [rsp+64h] [rbp-1Ch]\n__int64 v10; // [rsp+68h] [rbp-18h]\n__int64 v11; // [rsp+70h] [rbp-10h]\n__int64 v12; // [rsp+78h] [rbp-8h]\n\nv12 = *(_QWORD *)(a1 + 40);\nv11 = *(_QWORD *)(a1 + 24);\nv10 = *(_QWORD *)(a1 + 16);\nv9 = *(_DWORD *)(a1 + 48);\nv8 = *(_OWORD *)a1;\nresult = GOMP_single_start();\nif ( (_BYTE)result == 1 )\n{\nwhile ( 1 )\n{\nresult = *(_QWORD *)(a1 + 32);\nif ( result == v12 )\nbreak;\nv6 = *(_QWORD *)(a1 + 32);\nv5 = v12;\nv4 = v11;\nv3 = v10;\nv7 = v9;\nv2 = v8;\nGOMP_task(query__omp_fn_1, &v2, 0LL, 56LL, 8LL, 1LL, 0LL, 0LL, 0LL);\n*(_QWORD *)(a1 + 32) = *(_QWORD *)(*(_QWORD *)(a1 + 32) + 24LL);\n}\n}\nreturn result;\n}"
],
[
"query__omp_fn_1",
"__int64 __fastcall func8(__int64 a1)\n{\n__int64 result; // rax\ndouble v2; // xmm0_8\n__m128i v3; // xmm2\n__m128i v4; // xmm3\ndouble v5; // [rsp+20h] [rbp-30h]\n__int64 v6; // [rsp+30h] [rbp-20h]\n__int64 v7; // [rsp+38h] [rbp-18h]\n__int64 v8; // [rsp+40h] [rbp-10h]\n__int64 *v9; // [rsp+48h] [rbp-8h]\n\nv9 = *(__int64 **)(a1 + 40);\nv8 = *(_QWORD *)(a1 + 32);\nv7 = *(_QWORD *)(a1 + 24);\nv6 = *(_QWORD *)(a1 + 16);\nv5 = *(double *)(a1 + 8);\nresult = *v9;\nif ( *v9 )\n{\nHIDWORD(v2) = 0;\n*(float *)&v2 = *(double *)a1;\nif ( *(_DWORD *)(a1 + 48) == 1 )\n{\nv4 = 0LL;\n*(float *)v4.m128i_i32 = v5;\nresult = fasta_process(v6, v9, v8, v7, *(double *)_mm_cvtsi32_si128(_mm_cvtsi128_si32(v4)).m128i_i64, v2);\n}\nelse\n{\nv3 = 0LL;\n*(float *)v3.m128i_i32 = v5;\nresult = fastq_process(v6, v9, v8, v7, *(double *)_mm_cvtsi32_si128(_mm_cvtsi128_si32(v3)).m128i_i64, v2);\n}\n}\nreturn result;\n}"
]
] | [
{
"name": "query_usage",
"canonical_name": "func0",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 query_usage()\n{\nfwrite(\"\\nUsage: ./facs query [options]\\n\", 1uLL, 0x1FuLL, stderr);\nfwrite(\"Options:\\n\", 1uLL, 9uLL, stderr);\nfwrite(\"\\t-r reference bloom filter to query against\\n\", 1uLL, 0x2CuLL, stderr);\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 func0()\n{\nfwrite(\"\\nUsage: ./facs query [options]\\n\", 1uLL, 0x1FuLL, stderr);\nfwrite(\"Options:\\n\", 1uLL, 9uLL, stderr);\nfwrite(\"\\t-r reference bloom filter to query against\\n\", 1uLL, 0x2CuLL, stderr);\nreturn 1LL;\n}",
"original_code": "static int\nquery_usage(void)\n{\n fprintf(stderr, \"\\nUsage: ./facs query [options]\\n\");\n fprintf(stderr, \"Options:\\n\");\n fprintf(stderr, \"\\t-r reference bloom filter to query against\\n\");\n return 1;\n}",
"canonical_original_code": "static int query_usage()\n{\n fprintf(stderr, \"\\nUsage: ./facs query [options]\\n\");\n fprintf(stderr, \"Options:\\n\");\n fprintf(stderr, \"\\t-r reference bloom filter to query against\\n\");\n return 1;\n}",
"variable_types": [],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "99d11d67e9acc0c38bf21101d3924860e16dfa3b378c2e015c660cbee3cc3a5b"
},
{
"name": "bq_main",
"canonical_name": "func1",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall bq_main(int a1, char *const *a2)\n{\n__int64 result; // rax\nfloat v3; // xmm0_4\nfloat v4; // xmm0_4\nint v5; // [rsp+14h] [rbp-2Ch]\nchar *v6; // [rsp+18h] [rbp-28h]\nchar *v7; // [rsp+20h] [rbp-20h]\nchar *v8; // [rsp+28h] [rbp-18h]\nchar *v9; // [rsp+30h] [rbp-10h]\nfloat v10; // [rsp+38h] [rbp-8h]\nfloat v11; // [rsp+3Ch] [rbp-4h]\n\nif ( a1 <= 1 )\nreturn query_usage();\nv11 = 0.0;\nv10 = 1.0;\nv9 = 0LL;\nv8 = 0LL;\nv7 = 0LL;\nv6 = 0LL;\nwhile ( 2 )\n{\nv5 = getopt(a1, a2, \"s:t:r:o:q:l:h\");\nif ( v5 == -1 )\nreturn query(v6, v9, v8, v7, v11, v10);\nswitch ( v5 )\n{\ncase '?':\nprintf(\"Unknown option: -%c\\n\", (unsigned int)(char)optopt);\nresult = query_usage();\nbreak;\ncase 'h':\nreturn query_usage();\ncase 'l':\nif ( optarg )\nv8 = optarg;\ncontinue;\ncase 'o':\nif ( optarg )\nv7 = optarg;\ncontinue;\ncase 'q':\nif ( optarg )\nv6 = optarg;\ncontinue;\ncase 'r':\nif ( optarg )\nv9 = optarg;\ncontinue;\ncase 's':\nif ( optarg )\n{\nv4 = atof(optarg);\nv10 = v4;\n}\ncontinue;\ncase 't':\nif ( optarg )\n{\nv3 = atof(optarg);\nv11 = v3;\n}\ncontinue;\ndefault:\ncontinue;\n}\nbreak;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(int a1, char *const *a2)\n{\n__int64 result; // rax\nfloat v3; // xmm0_4\nfloat v4; // xmm0_4\nint v5; // [rsp+14h] [rbp-2Ch]\nchar *v6; // [rsp+18h] [rbp-28h]\nchar *v7; // [rsp+20h] [rbp-20h]\nchar *v8; // [rsp+28h] [rbp-18h]\nchar *v9; // [rsp+30h] [rbp-10h]\nfloat v10; // [rsp+38h] [rbp-8h]\nfloat v11; // [rsp+3Ch] [rbp-4h]\n\nif ( a1 <= 1 )\nreturn func0();\nv11 = 0.0;\nv10 = 1.0;\nv9 = 0LL;\nv8 = 0LL;\nv7 = 0LL;\nv6 = 0LL;\nwhile ( 2 )\n{\nv5 = getopt(a1, a2, \"s:t:r:o:q:l:h\");\nif ( v5 == -1 )\nreturn func2(v6, v9, v8, v7, v11, v10);\nswitch ( v5 )\n{\ncase '?':\nprintf(\"Unknown option: -%c\\n\", (unsigned int)(char)optopt);\nresult = func0();\nbreak;\ncase 'h':\nreturn func0();\ncase 'l':\nif ( optarg )\nv8 = optarg;\ncontinue;\ncase 'o':\nif ( optarg )\nv7 = optarg;\ncontinue;\ncase 'q':\nif ( optarg )\nv6 = optarg;\ncontinue;\ncase 'r':\nif ( optarg )\nv9 = optarg;\ncontinue;\ncase 's':\nif ( optarg )\n{\nv4 = atof(optarg);\nv10 = v4;\n}\ncontinue;\ncase 't':\nif ( optarg )\n{\nv3 = atof(optarg);\nv11 = v3;\n}\ncontinue;\ndefault:\ncontinue;\n}\nbreak;\n}\nreturn result;\n}",
"original_code": "int bq_main(int argc, char** argv)\n{\n if (argc < 2) return query_usage();\n int opt;\n float tole_rate = 0;\n float sampling_rate = 1;\n char* ref = ((void *)0);\n char* list = ((void *)0);\n char* target_path = ((void *)0);\n char* source = ((void *)0);\n while ((opt = getopt (argc, argv, \"s:t:r:o:q:l:h\")) != -1) {\n switch (opt) {\n case 't':\n (optarg) && ((tole_rate = atof(optarg)), 1);\n break;\n case 's':\n (optarg) && ((sampling_rate = atof(optarg)), 1);\n break;\n case 'o':\n (optarg) && ((target_path = optarg), 1);\n break;\n case 'q':\n (optarg) && (source = optarg, 1);\n break;\n case 'r':\n (optarg) && (ref = optarg, 1);\n break;\n case 'l':\n (optarg) && (list = optarg, 1);\n break;\n case 'h':\n return query_usage();\n case '?':\n printf (\"Unknown option: -%c\\n\", (char) optopt);\n return query_usage();\n }\n }\n return query(source, ref, tole_rate, sampling_rate, list, target_path);\n}",
"canonical_original_code": "int bq_main(int argc, char **argv)\n{\n if (argc < 2) return query_usage();\n int opt;\n float tole_rate = 0;\n float sampling_rate = 1;\n char *ref = ((void *)0);\n char *list = ((void *)0);\n char *target_path = ((void *)0);\n char *source = ((void *)0);\n while ((opt = getopt (argc, argv, \"s:t:r:o:q:l:h\")) != -1) {\n switch (opt) {\n case 't':\n (optarg) && ((tole_rate = atof(optarg)), 1);\n break;\n case 's':\n (optarg) && ((sampling_rate = atof(optarg)), 1);\n break;\n case 'o':\n (optarg) && ((target_path = optarg), 1);\n break;\n case 'q':\n (optarg) && (source = optarg, 1);\n break;\n case 'r':\n (optarg) && (ref = optarg, 1);\n break;\n case 'l':\n (optarg) && (list = optarg, 1);\n break;\n case 'h':\n return query_usage();\n case '?':\n printf (\"Unknown option: -%c\\n\", (char) optopt);\n return query_usage();\n }\n }\n return query(source, ref, tole_rate, sampling_rate, list, target_path);\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char **"
],
[
"opt",
"int"
],
[
"tole_rate",
"float"
],
[
"sampling_rate",
"float"
],
[
"ref",
"char *"
],
[
"list",
"char *"
],
[
"target_path",
"char *"
],
[
"source",
"char *"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "99d11d67e9acc0c38bf21101d3924860e16dfa3b378c2e015c660cbee3cc3a5b"
},
{
"name": "query",
"canonical_name": "func2",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall query(const char *a1, __int64 a2, __int64 a3, __int64 a4, double a5, double a6)\n{\nsize_t v6; // rax\ndouble v10; // [rsp+18h] [rbp-E8h]\n__int64 v11[4]; // [rsp+70h] [rbp-90h] BYREF\n_QWORD *v12; // [rsp+90h] [rbp-70h]\nvoid *v13; // [rsp+98h] [rbp-68h]\nunsigned int v14; // [rsp+A0h] [rbp-60h]\n_QWORD *v15; // [rsp+B0h] [rbp-50h]\nvoid *v16; // [rsp+B8h] [rbp-48h]\n_QWORD *v17; // [rsp+C0h] [rbp-40h]\n__int64 v18; // [rsp+C8h] [rbp-38h]\n_QWORD *v19; // [rsp+D0h] [rbp-30h]\nunsigned int *v20; // [rsp+D8h] [rbp-28h]\nchar *s; // [rsp+E0h] [rbp-20h]\nvoid *v22; // [rsp+E8h] [rbp-18h]\n__int64 v23; // [rsp+F0h] [rbp-10h]\nunsigned int v24; // [rsp+FCh] [rbp-4h]\n\nv10 = a5;\nv24 = 0;\nv23 = 0LL;\nv22 = malloc(0xF4240uLL);\ns = (char *)malloc(0x3B9ACA01uLL);\nv20 = (unsigned int *)malloc(0x48uLL);\nv19 = (_QWORD *)make_list(a2, a3);\nv19[2] = 0LL;\nv19[3] = 0LL;\nv19[4] = 0LL;\n*v19 = a2;\nload_bloom(*v19, v20);\nif ( a5 == 0.0 )\nv10 = mco_suggestion(v20[14]);\nv18 = gzopen64(a1, &unk_DF0);\nif ( strstr(a1, \".fastq\") || strstr(a1, \".fq\") )\nv24 = 2;\nelse\nv24 = 1;\nwhile ( v23 != -1 )\n{\nv23 = CHUNKer(v18, v23, 1000000000LL, s, v24);\nv17 = malloc(0x20uLL);\n*v17 = 0LL;\nv16 = malloc(0x20uLL);\nv17[3] = v16;\nv15 = v17;\nget_parainfo(s, v17);\nv13 = v16;\nv11[3] = (__int64)v19;\nv11[2] = (__int64)v20;\nv14 = v24;\n*(double *)&v11[1] = a6;\n*(double *)v11 = v10;\nv12 = v17;\nGOMP_parallel(query__omp_fn_0, v11, 0LL, 0LL);\nv17 = v12;\nif ( !s )\n{\nperror(\"Cannot memset, wrong position on fastq file\\n\");\nexit(-1);\n}\nv6 = strlen(s);\nmemset(s, 0, v6);\nclean_list(v15, v16);\n}\nfree(s);\nevaluate(v22, *v19, v19);\ngzclose(v18);\nbloom_destroy(v20);\nstatistic_save(v22, a1, a4);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(const char *a1, __int64 a2, __int64 a3, __int64 a4, double a5, double a6)\n{\nsize_t v6; // rax\ndouble v10; // [rsp+18h] [rbp-E8h]\n__int64 v11[4]; // [rsp+70h] [rbp-90h] BYREF\n_QWORD *v12; // [rsp+90h] [rbp-70h]\nvoid *v13; // [rsp+98h] [rbp-68h]\nunsigned int v14; // [rsp+A0h] [rbp-60h]\n_QWORD *v15; // [rsp+B0h] [rbp-50h]\nvoid *v16; // [rsp+B8h] [rbp-48h]\n_QWORD *v17; // [rsp+C0h] [rbp-40h]\n__int64 v18; // [rsp+C8h] [rbp-38h]\n_QWORD *v19; // [rsp+D0h] [rbp-30h]\nunsigned int *v20; // [rsp+D8h] [rbp-28h]\nchar *s; // [rsp+E0h] [rbp-20h]\nvoid *v22; // [rsp+E8h] [rbp-18h]\n__int64 v23; // [rsp+F0h] [rbp-10h]\nunsigned int v24; // [rsp+FCh] [rbp-4h]\n\nv10 = a5;\nv24 = 0;\nv23 = 0LL;\nv22 = malloc(0xF4240uLL);\ns = (char *)malloc(0x3B9ACA01uLL);\nv20 = (unsigned int *)malloc(0x48uLL);\nv19 = (_QWORD *)make_list(a2, a3);\nv19[2] = 0LL;\nv19[3] = 0LL;\nv19[4] = 0LL;\n*v19 = a2;\nload_bloom(*v19, v20);\nif ( a5 == 0.0 )\nv10 = mco_suggestion(v20[14]);\nv18 = gzopen64(a1, &unk_DF0);\nif ( strstr(a1, \".fastq\") || strstr(a1, \".fq\") )\nv24 = 2;\nelse\nv24 = 1;\nwhile ( v23 != -1 )\n{\nv23 = func5(v18, v23, 1000000000LL, s, v24);\nv17 = malloc(0x20uLL);\n*v17 = 0LL;\nv16 = malloc(0x20uLL);\nv17[3] = v16;\nv15 = v17;\nget_parainfo(s, v17);\nv13 = v16;\nv11[3] = (__int64)v19;\nv11[2] = (__int64)v20;\nv14 = v24;\n*(double *)&v11[1] = a6;\n*(double *)v11 = v10;\nv12 = v17;\nGOMP_parallel(query__omp_fn_0, v11, 0LL, 0LL);\nv17 = v12;\nif ( !s )\n{\nperror(\"Cannot memset, wrong position on fastq file\\n\");\nexit(-1);\n}\nv6 = strlen(s);\nmemset(s, 0, v6);\nfunc4(v15, v16);\n}\nfree(s);\nevaluate(v22, *v19, v19);\ngzclose(v18);\nbloom_destroy(v20);\nstatistic_save(v22, a1, a4);\nreturn 0LL;\n}",
"original_code": "int query(char* query, char* bloom_filter, double tole_rate, double sampling_rate, char* list, char* target_path)\n{\n gzFile zip;\n int type = 0;\n long long offset = 0;\n char *detail = (char*) malloc((100*100*100)*sizeof(char));\n char *position = (char*) malloc((1000000000 +1)*sizeof(char));\n bloom *bl_2 = (bloom *) malloc(sizeof(bloom));\n F_set *File_head = make_list (bloom_filter, list);\n File_head->reads_num = 0;\n File_head->reads_contam = 0;\n File_head->hits = 0;\n File_head->filename = bloom_filter;\n load_bloom (File_head->filename, bl_2);\n if (tole_rate==0)\n tole_rate = mco_suggestion (bl_2->k_mer);\n if ((zip = gzopen64(query, \"rb\"))<0) {\n perror(\"query open error...\\n\");\n exit(-1);\n }\n if (strstr(query, \".fastq\") || strstr(query, \".fq\"))\n type = 2;\n else\n type = 1;\n while (offset!=-1) {\n offset = CHUNKer(zip,offset,1000000000,position,type);\n Queue *head = (Queue *) malloc(sizeof(Queue));\n head->location = ((void *)0);\n Queue *tail = (Queue *) malloc(sizeof(Queue));\n head->next = tail;\n Queue *head2 = head;\n get_parainfo (position, head);\n \n#pragma omp parallel\n{\n \n#pragma omp single nowait\n {\n while (head != tail)\n {\n \n#pragma omp task firstprivate(head)\n {\n if (head->location!=((void *)0)) {\n if (type == 1) {\n fasta_process (bl_2, head, tail, File_head, sampling_rate,\n tole_rate);\n } else {\n fastq_process (bl_2, head, tail, File_head, sampling_rate,\n tole_rate);\n }\n }\n }\n head = head->next;\n }\n }\n}\n if (position != ((void *)0)) {\n memset (position, 0, strlen(position));\n }\n else {\n perror(\"Cannot memset, wrong position on fastq file\\n\");\n exit(-1);\n }\n clean_list (head2, tail);\n }\n free(position);\n evaluate (detail, File_head->filename, File_head);\n gzclose(zip);\n bloom_destroy (bl_2);\n statistic_save (detail, query, target_path);\n return 0;\n}",
"canonical_original_code": "int query(char *query, char *bloom_filter, double tole_rate, double sampling_rate, char *list, char *target_path)\n{\n struct gzFile_s *zip;\n int type = 0;\n long long offset = 0;\n char *detail = (char*) malloc((100*100*100)*sizeof(char));\n char *position = (char*) malloc((1000000000 +1)*sizeof(char));\n struct bloom *bl_2 = (bloom *) malloc(sizeof(bloom));\n struct file_list *File_head = make_list (bloom_filter, list);\n File_head->reads_num = 0;\n File_head->reads_contam = 0;\n File_head->hits = 0;\n File_head->filename = bloom_filter;\n load_bloom (File_head->filename, bl_2);\n if (tole_rate==0)\n tole_rate = mco_suggestion (bl_2->k_mer);\n if ((zip = gzopen64(query, \"rb\"))<0) {\n perror(\"query open error...\\n\");\n exit(-1);\n }\n if (strstr(query, \".fastq\") || strstr(query, \".fq\"))\n type = 2;\n else\n type = 1;\n while (offset!=-1) {\n offset = CHUNKer(zip,offset,1000000000,position,type);\n struct info *head = (Queue *) malloc(sizeof(Queue));\n head->location = ((void *)0);\n struct info *tail = (Queue *) malloc(sizeof(Queue));\n head->next = tail;\n struct info *head2 = head;\n get_parainfo (position, head);\n \n#pragma omp parallel\n{\n \n#pragma omp single nowait\n {\n while (head != tail)\n {\n \n#pragma omp task firstprivate(head)\n {\n if (head->location!=((void *)0)) {\n if (type == 1) {\n fasta_process (bl_2, head, tail, File_head, sampling_rate,\n tole_rate);\n } else {\n fastq_process (bl_2, head, tail, File_head, sampling_rate,\n tole_rate);\n }\n }\n }\n head = head->next;\n }\n }\n}\n if (position != ((void *)0)) {\n memset (position, 0, strlen(position));\n }\n else {\n perror(\"Cannot memset, wrong position on fastq file\\n\");\n exit(-1);\n }\n clean_list (head2, tail);\n }\n free(position);\n evaluate (detail, File_head->filename, File_head);\n gzclose(zip);\n bloom_destroy (bl_2);\n statistic_save (detail, query, target_path);\n return 0;\n}",
"variable_types": [
[
"query",
"char *"
],
[
"bloom_filter",
"char *"
],
[
"tole_rate",
"double"
],
[
"sampling_rate",
"double"
],
[
"list",
"char *"
],
[
"target_path",
"char *"
],
[
"zip",
"struct gzFile_s { unsigned int have; unsigned char *next; long pos; } *"
],
[
"type",
"int"
],
[
"offset",
"long long"
],
[
"detail",
"char *"
],
[
"position",
"char *"
],
[
"bl_2",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"File_head",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; } *"
],
[
"head",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"tail",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"head2",
"struct info { char *location; short *score; short *number; struct info *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct gzFile_s { unsigned int have; unsigned char *next; long pos; }",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; }",
"struct info { char *location; short *score; short *number; struct info *next; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "99d11d67e9acc0c38bf21101d3924860e16dfa3b378c2e015c660cbee3cc3a5b"
},
{
"name": "strrstr",
"canonical_name": "func3",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "const char *__fastcall strrstr(const char *a1, const char *a2)\n{\nsize_t v2; // rax\nconst char *s1; // [rsp+18h] [rbp-8h]\n\nfor ( s1 = &a1[(int)strlen(a1) - 1]; s1 >= a1; --s1 )\n{\nif ( *s1 == *a2 )\n{\nv2 = strlen(a2);\nif ( !memcmp(s1, a2, v2) )\nreturn s1;\n}\n}\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "const char *__fastcall func3(const char *a1, const char *a2)\n{\nsize_t v2; // rax\nconst char *s1; // [rsp+18h] [rbp-8h]\n\nfor ( s1 = &a1[(int)strlen(a1) - 1]; s1 >= a1; --s1 )\n{\nif ( *s1 == *a2 )\n{\nv2 = strlen(a2);\nif ( !memcmp(s1, a2, v2) )\nreturn s1;\n}\n}\nreturn 0LL;\n}",
"original_code": "char *strrstr(char *s, char *str)\n{\n char *p;\n int len = strlen(s);\n for (p = s + len - 1; p >= s; p--) {\n if ((*p == *str) && (memcmp(p, str, strlen(str)) == 0))\n return p;\n }\n return ((void *)0);\n}",
"canonical_original_code": "char *strrstr(char *s, char *str)\n{\n char *p;\n int len = strlen(s);\n for (p = s + len - 1; p >= s; p--) {\n if ((*p == *str) && (memcmp(p, str, strlen(str)) == 0))\n return p;\n }\n return ((void *)0);\n}",
"variable_types": [
[
"s",
"char *"
],
[
"str",
"char *"
],
[
"p",
"char *"
],
[
"len",
"int"
]
],
"return_type": "char *",
"user_defined_types": [],
"binary_hash": "99d11d67e9acc0c38bf21101d3924860e16dfa3b378c2e015c660cbee3cc3a5b"
},
{
"name": "clean_list",
"canonical_name": "func4",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "void __fastcall clean_list(_QWORD *a1, _QWORD *a2)\n{\n_QWORD *v3; // [rsp+18h] [rbp-8h]\n\nwhile ( a1 != a2 )\n{\nv3 = (_QWORD *)a1[3];\nmemset(a1, 0, 0x20uLL);\nfree(a1);\na1 = v3;\n}\nfree(a2);\n}\n",
"canonical_decompiled_code": "void __fastcall func4(_QWORD *a1, _QWORD *a2)\n{\n_QWORD *v3; // [rsp+18h] [rbp-8h]\n\nwhile ( a1 != a2 )\n{\nv3 = (_QWORD *)a1[3];\nmemset(a1, 0, 0x20uLL);\nfree(a1);\na1 = v3;\n}\nfree(a2);\n}",
"original_code": "void clean_list (Queue* head, Queue *tail)\n{\nQueue *element;\nwhile (head!=tail)\n {\n element = head->next;\n memset(head,0,sizeof(Queue));\n free(head);\n head = element;\n }\nfree(tail);\n}",
"canonical_original_code": "void clean_list(struct info *head, struct info *tail)\n{\nstruct info *element;\nwhile (head!=tail)\n {\n element = head->next;\n memset(head,0,sizeof(Queue));\n free(head);\n head = element;\n }\nfree(tail);\n}",
"variable_types": [
[
"head",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"tail",
"struct info *"
],
[
"element",
"struct info { char *location; short *score; short *number; struct info *next; } *"
]
],
"return_type": "void",
"user_defined_types": [
"struct info { char *location; short *score; short *number; struct info *next; }"
],
"binary_hash": "99d11d67e9acc0c38bf21101d3924860e16dfa3b378c2e015c660cbee3cc3a5b"
},
{
"name": "CHUNKer",
"canonical_name": "func5",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall CHUNKer(__int64 a1, __int64 a2, signed int a3, const char *a4, int a5)\n{\nchar *v5; // rax\nchar v6; // al\nconst char *v7; // rax\nsize_t v8; // rax\n__int64 v13; // [rsp+10h] [rbp-30h]\nint v14; // [rsp+2Ch] [rbp-14h]\nchar *v15; // [rsp+30h] [rbp-10h]\nchar v16; // [rsp+3Fh] [rbp-1h]\n\nv13 = a2;\nv15 = 0LL;\nv14 = 0;\nif ( a5 == 2 )\nv16 = 64;\nelse\nv16 = 62;\nif ( !a2 )\n{\nwhile ( v13 <= 999 )\n{\nif ( *(_DWORD *)a1 )\n{\n--*(_DWORD *)a1;\n++*(_QWORD *)(a1 + 16);\nv5 = *(char **)(a1 + 8);\n*(_QWORD *)(a1 + 8) = v5 + 1;\nv6 = *v5;\n}\nelse\n{\nv6 = gzgetc(a1);\n}\nif ( v6 == v16 )\nbreak;\n++v13;\n}\n}\ngzseek64(a1, v13, 0LL);\ngzread(a1, a4, (unsigned int)a3);\nif ( a4 )\nv14 = strlen(a4);\nif ( v14 >= a3 )\n{\nif ( a5 == 2 )\n{\nv7 = strrstr(a4, \"\\n+\");\nv15 = (char *)bac_2_n(v7 - 1);\n}\nelse\n{\nv15 = strrchr(a4, 62) - 1;\n}\n}\nif ( v15 )\n{\nv13 += v15 - a4;\nv8 = strlen(v15);\nmemset(v15, 0, v8);\n}\nif ( v14 < a3 )\nv13 = -1LL;\nreturn v13;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1, __int64 a2, signed int a3, const char *a4, int a5)\n{\nchar *v5; // rax\nchar v6; // al\nconst char *v7; // rax\nsize_t v8; // rax\n__int64 v13; // [rsp+10h] [rbp-30h]\nint v14; // [rsp+2Ch] [rbp-14h]\nchar *v15; // [rsp+30h] [rbp-10h]\nchar v16; // [rsp+3Fh] [rbp-1h]\n\nv13 = a2;\nv15 = 0LL;\nv14 = 0;\nif ( a5 == 2 )\nv16 = 64;\nelse\nv16 = 62;\nif ( !a2 )\n{\nwhile ( v13 <= 999 )\n{\nif ( *(_DWORD *)a1 )\n{\n--*(_DWORD *)a1;\n++*(_QWORD *)(a1 + 16);\nv5 = *(char **)(a1 + 8);\n*(_QWORD *)(a1 + 8) = v5 + 1;\nv6 = *v5;\n}\nelse\n{\nv6 = gzgetc(a1);\n}\nif ( v6 == v16 )\nbreak;\n++v13;\n}\n}\ngzseek64(a1, v13, 0LL);\ngzread(a1, a4, (unsigned int)a3);\nif ( a4 )\nv14 = strlen(a4);\nif ( v14 >= a3 )\n{\nif ( a5 == 2 )\n{\nv7 = func3(a4, \"\\n+\");\nv15 = (char *)bac_2_n(v7 - 1);\n}\nelse\n{\nv15 = strrchr(a4, 62) - 1;\n}\n}\nif ( v15 )\n{\nv13 += v15 - a4;\nv8 = strlen(v15);\nmemset(v15, 0, v8);\n}\nif ( v14 < a3 )\nv13 = -1LL;\nreturn v13;\n}",
"original_code": "long long CHUNKer(gzFile zip,long long offset,int chunk,char *data,int type)\n{\n char c, v;\n char *pos = ((void *)0);\n int length = 0;\n if (type == 2)\n v = '@';\n else\n v = '>';\n if (offset == 0)\n while (offset <10*100)\n {\n c = ((zip)->have ? ((zip)->have--, (zip)->pos++, *((zip)->next)++) : (gzgetc)(zip));\n if (c == v)\n break;\n offset++;\n }\n gzseek64 (zip,offset,0);\n gzread (zip,data,chunk);\n if (data != ((void *)0))\n length = strlen(data);\n if (length>=chunk) {\n if (type == 2) {\n pos = strrstr (data,\"\\n+\");\n pos = bac_2_n (pos-1);\n } else {\n pos = strrchr (data,'>')-1;\n }\n }\n if (pos) {\n offset += (pos-data);\n memset (pos, 0, strlen(pos));\n }\n if (length<chunk)\n offset=-1;\n return offset;\n}",
"canonical_original_code": "long long CHUNKer(struct gzFile_s *zip, long long offset, int chunk, char *data, int type)\n{\n char c; char v;\n char *pos = ((void *)0);\n int length = 0;\n if (type == 2)\n v = '@';\n else\n v = '>';\n if (offset == 0)\n while (offset <10*100)\n {\n c = ((zip)->have ? ((zip)->have--, (zip)->pos++, *((zip)->next)++) : (gzgetc)(zip));\n if (c == v)\n break;\n offset++;\n }\n gzseek64 (zip,offset,0);\n gzread (zip,data,chunk);\n if (data != ((void *)0))\n length = strlen(data);\n if (length>=chunk) {\n if (type == 2) {\n pos = strrstr (data,\"\\n+\");\n pos = bac_2_n (pos-1);\n } else {\n pos = strrchr (data,'>')-1;\n }\n }\n if (pos) {\n offset += (pos-data);\n memset (pos, 0, strlen(pos));\n }\n if (length<chunk)\n offset=-1;\n return offset;\n}",
"variable_types": [
[
"zip",
"struct gzFile_s { unsigned int have; unsigned char *next; long pos; } *"
],
[
"offset",
"long long"
],
[
"chunk",
"int"
],
[
"data",
"char *"
],
[
"type",
"int"
],
[
"c",
"char"
],
[
"v",
"char"
],
[
"pos",
"char *"
],
[
"length",
"int"
]
],
"return_type": "long long",
"user_defined_types": [
"struct gzFile_s { unsigned int have; unsigned char *next; long pos; }"
],
"binary_hash": "99d11d67e9acc0c38bf21101d3924860e16dfa3b378c2e015c660cbee3cc3a5b"
},
{
"name": "CHUNKgz",
"canonical_name": "func6",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "signed __int64 __fastcall CHUNKgz(__int64 a1, __int64 a2, int a3, char *a4, char *a5)\n{\nsize_t v5; // rax\nchar *v6; // rax\nchar v7; // al\nchar *v10; // [rsp+8h] [rbp-48h]\nchar *s; // [rsp+10h] [rbp-40h]\n__int64 v13; // [rsp+20h] [rbp-30h]\nchar *dest; // [rsp+30h] [rbp-20h]\nconst char *v15; // [rsp+40h] [rbp-10h]\nint v16; // [rsp+4Ch] [rbp-4h]\n\nv13 = a2;\ns = a4;\nmemset(a4, 0, a3);\nv15 = s;\nv16 = 0;\nif ( !a2 )\n{\nwhile ( v13 <= 999 )\n{\nif ( *(_DWORD *)a1 )\n{\n--*(_DWORD *)a1;\n++*(_QWORD *)(a1 + 16);\n++*(_QWORD *)(a1 + 8);\n}\nelse\n{\ngzgetc(a1);\n}\n++v13;\n}\n}\nif ( a5 )\n{\nv5 = strlen(a5);\nmemcpy(s, a5, v5);\ns += strlen(a5);\n}\nfree(a5);\nwhile ( 1 )\n{\nif ( *(_DWORD *)a1 )\n{\n--*(_DWORD *)a1;\n++*(_QWORD *)(a1 + 16);\nv6 = *(char **)(a1 + 8);\n*(_QWORD *)(a1 + 8) = v6 + 1;\nv7 = *v6;\n}\nelse\n{\nv7 = gzgetc(a1);\n}\nif ( v7 == -1 || v16 >= a3 )\nbreak;\n*s++ = v7;\n++v16;\n}\ndest = (char *)strrstr(v15, \"\\n@\");\nv10 = (char *)malloc(s - dest + 1);\nmemcpy(dest, v10, s - dest + 1);\nreturn s - dest + 1 + v13;\n}\n",
"canonical_decompiled_code": "signed __int64 __fastcall func6(__int64 a1, __int64 a2, int a3, char *a4, char *a5)\n{\nsize_t v5; // rax\nchar *v6; // rax\nchar v7; // al\nchar *v10; // [rsp+8h] [rbp-48h]\nchar *s; // [rsp+10h] [rbp-40h]\n__int64 v13; // [rsp+20h] [rbp-30h]\nchar *dest; // [rsp+30h] [rbp-20h]\nconst char *v15; // [rsp+40h] [rbp-10h]\nint v16; // [rsp+4Ch] [rbp-4h]\n\nv13 = a2;\ns = a4;\nmemset(a4, 0, a3);\nv15 = s;\nv16 = 0;\nif ( !a2 )\n{\nwhile ( v13 <= 999 )\n{\nif ( *(_DWORD *)a1 )\n{\n--*(_DWORD *)a1;\n++*(_QWORD *)(a1 + 16);\n++*(_QWORD *)(a1 + 8);\n}\nelse\n{\ngzgetc(a1);\n}\n++v13;\n}\n}\nif ( a5 )\n{\nv5 = strlen(a5);\nmemcpy(s, a5, v5);\ns += strlen(a5);\n}\nfree(a5);\nwhile ( 1 )\n{\nif ( *(_DWORD *)a1 )\n{\n--*(_DWORD *)a1;\n++*(_QWORD *)(a1 + 16);\nv6 = *(char **)(a1 + 8);\n*(_QWORD *)(a1 + 8) = v6 + 1;\nv7 = *v6;\n}\nelse\n{\nv7 = gzgetc(a1);\n}\nif ( v7 == -1 || v16 >= a3 )\nbreak;\n*s++ = v7;\n++v16;\n}\ndest = (char *)func3(v15, \"\\n@\");\nv10 = (char *)malloc(s - dest + 1);\nmemcpy(dest, v10, s - dest + 1);\nreturn s - dest + 1 + v13;\n}",
"original_code": "long long CHUNKgz(gzFile zip, long long offset,int chunk,char *position,char *extra,int type)\n{\n memset(position,0,chunk);\n char c, *position2 = position;\n char *x;\n int num=0;\n if (offset == 0)\n while (offset <10*100)\n {\n c = ((zip)->have ? ((zip)->have--, (zip)->pos++, *((zip)->next)++) : (gzgetc)(zip));\n if ((c == '@' && type==2)&&(c == '>' && type==1))\n break;\n offset++;\n }\n if (extra!=((void *)0))\n {\n memcpy(position,extra,strlen(extra));\n position+=strlen(extra);\n }\n free(extra);\n while (((c=((zip)->have ? ((zip)->have--, (zip)->pos++, *((zip)->next)++) : (gzgetc)(zip)))!=(-1))&&(num<chunk))\n {\n *position=c;\n position++;\n num++;\n }\n x = strrstr(position2,\"\\n@\");\n extra = (char*)malloc((position-x+1)*sizeof(char));\n memcpy (x,extra,position-x+1);\n offset+=(position-x+1);\n return offset;\n}",
"canonical_original_code": "long long CHUNKgz(struct gzFile_s *zip, long long offset, int chunk, char *position, char *extra, int type)\n{\n memset(position,0,chunk);\n char c; char *position2 = position;\n char *x;\n int num = 0;\n if (offset == 0)\n while (offset <10*100)\n {\n c = ((zip)->have ? ((zip)->have--, (zip)->pos++, *((zip)->next)++) : (gzgetc)(zip));\n if ((c == '@' && type==2)&&(c == '>' && type==1))\n break;\n offset++;\n }\n if (extra!=((void *)0))\n {\n memcpy(position,extra,strlen(extra));\n position+=strlen(extra);\n }\n free(extra);\n while (((c=((zip)->have ? ((zip)->have--, (zip)->pos++, *((zip)->next)++) : (gzgetc)(zip)))!=(-1))&&(num<chunk))\n {\n *position=c;\n position++;\n num++;\n }\n x = strrstr(position2,\"\\n@\");\n extra = (char *)malloc((position-x+1)*sizeof(char));\n memcpy (x,extra,position-x+1);\n offset+=(position-x+1);\n return offset;\n}",
"variable_types": [
[
"zip",
"struct gzFile_s { unsigned int have; unsigned char *next; long pos; } *"
],
[
"offset",
"long long"
],
[
"chunk",
"int"
],
[
"position",
"char *"
],
[
"extra",
"char *"
],
[
"type",
"int"
],
[
"c",
"char"
],
[
"position2",
"char *"
],
[
"x",
"char *"
],
[
"num",
"int"
]
],
"return_type": "long long",
"user_defined_types": [
"struct gzFile_s { unsigned int have; unsigned char *next; long pos; }"
],
"binary_hash": "99d11d67e9acc0c38bf21101d3924860e16dfa3b378c2e015c660cbee3cc3a5b"
}
] |
a964a8a3212ed086312717a28418a2b1eca97625b9f65d0bfd1ef12fdf5c1214 | tzcoolman/FACS-OLD | [
[
"check_main",
"->",
"check_all"
],
[
"check_all",
"->",
"check_main",
"evaluate",
"statistic_save"
],
[
"fastq_process",
"->",
"check_all__omp_fn_1"
],
[
"fasta_process",
"->",
"check_all__omp_fn_1"
],
[
"evaluate",
"->",
"check_all"
],
[
"statistic_save",
"->",
"check_all"
],
[
"check_all__omp_fn_0",
"->"
],
[
"check_all__omp_fn_1",
"->",
"fasta_process",
"fastq_process"
]
] | [
[
"check_all__omp_fn_0",
"__int64 __fastcall func6(__int64 a1)\n{\n__int64 result; // rax\n__int64 v2[5]; // [rsp+10h] [rbp-60h] BYREF\nint v3; // [rsp+38h] [rbp-38h]\n__int64 v4; // [rsp+4Ch] [rbp-24h]\nint v5; // [rsp+54h] [rbp-1Ch]\n__int64 v6; // [rsp+58h] [rbp-18h]\n__int64 v7; // [rsp+60h] [rbp-10h]\n__int64 v8; // [rsp+68h] [rbp-8h]\n\nv8 = *(_QWORD *)(a1 + 24);\nv7 = *(_QWORD *)(a1 + 16);\nv6 = *(_QWORD *)(a1 + 8);\nv5 = *(_DWORD *)(a1 + 40);\nv4 = *(_QWORD *)(a1 + 32);\nresult = GOMP_single_start();\nif ( (_BYTE)result == 1 )\n{\nwhile ( 1 )\n{\nresult = *(_QWORD *)a1;\nif ( *(_QWORD *)a1 == v6 )\nbreak;\nv2[3] = *(_QWORD *)a1;\nv2[2] = v8;\nv2[1] = v7;\nv2[0] = v6;\nv3 = v5;\nv2[4] = v4;\nGOMP_task(check_all__omp_fn_1, v2, 0LL, 48LL, 8LL, 1LL, 0LL, 0LL, 0LL);\n*(_QWORD *)a1 = *(_QWORD *)(*(_QWORD *)a1 + 24LL);\n}\n}\nreturn result;\n}"
],
[
"check_all__omp_fn_1",
"void __fastcall func7(__int64 a1)\n{\nfloat v1; // [rsp+14h] [rbp-2Ch]\nfloat v2; // [rsp+18h] [rbp-28h]\n__int64 v3; // [rsp+20h] [rbp-20h]\n__int64 v4; // [rsp+28h] [rbp-18h]\n__int64 v5; // [rsp+30h] [rbp-10h]\n_QWORD *v6; // [rsp+38h] [rbp-8h]\n\nv6 = *(_QWORD **)(a1 + 24);\nv5 = *(_QWORD *)(a1 + 16);\nv4 = *(_QWORD *)(a1 + 8);\nv3 = *(_QWORD *)a1;\nv2 = *(float *)(a1 + 36);\nv1 = *(float *)(a1 + 32);\nif ( *v6 )\n{\nif ( *(_DWORD *)(a1 + 40) == 1 )\nfunc3(v4, (__int64)v6, v3, v5, v2, v1);\nelse\nfunc2(v4, (__int64)v6, v3, v5, v2, v1);\n}\n}"
]
] | [
{
"name": "check_main",
"canonical_name": "func0",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall check_main(int a1, char *const *a2)\n{\nunsigned int v2; // xmm0_4\nfloat v3; // xmm0_4\nint v5; // [rsp+14h] [rbp-2Ch]\nchar *v6; // [rsp+18h] [rbp-28h]\nchar *v7; // [rsp+20h] [rbp-20h]\nchar *v8; // [rsp+28h] [rbp-18h]\nchar *v9; // [rsp+30h] [rbp-10h]\nfloat v10; // [rsp+38h] [rbp-8h]\nunsigned int v11; // [rsp+3Ch] [rbp-4h]\n\nif ( a1 <= 1 )\ncheck_help();\nv11 = 0;\nv10 = 1.0;\nv9 = 0LL;\nv8 = 0LL;\nv7 = 0LL;\nv6 = 0LL;\nwhile ( 1 )\n{\nv5 = getopt(a1, a2, \"s:t:r:o:q:l:h\");\nif ( v5 == -1 )\nreturn check_all(v6, v9, v8, v7, *(double *)_mm_cvtsi32_si128(v11).m128i_i64, v10);\nswitch ( v5 )\n{\ncase '?':\ngoto LABEL_18;\ncase 'h':\ncheck_help();\nLABEL_18:\nprintf(\"Unknown option: -%c\\n\", (unsigned int)(char)optopt);\ncheck_help();\nbreak;\ncase 'l':\nif ( optarg )\nv8 = optarg;\nbreak;\ncase 'o':\nif ( optarg )\nv7 = optarg;\nbreak;\ncase 'q':\nif ( optarg )\nv6 = optarg;\nbreak;\ncase 'r':\nif ( optarg )\nv9 = optarg;\nbreak;\ncase 's':\nif ( optarg )\n{\nv3 = atof(optarg);\nv10 = v3;\n}\nbreak;\ncase 't':\nif ( optarg )\n{\n*(float *)&v2 = atof(optarg);\nv11 = v2;\n}\nbreak;\ndefault:\ncontinue;\n}\n}\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func0(int a1, char *const *a2)\n{\nunsigned int v2; // xmm0_4\nfloat v3; // xmm0_4\nint v5; // [rsp+14h] [rbp-2Ch]\nchar *v6; // [rsp+18h] [rbp-28h]\nchar *v7; // [rsp+20h] [rbp-20h]\nchar *v8; // [rsp+28h] [rbp-18h]\nchar *v9; // [rsp+30h] [rbp-10h]\nfloat v10; // [rsp+38h] [rbp-8h]\nunsigned int v11; // [rsp+3Ch] [rbp-4h]\n\nif ( a1 <= 1 )\ncheck_help();\nv11 = 0;\nv10 = 1.0;\nv9 = 0LL;\nv8 = 0LL;\nv7 = 0LL;\nv6 = 0LL;\nwhile ( 1 )\n{\nv5 = getopt(a1, a2, \"s:t:r:o:q:l:h\");\nif ( v5 == -1 )\nreturn func1(v6, v9, v8, v7, *(double *)_mm_cvtsi32_si128(v11).m128i_i64, v10);\nswitch ( v5 )\n{\ncase '?':\ngoto LABEL_18;\ncase 'h':\ncheck_help();\nLABEL_18:\nprintf(\"Unknown option: -%c\\n\", (unsigned int)(char)optopt);\ncheck_help();\nbreak;\ncase 'l':\nif ( optarg )\nv8 = optarg;\nbreak;\ncase 'o':\nif ( optarg )\nv7 = optarg;\nbreak;\ncase 'q':\nif ( optarg )\nv6 = optarg;\nbreak;\ncase 'r':\nif ( optarg )\nv9 = optarg;\nbreak;\ncase 's':\nif ( optarg )\n{\nv3 = atof(optarg);\nv10 = v3;\n}\nbreak;\ncase 't':\nif ( optarg )\n{\n*(float *)&v2 = atof(optarg);\nv11 = v2;\n}\nbreak;\ndefault:\ncontinue;\n}\n}\n}",
"original_code": "int check_main (int argc, char **argv)\n{\n if (argc<2) check_help();\n int opt;\n float tole_rate = 0;\n float sampling_rate = 1;\n char* ref = ((void *)0);\n char* list = ((void *)0);\n char* target_path = ((void *)0);\n char* source = ((void *)0);\n while ((opt = getopt (argc, argv, \"s:t:r:o:q:l:h\")) != -1) {\n switch (opt) {\n case 't':\n (optarg) && ((tole_rate = atof(optarg)), 1);\n break;\n case 's':\n (optarg) && ((sampling_rate = atof(optarg)), 1);\n break;\n case 'o':\n (optarg) && ((target_path = optarg), 1);\n break;\n case 'q':\n (optarg) && (source = optarg, 1);\n break;\n case 'r':\n (optarg) && (ref = optarg, 1);\n break;\n case 'l':\n (optarg) && (list = optarg, 1);\n break;\n case 'h':\n check_help();\n case '?':\n printf (\"Unknown option: -%c\\n\", (char) optopt);\n check_help();\n }\n }\n return check_all (source, ref, tole_rate, sampling_rate, list, target_path);\n}",
"canonical_original_code": "int check_main(int argc, char **argv)\n{\n if (argc<2) check_help();\n int opt;\n float tole_rate = 0;\n float sampling_rate = 1;\n char *ref = ((void *)0);\n char *list = ((void *)0);\n char *target_path = ((void *)0);\n char *source = ((void *)0);\n while ((opt = getopt (argc, argv, \"s:t:r:o:q:l:h\")) != -1) {\n switch (opt) {\n case 't':\n (optarg) && ((tole_rate = atof(optarg)), 1);\n break;\n case 's':\n (optarg) && ((sampling_rate = atof(optarg)), 1);\n break;\n case 'o':\n (optarg) && ((target_path = optarg), 1);\n break;\n case 'q':\n (optarg) && (source = optarg, 1);\n break;\n case 'r':\n (optarg) && (ref = optarg, 1);\n break;\n case 'l':\n (optarg) && (list = optarg, 1);\n break;\n case 'h':\n check_help();\n case '?':\n printf (\"Unknown option: -%c\\n\", (char) optopt);\n check_help();\n }\n }\n return check_all (source, ref, tole_rate, sampling_rate, list, target_path);\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char **"
],
[
"opt",
"int"
],
[
"tole_rate",
"float"
],
[
"sampling_rate",
"float"
],
[
"ref",
"char *"
],
[
"list",
"char *"
],
[
"target_path",
"char *"
],
[
"source",
"char *"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "a964a8a3212ed086312717a28418a2b1eca97625b9f65d0bfd1ef12fdf5c1214"
},
{
"name": "check_all",
"canonical_name": "func1",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall check_all(__int64 a1, __int64 a2, __int64 a3, __int64 a4, float a5, float a6)\n{\n__m128i v6; // xmm0\nsize_t v7; // rax\n__int64 v12[4]; // [rsp+60h] [rbp-70h] BYREF\nfloat v13; // [rsp+80h] [rbp-50h]\nfloat v14; // [rsp+84h] [rbp-4Ch]\nint v15; // [rsp+88h] [rbp-48h]\nchar *v16; // [rsp+90h] [rbp-40h]\n_QWORD *v17; // [rsp+98h] [rbp-38h]\nunsigned int *v18; // [rsp+A0h] [rbp-30h]\nvoid *v19; // [rsp+A8h] [rbp-28h]\nint v20; // [rsp+B4h] [rbp-1Ch]\nvoid *s; // [rsp+B8h] [rbp-18h]\n_QWORD *v22; // [rsp+C0h] [rbp-10h]\n_QWORD *v23; // [rsp+C8h] [rbp-8h]\n\ns = malloc(0xF4240uLL);\nmemset(s, 0, 0xF4240uLL);\nv23 = malloc(0x20uLL);\nv19 = malloc(0x20uLL);\nv18 = (unsigned int *)malloc(0x48uLL);\n*v23 = 0LL;\nv17 = v23;\nv23[3] = v19;\nmalloc(0x38uLL);\nv22 = (_QWORD *)make_list(a2, a3);\nv16 = (char *)mmaping(a1);\nv20 = get_parainfo(v16, v23);\nwhile ( v22 )\n{\nload_bloom(*v22, v18);\nv6 = 0LL;\nif ( a5 == 0.0 )\n{\n*(double *)v6.m128i_i64 = mco_suggestion(v18[14]);\na5 = COERCE_FLOAT(_mm_cvtsi128_si32(v6));\n}\nv12[3] = (__int64)v22;\nv12[2] = (__int64)v18;\nv12[1] = (__int64)v19;\nv15 = v20;\nv14 = a6;\nv13 = a5;\nv12[0] = (__int64)v23;\nGOMP_parallel(check_all__omp_fn_0, v12, 0LL, 0LL);\nv23 = (_QWORD *)v12[0];\nevaluate(s, *v22, v22);\nv22 = (_QWORD *)v22[6];\nv23 = v17;\nbloom_destroy(v18);\n}\nstatistic_save(s, a1, a4);\nv7 = strlen(v16);\nmunmap(v16, v7);\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(__int64 a1, __int64 a2, __int64 a3, __int64 a4, float a5, float a6)\n{\n__m128i v6; // xmm0\nsize_t v7; // rax\n__int64 v12[4]; // [rsp+60h] [rbp-70h] BYREF\nfloat v13; // [rsp+80h] [rbp-50h]\nfloat v14; // [rsp+84h] [rbp-4Ch]\nint v15; // [rsp+88h] [rbp-48h]\nchar *v16; // [rsp+90h] [rbp-40h]\n_QWORD *v17; // [rsp+98h] [rbp-38h]\nunsigned int *v18; // [rsp+A0h] [rbp-30h]\nvoid *v19; // [rsp+A8h] [rbp-28h]\nint v20; // [rsp+B4h] [rbp-1Ch]\nvoid *s; // [rsp+B8h] [rbp-18h]\n_QWORD *v22; // [rsp+C0h] [rbp-10h]\n_QWORD *v23; // [rsp+C8h] [rbp-8h]\n\ns = malloc(0xF4240uLL);\nmemset(s, 0, 0xF4240uLL);\nv23 = malloc(0x20uLL);\nv19 = malloc(0x20uLL);\nv18 = (unsigned int *)malloc(0x48uLL);\n*v23 = 0LL;\nv17 = v23;\nv23[3] = v19;\nmalloc(0x38uLL);\nv22 = (_QWORD *)make_list(a2, a3);\nv16 = (char *)mmaping(a1);\nv20 = get_parainfo(v16, v23);\nwhile ( v22 )\n{\nload_bloom(*v22, v18);\nv6 = 0LL;\nif ( a5 == 0.0 )\n{\n*(double *)v6.m128i_i64 = mco_suggestion(v18[14]);\na5 = COERCE_FLOAT(_mm_cvtsi128_si32(v6));\n}\nv12[3] = (__int64)v22;\nv12[2] = (__int64)v18;\nv12[1] = (__int64)v19;\nv15 = v20;\nv14 = a6;\nv13 = a5;\nv12[0] = (__int64)v23;\nGOMP_parallel(check_all__omp_fn_0, v12, 0LL, 0LL);\nv23 = (_QWORD *)v12[0];\nfunc4(s, *v22, v22);\nv22 = (_QWORD *)v22[6];\nv23 = v17;\nbloom_destroy(v18);\n}\nfunc5(s, a1, a4);\nv7 = strlen(v16);\nmunmap(v16, v7);\nreturn 1LL;\n}",
"original_code": "int check_all (char *source, char *ref, float tole_rate, float sampling_rate, char *list, char *prefix)\n{\n char *position;\n char *detail = (char *) malloc (1000 * 1000 * sizeof (char));\n memset (detail, 0, 1000 * 1000);\n int type = 0;\n Queue *head = (Queue *) malloc(sizeof(Queue));\n Queue *tail = (Queue *) malloc(sizeof(Queue));\n bloom *bl_2 = (bloom *) malloc(sizeof(bloom));\n Queue *head2;\n head->location=((void *)0);\n head2 = head;\n head->next = tail;\n F_set *File_head = (F_set *) malloc(sizeof(F_set));\n File_head = make_list (ref, list);\n position = mmaping (source);\n type = get_parainfo (position,head);\n while (File_head!=((void *)0))\n {\n load_bloom (File_head->filename, bl_2);\n if (tole_rate==0)\n tole_rate = mco_suggestion(bl_2->k_mer);\n \n#pragma omp parallel\n {\n \n#pragma omp single nowait\n {\n while (head != tail) {\n \n#pragma omp task firstprivate(head)\n {\n if (head->location!=((void *)0))\n {\n if (type == 1)\n fasta_process (bl_2, head, tail, File_head, sampling_rate,\n tole_rate);\n else\n fastq_process (bl_2, head, tail, File_head, sampling_rate,\n tole_rate);\n }\n }\n head = head->next;\n }\n }\n }\n evaluate (detail, File_head->filename, File_head);\n File_head = File_head->next;\n head = head2;\n bloom_destroy (bl_2);\n }\n statistic_save (detail, source, prefix);\n munmap (position, strlen (position));\n return 1;\n}",
"canonical_original_code": "int check_all(char *source, char *ref, float tole_rate, float sampling_rate, char *list, char *prefix)\n{\n char *position;\n char *detail = (char *) malloc (1000 * 1000 * sizeof (char));\n memset (detail, 0, 1000 * 1000);\n int type = 0;\n struct info *head = (Queue *) malloc(sizeof(Queue));\n struct info *tail = (Queue *) malloc(sizeof(Queue));\n struct bloom *bl_2 = (bloom *) malloc(sizeof(bloom));\n struct info *head2;\n head->location=((void *)0);\n head2 = head;\n head->next = tail;\n struct file_list *File_head = (F_set *) malloc(sizeof(F_set));\n File_head = make_list (ref, list);\n position = mmaping (source);\n type = get_parainfo (position,head);\n while (File_head!=((void *)0))\n {\n load_bloom (File_head->filename, bl_2);\n if (tole_rate==0)\n tole_rate = mco_suggestion(bl_2->k_mer);\n \n#pragma omp parallel\n {\n \n#pragma omp single nowait\n {\n while (head != tail) {\n \n#pragma omp task firstprivate(head)\n {\n if (head->location!=((void *)0))\n {\n if (type == 1)\n fasta_process (bl_2, head, tail, File_head, sampling_rate,\n tole_rate);\n else\n fastq_process (bl_2, head, tail, File_head, sampling_rate,\n tole_rate);\n }\n }\n head = head->next;\n }\n }\n }\n evaluate (detail, File_head->filename, File_head);\n File_head = File_head->next;\n head = head2;\n bloom_destroy (bl_2);\n }\n statistic_save (detail, source, prefix);\n munmap (position, strlen (position));\n return 1;\n}",
"variable_types": [
[
"source",
"char *"
],
[
"ref",
"char *"
],
[
"tole_rate",
"float"
],
[
"sampling_rate",
"float"
],
[
"list",
"char *"
],
[
"prefix",
"char *"
],
[
"position",
"char *"
],
[
"detail",
"char *"
],
[
"type",
"int"
],
[
"head",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"tail",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"bl_2",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"head2",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"File_head",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct info { char *location; short *score; short *number; struct info *next; }",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "a964a8a3212ed086312717a28418a2b1eca97625b9f65d0bfd1ef12fdf5c1214"
},
{
"name": "fastq_process",
"canonical_name": "func2",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "void __fastcall fastq_process(__int64 a1, __int64 a2, __int64 a3, __int64 a4, float a5, float a6)\n{\nunsigned int v6; // eax\nchar *v7; // rax\nchar *v8; // rax\n__int64 v10; // [rsp+38h] [rbp-18h]\nchar *v11; // [rsp+40h] [rbp-10h]\nchar *s; // [rsp+48h] [rbp-8h]\nchar *sa; // [rsp+48h] [rbp-8h]\n\ns = *(char **)a2;\nif ( **(_BYTE **)a2 == 64 )\n{\nif ( a3 == *(_QWORD *)(a2 + 24) || !**(_QWORD **)(a2 + 24) )\nv11 = &s[strlen(s)];\nelse\nv11 = **(char ***)(a2 + 24);\nwhile ( s != v11 )\n{\nv10 = jump(s, 2LL, *(double *)_mm_cvtsi32_si128(LODWORD(a5)).m128i_i64);\nif ( s == (char *)v10 )\n{\n_InterlockedAdd64((volatile signed __int64 *)(a4 + 16), 1uLL);\nsa = strchr(s, 10) + 1;\nv6 = (unsigned int)strchr(sa, 10);\nif ( (int)fastq_read_check(\nsa,\nv6 - (unsigned int)sa,\n110LL,\na1,\na4,\n*(double *)_mm_cvtsi32_si128(LODWORD(a6)).m128i_i64) > 0 )\n_InterlockedAdd64((volatile signed __int64 *)(a4 + 24), 1uLL);\nv7 = strchr(sa, 10);\nv8 = strchr(v7 + 1, 10);\ns = strchr(v8 + 1, 10) + 1;\n}\nelse\n{\ns = (char *)v10;\n}\n}\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func2(__int64 a1, __int64 a2, __int64 a3, __int64 a4, float a5, float a6)\n{\nunsigned int v6; // eax\nchar *v7; // rax\nchar *v8; // rax\n__int64 v10; // [rsp+38h] [rbp-18h]\nchar *v11; // [rsp+40h] [rbp-10h]\nchar *s; // [rsp+48h] [rbp-8h]\nchar *sa; // [rsp+48h] [rbp-8h]\n\ns = *(char **)a2;\nif ( **(_BYTE **)a2 == 64 )\n{\nif ( a3 == *(_QWORD *)(a2 + 24) || !**(_QWORD **)(a2 + 24) )\nv11 = &s[strlen(s)];\nelse\nv11 = **(char ***)(a2 + 24);\nwhile ( s != v11 )\n{\nv10 = jump(s, 2LL, *(double *)_mm_cvtsi32_si128(LODWORD(a5)).m128i_i64);\nif ( s == (char *)v10 )\n{\n_InterlockedAdd64((volatile signed __int64 *)(a4 + 16), 1uLL);\nsa = strchr(s, 10) + 1;\nv6 = (unsigned int)strchr(sa, 10);\nif ( (int)fastq_read_check(\nsa,\nv6 - (unsigned int)sa,\n110LL,\na1,\na4,\n*(double *)_mm_cvtsi32_si128(LODWORD(a6)).m128i_i64) > 0 )\n_InterlockedAdd64((volatile signed __int64 *)(a4 + 24), 1uLL);\nv7 = strchr(sa, 10);\nv8 = strchr(v7 + 1, 10);\ns = strchr(v8 + 1, 10) + 1;\n}\nelse\n{\ns = (char *)v10;\n}\n}\n}\n}",
"original_code": "void\nfastq_process (bloom * bl, Queue * info, Queue *tail, F_set * File_head,\n float sampling_rate, float tole_rate)\n{\n char *p = info->location;\n char *next = ((void *)0), *temp = ((void *)0), *temp_piece = ((void *)0);\n if (info->location[0] != '@') {\n return;\n } else if (info->next != tail && info->next->location!=((void *)0)) {\n next = info->next->location;\n } else {\n next = strchr (p, '\\0');\n }\n while (p != next)\n {\n temp = jump (p, 2, sampling_rate);\n if (p != temp)\n {\n p = temp;\n continue;\n }\n \n#pragma omp atomic\n File_head->reads_num++;\n p = strchr (p, '\\n') + 1;\n if (fastq_read_check (p, strchr (p, '\\n') - p, 'n', bl, tole_rate, File_head)> 0) {\n \n#pragma omp atomic\n File_head->reads_contam++;\n }\n p = strchr (p, '\\n') + 1;\n p = strchr (p, '\\n') + 1;\n p = strchr (p, '\\n') + 1;\n }\n if (temp_piece)\n free (temp_piece);\n}",
"canonical_original_code": "void fastq_process(struct bloom *bl, struct info *info, struct info *tail, struct file_list *File_head, float sampling_rate, float tole_rate)\n{\n char *p = info->location;\n char *next = ((void *)0); char *temp = ((void *)0); char *temp_piece = ((void *)0);\n if (info->location[0] != '@') {\n return;\n } else if (info->next != tail && info->next->location!=((void *)0)) {\n next = info->next->location;\n } else {\n next = strchr (p, '\\0');\n }\n while (p != next)\n {\n temp = jump (p, 2, sampling_rate);\n if (p != temp)\n {\n p = temp;\n continue;\n }\n \n#pragma omp atomic\n File_head->reads_num++;\n p = strchr (p, '\\n') + 1;\n if (fastq_read_check (p, strchr (p, '\\n') - p, 'n', bl, tole_rate, File_head)> 0) {\n \n#pragma omp atomic\n File_head->reads_contam++;\n }\n p = strchr (p, '\\n') + 1;\n p = strchr (p, '\\n') + 1;\n p = strchr (p, '\\n') + 1;\n }\n if (temp_piece)\n free (temp_piece);\n}",
"variable_types": [
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"info",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"tail",
"struct info *"
],
[
"File_head",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; } *"
],
[
"sampling_rate",
"float"
],
[
"tole_rate",
"float"
],
[
"p",
"char *"
],
[
"next",
"char *"
],
[
"temp",
"char *"
],
[
"temp_piece",
"char *"
]
],
"return_type": "void",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct info { char *location; short *score; short *number; struct info *next; }",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "a964a8a3212ed086312717a28418a2b1eca97625b9f65d0bfd1ef12fdf5c1214"
},
{
"name": "fasta_process",
"canonical_name": "func3",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "const char *__fastcall fasta_process(__int64 a1, __int64 a2, __int64 a3, __int64 a4, float a5, float a6)\n{\nconst char *result; // rax\nconst char *v7; // rbx\n__int64 v9; // [rsp+30h] [rbp-30h]\nconst char *v10; // [rsp+38h] [rbp-28h]\nchar *v11; // [rsp+40h] [rbp-20h]\nchar *v12; // [rsp+48h] [rbp-18h]\n\nresult = *(const char **)a2;\nif ( *(_QWORD *)a2 )\n{\nif ( a3 == *(_QWORD *)(a2 + 24) )\n{\nv7 = *(const char **)a2;\nv11 = (char *)&v7[strlen(*(const char **)a2)];\n}\nelse\n{\nv11 = **(char ***)(a2 + 24);\n}\nv10 = *(const char **)a2;\nwhile ( 1 )\n{\nresult = v10;\nif ( v10 == v11 )\nbreak;\nv9 = jump(v10, 1LL, *(double *)_mm_cvtsi32_si128(LODWORD(a5)).m128i_i64);\nif ( v10 == (const char *)v9 )\n{\n_InterlockedAdd64((volatile signed __int64 *)(a4 + 16), 1uLL);\nv12 = strchr(v10 + 1, 62);\nif ( !v12 )\nv12 = v11;\nif ( (int)fasta_read_check(v10, v12, 110LL, a1, a4, *(double *)_mm_cvtsi32_si128(LODWORD(a6)).m128i_i64) > 0 )\n_InterlockedAdd64((volatile signed __int64 *)(a4 + 24), 1uLL);\nv10 = v12;\n}\nelse\n{\nv10 = (const char *)v9;\n}\n}\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "const char *__fastcall func3(__int64 a1, __int64 a2, __int64 a3, __int64 a4, float a5, float a6)\n{\nconst char *result; // rax\nconst char *v7; // rbx\n__int64 v9; // [rsp+30h] [rbp-30h]\nconst char *v10; // [rsp+38h] [rbp-28h]\nchar *v11; // [rsp+40h] [rbp-20h]\nchar *v12; // [rsp+48h] [rbp-18h]\n\nresult = *(const char **)a2;\nif ( *(_QWORD *)a2 )\n{\nif ( a3 == *(_QWORD *)(a2 + 24) )\n{\nv7 = *(const char **)a2;\nv11 = (char *)&v7[strlen(*(const char **)a2)];\n}\nelse\n{\nv11 = **(char ***)(a2 + 24);\n}\nv10 = *(const char **)a2;\nwhile ( 1 )\n{\nresult = v10;\nif ( v10 == v11 )\nbreak;\nv9 = jump(v10, 1LL, *(double *)_mm_cvtsi32_si128(LODWORD(a5)).m128i_i64);\nif ( v10 == (const char *)v9 )\n{\n_InterlockedAdd64((volatile signed __int64 *)(a4 + 16), 1uLL);\nv12 = strchr(v10 + 1, 62);\nif ( !v12 )\nv12 = v11;\nif ( (int)fasta_read_check(v10, v12, 110LL, a1, a4, *(double *)_mm_cvtsi32_si128(LODWORD(a6)).m128i_i64) > 0 )\n_InterlockedAdd64((volatile signed __int64 *)(a4 + 24), 1uLL);\nv10 = v12;\n}\nelse\n{\nv10 = (const char *)v9;\n}\n}\n}\nreturn result;\n}",
"original_code": "void\nfasta_process (bloom * bl, Queue * info, Queue * tail, F_set * File_head,\n float sampling_rate, float tole_rate)\n{\n char *temp_next, *next, *temp;\n if (info->location == ((void *)0))\n return;\n else if (info->next != tail)\n next = info->next->location;\n else\n next = strchr (info->location, '\\0');\n char *p = info->location;\n while (p != next)\n {\n temp = jump (p, 1, sampling_rate);\n if (p != temp)\n {\n p = temp;\n continue;\n }\n \n#pragma omp atomic\n File_head->reads_num++;\n temp_next = strchr (p + 1, '>');\n if (!temp_next)\n temp_next = next;\n if (fasta_read_check (p, temp_next, 'n', bl, tole_rate, File_head) > 0)\n {\n \n#pragma omp atomic\n File_head->reads_contam++;\n }\n p = temp_next;\n }\n}",
"canonical_original_code": "void fasta_process(struct bloom *bl, struct info *info, struct info *tail, struct file_list *File_head, float sampling_rate, float tole_rate)\n{\n char *temp_next; char *next; char *temp;\n if (info->location == ((void *)0))\n return;\n else if (info->next != tail)\n next = info->next->location;\n else\n next = strchr (info->location, '\\0');\n char *p = info->location;\n while (p != next)\n {\n temp = jump (p, 1, sampling_rate);\n if (p != temp)\n {\n p = temp;\n continue;\n }\n \n#pragma omp atomic\n File_head->reads_num++;\n temp_next = strchr (p + 1, '>');\n if (!temp_next)\n temp_next = next;\n if (fasta_read_check (p, temp_next, 'n', bl, tole_rate, File_head) > 0)\n {\n \n#pragma omp atomic\n File_head->reads_contam++;\n }\n p = temp_next;\n }\n}",
"variable_types": [
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"info",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"tail",
"struct info *"
],
[
"File_head",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; } *"
],
[
"sampling_rate",
"float"
],
[
"tole_rate",
"float"
],
[
"temp_next",
"char *"
],
[
"next",
"char *"
],
[
"temp",
"char *"
],
[
"p",
"char *"
]
],
"return_type": "void",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct info { char *location; short *score; short *number; struct info *next; }",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "a964a8a3212ed086312717a28418a2b1eca97625b9f65d0bfd1ef12fdf5c1214"
},
{
"name": "evaluate",
"canonical_name": "func4",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "char *__fastcall evaluate(char *a1, const char *a2, _QWORD *a3)\n{\nchar s[8]; // [rsp+20h] [rbp-D0h] BYREF\n__int64 v6; // [rsp+28h] [rbp-C8h]\n__int64 v7; // [rsp+30h] [rbp-C0h]\n__int64 v8; // [rsp+38h] [rbp-B8h]\n__int64 v9; // [rsp+40h] [rbp-B0h]\n__int64 v10; // [rsp+48h] [rbp-A8h]\n__int64 v11; // [rsp+50h] [rbp-A0h]\n__int64 v12; // [rsp+58h] [rbp-98h]\n__int64 v13; // [rsp+60h] [rbp-90h]\n__int64 v14; // [rsp+68h] [rbp-88h]\n__int64 v15; // [rsp+70h] [rbp-80h]\n__int64 v16; // [rsp+78h] [rbp-78h]\n__int64 v17; // [rsp+80h] [rbp-70h]\n__int64 v18; // [rsp+88h] [rbp-68h]\n__int64 v19; // [rsp+90h] [rbp-60h]\n__int64 v20; // [rsp+98h] [rbp-58h]\n__int64 v21; // [rsp+A0h] [rbp-50h]\n__int64 v22; // [rsp+A8h] [rbp-48h]\n__int64 v23; // [rsp+B0h] [rbp-40h]\n__int64 v24; // [rsp+B8h] [rbp-38h]\n__int64 v25; // [rsp+C0h] [rbp-30h]\n__int64 v26; // [rsp+C8h] [rbp-28h]\n__int64 v27; // [rsp+D0h] [rbp-20h]\n__int64 v28; // [rsp+D8h] [rbp-18h]\n__int64 v29; // [rsp+E0h] [rbp-10h]\nfloat v30; // [rsp+ECh] [rbp-4h]\n\n*(_QWORD *)s = 0LL;\nv6 = 0LL;\nv7 = 0LL;\nv8 = 0LL;\nv9 = 0LL;\nv10 = 0LL;\nv11 = 0LL;\nv12 = 0LL;\nv13 = 0LL;\nv14 = 0LL;\nv15 = 0LL;\nv16 = 0LL;\nv17 = 0LL;\nv18 = 0LL;\nv19 = 0LL;\nv20 = 0LL;\nv21 = 0LL;\nv22 = 0LL;\nv23 = 0LL;\nv24 = 0LL;\nv25 = 0LL;\nv26 = 0LL;\nv27 = 0LL;\nv28 = 0LL;\nv29 = 0LL;\nv30 = (float)(int)a3[3] / (float)(int)a3[2];\nputs(\"{\");\nprintf(\"\\t\\\"total_read_count\\\": %lld,\\n\", a3[2]);\nprintf(\"\\t\\\"contaminated_reads\\\": %lld,\\n\", a3[3]);\nprintf(\"\\t\\\"total_hits\\\": %lld,\\n\", a3[4]);\nprintf(\"\\t\\\"contamination_rate\\\": %f,\\n\", v30);\nprintf(\"\\t\\\"bloom_filename\\\":\\\"%s\\\"\\n\", a2);\nputs(\"}\");\nsprintf(s, \" %lld\\t%lld\\t%f\\n\", a3[2], a3[3], v30);\nreturn strcat(a1, s);\n}\n",
"canonical_decompiled_code": "char *__fastcall func4(char *a1, const char *a2, _QWORD *a3)\n{\nchar s[8]; // [rsp+20h] [rbp-D0h] BYREF\n__int64 v6; // [rsp+28h] [rbp-C8h]\n__int64 v7; // [rsp+30h] [rbp-C0h]\n__int64 v8; // [rsp+38h] [rbp-B8h]\n__int64 v9; // [rsp+40h] [rbp-B0h]\n__int64 v10; // [rsp+48h] [rbp-A8h]\n__int64 v11; // [rsp+50h] [rbp-A0h]\n__int64 v12; // [rsp+58h] [rbp-98h]\n__int64 v13; // [rsp+60h] [rbp-90h]\n__int64 v14; // [rsp+68h] [rbp-88h]\n__int64 v15; // [rsp+70h] [rbp-80h]\n__int64 v16; // [rsp+78h] [rbp-78h]\n__int64 v17; // [rsp+80h] [rbp-70h]\n__int64 v18; // [rsp+88h] [rbp-68h]\n__int64 v19; // [rsp+90h] [rbp-60h]\n__int64 v20; // [rsp+98h] [rbp-58h]\n__int64 v21; // [rsp+A0h] [rbp-50h]\n__int64 v22; // [rsp+A8h] [rbp-48h]\n__int64 v23; // [rsp+B0h] [rbp-40h]\n__int64 v24; // [rsp+B8h] [rbp-38h]\n__int64 v25; // [rsp+C0h] [rbp-30h]\n__int64 v26; // [rsp+C8h] [rbp-28h]\n__int64 v27; // [rsp+D0h] [rbp-20h]\n__int64 v28; // [rsp+D8h] [rbp-18h]\n__int64 v29; // [rsp+E0h] [rbp-10h]\nfloat v30; // [rsp+ECh] [rbp-4h]\n\n*(_QWORD *)s = 0LL;\nv6 = 0LL;\nv7 = 0LL;\nv8 = 0LL;\nv9 = 0LL;\nv10 = 0LL;\nv11 = 0LL;\nv12 = 0LL;\nv13 = 0LL;\nv14 = 0LL;\nv15 = 0LL;\nv16 = 0LL;\nv17 = 0LL;\nv18 = 0LL;\nv19 = 0LL;\nv20 = 0LL;\nv21 = 0LL;\nv22 = 0LL;\nv23 = 0LL;\nv24 = 0LL;\nv25 = 0LL;\nv26 = 0LL;\nv27 = 0LL;\nv28 = 0LL;\nv29 = 0LL;\nv30 = (float)(int)a3[3] / (float)(int)a3[2];\nputs(\"{\");\nprintf(\"\\t\\\"total_read_count\\\": %lld,\\n\", a3[2]);\nprintf(\"\\t\\\"contaminated_reads\\\": %lld,\\n\", a3[3]);\nprintf(\"\\t\\\"total_hits\\\": %lld,\\n\", a3[4]);\nprintf(\"\\t\\\"contamination_rate\\\": %f,\\n\", v30);\nprintf(\"\\t\\\"bloom_filename\\\":\\\"%s\\\"\\n\", a2);\nputs(\"}\");\nsprintf(s, \" %lld\\t%lld\\t%f\\n\", a3[2], a3[3], v30);\nreturn strcat(a1, s);\n}",
"original_code": "void\nevaluate (char *detail, char *filename, F_set * File_head)\n{\n char buffer[200] = { 0 };\n float contamination_rate =\n (float) (File_head->reads_contam) / (float) (File_head->reads_num);\n printf(\"{\\n\");\n printf (\"\\t\\\"total_read_count\\\": %lld,\\n\", File_head->reads_num);\n printf (\"\\t\\\"contaminated_reads\\\": %lld,\\n\", File_head->reads_contam);\n printf (\"\\t\\\"total_hits\\\": %lld,\\n\", File_head->hits);\n printf (\"\\t\\\"contamination_rate\\\": %f,\\n\", contamination_rate);\n printf (\"\\t\\\"bloom_filename\\\":\\\"%s\\\"\\n\", filename);\n printf(\"}\\n\");\n sprintf (buffer, \" %lld\\t%lld\\t%f\\n\", File_head->reads_num,\n File_head->reads_contam, contamination_rate);\n strcat (detail, buffer);\n}",
"canonical_original_code": "void evaluate(char *detail, char *filename, struct file_list *File_head)\n{\n char buffer[200] = { 0 };\n float contamination_rate = (float) (File_head->reads_contam) / (float) (File_head->reads_num);\n printf(\"{\\n\");\n printf (\"\\t\\\"total_read_count\\\": %lld,\\n\", File_head->reads_num);\n printf (\"\\t\\\"contaminated_reads\\\": %lld,\\n\", File_head->reads_contam);\n printf (\"\\t\\\"total_hits\\\": %lld,\\n\", File_head->hits);\n printf (\"\\t\\\"contamination_rate\\\": %f,\\n\", contamination_rate);\n printf (\"\\t\\\"bloom_filename\\\":\\\"%s\\\"\\n\", filename);\n printf(\"}\\n\");\n sprintf (buffer, \" %lld\\t%lld\\t%f\\n\", File_head->reads_num,\n File_head->reads_contam, contamination_rate);\n strcat (detail, buffer);\n}",
"variable_types": [
[
"detail",
"char *"
],
[
"filename",
"char *"
],
[
"File_head",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; } *"
],
[
"buffer",
"char [200]"
],
[
"contamination_rate",
"float"
]
],
"return_type": "void",
"user_defined_types": [
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; }"
],
"binary_hash": "a964a8a3212ed086312717a28418a2b1eca97625b9f65d0bfd1ef12fdf5c1214"
},
{
"name": "statistic_save",
"canonical_name": "func5",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall statistic_save(__int64 a1, __int64 a2, __int64 a3)\n{\nchar *s; // [rsp+28h] [rbp-8h]\n\ns = (char *)prefix_make(a2, 0LL, a3);\nif ( *s == 47 )\n++s;\nstrcat(s, \".info\");\nreturn write_result(s, a1);\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1, __int64 a2, __int64 a3)\n{\nchar *s; // [rsp+28h] [rbp-8h]\n\ns = (char *)prefix_make(a2, 0LL, a3);\nif ( *s == 47 )\n++s;\nstrcat(s, \".info\");\nreturn write_result(s, a1);\n}",
"original_code": "void\nstatistic_save (char *detail, char *filename, char *prefix)\n{\n char *save_file = ((void *)0);\n save_file = prefix_make (filename, ((void *)0), prefix);\n if (save_file[0]=='/')\n save_file++;\n strcat (save_file,\".info\");\n write_result (save_file, detail);\n}",
"canonical_original_code": "void statistic_save(char *detail, char *filename, char *prefix)\n{\n char *save_file = ((void *)0);\n save_file = prefix_make (filename, ((void *)0), prefix);\n if (save_file[0]=='/')\n save_file++;\n strcat (save_file,\".info\");\n write_result (save_file, detail);\n}",
"variable_types": [
[
"detail",
"char *"
],
[
"filename",
"char *"
],
[
"prefix",
"char *"
],
[
"save_file",
"char *"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "a964a8a3212ed086312717a28418a2b1eca97625b9f65d0bfd1ef12fdf5c1214"
}
] |
c0372e960dba58e488f61fe4a0da1e2a2ccfdffa2317895e6d3a400380cd7cd0 | tzcoolman/FACS-OLD | [
[
"usage",
"->",
"main"
],
[
"main",
"->",
"usage"
]
] | [] | [
{
"name": "usage",
"canonical_name": "func0",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 usage()\n{\nfputc(10, stderr);\nfwrite(\"Program: facs (Sequence decontamination using bloom filters)\\n\", 1uLL, 0x3DuLL, stderr);\nfprintf(stderr, \"Version: %s\\n\", \"0.1\");\nfwrite(\"Contact: Enze Liu <[email protected]>\\n\\n\", 1uLL, 0x2CuLL, stderr);\nfwrite(\"Usage: facs <command> [options]\\n\\n\", 1uLL, 0x23uLL, stderr);\nfwrite(\"Command: build build a bloom filter from a FASTA reference file\\n\", 1uLL, 0x48uLL, stderr);\nfwrite(\n\" query query a bloom filter given a FASTQ/FASTA file. Large files and compressed files supported\\n\",\n1uLL,\n0x71uLL,\nstderr);\nfwrite(\n\" check query a bloom filter given a FASTQ/FASTA file. Faster than query\\n\",\n1uLL,\n0x58uLL,\nstderr);\nfwrite(\" remove remove (contamination) sequences from FASTQ/FASTA file\\n\", 1uLL, 0x4EuLL, stderr);\nfwrite(\" classify classify reads to the most likely reference genomes\\n\", 1uLL, 0x4BuLL, stderr);\nfputc(10, stderr);\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 func0()\n{\nfputc(10, stderr);\nfwrite(\"Program: facs (Sequence decontamination using bloom filters)\\n\", 1uLL, 0x3DuLL, stderr);\nfprintf(stderr, \"Version: %s\\n\", \"0.1\");\nfwrite(\"Contact: Enze Liu <[email protected]>\\n\\n\", 1uLL, 0x2CuLL, stderr);\nfwrite(\"Usage: facs <command> [options]\\n\\n\", 1uLL, 0x23uLL, stderr);\nfwrite(\"Command: build build a bloom filter from a FASTA reference file\\n\", 1uLL, 0x48uLL, stderr);\nfwrite(\n\" query query a bloom filter given a FASTQ/FASTA file. Large files and compressed files supported\\n\",\n1uLL,\n0x71uLL,\nstderr);\nfwrite(\n\" check query a bloom filter given a FASTQ/FASTA file. Faster than query\\n\",\n1uLL,\n0x58uLL,\nstderr);\nfwrite(\" remove remove (contamination) sequences from FASTQ/FASTA file\\n\", 1uLL, 0x4EuLL, stderr);\nfwrite(\" classify classify reads to the most likely reference genomes\\n\", 1uLL, 0x4BuLL, stderr);\nfputc(10, stderr);\nreturn 1LL;\n}",
"original_code": "static int\nusage(void)\n{\n fprintf(stderr, \"\\n\");\n fprintf(stderr, \"Program: facs (Sequence decontamination using bloom filters)\\n\");\n fprintf(stderr, \"Version: %s\\n\", \"0.1\");\n fprintf(stderr, \"Contact: Enze Liu <[email protected]>\\n\\n\");\n fprintf(stderr, \"Usage: facs <command> [options]\\n\\n\");\n fprintf(stderr, \"Command: build build a bloom filter from a FASTA reference file\\n\");\n fprintf(stderr, \" query query a bloom filter given a FASTQ/FASTA file. Large files and compressed files supported\\n\");\n fprintf(stderr, \" check query a bloom filter given a FASTQ/FASTA file. Faster than query\\n\");\n fprintf(stderr, \" remove remove (contamination) sequences from FASTQ/FASTA file\\n\");\n fprintf(stderr, \" classify classify reads to the most likely reference genomes\\n\");\n fprintf(stderr, \"\\n\");\n return 1;\n}",
"canonical_original_code": "static int usage()\n{\n fprintf(stderr, \"\\n\");\n fprintf(stderr, \"Program: facs (Sequence decontamination using bloom filters)\\n\");\n fprintf(stderr, \"Version: %s\\n\", \"0.1\");\n fprintf(stderr, \"Contact: Enze Liu <[email protected]>\\n\\n\");\n fprintf(stderr, \"Usage: facs <command> [options]\\n\\n\");\n fprintf(stderr, \"Command: build build a bloom filter from a FASTA reference file\\n\");\n fprintf(stderr, \" query query a bloom filter given a FASTQ/FASTA file. Large files and compressed files supported\\n\");\n fprintf(stderr, \" check query a bloom filter given a FASTQ/FASTA file. Faster than query\\n\");\n fprintf(stderr, \" remove remove (contamination) sequences from FASTQ/FASTA file\\n\");\n fprintf(stderr, \" classify classify reads to the most likely reference genomes\\n\");\n fprintf(stderr, \"\\n\");\n return 1;\n}",
"variable_types": [],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "c0372e960dba58e488f61fe4a0da1e2a2ccfdffa2317895e6d3a400380cd7cd0"
},
{
"name": "main",
"canonical_name": "main",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nint v4; // [rsp+1Ch] [rbp-4h]\n\nv4 = 0;\nif ( argc <= 1 )\nreturn usage(argc, argv, envp);\nif ( !strcmp(argv[1], \"build\") )\nreturn build_main((unsigned int)(argc - 1), argv + 1);\nif ( !strcmp(argv[1], \"check\") )\nreturn check_main((unsigned int)(argc - 1), argv + 1);\nif ( !strcmp(argv[1], \"query\") )\nreturn bq_main((unsigned int)(argc - 1), argv + 1);\nif ( !strcmp(argv[1], \"remove\") )\nreturn remove_main((unsigned int)(argc - 1), argv + 1);\nif ( !strcmp(argv[1], \"classify\") )\nreturn remove_l_main((unsigned int)(argc - 1), argv + 1);\n((void (*)(void))usage)();\nreturn v4;\n}\n",
"canonical_decompiled_code": "int __cdecl main(int argc, const char **argv, const char **envp)\n{\nint v4; // [rsp+1Ch] [rbp-4h]\n\nv4 = 0;\nif ( argc <= 1 )\nreturn func0(argc, argv, envp);\nif ( !strcmp(argv[1], \"build\") )\nreturn build_main((unsigned int)(argc - 1), argv + 1);\nif ( !strcmp(argv[1], \"check\") )\nreturn check_main((unsigned int)(argc - 1), argv + 1);\nif ( !strcmp(argv[1], \"query\") )\nreturn bq_main((unsigned int)(argc - 1), argv + 1);\nif ( !strcmp(argv[1], \"remove\") )\nreturn remove_main((unsigned int)(argc - 1), argv + 1);\nif ( !strcmp(argv[1], \"classify\") )\nreturn remove_l_main((unsigned int)(argc - 1), argv + 1);\n((void (*)(void))usage)();\nreturn v4;\n}",
"original_code": "int main (int argc, char **argv)\n{\n int ret=0;\n if (argc < 2) return usage();\n if (strcmp(argv[1], \"build\") == 0) ret = build_main(argc-1, argv+1);\n else if (strcmp(argv[1], \"check\") == 0) ret = check_main(argc-1, argv+1);\n else if (strcmp(argv[1], \"query\") == 0) ret = bq_main(argc-1, argv+1);\n else if (strcmp(argv[1], \"remove\") == 0) ret = remove_main(argc-1, argv+1);\n else if (strcmp(argv[1], \"classify\") == 0) ret = remove_l_main(argc-1,argv+1);\n else usage();\n return ret;\n}",
"canonical_original_code": "int main(int argc, char **argv)\n{\n int ret = 0;\n if (argc < 2) return usage();\n if (strcmp(argv[1], \"build\") == 0) ret = build_main(argc-1, argv+1);\n else if (strcmp(argv[1], \"check\") == 0) ret = check_main(argc-1, argv+1);\n else if (strcmp(argv[1], \"query\") == 0) ret = bq_main(argc-1, argv+1);\n else if (strcmp(argv[1], \"remove\") == 0) ret = remove_main(argc-1, argv+1);\n else if (strcmp(argv[1], \"classify\") == 0) ret = remove_l_main(argc-1,argv+1);\n else usage();\n return ret;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char **"
],
[
"ret",
"int"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "c0372e960dba58e488f61fe4a0da1e2a2ccfdffa2317895e6d3a400380cd7cd0"
}
] |
d32b56d05626e61462fb6e4612dcf5b23046c532266da4c0d399d6c5aeca54ad | tzcoolman/FACS-OLD | [
[
"build_usage",
"->",
"build_main"
],
[
"build_main",
"->",
"build_usage",
"init_bloom",
"ref_add",
"build"
],
[
"init_bloom",
"->",
"build_main"
],
[
"build",
"->",
"build_main",
"ref_add"
],
[
"fasta_title",
"->",
"fasta_add"
],
[
"fasta_add",
"->",
"fasta_title",
"ref_add"
],
[
"fastq_add",
"->",
"ref_add"
],
[
"ref_add",
"->",
"build_main",
"build",
"fasta_add",
"fastq_add"
]
] | [] | [
{
"name": "build_usage",
"canonical_name": "func0",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 build_usage()\n{\nfwrite(\"\\nUsage: ./facs build [options]\\n\", 1uLL, 0x1FuLL, stderr);\nfwrite(\"Options:\\n\", 1uLL, 9uLL, stderr);\nfwrite(\"\\t-r path/to/something.fasta\\n\", 1uLL, 0x1CuLL, stderr);\nfwrite(\"\\t-o have to use it, but does not write file! :_/ XXX\\n\", 1uLL, 0x35uLL, stderr);\nreturn 1LL;\n}\n",
"canonical_decompiled_code": "__int64 func0()\n{\nfwrite(\"\\nUsage: ./facs build [options]\\n\", 1uLL, 0x1FuLL, stderr);\nfwrite(\"Options:\\n\", 1uLL, 9uLL, stderr);\nfwrite(\"\\t-r path/to/something.fasta\\n\", 1uLL, 0x1CuLL, stderr);\nfwrite(\"\\t-o have to use it, but does not write file! :_/ XXX\\n\", 1uLL, 0x35uLL, stderr);\nreturn 1LL;\n}",
"original_code": "static int\nbuild_usage(void)\n{\n fprintf(stderr, \"\\nUsage: ./facs build [options]\\n\");\n fprintf(stderr, \"Options:\\n\");\n fprintf(stderr, \"\\t-r path/to/something.fasta\\n\");\n fprintf(stderr, \"\\t-o have to use it, but does not write file! :_/ XXX\\n\");\n return 1;\n}",
"canonical_original_code": "static int build_usage()\n{\n fprintf(stderr, \"\\nUsage: ./facs build [options]\\n\");\n fprintf(stderr, \"Options:\\n\");\n fprintf(stderr, \"\\t-r path/to/something.fasta\\n\");\n fprintf(stderr, \"\\t-o have to use it, but does not write file! :_/ XXX\\n\");\n return 1;\n}",
"variable_types": [],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "d32b56d05626e61462fb6e4612dcf5b23046c532266da4c0d399d6c5aeca54ad"
},
{
"name": "build_main",
"canonical_name": "func1",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall build_main(int a1, char *const *a2)\n{\n__int64 result; // rax\nfloat v3; // xmm0_4\nsize_t v4; // rax\nchar *s; // [rsp+10h] [rbp-60h]\n_QWORD *v6; // [rsp+20h] [rbp-50h]\nvoid *v7; // [rsp+28h] [rbp-48h]\nint v8; // [rsp+34h] [rbp-3Ch]\n_QWORD *i; // [rsp+40h] [rbp-30h]\nchar *v10; // [rsp+48h] [rbp-28h]\nchar *v11; // [rsp+50h] [rbp-20h]\nchar *v12; // [rsp+58h] [rbp-18h]\nfloat v13; // [rsp+60h] [rbp-10h]\nunsigned int v14; // [rsp+64h] [rbp-Ch]\nsize_t v15; // [rsp+68h] [rbp-8h]\n\nif ( a1 <= 1 )\nreturn build_usage();\nv14 = 0;\nv13 = 0.00050000002;\nv12 = 0LL;\nv11 = 0LL;\nv10 = 0LL;\nprintf(\"1st command->%s\\n\", *(const char **)a2);\nwhile ( 2 )\n{\nv8 = getopt(a1, a2, \"ek:o:r:lh\");\nif ( v8 == -1 )\n{\nprintf(\"LIST IS %s\\n\", v12);\nif ( v12 )\n{\nv7 = malloc(0x48uLL);\nv6 = malloc(0x20uLL);\nv6[3] = malloc(0x20uLL);\nmalloc(0x38uLL);\nfor ( i = (_QWORD *)make_list(v10, v12); i; i = (_QWORD *)i[6] )\n{\ns = (char *)mmaping(*i);\nif ( *s == 62 )\nv15 = strlen(s);\nelse\nv15 = strlen(s) >> 1;\ninit_bloom(v7, v15, v14, *i, *(double *)_mm_cvtsi32_si128(LODWORD(v13)).m128i_i64);\nref_add(v7, s);\nsave_bloom(*i, v7, 0LL, v11);\nbloom_destroy(v7);\nv4 = strlen(s);\nmunmap(s, v4);\n}\n}\nelse\n{\nbuild(v10, v11, v14, 0LL, v13);\n}\nresult = 0LL;\n}\nelse\n{\nswitch ( v8 )\n{\ncase '?':\nprintf(\"Unknown option: -%c\\n\", (unsigned int)(char)optopt);\nresult = build_usage();\nbreak;\ncase 'e':\nif ( optarg )\n{\nv3 = atof(optarg);\nv13 = v3;\n}\ncontinue;\ncase 'h':\nreturn build_usage();\ncase 'k':\nif ( optarg )\nv14 = atoi(optarg);\nprintf(\"k_mer->%d\\n\", v14);\ncontinue;\ncase 'l':\nif ( optarg )\nv12 = optarg;\ncontinue;\ncase 'o':\nif ( optarg )\nv11 = optarg;\ncontinue;\ncase 'r':\nif ( optarg )\nv10 = optarg;\ncontinue;\ndefault:\ncontinue;\n}\n}\nbreak;\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func1(int a1, char *const *a2)\n{\n__int64 result; // rax\nfloat v3; // xmm0_4\nsize_t v4; // rax\nchar *s; // [rsp+10h] [rbp-60h]\n_QWORD *v6; // [rsp+20h] [rbp-50h]\nvoid *v7; // [rsp+28h] [rbp-48h]\nint v8; // [rsp+34h] [rbp-3Ch]\n_QWORD *i; // [rsp+40h] [rbp-30h]\nchar *v10; // [rsp+48h] [rbp-28h]\nchar *v11; // [rsp+50h] [rbp-20h]\nchar *v12; // [rsp+58h] [rbp-18h]\nfloat v13; // [rsp+60h] [rbp-10h]\nunsigned int v14; // [rsp+64h] [rbp-Ch]\nsize_t v15; // [rsp+68h] [rbp-8h]\n\nif ( a1 <= 1 )\nreturn func0();\nv14 = 0;\nv13 = 0.00050000002;\nv12 = 0LL;\nv11 = 0LL;\nv10 = 0LL;\nprintf(\"1st command->%s\\n\", *(const char **)a2);\nwhile ( 2 )\n{\nv8 = getopt(a1, a2, \"ek:o:r:lh\");\nif ( v8 == -1 )\n{\nprintf(\"LIST IS %s\\n\", v12);\nif ( v12 )\n{\nv7 = malloc(0x48uLL);\nv6 = malloc(0x20uLL);\nv6[3] = malloc(0x20uLL);\nmalloc(0x38uLL);\nfor ( i = (_QWORD *)make_list(v10, v12); i; i = (_QWORD *)i[6] )\n{\ns = (char *)mmaping(*i);\nif ( *s == 62 )\nv15 = strlen(s);\nelse\nv15 = strlen(s) >> 1;\nfunc2(v7, v15, v14, *i, *(double *)_mm_cvtsi32_si128(LODWORD(v13)).m128i_i64);\nfunc7(v7, s);\nsave_bloom(*i, v7, 0LL, v11);\nbloom_destroy(v7);\nv4 = strlen(s);\nmunmap(s, v4);\n}\n}\nelse\n{\nfunc3(v10, v11, v14, 0LL, v13);\n}\nresult = 0LL;\n}\nelse\n{\nswitch ( v8 )\n{\ncase '?':\nprintf(\"Unknown option: -%c\\n\", (unsigned int)(char)optopt);\nresult = func0();\nbreak;\ncase 'e':\nif ( optarg )\n{\nv3 = atof(optarg);\nv13 = v3;\n}\ncontinue;\ncase 'h':\nreturn func0();\ncase 'k':\nif ( optarg )\nv14 = atoi(optarg);\nprintf(\"k_mer->%d\\n\", v14);\ncontinue;\ncase 'l':\nif ( optarg )\nv12 = optarg;\ncontinue;\ncase 'o':\nif ( optarg )\nv11 = optarg;\ncontinue;\ncase 'r':\nif ( optarg )\nv10 = optarg;\ncontinue;\ndefault:\ncontinue;\n}\n}\nbreak;\n}\nreturn result;\n}",
"original_code": "int\nbuild_main (int argc, char **argv)\n{\n if (argc < 2) return build_usage();\n char *position;\n unsigned long long capacity;\n int opt;\n int k_mer = 0;\n float error_rate = 0.0005;\n char* list = ((void *)0);\n char* prefix = ((void *)0);\n char* target_path = ((void *)0);\n char* source = ((void *)0);\n printf (\"1st command->%s\\n\",argv[0]);\n while ((opt = getopt (argc, argv, \"ek:o:r:lh\")) != -1) {\n switch (opt) {\n case 'e':\n (optarg) && ((error_rate = atof (optarg)), 1);\n break;\n case 'k':\n (optarg) && ((k_mer = atoi (optarg)), 1);\n printf (\"k_mer->%d\\n\",k_mer);\n break;\n case 'o':\n (optarg) && ((target_path = optarg), 1);\n break;\n case 'r':\n (optarg) && (source = optarg, 1);\n break;\n case 'l':\n (optarg) && (list = optarg, 1);\n break;\n case 'h':\n return build_usage();\n case '?':\n printf (\"Unknown option: -%c\\n\", (char) optopt);\n return build_usage();\n }\n }\n printf(\"LIST IS %s\\n\", list);\n if (!list) {\n build(source, target_path, k_mer, error_rate, ((void *)0));\n } else {\n bloom *bl_2 = (bloom *) malloc(sizeof(bloom));\n Queue *head = (Queue *) malloc(sizeof(Queue));\n Queue *tail = (Queue *) malloc(sizeof(Queue));\n head->next = tail;\n F_set *File_head = (F_set *) malloc(sizeof(F_set));\n File_head = make_list (source, list);\n while (File_head) {\n position = mmaping (File_head->filename);\n if (*position == '>')\n capacity = strlen (position);\n else\n capacity = strlen (position) / 2;\n init_bloom (bl_2, capacity, error_rate, k_mer, File_head->filename);\n ref_add (bl_2, position);\n save_bloom (File_head->filename, bl_2, prefix,target_path);\n bloom_destroy (bl_2);\n munmap (position, strlen (position));\n File_head = File_head->next;\n }\n }\n return 0;\n}",
"canonical_original_code": "int build_main(int argc, char **argv)\n{\n if (argc < 2) return build_usage();\n char *position;\n unsigned long long capacity;\n int opt;\n int k_mer = 0;\n float error_rate = 0.0005;\n char *list = ((void *)0);\n char *prefix = ((void *)0);\n char *target_path = ((void *)0);\n char *source = ((void *)0);\n printf (\"1st command->%s\\n\",argv[0]);\n while ((opt = getopt (argc, argv, \"ek:o:r:lh\")) != -1) {\n switch (opt) {\n case 'e':\n (optarg) && ((error_rate = atof (optarg)), 1);\n break;\n case 'k':\n (optarg) && ((k_mer = atoi (optarg)), 1);\n printf (\"k_mer->%d\\n\",k_mer);\n break;\n case 'o':\n (optarg) && ((target_path = optarg), 1);\n break;\n case 'r':\n (optarg) && (source = optarg, 1);\n break;\n case 'l':\n (optarg) && (list = optarg, 1);\n break;\n case 'h':\n return build_usage();\n case '?':\n printf (\"Unknown option: -%c\\n\", (char) optopt);\n return build_usage();\n }\n }\n printf(\"LIST IS %s\\n\", list);\n if (!list) {\n build(source, target_path, k_mer, error_rate, ((void *)0));\n } else {\n struct bloom *bl_2 = (bloom *) malloc(sizeof(bloom));\n struct info *head = (Queue *) malloc(sizeof(Queue));\n struct info *tail = (Queue *) malloc(sizeof(Queue));\n head->next = tail;\n struct file_list *File_head = (F_set *) malloc(sizeof(F_set));\n File_head = make_list (source, list);\n while (File_head) {\n position = mmaping (File_head->filename);\n if (*position == '>')\n capacity = strlen (position);\n else\n capacity = strlen (position) / 2;\n init_bloom (bl_2, capacity, error_rate, k_mer, File_head->filename);\n ref_add (bl_2, position);\n save_bloom (File_head->filename, bl_2, prefix,target_path);\n bloom_destroy (bl_2);\n munmap (position, strlen (position));\n File_head = File_head->next;\n }\n }\n return 0;\n}",
"variable_types": [
[
"argc",
"int"
],
[
"argv",
"char **"
],
[
"position",
"char *"
],
[
"capacity",
"unsigned long long"
],
[
"opt",
"int"
],
[
"k_mer",
"int"
],
[
"error_rate",
"float"
],
[
"list",
"char *"
],
[
"prefix",
"char *"
],
[
"target_path",
"char *"
],
[
"source",
"char *"
],
[
"bl_2",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"head",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"tail",
"struct info { char *location; short *score; short *number; struct info *next; } *"
],
[
"File_head",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct info { char *location; short *score; short *number; struct info *next; }",
"struct file_list { char *filename; short number; long long reads_num; long long reads_contam; long long hits; long long all_k; struct file_list *next; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "d32b56d05626e61462fb6e4612dcf5b23046c532266da4c0d399d6c5aeca54ad"
},
{
"name": "init_bloom",
"canonical_name": "func2",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall init_bloom(__int64 a1, __int64 a2, unsigned int a3, __int64 a4, float a5)\n{\n__int64 v5; // rax\n__int64 result; // rax\n\nget_suggestion(a1 + 24, a2, a5);\nbloom_init(a1, *(_QWORD *)(a1 + 24), *(_QWORD *)(a1 + 40), *(unsigned int *)(a1 + 32), 0LL, 3LL, *(double *)(a1 + 48));\nprintf(\"k_mer->%d\\n\", a3);\nif ( a3 )\n{\n*(_DWORD *)(a1 + 56) = a3;\n}\nelse\n{\nv5 = get_size(a4);\n*(_DWORD *)(a1 + 56) = kmer_suggestion(v5);\n}\nresult = dx_add(*(unsigned int *)(a1 + 56));\n*(_DWORD *)(a1 + 60) = result;\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func2(__int64 a1, __int64 a2, unsigned int a3, __int64 a4, float a5)\n{\n__int64 v5; // rax\n__int64 result; // rax\n\nget_suggestion(a1 + 24, a2, a5);\nbloom_init(a1, *(_QWORD *)(a1 + 24), *(_QWORD *)(a1 + 40), *(unsigned int *)(a1 + 32), 0LL, 3LL, *(double *)(a1 + 48));\nprintf(\"k_mer->%d\\n\", a3);\nif ( a3 )\n{\n*(_DWORD *)(a1 + 56) = a3;\n}\nelse\n{\nv5 = get_size(a4);\n*(_DWORD *)(a1 + 56) = kmer_suggestion(v5);\n}\nresult = dx_add(*(unsigned int *)(a1 + 56));\n*(_DWORD *)(a1 + 60) = result;\nreturn result;\n}",
"original_code": "void\ninit_bloom (bloom * bl, unsigned long long capacity, float error_rate, int k_mer, char* filename)\n{\n int flags = 3;\n get_suggestion (&bl->stat, capacity, error_rate);\n bloom_init (bl, bl->stat.elements, bl->stat.capacity, bl->stat.e,\n bl->stat.ideal_hashes, ((void *)0), flags);\n printf (\"k_mer->%d\\n\",k_mer);\n if (k_mer!=0)\n bl->k_mer = k_mer;\n else\n bl->k_mer = kmer_suggestion(get_size(filename));\n bl->dx = dx_add (bl->k_mer);\n}",
"canonical_original_code": "void init_bloom(struct bloom *bl, unsigned long long capacity, float error_rate, int k_mer, char *filename)\n{\n int flags = 3;\n get_suggestion (&bl->stat, capacity, error_rate);\n bloom_init (bl, bl->stat.elements, bl->stat.capacity, bl->stat.e,\n bl->stat.ideal_hashes, ((void *)0), flags);\n printf (\"k_mer->%d\\n\",k_mer);\n if (k_mer!=0)\n bl->k_mer = k_mer;\n else\n bl->k_mer = kmer_suggestion(get_size(filename));\n bl->dx = dx_add (bl->k_mer);\n}",
"variable_types": [
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"capacity",
"unsigned long long"
],
[
"error_rate",
"float"
],
[
"k_mer",
"int"
],
[
"filename",
"char *"
],
[
"flags",
"int"
]
],
"return_type": "void",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "d32b56d05626e61462fb6e4612dcf5b23046c532266da4c0d399d6c5aeca54ad"
},
{
"name": "build",
"canonical_name": "func3",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall build(__int64 a1, __int64 a2, unsigned int a3, double a4)\n{\n__int64 v4; // rax\ndouble *v7; // [rsp+30h] [rbp-10h]\nchar *s; // [rsp+38h] [rbp-8h]\n\ns = (char *)mmaping(a1);\nv7 = (double *)malloc(0x48uLL);\nif ( a3 )\n{\n*((_DWORD *)v7 + 14) = a3;\n}\nelse\n{\nv4 = get_size(a1);\n*((_DWORD *)v7 + 14) = kmer_suggestion(v4);\n}\nprintf(\"k_mer->%d\\n\", *((unsigned int *)v7 + 14));\nv7[6] = a4;\n*((_DWORD *)v7 + 15) = dx_add(*((unsigned int *)v7 + 14));\n*((_QWORD *)v7 + 5) = strlen(s);\nget_rec(v7 + 3);\nbloom_init(v7, *((_QWORD *)v7 + 3), *((_QWORD *)v7 + 5), *((unsigned int *)v7 + 8), 0LL, 3LL, v7[6]);\nref_add(v7, s);\nsave_bloom(a1, v7, 0LL, a2);\nreturn 0LL;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func3(__int64 a1, __int64 a2, unsigned int a3, double a4)\n{\n__int64 v4; // rax\ndouble *v7; // [rsp+30h] [rbp-10h]\nchar *s; // [rsp+38h] [rbp-8h]\n\ns = (char *)mmaping(a1);\nv7 = (double *)malloc(0x48uLL);\nif ( a3 )\n{\n*((_DWORD *)v7 + 14) = a3;\n}\nelse\n{\nv4 = get_size(a1);\n*((_DWORD *)v7 + 14) = kmer_suggestion(v4);\n}\nprintf(\"k_mer->%d\\n\", *((unsigned int *)v7 + 14));\nv7[6] = a4;\n*((_DWORD *)v7 + 15) = dx_add(*((unsigned int *)v7 + 14));\n*((_QWORD *)v7 + 5) = strlen(s);\nget_rec(v7 + 3);\nbloom_init(v7, *((_QWORD *)v7 + 3), *((_QWORD *)v7 + 5), *((unsigned int *)v7 + 8), 0LL, 3LL, v7[6]);\nfunc7(v7, s);\nsave_bloom(a1, v7, 0LL, a2);\nreturn 0LL;\n}",
"original_code": "int\nbuild(char *ref_name, char *target_path, int k_mer, double error_rate, char *prefix)\n{\n char *position = mmaping (ref_name);\n bloom *bl = (bloom *) malloc(sizeof(bloom));\n if (k_mer!=0)\n bl->k_mer = k_mer;\n else\n bl->k_mer = kmer_suggestion(get_size(ref_name));\n printf (\"k_mer->%d\\n\",bl->k_mer);\n bl->stat.e = error_rate;\n bl->dx = dx_add (bl->k_mer);\n bl->stat.capacity = strlen (position);\n get_rec (&bl->stat);\n bloom_init (bl, bl->stat.elements, bl->stat.capacity, bl->stat.e,\n bl->stat.ideal_hashes, ((void *)0), 3);\n ref_add (bl, position);\n save_bloom (ref_name, bl, ((void *)0), target_path);\n return 0;\n}",
"canonical_original_code": "int build(char *ref_name, char *target_path, int k_mer, double error_rate, char *prefix)\n{\n char *position = mmaping (ref_name);\n struct bloom *bl = (bloom *) malloc(sizeof(bloom));\n if (k_mer!=0)\n bl->k_mer = k_mer;\n else\n bl->k_mer = kmer_suggestion(get_size(ref_name));\n printf (\"k_mer->%d\\n\",bl->k_mer);\n bl->stat.e = error_rate;\n bl->dx = dx_add (bl->k_mer);\n bl->stat.capacity = strlen (position);\n get_rec (&bl->stat);\n bloom_init (bl, bl->stat.elements, bl->stat.capacity, bl->stat.e,\n bl->stat.ideal_hashes, ((void *)0), 3);\n ref_add (bl, position);\n save_bloom (ref_name, bl, ((void *)0), target_path);\n return 0;\n}",
"variable_types": [
[
"ref_name",
"char *"
],
[
"target_path",
"char *"
],
[
"k_mer",
"int"
],
[
"error_rate",
"double"
],
[
"prefix",
"char *"
],
[
"position",
"char *"
],
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
]
],
"return_type": "int",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "d32b56d05626e61462fb6e4612dcf5b23046c532266da4c0d399d6c5aeca54ad"
},
{
"name": "fasta_title",
"canonical_name": "func4",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "char *__fastcall fasta_title(const char *a1)\n{\nreturn strchr(a1, 10) + 1;\n}\n",
"canonical_decompiled_code": "char *__fastcall func4(const char *a1)\n{\nreturn strchr(a1, 10) + 1;\n}",
"original_code": "char *\nfasta_title (char *full)\n{\n char *ptr;\n ptr = strchr (full, '\\n');\n return ptr + 1;\n}",
"canonical_original_code": "char *fasta_title(char *full)\n{\n char *ptr;\n ptr = strchr (full, '\\n');\n return ptr + 1;\n}",
"variable_types": [
[
"full",
"char *"
],
[
"ptr",
"char *"
]
],
"return_type": "char *",
"user_defined_types": [],
"binary_hash": "d32b56d05626e61462fb6e4612dcf5b23046c532266da4c0d399d6c5aeca54ad"
},
{
"name": "fasta_add",
"canonical_name": "func5",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "__int64 __fastcall fasta_add(__int64 a1, char *a2)\n{\n__int64 result; // rax\n\nwhile ( 1 )\n{\nresult = (unsigned __int8)*a2;\nif ( !(_BYTE)result )\nbreak;\nif ( *a2 == 62 )\na2 = fasta_title(a2);\nelse\na2 = (char *)fasta_data(a1, a2);\n}\nreturn result;\n}\n",
"canonical_decompiled_code": "__int64 __fastcall func5(__int64 a1, char *a2)\n{\n__int64 result; // rax\n\nwhile ( 1 )\n{\nresult = (unsigned __int8)*a2;\nif ( !(_BYTE)result )\nbreak;\nif ( *a2 == 62 )\na2 = func4(a2);\nelse\na2 = (char *)fasta_data(a1, a2);\n}\nreturn result;\n}",
"original_code": "void\nfasta_add (bloom * bl, char *position)\n{\n while (*position != '\\0')\n {\n if (*position == '>')\n position = fasta_title (position);\n else\n position = fasta_data (bl, position);\n }\n}",
"canonical_original_code": "void fasta_add(struct bloom *bl, char *position)\n{\n while (*position != '\\0')\n {\n if (*position == '>')\n position = fasta_title (position);\n else\n position = fasta_data (bl, position);\n }\n}",
"variable_types": [
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"position",
"char *"
]
],
"return_type": "void",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "d32b56d05626e61462fb6e4612dcf5b23046c532266da4c0d399d6c5aeca54ad"
},
{
"name": "fastq_add",
"canonical_name": "func6",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "void __fastcall fastq_add(__int64 a1, const char *a2)\n{\nchar *sa; // [rsp+0h] [rbp-20h]\nchar *sb; // [rsp+0h] [rbp-20h]\nchar *v5; // [rsp+10h] [rbp-10h]\nvoid *dest; // [rsp+18h] [rbp-8h]\n\ndest = malloc(*(int *)(a1 + 56) + 1LL);\nwhile ( *a2 )\n{\nfor ( sa = strchr(a2, 10) + 1; sa[*(int *)(a1 + 56) - 1] != 10; ++sa )\n{\nmemcpy(dest, sa, *(int *)(a1 + 56));\n*((_BYTE *)dest + *(int *)(a1 + 56)) = 0;\nbloom_add(a1, dest);\n}\nsb = strchr(&sa[*(int *)(a1 + 56)], 10) + 1;\nv5 = strchr(sb, 10);\nif ( !v5 )\nbreak;\na2 = v5 + 1;\n}\nfree(dest);\n}\n",
"canonical_decompiled_code": "void __fastcall func6(__int64 a1, const char *a2)\n{\nchar *sa; // [rsp+0h] [rbp-20h]\nchar *sb; // [rsp+0h] [rbp-20h]\nchar *v5; // [rsp+10h] [rbp-10h]\nvoid *dest; // [rsp+18h] [rbp-8h]\n\ndest = malloc(*(int *)(a1 + 56) + 1LL);\nwhile ( *a2 )\n{\nfor ( sa = strchr(a2, 10) + 1; sa[*(int *)(a1 + 56) - 1] != 10; ++sa )\n{\nmemcpy(dest, sa, *(int *)(a1 + 56));\n*((_BYTE *)dest + *(int *)(a1 + 56)) = 0;\nbloom_add(a1, dest);\n}\nsb = strchr(&sa[*(int *)(a1 + 56)], 10) + 1;\nv5 = strchr(sb, 10);\nif ( !v5 )\nbreak;\na2 = v5 + 1;\n}\nfree(dest);\n}",
"original_code": "void\nfastq_add (bloom * bl, char *position)\n{\n char *key = (char *) malloc (bl->k_mer * sizeof (char) + 1);\n while (position[0] != '\\0')\n {\n position = strchr (position, '\\n') + 1;\n while (position[bl->k_mer - 1] != '\\n') {\n memcpy (key, position, sizeof (char) * bl->k_mer);\n key[bl->k_mer] = '\\0';\n bloom_add (bl, key);\n position++;\n }\n position += bl->k_mer;\n position = strchr (position, '\\n') + 1;\n char *v = strchr (position, '\\n');\n if (!v) break;\n else position = v + 1;\n }\n free (key);\n}",
"canonical_original_code": "void fastq_add(struct bloom *bl, char *position)\n{\n char *key = (char *) malloc (bl->k_mer * sizeof (char) + 1);\n while (position[0] != '\\0')\n {\n position = strchr (position, '\\n') + 1;\n while (position[bl->k_mer - 1] != '\\n') {\n memcpy (key, position, sizeof (char) * bl->k_mer);\n key[bl->k_mer] = '\\0';\n bloom_add (bl, key);\n position++;\n }\n position += bl->k_mer;\n position = strchr (position, '\\n') + 1;\n char *v = strchr (position, '\\n');\n if (!v) break;\n else position = v + 1;\n }\n free (key);\n}",
"variable_types": [
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"position",
"char *"
],
[
"key",
"char *"
],
[
"v",
"char *"
]
],
"return_type": "void",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "d32b56d05626e61462fb6e4612dcf5b23046c532266da4c0d399d6c5aeca54ad"
},
{
"name": "ref_add",
"canonical_name": "func7",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "void __fastcall ref_add(__int64 a1, char *a2)\n{\nif ( *a2 == 62 )\n{\nfasta_add(a1, a2);\n}\nelse\n{\nif ( *a2 != 64 )\n{\nperror(\"wrong format\\n\");\nexit(-1);\n}\nfastq_add(a1, a2);\n}\n}\n",
"canonical_decompiled_code": "void __fastcall func7(__int64 a1, char *a2)\n{\nif ( *a2 == 62 )\n{\nfunc5(a1, a2);\n}\nelse\n{\nif ( *a2 != 64 )\n{\nperror(\"wrong format\\n\");\nexit(-1);\n}\nfunc6(a1, a2);\n}\n}",
"original_code": "void ref_add (bloom * bl, char *position)\n{\n if (*position == '>')\n fasta_add (bl, position);\n else if (*position == '@')\n fastq_add (bl, position);\n else\n {\n perror (\"wrong format\\n\");\n exit (-1);\n }\n}",
"canonical_original_code": "void ref_add(struct bloom *bl, char *position)\n{\n if (*position == '>')\n fasta_add (bl, position);\n else if (*position == '@')\n fastq_add (bl, position);\n else\n {\n perror (\"wrong format\\n\");\n exit (-1);\n }\n}",
"variable_types": [
[
"bl",
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; } stat; int k_mer; int dx; float mcf; } *"
],
[
"position",
"char *"
]
],
"return_type": "void",
"user_defined_types": [
"struct bloom { char *vector; unsigned long long (*hash)(char *str); unsigned long long inserts; struct bloomstat stat; int k_mer; int dx; float mcf; }",
"struct bloomstat { unsigned long long elements; int ideal_hashes; unsigned long long capacity; double e; }"
],
"binary_hash": "d32b56d05626e61462fb6e4612dcf5b23046c532266da4c0d399d6c5aeca54ad"
}
] |
e380f65fc212a1ee7501ea3960b75288de0c85ebf03169646a39f2fc7226c672 | tzcoolman/FACS-OLD | [
[
"get_file_path",
"->",
"make_list"
],
[
"is_dir",
"->",
"make_list"
],
[
"is_file",
"->",
"make_list"
],
[
"is_special_dir",
"->",
"make_list"
],
[
"make_list",
"->",
"is_file",
"is_dir",
"get_file_path",
"is_special_dir"
]
] | [
[
"make_list",
"__int64 __fastcall func4(const char *a1, __int64 a2)\n{\n_QWORD *v2; // rax\nchar *src; // [rsp+0h] [rbp-70h]\nint v5; // [rsp+18h] [rbp-58h]\n_WORD *v6; // [rsp+20h] [rbp-50h]\n__int16 *v7; // [rsp+30h] [rbp-40h]\nvoid *v8; // [rsp+38h] [rbp-38h]\nstruct dirent64 *v9; // [rsp+40h] [rbp-30h]\nDIR *dirp; // [rsp+48h] [rbp-28h]\nchar *v11; // [rsp+50h] [rbp-20h]\nvoid *s; // [rsp+58h] [rbp-18h]\n_QWORD *v13; // [rsp+60h] [rbp-10h]\n_QWORD *v14; // [rsp+68h] [rbp-8h]\n__int64 savedregs; // [rsp+70h] [rbp+0h] BYREF\n\nv14 = malloc(0x38uLL);\nv13 = v14;\nv5 = 0;\nif ( a2 )\n{\nsrc = (char *)mmaping(a2);\nwhile ( src )\n{\ns = malloc(0xC9uLL);\nmemset(s, 0, 0xC8uLL);\nv6 = malloc(0x38uLL);\n*(_QWORD *)v6 = 0LL;\nv6[4] = 0;\nv11 = strchr(src, 10);\nif ( !v11 )\nbreak;\nstrncat((char *)s, src, v11 - src);\n*(_QWORD *)v6 = s;\nv6[4] = v5;\n*((_QWORD *)v6 + 6) = v14[6];\nv14[6] = v6;\nv14 = (_QWORD *)v14[6];\nsrc = v11 + 1;\n++v5;\n}\n}\nelse if ( func2(a1) )\n{\nv2 = malloc(0x38uLL);\n*v2 = a1;\nv2[6] = v14[6];\nv14[6] = v2;\n*(_QWORD *)(v14[6] + 48LL) = 0LL;\n}\nelse if ( func1(a1) )\n{\ndirp = opendir(a1);\nif ( !dirp )\n{\nperror(\"Empty dir\\n\");\nexit(-1);\n}\nwhile ( 1 )\n{\nv9 = readdir64(dirp);\nif ( !v9 )\nbreak;\nv8 = malloc(0x12CuLL);\nmemset(v8, 0, 0x12CuLL);\nfunc0(a1, v9->d_name, (char *)v8);\nif ( !func3(v9->d_name) && strstr(v9->d_name, \".bloom\") )\n{\nprintf(\"file_path->%s\\n\", (const char *)v8);\nv7 = (__int16 *)malloc(0x38uLL);\n*(_QWORD *)v7 = v8;\nv7[4] = (unsigned __int16)&savedregs - 88;\nprintf(\"fset->%d\\n\", (unsigned int)v7[4]);\n*((_QWORD *)v7 + 6) = v14[6];\nv14[6] = v7;\nv14 = (_QWORD *)v14[6];\n++v5;\n}\n}\n}\n*(_QWORD *)(v13[6] + 16LL) = 0LL;\n*(_QWORD *)(v13[6] + 24LL) = 0LL;\nreturn v13[6];\n}"
]
] | [
{
"name": "get_file_path",
"canonical_name": "func0",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "char *__fastcall get_file_path(const char *a1, const char *a2, char *a3)\n{\nstrcpy(a3, a1);\nif ( a3[strlen(a1) - 1] != 47 )\n*(_WORD *)&a3[strlen(a3)] = 47;\nreturn strcat(a3, a2);\n}\n",
"canonical_decompiled_code": "char *__fastcall func0(const char *a1, const char *a2, char *a3)\n{\nstrcpy(a3, a1);\nif ( a3[strlen(a1) - 1] != 47 )\n*(_WORD *)&a3[strlen(a3)] = 47;\nreturn strcat(a3, a2);\n}",
"original_code": "void\nget_file_path (const char *path, const char *file_name, char *file_path)\n{\n strcpy (file_path, path);\n if (file_path[strlen (path) - 1] != '/')\n strcat (file_path, \"/\");\n strcat (file_path, file_name);\n}",
"canonical_original_code": "void get_file_path(char *path, char *file_name, char *file_path)\n{\n strcpy (file_path, path);\n if (file_path[strlen (path) - 1] != '/')\n strcat (file_path, \"/\");\n strcat (file_path, file_name);\n}",
"variable_types": [
[
"path",
"char *"
],
[
"file_name",
"char *"
],
[
"file_path",
"char *"
]
],
"return_type": "void",
"user_defined_types": [],
"binary_hash": "e380f65fc212a1ee7501ea3960b75288de0c85ebf03169646a39f2fc7226c672"
},
{
"name": "is_dir",
"canonical_name": "func1",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "_BOOL8 __fastcall is_dir(const char *a1)\n{\n_BOOL8 result; // rax\nstruct stat64 buf; // [rsp+10h] [rbp-90h] BYREF\n\nif ( lstat64(a1, &buf) )\nresult = 0LL;\nelse\nresult = (buf.st_mode & 0xF000) == 0x4000;\nreturn result;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func1(const char *a1)\n{\n_BOOL8 result; // rax\nstruct stat64 buf; // [rsp+10h] [rbp-90h] BYREF\n\nif ( lstat64(a1, &buf) )\nresult = 0LL;\nelse\nresult = (buf.st_mode & 0xF000) == 0x4000;\nreturn result;\n}",
"original_code": "int\nis_dir (const char *path)\n{\n struct stat statbuf;\n if (lstat (path, &statbuf) == 0)\n {\n return ((((statbuf.st_mode)) & 0170000) == (0040000)) != 0;\n }\n return 0;\n}",
"canonical_original_code": "int is_dir(char *path)\n{\n struct stat statbuf;\n if (lstat (path, &statbuf) == 0)\n {\n return ((((statbuf.st_mode)) & 0170000) == (0040000)) != 0;\n }\n return 0;\n}",
"variable_types": [
[
"path",
"char *"
],
[
"statbuf",
"struct stat { unsigned long st_dev; unsigned long st_ino; unsigned long st_nlink; unsigned int st_mode; unsigned int st_uid; unsigned int st_gid; int __pad0; unsigned long st_rdev; long st_size; long st_blksize; long st_blocks; struct timespec { long tv_sec; long tv_nsec; } st_atim; struct timespec st_mtim; struct timespec st_ctim; long __glibc_reserved[3]; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct stat { unsigned long st_dev; unsigned long st_ino; unsigned long st_nlink; unsigned int st_mode; unsigned int st_uid; unsigned int st_gid; int __pad0; unsigned long st_rdev; long st_size; long st_blksize; long st_blocks; struct timespec st_atim; struct timespec st_mtim; struct timespec st_ctim; long __glibc_reserved[3]; }",
"struct timespec { long tv_sec; long tv_nsec; }"
],
"binary_hash": "e380f65fc212a1ee7501ea3960b75288de0c85ebf03169646a39f2fc7226c672"
},
{
"name": "is_file",
"canonical_name": "func2",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "_BOOL8 __fastcall is_file(const char *a1)\n{\n_BOOL8 result; // rax\nstruct stat64 buf; // [rsp+10h] [rbp-90h] BYREF\n\nif ( lstat64(a1, &buf) )\nresult = 0LL;\nelse\nresult = (buf.st_mode & 0xF000) == 0x8000;\nreturn result;\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func2(const char *a1)\n{\n_BOOL8 result; // rax\nstruct stat64 buf; // [rsp+10h] [rbp-90h] BYREF\n\nif ( lstat64(a1, &buf) )\nresult = 0LL;\nelse\nresult = (buf.st_mode & 0xF000) == 0x8000;\nreturn result;\n}",
"original_code": "int\nis_file (const char *path)\n{\n struct stat statbuf;\n if (lstat (path, &statbuf) == 0)\n return ((((statbuf.st_mode)) & 0170000) == (0100000)) != 0;\n return 0;\n}",
"canonical_original_code": "int is_file(char *path)\n{\n struct stat statbuf;\n if (lstat (path, &statbuf) == 0)\n return ((((statbuf.st_mode)) & 0170000) == (0100000)) != 0;\n return 0;\n}",
"variable_types": [
[
"path",
"char *"
],
[
"statbuf",
"struct stat { unsigned long st_dev; unsigned long st_ino; unsigned long st_nlink; unsigned int st_mode; unsigned int st_uid; unsigned int st_gid; int __pad0; unsigned long st_rdev; long st_size; long st_blksize; long st_blocks; struct timespec { long tv_sec; long tv_nsec; } st_atim; struct timespec st_mtim; struct timespec st_ctim; long __glibc_reserved[3]; }"
]
],
"return_type": "int",
"user_defined_types": [
"struct stat { unsigned long st_dev; unsigned long st_ino; unsigned long st_nlink; unsigned int st_mode; unsigned int st_uid; unsigned int st_gid; int __pad0; unsigned long st_rdev; long st_size; long st_blksize; long st_blocks; struct timespec st_atim; struct timespec st_mtim; struct timespec st_ctim; long __glibc_reserved[3]; }",
"struct timespec { long tv_sec; long tv_nsec; }"
],
"binary_hash": "e380f65fc212a1ee7501ea3960b75288de0c85ebf03169646a39f2fc7226c672"
},
{
"name": "is_special_dir",
"canonical_name": "func3",
"repo": "tzcoolman/FACS-OLD",
"decompiled_code": "_BOOL8 __fastcall is_special_dir(const char *a1)\n{\nreturn !strcmp(a1, \".\") || !strcmp(a1, \"..\");\n}\n",
"canonical_decompiled_code": "_BOOL8 __fastcall func3(const char *a1)\n{\nreturn !strcmp(a1, \".\") || !strcmp(a1, \"..\");\n}",
"original_code": "int\nis_special_dir (const char *path)\n{\n return strcmp (path, \".\") == 0 || strcmp (path, \"..\") == 0;\n}",
"canonical_original_code": "int is_special_dir(char *path)\n{\n return strcmp (path, \".\") == 0 || strcmp (path, \"..\") == 0;\n}",
"variable_types": [
[
"path",
"char *"
]
],
"return_type": "int",
"user_defined_types": [],
"binary_hash": "e380f65fc212a1ee7501ea3960b75288de0c85ebf03169646a39f2fc7226c672"
}
] |
Subsets and Splits