-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdeclaw.py
More file actions
2308 lines (2068 loc) · 112 KB
/
Copy pathdeclaw.py
File metadata and controls
2308 lines (2068 loc) · 112 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#!/usr/bin/env python3
import sys
import os
import io
import argparse
import re
import struct
import math
import base64
import warnings
from typing import Dict, List, Set, Optional, Tuple, Any
import lief
from capstone import *
from capstone.x86 import *
warnings.filterwarnings('ignore', category=RuntimeWarning)
try:
from rich.console import Console, Group
from rich.syntax import Syntax
from rich.panel import Panel
from rich.table import Table
from rich.text import Text
from rich.markup import escape
from rich import box
from rich.progress import Progress, SpinnerColumn, TextColumn
RICH_AVAILABLE = True
except ImportError:
RICH_AVAILABLE = False
if hasattr(sys.stdout, 'reconfigure'):
sys.stdout.reconfigure(encoding='utf-8')
REG_64_TO_FAMILY = {
'rax': 'rax', 'eax': 'rax', 'ax': 'rax', 'al': 'rax', 'ah': 'rax',
'rbx': 'rbx', 'ebx': 'rbx', 'bx': 'rbx', 'bl': 'rbx', 'bh': 'rbx',
'rcx': 'rcx', 'ecx': 'rcx', 'cx': 'rcx', 'cl': 'rcx', 'ch': 'rcx',
'rdx': 'rdx', 'edx': 'rdx', 'dx': 'rdx', 'dl': 'rdx', 'dh': 'rdx',
'rsi': 'rsi', 'esi': 'rsi', 'si': 'rsi', 'sil': 'rsi',
'rdi': 'rdi', 'edi': 'rdi', 'di': 'rdi', 'dil': 'rdi',
'rbp': 'rbp', 'ebp': 'rbp', 'bp': 'rbp', 'bpl': 'rbp',
'rsp': 'rsp', 'esp': 'rsp', 'sp': 'rsp', 'spl': 'rsp',
'r8': 'r8', 'r8d': 'r8', 'r8w': 'r8', 'r8b': 'r8',
'r9': 'r9', 'r9d': 'r9', 'r9w': 'r9', 'r9b': 'r9',
'r10': 'r10', 'r10d': 'r10', 'r10w': 'r10', 'r10b': 'r10',
'r11': 'r11', 'r11d': 'r11', 'r11w': 'r11', 'r11b': 'r11',
'r12': 'r12', 'r12d': 'r12', 'r12w': 'r12', 'r12b': 'r12',
'r13': 'r13', 'r13d': 'r13', 'r13w': 'r13', 'r13b': 'r13',
'r14': 'r14', 'r14d': 'r14', 'r14w': 'r14', 'r14b': 'r14',
'r15': 'r15', 'r15d': 'r15', 'r15w': 'r15', 'r15b': 'r15',
}
SYSV_ARG_REGS = ['rdi', 'rsi', 'rdx', 'rcx', 'r8', 'r9']
def decode_imm_string(val: int) -> Optional[str]:
"""Decodes integer immediates that encode printable ASCII strings (e.g. 0x4e4957584b434148 -> 'HACKXWIN')."""
if val < 0:
val = val & 0xFFFFFFFFFFFFFFFF
for length in (8, 7, 6, 5, 4, 3):
mask = (1 << (length * 8)) - 1
masked = val & mask
b = masked.to_bytes(length, byteorder='little')
if all(32 <= c <= 126 for c in b):
try:
s = b.decode('ascii')
s = s.replace('\\', '\\\\').replace('"', '\\"').replace('\n', '\\n').replace('\r', '\\r').replace('\t', '\\t')
return f'"{s}"'
except Exception:
pass
return None
def clean_var_str(op_str: str) -> str:
"""Normalizes stack offsets into clean variable identifiers."""
op_str = re.sub(r'^(byte|word|dword|qword)\s+ptr\s+', '', op_str.strip())
m = re.match(r'^\[[re]?bp\s*-\s*(?:0x([0-9a-fA-F]+)|(\d+))\]$', op_str)
if m:
offset_hex = m.group(1) if m.group(1) else hex(int(m.group(2)))[2:]
return f"var_{offset_hex}"
m = re.match(r'^\[[re]?bp\s*\+\s*(?:0x([0-9a-fA-F]+)|(\d+))\]$', op_str)
if m:
offset_hex = m.group(1) if m.group(1) else hex(int(m.group(2)))[2:]
return f"arg_{offset_hex}"
m = re.match(r'^\[[re]?sp\s*\+\s*(?:0x([0-9a-fA-F]+)|(\d+))\]$', op_str)
if m:
offset_hex = m.group(1) if m.group(1) else hex(int(m.group(2)))[2:]
return f"var_{offset_hex}"
if 'fs:0x28' in op_str or ':0x28]' in op_str:
return "__stack_chk_guard"
return op_str
def invert_condition(cond: str) -> str:
"""Inverts a logical comparison condition."""
cond = cond.strip()
if ' == ' in cond:
return cond.replace(' == ', ' != ', 1)
if ' != ' in cond:
return cond.replace(' != ', ' == ', 1)
if ' <= ' in cond:
return cond.replace(' <= ', ' > ', 1)
if ' >= ' in cond:
return cond.replace(' >= ', ' < ', 1)
if ' < ' in cond:
return cond.replace(' < ', ' >= ', 1)
if ' > ' in cond:
return cond.replace(' > ', ' <= ', 1)
if cond.startswith('!(') and cond.endswith(')'):
return cond[2:-1]
return f"!({cond})"
def clean_statement_text(stmt: str) -> str:
"""Cleans up syntax artifacts in generated C statements."""
stmt = re.sub(r'&("([^"\\]|\\.)*")', r'\1', stmt)
stmt = re.sub(r'(\w+)\s+js\s+\1', r'\1 < 0', stmt)
stmt = re.sub(r'(\w+)\s+jns\s+\1', r'\1 >= 0', stmt)
stmt = re.sub(r'\b==\s*0x2d\b', "== '-'", stmt)
stmt = re.sub(r'\b!=\s*0x2d\b', "!= '-'", stmt)
stmt = re.sub(r'\b==\s*0xa\b', "== '\\n'", stmt)
stmt = re.sub(r'\b!=\s*0xa\b', "!= '\\n'", stmt)
stmt = re.sub(r'\b==\s*0x0\b', "== 0", stmt)
stmt = re.sub(r'\b!=\s*0x0\b', "!= 0", stmt)
if '0xaaaaaaab' in stmt:
stmt = re.sub(r'\b(var_[0-9a-fA-F]+)\s*-\s*\([^)]*0xaaaaaaab[^)]*\)', r'\1 % 3', stmt)
return stmt
class BinaryContext:
"""Loads and encapsulates binary sections, symbols, relocations, PLT stubs, and string data."""
def __init__(self, filename: str):
self.filename = filename
self.binary = lief.parse(filename)
if not self.binary:
raise ValueError(f"Could not parse binary {filename} with LIEF.")
self.sections: Dict[str, Dict[str, Any]] = {}
for s in self.binary.sections:
if s.size > 0:
self.sections[s.name] = {
'addr': s.virtual_address,
'size': s.size,
'data': bytes(s.content)
}
self.imagebase = 0
self.entrypoint = self.binary.entrypoint
if isinstance(self.binary, lief.PE.Binary) and hasattr(self.binary, 'optional_header'):
self.imagebase = self.binary.optional_header.imagebase
if self.entrypoint >= self.imagebase:
self.entrypoint -= self.imagebase
self.md = self._setup_capstone()
self.symbol_map: Dict[int, str] = {}
self.relocs: Dict[int, str] = {}
self._load_symbols_and_relocs()
def _setup_capstone(self) -> Cs:
arch = CS_ARCH_X86
mode = CS_MODE_64
arch_name = self.binary.abstract.header.architecture.name if hasattr(self.binary.abstract.header.architecture, 'name') else str(self.binary.abstract.header.architecture)
if 'X86' in arch_name:
arch = CS_ARCH_X86
if hasattr(self.binary.abstract.header, 'is_64'):
mode = CS_MODE_64 if self.binary.abstract.header.is_64 else CS_MODE_32
else:
mode = CS_MODE_64
elif 'ARM64' in arch_name:
arch = CS_ARCH_ARM64
mode = CS_MODE_ARM
elif 'ARM' in arch_name:
arch = CS_ARCH_ARM
mode = CS_MODE_ARM
elif 'MIPS' in arch_name:
arch = CS_ARCH_MIPS
mode = CS_MODE_MIPS32
md = Cs(arch, mode)
md.detail = True
return md
def _load_symbols_and_relocs(self):
if isinstance(self.binary, lief.PE.Binary):
secs = list(self.binary.sections)
for sym in self.binary.symbols:
if not sym.name or sym.name.startswith(('.', '/')):
continue
if 1 <= sym.section_idx <= len(secs):
sec = secs[sym.section_idx - 1]
if sec.name.startswith(('/', '.debug')):
continue
addr = sec.virtual_address + sym.value
self.symbol_map[addr] = sym.name
for imp in self.binary.imported_functions:
if imp.name and imp.address > 0:
self.symbol_map[imp.address] = imp.name
else:
for sym in self.binary.symbols:
if sym.value > 0 and sym.name:
self.symbol_map[sym.value] = sym.name
if isinstance(self.binary, lief.ELF.Binary):
for reloc in self.binary.relocations:
if reloc.has_symbol and reloc.address > 0:
self.symbol_map[reloc.address] = reloc.symbol.name
self.relocs[reloc.address] = reloc.symbol.name
# Scan .plt, .plt.sec, .plt.got, __plt sections for jumps
plt_sections = [s for s in self.binary.sections if s.name in ('.plt', '.plt.sec', '.plt.got', '__plt')]
for plt_sec in plt_sections:
plt_bytes = bytes(plt_sec.content)
for ins in self.md.disasm(plt_bytes, plt_sec.virtual_address):
if 'jmp' in ins.mnemonic and ins.operands and ins.operands[0].type == CS_OP_MEM:
base = self.md.reg_name(ins.operands[0].mem.base)
disp = ins.operands[0].mem.disp
if base == 'rip':
target = ins.address + ins.size + disp
elif base in ('', None) and disp > 0:
target = disp
else:
target = None
if target and target in self.relocs:
sym_name = self.relocs[target]
entry_start = (ins.address // 16) * 16
self.symbol_map[entry_start] = sym_name
self.symbol_map[ins.address] = sym_name
# Detect main from _start in ELF
entry = self.binary.entrypoint
text = self.binary.get_section('.text')
if text and text.virtual_address <= entry < text.virtual_address + text.size:
offset = entry - text.virtual_address
entry_bytes = bytes(text.content)[offset:offset + 120]
for ins in self.md.disasm(entry_bytes, entry):
if ins.mnemonic == 'mov' and len(ins.operands) == 2:
if self.md.reg_name(ins.operands[0].reg) == 'rdi' and ins.operands[1].type == CS_OP_IMM:
main_addr = ins.operands[1].imm
if text.virtual_address <= main_addr < text.virtual_address + text.size:
self.symbol_map[main_addr] = 'main'
elif ins.mnemonic == 'lea' and len(ins.operands) == 2:
if self.md.reg_name(ins.operands[0].reg) == 'rdi' and ins.operands[1].type == CS_OP_MEM:
if self.md.reg_name(ins.operands[1].mem.base) == 'rip':
main_addr = ins.address + ins.size + ins.operands[1].mem.disp
if text.virtual_address <= main_addr < text.virtual_address + text.size:
self.symbol_map[main_addr] = 'main'
def read_string(self, abs_addr: int) -> Optional[str]:
valid_sections = ('.rodata', '.rdata', '__rodata', '__cstring', '.data', '.data.rel.ro')
if hasattr(self, 'imagebase') and self.imagebase > 0 and abs_addr >= self.imagebase:
abs_addr -= self.imagebase
for name, section in self.sections.items():
if name in valid_sections or 'data' in name or 'ro' in name:
if section['addr'] <= abs_addr < section['addr'] + section['size']:
offset = abs_addr - section['addr']
data = section['data'][offset:]
null_idx = data.find(b'\x00')
raw_str = data[:null_idx] if null_idx != -1 else data[:80]
if len(raw_str) >= 1 and all(32 <= b <= 126 or b in (9, 10, 13) for b in raw_str):
s = raw_str.decode('ascii', errors='replace')
s = s.replace('\\', '\\\\').replace('"', '\\"').replace('\n', '\\n').replace('\r', '\\r').replace('\t', '\\t')
return f'"{s}"'
return None
def read_jump_table(self, table_addr: int, max_cases: int = 32) -> List[int]:
valid_sections = ('.rodata', '.rdata', '__rodata', '.data')
if hasattr(self, 'imagebase') and self.imagebase > 0 and table_addr >= self.imagebase:
table_addr -= self.imagebase
for name, section in self.sections.items():
if name in valid_sections:
if section['addr'] <= table_addr < section['addr'] + section['size']:
offset = table_addr - section['addr']
data = section['data'][offset:]
entries = []
for i in range(max_cases):
if (i + 1) * 8 > len(data):
break
ptr = struct.unpack('<Q', data[i * 8:(i + 1) * 8])[0]
if any(s['addr'] <= ptr < s['addr'] + s['size'] for sname, s in self.sections.items() if 'text' in sname or 'code' in sname):
entries.append(ptr)
else:
break
if len(entries) >= 2:
return entries
return []
class ILBlock:
"""Represents a Basic Block with lifted statements and control-flow edges."""
def __init__(self, start_addr: int):
self.start_addr = start_addr
self.end_addr = start_addr
self.instructions: List[Any] = []
self.statements: List[str] = []
self.successors: List['ILBlock'] = []
self.predecessors: List['ILBlock'] = []
self.condition: Optional[str] = None
self.jump_type: Optional[str] = None
self.switch_expr: Optional[str] = None
self.switch_cases: Dict[int, int] = {}
self.raw_jump_target: Optional[str] = None
class FunctionFinder:
"""Discovers function boundaries cleanly, avoiding accidental function merging."""
@staticmethod
def get_code_sections(ctx: BinaryContext) -> List[Any]:
code_sections = []
for s in ctx.binary.sections:
if s.size == 0:
continue
is_exec = False
if hasattr(lief.ELF, 'SECTION_FLAGS') and isinstance(ctx.binary, lief.ELF.Binary):
is_exec = s.has(lief.ELF.SECTION_FLAGS.EXECINSTR)
elif hasattr(lief.PE, 'SECTION_CHARACTERISTICS') and isinstance(ctx.binary, lief.PE.Binary):
is_exec = s.has(lief.PE.SECTION_CHARACTERISTICS.MEM_EXECUTE)
elif hasattr(lief.MachO, 'SECTION_FLAGS') and isinstance(ctx.binary, lief.MachO.Binary):
is_exec = s.has(lief.MachO.SECTION_FLAGS.SOME_INSTRUCTIONS)
if is_exec and s.name not in ('.plt', '.plt.sec', '__plt'):
code_sections.append(s)
if not code_sections:
for s in ctx.binary.sections:
if s.name in ('.text', '__text', 'CODE'):
code_sections.append(s)
return code_sections
@staticmethod
def find_functions(ctx: BinaryContext) -> List[Tuple[int, int, str]]:
code_sections = FunctionFinder.get_code_sections(ctx)
starts: Set[int] = set()
if ctx.entrypoint > 0:
starts.add(ctx.entrypoint)
for addr in ctx.symbol_map:
if any(s.virtual_address <= addr < s.virtual_address + s.size for s in code_sections):
starts.add(addr)
endbr_followers: Set[int] = set()
for s in code_sections:
bytes_data = bytes(s.content)
base = s.virtual_address
end = base + s.size
starts.add(base)
ins_list = list(ctx.md.disasm(bytes_data, base))
for i, ins in enumerate(ins_list):
if ins.mnemonic in ('call', 'bl'):
try:
target = int(ins.op_str.split(',')[0], 16)
if base <= target < end:
starts.add(target)
except ValueError:
pass
elif ins.mnemonic in ('endbr64', 'endbr32'):
starts.add(ins.address)
endbr_followers.add(ins.address + ins.size)
elif ins.mnemonic == 'push' and ins.op_str in ('rbp', 'ebp'):
nxt = ins_list[i + 1] if i + 1 < len(ins_list) else None
if nxt and nxt.mnemonic == 'mov' and nxt.op_str in ('rbp, rsp', 'ebp, esp'):
if ins.address not in endbr_followers:
j = i - 1
while j >= 0 and ins_list[j].mnemonic in ('nop', 'endbr64', 'endbr32'):
j -= 1
prev_m = ins_list[j].mnemonic if j >= 0 else None
if j < 0 or prev_m in ('ret', 'jmp', 'hlt', 'ud2', 'int3'):
starts.add(ins.address)
# Remove redundant addresses right after endbr64
starts = starts - endbr_followers
# Filter out candidate starts that fall strictly inside known ELF function symbols
if isinstance(ctx.binary, lief.ELF.Binary):
for sym in ctx.binary.symbols:
if sym.type == lief.ELF.Symbol.TYPE.FUNC and sym.value > 0 and sym.size > 0:
starts = {s for s in starts if s == sym.value or not (sym.value < s < sym.value + sym.size)}
sorted_starts = sorted(list(starts))
functions = []
for i, start_addr in enumerate(sorted_starts):
sec = next((s for s in code_sections if s.virtual_address <= start_addr < s.virtual_address + s.size), None)
if not sec:
continue
sec_end = sec.virtual_address + sec.size
next_start = sorted_starts[i + 1] if i + 1 < len(sorted_starts) and sorted_starts[i + 1] < sec_end else sec_end
end_addr = next_start
func_name = ctx.symbol_map.get(start_addr, f"func_{hex(start_addr)}")
functions.append((start_addr, end_addr, func_name))
return functions
class InstructionLifter:
"""Lifts raw Capstone assembly into high-level C expressions with argument folding and dead code stripping."""
@staticmethod
def lift(ctx: BinaryContext, func_addr: int, func_end_addr: int) -> Optional[List[ILBlock]]:
sec = next((s for s in ctx.sections.values() if s['addr'] <= func_addr < s['addr'] + s['size']), None)
if not sec:
return None
offset = func_addr - sec['addr']
end_offset = func_end_addr - sec['addr']
func_bytes = sec['data'][offset:end_offset]
instructions = list(ctx.md.disasm(func_bytes, func_addr))
if not instructions:
return None
leaders: Set[int] = set([func_addr])
jump_table_info: Dict[int, Tuple[str, List[int]]] = {}
for ins in instructions:
m = ins.mnemonic
if m in ('jmp', 'b') and ins.operands and ins.operands[0].type == CS_OP_MEM:
mem = ins.operands[0].mem
if mem.disp > 0 and mem.index != 0:
entries = ctx.read_jump_table(mem.disp)
if entries:
index_reg = ctx.md.reg_name(mem.index)
jump_table_info[ins.address] = (index_reg, entries)
for target in entries:
if func_addr <= target < func_end_addr:
leaders.add(target)
elif m.startswith('j') or m.startswith('b') or m in ('call', 'bl'):
try:
target = int(ins.op_str.split(',')[0], 16)
if func_addr <= target < func_end_addr:
leaders.add(target)
except ValueError:
pass
if m.startswith('j') or m.startswith('b') or m in ('call', 'bl', 'ret'):
next_addr = ins.address + ins.size
if func_addr <= next_addr < func_end_addr:
leaders.add(next_addr)
blocks: List[ILBlock] = []
block_map: Dict[int, ILBlock] = {}
cur_block: Optional[ILBlock] = None
for ins in instructions:
if ins.address in leaders:
cur_block = ILBlock(ins.address)
blocks.append(cur_block)
block_map[ins.address] = cur_block
if cur_block:
cur_block.instructions.append(ins)
cur_block.end_addr = ins.address + ins.size
for i, b in enumerate(blocks):
if not b.instructions:
continue
last_ins = b.instructions[-1]
m = last_ins.mnemonic
nxt = blocks[i + 1] if i + 1 < len(blocks) else None
if last_ins.address in jump_table_info:
b.jump_type = 'switch'
reg, targets = jump_table_info[last_ins.address]
b.switch_expr = reg
for c_idx, tgt in enumerate(targets):
b.switch_cases[c_idx] = tgt
if tgt in block_map:
target_b = block_map[tgt]
if target_b not in b.successors:
b.successors.append(target_b)
elif m == 'ret':
b.jump_type = 'ret'
elif m in ('jmp', 'b'):
b.jump_type = 'jmp'
try:
tgt = int(last_ins.op_str.split(',')[0], 16)
if tgt in block_map:
b.successors.append(block_map[tgt])
else:
b.raw_jump_target = hex(tgt)
except ValueError:
b.raw_jump_target = last_ins.op_str
elif m.startswith('j') or m.startswith('b'):
b.jump_type = 'cond'
try:
tgt = int(last_ins.op_str.split(',')[0], 16)
if tgt in block_map:
b.successors.append(block_map[tgt])
if nxt:
b.successors.append(nxt)
except ValueError:
pass
else:
b.jump_type = 'fall'
if nxt:
b.successors.append(nxt)
for s in b.successors:
s.predecessors.append(b)
canary_regs: Set[str] = set()
canary_var = None
for b in blocks:
reg_state: Dict[str, str] = {}
pushed_args: List[str] = []
statements: List[str] = []
last_cmp: Optional[Tuple[str, str, str]] = None
last_call_expr: Optional[str] = None
for ins_idx, ins in enumerate(b.instructions):
m = ins.mnemonic
op_str = ins.op_str
if m in ('endbr64', 'endbr32', 'nop'):
continue
if m == 'lea' and op_str.startswith('ecx,') and '[esp' in op_str:
continue
if m == 'and' and op_str.startswith('esp,'):
continue
if m == 'push' and (op_str in ('rbp', 'ebp', 'r12', 'r13', 'r14', 'r15', 'rbx', 'ecx') or 'ecx - 4' in op_str):
continue
if m == 'pop' and op_str in ('rbp', 'ebp', 'r12', 'r13', 'r14', 'r15', 'rbx', 'ecx'):
continue
if m == 'mov' and op_str in ('rbp, rsp', 'ebp, esp'):
continue
if m == 'sub' and (op_str.startswith('rsp, ') or op_str.startswith('esp, ')):
pushed_args.clear()
continue
if m == 'leave':
continue
# Stack canary setup
if m == 'mov' and ('fs:0x28' in op_str or ':0x28]' in op_str):
parts = op_str.split(',')
dest_reg = parts[0].strip()
fam = REG_64_TO_FAMILY.get(dest_reg)
if fam:
canary_regs.add(fam)
reg_state[fam] = '__stack_chk_guard'
continue
if m == 'mov':
parts = op_str.split(',')
if len(parts) == 2:
src_reg = parts[1].strip()
src_fam = REG_64_TO_FAMILY.get(src_reg)
if src_fam and src_fam in canary_regs:
canary_var = clean_var_str(parts[0].strip())
continue
# Stack canary check at epilogue
if canary_var and (canary_var in op_str or 'fs:0x28' in op_str or ':0x28]' in op_str):
if m in ('xor', 'sub', 'cmp') or (m == 'mov' and 'fs:0x28' in op_str):
continue
# Resolve operands
resolved_ops = []
if hasattr(ins, 'operands') and ins.operands:
for op in ins.operands:
if op.type == CS_OP_REG:
r_name = ctx.md.reg_name(op.reg)
resolved_ops.append(r_name)
elif op.type == CS_OP_IMM:
imm = op.imm
if imm == 0:
resolved_ops.append("0")
elif imm in ctx.symbol_map:
resolved_ops.append(ctx.symbol_map[imm])
else:
s = ctx.read_string(imm)
if s:
resolved_ops.append(s)
else:
imm_str = decode_imm_string(imm)
if imm_str:
resolved_ops.append(imm_str)
elif -9 <= imm <= 9:
resolved_ops.append(str(imm))
else:
resolved_ops.append(hex(imm))
elif op.type == CS_OP_MEM:
base = ctx.md.reg_name(op.mem.base) if op.mem.base != 0 else ""
index = ctx.md.reg_name(op.mem.index) if op.mem.index != 0 else ""
scale = op.mem.scale
disp = op.mem.disp
seg = ctx.md.reg_name(op.mem.segment) if hasattr(op.mem, 'segment') and op.mem.segment != 0 else ""
if seg == 'fs':
resolved_ops.append(f"[fs:{hex(disp)}]")
elif base == 'rip':
target = ins.address + ins.size + disp
if target in ctx.symbol_map:
resolved_ops.append(ctx.symbol_map[target])
else:
s = ctx.read_string(target)
resolved_ops.append(s if s else f"g_data_{hex(target)}")
elif base in ('rsp', 'rbp', 'esp', 'ebp'):
if disp == 0:
resolved_ops.append(f"[{base}]")
elif disp > 0:
resolved_ops.append(clean_var_str(f"[{base} + {hex(disp)}]"))
else:
if index:
resolved_ops.append(f"var_{hex(-disp)[2:]}[{index}]")
else:
resolved_ops.append(clean_var_str(f"[{base} - {hex(-disp)}]"))
elif base and index:
if scale > 1:
resolved_ops.append(f"{base}[{index} * {scale}]")
else:
resolved_ops.append(f"{base}[{index}]")
elif index and disp:
sym = ctx.symbol_map.get(disp, f"g_data_{hex(disp)}")
resolved_ops.append(f"{sym}[{index}]")
elif not base and not index and disp:
if disp in ctx.symbol_map:
resolved_ops.append(ctx.symbol_map[disp])
else:
s = ctx.read_string(disp)
resolved_ops.append(s if s else f"g_data_{hex(disp)}")
elif base:
resolved_ops.append(f"*{base}" if disp == 0 else f"*({base} + {hex(disp)})")
else:
resolved_ops.append(f"[{hex(disp)}]")
else:
resolved_ops.append("UNKNOWN")
else:
parts = [p.strip() for p in op_str.split(',')]
resolved_ops = [clean_var_str(p) for p in parts if p]
# Lift semantics
if m in ('mov', 'movzx', 'movsx', 'movsxd', 'movabs') and len(resolved_ops) == 2:
dest, src = resolved_ops
src_fam = REG_64_TO_FAMILY.get(src)
src_val = reg_state.get(src_fam, src) if src_fam else src
dest_fam = REG_64_TO_FAMILY.get(dest)
if dest_fam:
reg_state[dest_fam] = src_val
else:
statements.append(f"{dest} = {src_val};")
elif m == 'lea' and len(resolved_ops) == 2:
dest, src = resolved_ops
dest_fam = REG_64_TO_FAMILY.get(dest)
if src.startswith('var_') or src.startswith('arg_') or src.startswith('stack_'):
addr_val = f"&{src}"
elif src.startswith('*'):
addr_val = src[1:]
else:
addr_val = f"&{src}" if not src.startswith('&') else src
if dest_fam:
reg_state[dest_fam] = addr_val
else:
statements.append(f"{dest} = {addr_val};")
elif m in ('add', 'sub') and len(resolved_ops) == 2:
dest, src = resolved_ops
if dest in ('rsp', 'esp'):
continue
src_fam = REG_64_TO_FAMILY.get(src)
src_val = reg_state.get(src_fam, src) if src_fam else src
dest_fam = REG_64_TO_FAMILY.get(dest)
op_sym = '+' if m == 'add' else '-'
if dest_fam:
prev = reg_state.get(dest_fam, dest)
reg_state[dest_fam] = f"({prev} {op_sym} {src_val})"
else:
if src_val in ('1', '0x1'):
statements.append(f"{dest}++;" if m == 'add' else f"{dest}--;")
else:
statements.append(f"{dest} {op_sym}= {src_val};")
elif m == 'inc' and len(resolved_ops) == 1:
statements.append(f"{resolved_ops[0]}++;")
elif m == 'dec' and len(resolved_ops) == 1:
statements.append(f"{resolved_ops[0]}--;")
elif m == 'xor' and len(resolved_ops) == 2:
dest, src = resolved_ops
dest_fam = REG_64_TO_FAMILY.get(dest)
if dest == src:
if dest_fam:
reg_state[dest_fam] = "0"
else:
statements.append(f"{dest} = 0;")
else:
src_fam = REG_64_TO_FAMILY.get(src)
src_val = reg_state.get(src_fam, src) if src_fam else src
if dest_fam:
prev = reg_state.get(dest_fam, dest)
reg_state[dest_fam] = f"({prev} ^ {src_val})"
else:
statements.append(f"{dest} ^= {src_val};")
elif m in ('and', 'or', 'shl', 'shr') and len(resolved_ops) == 2:
dest, src = resolved_ops
src_fam = REG_64_TO_FAMILY.get(src)
src_val = reg_state.get(src_fam, src) if src_fam else src
dest_fam = REG_64_TO_FAMILY.get(dest)
sym_map = {'and': '&', 'or': '|', 'shl': '<<', 'shr': '>>'}
op_sym = sym_map[m]
if dest_fam:
prev = reg_state.get(dest_fam, dest)
reg_state[dest_fam] = f"({prev} {op_sym} {src_val})"
else:
statements.append(f"{dest} {op_sym}= {src_val};")
elif m in ('cmp', 'test') and len(resolved_ops) == 2:
op1, op2 = resolved_ops
op1_fam = REG_64_TO_FAMILY.get(op1)
op2_fam = REG_64_TO_FAMILY.get(op2)
v1 = reg_state.get(op1_fam, op1) if op1_fam else op1
v2 = reg_state.get(op2_fam, op2) if op2_fam else op2
last_cmp = (v1, v2, m)
elif m == 'push' and len(resolved_ops) == 1:
val = resolved_ops[0]
fam = REG_64_TO_FAMILY.get(val)
if fam and fam in reg_state:
val = reg_state[fam]
if val not in ('ebp', 'ecx', 'rbp') and not (val.startswith('[ecx') or val.startswith('[rcx')):
pushed_args.append(val)
elif m == 'add' and 'esp' in op_str:
pushed_args.clear()
elif m in ('call', 'bl'):
target_str = resolved_ops[0] if resolved_ops else "unknown_func"
try:
target_addr = int(target_str, 16)
target_name = ctx.symbol_map.get(target_addr, f"func_{hex(target_addr)}")
except ValueError:
target_name = target_str
args = []
for r in SYSV_ARG_REGS:
if r in reg_state:
args.append(reg_state[r])
else:
break
if not args and pushed_args:
args = list(reversed(pushed_args))
pushed_args.clear()
call_expr = f"{target_name}({', '.join(args)})"
last_call_expr = call_expr
for r in ('rdi', 'rsi', 'rdx', 'rcx', 'r8', 'r9', 'r10', 'r11'):
reg_state.pop(r, None)
next_ins = b.instructions[ins_idx + 1] if ins_idx + 1 < len(b.instructions) else None
if next_ins and next_ins.mnemonic in ('mov', 'movzx', 'movsx', 'movsxd') and any(reg in next_ins.op_str.split(',')[1] for reg in ('rax', 'eax')):
reg_state['rax'] = call_expr
elif target_name in ('__stack_chk_fail',):
b.jump_type = 'canary_fail'
elif target_name in ('exit', 'abort'):
statements.append(f"{call_expr};")
else:
reg_state['rax'] = call_expr
statements.append(f"{call_expr};")
elif m in ('jmp', 'b'):
target_name = None
if resolved_ops and resolved_ops[0] in ctx.symbol_map.values():
target_name = resolved_ops[0]
else:
try:
target_addr = int(resolved_ops[0], 16) if resolved_ops else None
if target_addr and target_addr in ctx.symbol_map:
target_name = ctx.symbol_map[target_addr]
except ValueError:
pass
if target_name and target_name not in ('__stack_chk_fail',):
args = [reg_state[r] for r in SYSV_ARG_REGS if r in reg_state]
if not args and pushed_args:
args = list(reversed(pushed_args))
pushed_args.clear()
statements.append(f"{target_name}({', '.join(args)});")
statements.append("return;")
b.jump_type = 'ret'
elif m == 'ret':
ret_val = reg_state.get('rax')
if ret_val:
statements.append(f"return {ret_val};")
else:
statements.append("return;")
# Build condition string
if b.jump_type == 'cond' and len(b.instructions) > 0:
last_ins = b.instructions[-1]
c_mnem = last_ins.mnemonic
if last_cmp:
v1, v2, cmp_type = last_cmp
cond_map = {
'je': f"{v1} == {v2}", 'jz': f"{v1} == {v2}",
'jne': f"{v1} != {v2}", 'jnz': f"{v1} != {v2}",
'jg': f"{v1} > {v2}", 'jge': f"{v1} >= {v2}",
'jl': f"{v1} < {v2}", 'jle': f"{v1} <= {v2}",
'ja': f"(unsigned){v1} > {v2}", 'jae': f"(unsigned){v1} >= {v2}",
'jb': f"(unsigned){v1} < {v2}", 'jbe': f"(unsigned){v1} <= {v2}",
}
if cmp_type == 'test' and v1 == v2:
if c_mnem in ('jz', 'je'):
b.condition = f"{v1} == 0"
elif c_mnem in ('jnz', 'jne'):
b.condition = f"{v1} != 0"
elif c_mnem == 'jle':
b.condition = f"{v1} <= 0"
elif c_mnem == 'jl':
b.condition = f"{v1} < 0"
elif c_mnem == 'jg':
b.condition = f"{v1} > 0"
elif c_mnem == 'jge':
b.condition = f"{v1} >= 0"
else:
b.condition = cond_map.get(c_mnem, f"{v1} {c_mnem} {v2}")
else:
b.condition = cond_map.get(c_mnem, f"{v1} {c_mnem} {v2}")
else:
b.condition = c_mnem
# Fold call into condition if condition tests return value
if b.condition and last_call_expr:
if re.search(r'\b(rax|eax|al)\b', b.condition):
b.condition = re.sub(r'\b(rax|eax|al)\b', last_call_expr, b.condition)
if statements and statements[-1].strip() == f"{last_call_expr};":
statements.pop()
if b.condition:
b.condition = clean_statement_text(b.condition)
b.statements = statements
return blocks
class ASTStructurer:
"""Transforms raw BasicBlocks into structured C control flow (loops, if-else, switches)."""
@staticmethod
def find_reachable(start_block: ILBlock, stop_at: Optional[ILBlock] = None) -> Set[int]:
visited: Set[int] = set()
queue = [start_block]
while queue:
curr = queue.pop(0)
if curr.start_addr in visited or (stop_at and curr.start_addr == stop_at.start_addr):
continue
visited.add(curr.start_addr)
for s in curr.successors:
if s.start_addr not in visited and (not stop_at or s.start_addr != stop_at.start_addr):
queue.append(s)
return visited
@staticmethod
def decompile(ctx: BinaryContext, func_addr: int, func_end_addr: int) -> str:
blocks = InstructionLifter.lift(ctx, func_addr, func_end_addr)
if not blocks:
return "// (empty function)\n"
func_name = ctx.symbol_map.get(func_addr, f"func_{hex(func_addr)}")
block_map = {b.start_addr: b for b in blocks}
# Collapse repetitive zeroing into clean memset
for b in blocks:
new_stmts = []
zero_vars = []
for s in b.statements:
m = re.match(r'^(var_[0-9a-fA-F]+)\s*=\s*0;$', s)
if m:
zero_vars.append(m.group(1))
else:
if len(zero_vars) >= 4:
new_stmts.append(f"memset(&{zero_vars[0]}, 0, sizeof({zero_vars[0]})); /* zeroed {len(zero_vars)*8} bytes */")
else:
for v in zero_vars:
new_stmts.append(f"{v} = 0;")
zero_vars = []
new_stmts.append(s)
if len(zero_vars) >= 4:
new_stmts.append(f"memset(&{zero_vars[0]}, 0, sizeof({zero_vars[0]})); /* zeroed {len(zero_vars)*8} bytes */")
else:
for v in zero_vars:
new_stmts.append(f"{v} = 0;")
b.statements = new_stmts
# Natural loops (back-edges: target <= source)
loops = []
for b in blocks:
for s in b.successors:
if s.start_addr <= b.start_addr:
h, l = s.start_addr, b.start_addr
body = set([h, l])
work = [l]
while work:
curr = work.pop()
if curr in block_map:
for p in block_map[curr].predecessors:
if p.start_addr not in body:
body.add(p.start_addr)
work.append(p.start_addr)
exits = set()
for b_addr in body:
if b_addr in block_map:
for succ in block_map[b_addr].successors:
if succ.start_addr not in body:
exits.add(succ.start_addr)
loops.append((h, l, body, exits))
# Classify loops
loop_info_map: Dict[int, Dict[str, Any]] = {}
for h, l, body, exits in loops:
h_block = block_map[h]
l_block = block_map[l]
step_str = None
loop_var = None
for s in l_block.statements:
m = re.match(r'^(var_[0-9a-fA-F]+|\w+)\+\+;$', s)
if m:
loop_var, step_str = m.group(1), f"{m.group(1)}++"
m2 = re.match(r'^(var_[0-9a-fA-F]+|\w+)\s*\+=\s*(\d+);$', s)
if m2:
loop_var, step_str = m2.group(1), f"{m2.group(1)} += {m2.group(2)}"
cond_str, init_str, exit_target = None, None, None
if loop_var:
for b_addr in body:
bb = block_map[b_addr]
if bb.condition and loop_var in bb.condition:
cond_str = bb.condition
for succ in bb.successors:
if succ.start_addr in exits:
exit_target = succ.start_addr
break
for p in h_block.predecessors:
if p.start_addr not in body:
for s in reversed(p.statements):
m_init = re.match(rf'^{loop_var}\s*=\s*([^;]+);$', s)
if m_init:
init_str = f"{loop_var} = {m_init.group(1)}"
break
if loop_var and cond_str and step_str:
loop_info_map[h] = {
'type': 'for', 'init': init_str or f"{loop_var} = 0",
'cond': cond_str, 'step': step_str, 'body': body,
'exits': exits, 'latch': l
}
elif h_block.jump_type == 'cond' and len(h_block.successors) == 2:
s0, s1 = h_block.successors[0], h_block.successors[1]
c = invert_condition(h_block.condition) if s0.start_addr in exits else h_block.condition
loop_info_map[h] = {
'type': 'while', 'cond': c, 'body': body,
'exits': exits, 'latch': l
}
else:
loop_info_map[h] = {
'type': 'while_1', 'cond': '1', 'body': body,
'exits': exits, 'latch': l
}
processed: Set[int] = set()
lines: List[str] = []
pad = " "
# Collect local variables and infer types
all_vars: Dict[str, str] = {}
for b in blocks:
for s in b.statements:
for v in re.findall(r'\b(var_[0-9a-fA-F]+)\b', s):
if v not in all_vars:
all_vars[v] = 'int'
m_buf = re.search(r'\b(fgets|read|read_input)\s*\(\s*&(var_[0-9a-fA-F]+)\s*,\s*(0x[0-9a-fA-F]+|\d+)', s)
if m_buf:
var_name = m_buf.group(2)
size_val = int(m_buf.group(3), 0)
all_vars[var_name] = f"char {var_name}[{size_val}]"
m_set = re.search(r'memset\s*\(\s*&(var_[0-9a-fA-F]+).*?sizeof\(\w+\)\);\s*/\*\s*zeroed\s+(\d+)\s*bytes', s)
if m_set:
var_name = m_set.group(1)
size_val = int(m_set.group(2))
all_vars[var_name] = f"char {var_name}[{size_val}]"
if re.search(r'\b(var_[0-9a-fA-F]+)\s*=\s*fopen\b', s):
m_f = re.search(r'\b(var_[0-9a-fA-F]+)\s*=\s*fopen\b', s)
if m_f:
all_vars[m_f.group(1)] = f"FILE *{m_f.group(1)} = NULL"
# Emit Function Signature
if func_name == 'main':
lines.append("int main(int argc, char **argv) {")
else:
lines.append(f"int {func_name}() {{")
# Declare local variables cleanly at the top
if all_vars: