-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathcodegen.py
More file actions
5453 lines (5120 loc) · 308 KB
/
Copy pathcodegen.py
File metadata and controls
5453 lines (5120 loc) · 308 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
"""Code generator with function call optimizations."""
from pycparser import c_ast
import os
import struct
import sys
import re
from register_allocator import analyze_all_functions_for_registers
from analyzer import count_function_params
def safe_str(obj):
"""Safely convert an object to string, preventing AST node attributes from leaking.
This function ensures that AST node objects are never accidentally output
as their string representation, which could include attribute names like
'type' or 'field' that would cause assembly errors.
"""
if obj is None:
return "None"
if isinstance(obj, str):
return obj
if isinstance(obj, (int, float, bool)):
return str(obj)
# For AST nodes, only output the class name, never the object itself
if hasattr(obj, '__class__'):
class_name = obj.__class__.__name__
# Remove any angle brackets or module paths
return class_name.split('.')[-1]
# For other objects, use type name
return type(obj).__name__
class CodeGenerator:
"""Code generator with indexed-jump, metamorphic return sites, quantized call-backs, and SIMD bit-packing."""
def __init__(self, function_data, global_var_data=None, asm_parser=None, use_32bit=False, enable_metamorphic_return_sites=False, register_allocator=None, enable_indexed_function_calls=False, enable_debug_gdb=False):
self.function_data = function_data
self.global_var_data = global_var_data or {'packed_vars': [], 'bit_positions': {}, 'total_bits_used': 0}
self.asm_parser = asm_parser # Assembly parser for external symbols
self.use_32bit = use_32bit # 32-bit mode flag
self.enable_metamorphic_return_sites = enable_metamorphic_return_sites # Enable/disable metamorphic return sites
self.enable_indexed_function_calls = enable_indexed_function_calls # Use indexed jump for small functions (JMP base+offset vs CALL)
self.enable_debug_gdb = enable_debug_gdb
self.register_allocator = register_allocator # Register allocator for efficient register usage
self.output = []
self.small_functions = []
self.function_offsets = {}
self.return_site_base = 0x10000 # Base address for return sites
self.return_sites = [] # Track return sites for quantized call-backs
self.return_site_index = 0
self.alignment = 16 # 16-byte alignment for quantized call-backs
self.current_line = 0 # Track current output line for return site tracking
self.simd_register = 'xmm15' # Last SIMD register for bit-packing
self.referenced_asm_symbols = set() # Track which assembly symbols we've included
self.variable_registers = {} # Track which variables are currently in registers: {var_name: register}
self._loop_hoisted_small_funcs = None # When in a loop: {func_name: reg} for precomputed jump addresses
self.needs_print_int_buffer = False # Emit shared decimal buffer only when print("%d", ...) is used
self.string_literals = {} # Interned C string literals: {raw_literal: (label, decoded_value)}
self.string_literal_counter = 0
self.external_functions = set() # Unresolved function symbols that must be declared EXTERN
# Register names based on bit mode
if use_32bit:
self.reg_rax = 'EAX'
self.reg_rbx = 'EBX'
self.reg_rcx = 'ECX'
self.reg_rdx = 'EDX'
self.reg_rdi = 'EDI'
self.reg_rsi = 'ESI'
self.reg_rbp = 'EBP'
self.reg_rsp = 'ESP'
self.reg_r8 = 'EDI' # Fallback for 6th arg - reuse EDI if needed
self.reg_r9 = 'ESI' # Fallback for 7th arg - reuse ESI if needed
# In 32-bit mode, R12/R13 don't exist, use EBP/ESP for stack base/index
# But EBP is already used for frame pointer, so use EBX/ECX instead
self.reg_binary_op_temp = 'EBX' # Same as RBX in 32-bit (no R10)
self.stack_base_register = 'EBX' # Base address register for stack (32-bit)
self.stack_index_register = 'ECX' # Index register (32-bit)
self.small_func_dispatch_reg = 'EAX' # Temp register for small-function JMP dispatch
else:
self.reg_rax = 'RAX'
self.reg_rbx = 'RBX'
self.reg_rcx = 'RCX'
self.reg_rdx = 'RDX'
self.reg_rdi = 'RDI'
self.reg_rsi = 'RSI'
self.reg_rbp = 'RBP'
self.reg_rsp = 'RSP'
self.reg_r8 = 'R8'
self.reg_r9 = 'R9'
# Caller-saved temp for binary ops so leaf functions (add, multiply) don't clobber RBX
self.reg_binary_op_temp = 'R10'
self.stack_base_register = 'R12' # Base address register for stack
self.stack_index_register = 'R13' # Index register (stores slot index, fits in 32 bits)
self.small_func_dispatch_reg = 'R11' # Temp register for small-function JMP dispatch
# Indexed stack pointer system (16-byte intervals)
self.stack_slot_size = 16 # 16-byte intervals
self.current_function_stack = {} # Track local variables: {name: (slot_index, offset)}
self.current_stack_slots = 0 # Number of 16-byte slots allocated in current function
self.stack_base_address = 'STACK_BASE' # Symbol for stack base address
self.label_counter = 0 # Counter for unique labels
self.saved_fp_in_rbx = False # Track if function pointer is saved in RBX from if condition
self.fp_in_rax = False # Track if function pointer is already in RAX from condition
self.metamorphic_labels = {} # Track metamorphic return site labels: {func_name: label_name}
self.struct_sizes = {} # Populated at generate() from AST: {struct_name: size_in_bytes}
self.struct_layouts = {} # {struct_name: {field_name: {'offset': int, 'size': int, 'type': node, 'aggregate': bool}}}
self.typedef_types = {} # {typedef_name: type_node}
self.global_var_types = {} # {var_name: decl.type}
self.current_var_types = {} # {var_name: decl.type} for current function
self.enum_constants = {} # {enum_name: integer_value}
self.known_function_symbols = set() # Function names known in current translation unit
self.function_param_spills = {} # {param_name: rbp-relative spill offset}
self.function_stack_param_sources = {} # {param_name: rbp+offset source for stack-passed args}
self.function_param_order = [] # Parameter names in declaration order
self.break_label_stack = [] # Active break targets for nested loops/switches
self.continue_label_stack = [] # Active continue targets for nested loops
def _get_ast_list(self, parser):
"""Return list of ASTs from parser (single CParser or MultiFileParser)."""
if hasattr(parser, 'parsers'):
return [p.ast for p in parser.parsers if getattr(p, 'ast', None)]
if getattr(parser, 'ast', None):
return [parser.ast]
return []
def _get_type_size_align(self, type_node, struct_sizes):
"""Return (size, alignment) in bytes for a type node. Uses struct_sizes for struct lookups."""
if type_node is None:
return (0, 1)
if isinstance(type_node, c_ast.PtrDecl):
return (4 if self.use_32bit else 8, 4 if self.use_32bit else 8)
if isinstance(type_node, c_ast.FuncDecl):
return (4 if self.use_32bit else 8, 4 if self.use_32bit else 8)
if isinstance(type_node, c_ast.ArrayDecl):
elem_size, elem_align = self._get_type_size_align(type_node.type, struct_sizes)
dim = self._eval_const_expr(getattr(type_node, "dim", None))
if dim is None or dim <= 0:
dim = 1
return (elem_size * dim, elem_align)
if isinstance(type_node, c_ast.TypeDecl):
return self._get_type_size_align(type_node.type, struct_sizes)
if isinstance(type_node, c_ast.IdentifierType):
names = getattr(type_node, 'names', None) or []
s = ' '.join(str(n).lower() for n in names)
# Handle fixed-width typedef aliases (e.g., mz_uint64, uint32_t).
for tok in [str(n).lower() for n in names]:
if tok in ("size_t", "ssize_t", "ptrdiff_t", "intptr_t", "uintptr_t", "off_t"):
return (8 if not self.use_32bit else 4, 8 if not self.use_32bit else 4)
if '64' in tok:
return (8, 8 if not self.use_32bit else 4)
if '32' in tok:
return (4, 4)
if '16' in tok:
return (2, 2)
if tok.endswith('8') or '8_t' in tok:
return (1, 1)
if 'char' in s and 'long' not in s:
return (1, 1)
if 'short' in s:
return (2, 2)
if 'long' in s or 'double' in s:
return (8, 8)
if 'int' in s or 'unsigned' in s:
return (4, 4)
if 'float' in s:
return (4, 4)
return (4, 4) # default
if isinstance(type_node, (c_ast.Struct, c_ast.Union)):
name = getattr(type_node, 'name', None)
if name:
if name in struct_sizes:
size = struct_sizes[name]
else:
# Some system structs (notably `struct stat`) are referenced via
# macros/typedefs but may not be fully present in the parsed AST.
# Use a conservative stack allocation size to avoid overwrite of
# adjacent locals/return state when passed to libc APIs.
lname = str(name).lower()
size = 256 if lname.endswith("stat") else 8
return (size, 8 if not self.use_32bit else 4)
decls = getattr(type_node, "decls", None)
if decls:
size = self._compute_struct_size_from_decls(type_node, struct_sizes)
align = 8 if not self.use_32bit else 4
return (size, align)
return (8, 8)
if isinstance(type_node, c_ast.Enum):
return (4, 4)
return (8, 8)
def _eval_const_expr(self, node, symbols=None):
"""Best-effort integer evaluation for constant-expression AST nodes."""
if node is None:
return None
syms = symbols if symbols is not None else getattr(self, "enum_constants", {})
if isinstance(node, c_ast.Constant):
try:
return int(node.value, 0)
except (TypeError, ValueError):
return None
if isinstance(node, c_ast.ID):
return syms.get(node.name)
if isinstance(node, c_ast.UnaryOp):
v = self._eval_const_expr(node.expr, syms)
if v is None:
return None
if node.op == '+':
return +v
if node.op == '-':
return -v
if node.op == '~':
return ~v
return None
if isinstance(node, c_ast.BinaryOp):
l = self._eval_const_expr(node.left, syms)
r = self._eval_const_expr(node.right, syms)
if l is None or r is None:
return None
try:
if node.op == '+':
return l + r
if node.op == '-':
return l - r
if node.op == '*':
return l * r
if node.op == '/':
return l // r if r != 0 else None
if node.op == '%':
return l % r if r != 0 else None
if node.op == '<<':
return l << r
if node.op == '>>':
return l >> r
if node.op == '|':
return l | r
if node.op == '&':
return l & r
if node.op == '^':
return l ^ r
except Exception:
return None
return None
if isinstance(node, c_ast.Cast):
return self._eval_const_expr(node.expr, syms)
return None
def _compute_struct_size_from_decls(self, struct_node, struct_sizes):
"""Compute size of a struct from its .decls (member list)."""
decls = getattr(struct_node, 'decls', None) or []
offset = 0
max_align = 1
for decl in decls:
# Use typedef-aware sizing so fields like size_t/typedef'd structs are handled correctly.
size, align = self._get_type_size_align_resolved(decl.type, struct_sizes)
if align <= 0:
align = 1
if size <= 0:
size = 1
offset = (offset + align - 1) & ~(align - 1)
offset += size
max_align = max(max_align, align)
offset = (offset + max_align - 1) & ~(max_align - 1)
return offset
def _collect_struct_definitions(self, ast_list):
"""Collect all Struct/Union nodes that have .name and .decls from ASTs."""
structs = {} # name -> node (first definition wins)
class StructCollector(c_ast.NodeVisitor):
def __init__(self, out):
self.out = out
def visit_Struct(self, node):
if getattr(node, 'name', None) and getattr(node, 'decls', None):
if node.name not in self.out:
self.out[node.name] = node
self.generic_visit(node)
def visit_Union(self, node):
if getattr(node, 'name', None) and getattr(node, 'decls', None):
if node.name not in self.out:
self.out[node.name] = node
self.generic_visit(node)
for ast in ast_list:
StructCollector(structs).visit(ast)
return structs
def _struct_dependencies(self, struct_node, struct_sizes_keys):
"""Return set of struct names that this struct's members reference."""
deps = set()
decls = getattr(struct_node, 'decls', None) or []
for decl in decls:
node = decl.type
while node:
if isinstance(node, c_ast.TypeDecl):
node = node.type
continue
if isinstance(node, (c_ast.Struct, c_ast.Union)):
name = getattr(node, 'name', None)
if name and name in struct_sizes_keys:
deps.add(name)
break
if isinstance(node, c_ast.ArrayDecl):
node = node.type
continue
break
return deps
def _collect_struct_sizes(self, parser):
"""Populate self.struct_sizes from parser AST(s) by computing sizes from struct definitions."""
ast_list = self._get_ast_list(parser)
struct_defs = self._collect_struct_definitions(ast_list)
# Compute in dependency order: if A has a member of type B, compute B first
computed = {}
names = list(struct_defs.keys())
changed = True
while changed:
changed = False
for name in names:
if name in computed:
continue
node = struct_defs[name]
deps = self._struct_dependencies(node, set(computed.keys()) | set(names))
if all(d in computed for d in deps):
size = self._compute_struct_size_from_decls(node, computed)
computed[name] = size
changed = True
# Any remaining (e.g. forward decl only) get default 8
for name in names:
if name not in computed:
computed[name] = 8
self.struct_sizes = computed
def _collect_typedefs(self, parser):
"""Collect typedef alias -> type mappings from parser AST(s)."""
ast_list = self._get_ast_list(parser)
typedefs = {}
class TypedefCollector(c_ast.NodeVisitor):
def __init__(self, out):
self.out = out
def visit_Typedef(self, node):
if getattr(node, "name", None) and getattr(node, "type", None):
# Keep first definition for deterministic behavior.
if node.name not in self.out:
self.out[node.name] = node.type
self.generic_visit(node)
for ast in ast_list:
TypedefCollector(typedefs).visit(ast)
self.typedef_types = typedefs
def _resolve_typedefs(self, type_node):
"""Resolve one or more typedef aliases in a type node."""
node = type_node
seen = set()
while True:
# Unwrap TypeDecl shells.
if isinstance(node, c_ast.TypeDecl):
node = node.type
continue
if isinstance(node, c_ast.IdentifierType):
names = getattr(node, "names", None) or []
if len(names) == 1:
alias = names[0]
if alias in self.typedef_types and alias not in seen:
seen.add(alias)
aliased = self.typedef_types[alias]
# Typedef nodes usually wrap with TypeDecl; keep unwrapping in loop.
node = aliased
continue
break
return node
def _get_type_size_align_resolved(self, type_node, struct_sizes):
"""Like _get_type_size_align(), but resolves typedef aliases first."""
if type_node is None:
return (0, 1)
# Preserve pointer/function-pointer sizing before alias resolution.
if isinstance(type_node, (c_ast.PtrDecl, c_ast.FuncDecl)):
return self._get_type_size_align(type_node, struct_sizes)
if isinstance(type_node, c_ast.ArrayDecl):
elem_size, elem_align = self._get_type_size_align_resolved(type_node.type, struct_sizes)
dim = self._eval_const_expr(getattr(type_node, "dim", None))
if dim is None or dim <= 0:
dim = 1
return (elem_size * dim, elem_align)
# Recover fixed-width typedef intent before fake-libc collapses aliases to int.
node = type_node
guard = 0
while node is not None and guard < 16:
guard += 1
if isinstance(node, c_ast.TypeDecl):
node = node.type
continue
if isinstance(node, c_ast.IdentifierType):
names = getattr(node, "names", None) or []
if len(names) == 1:
alias = str(names[0]).lower()
if alias in ("size_t", "ssize_t", "ptrdiff_t", "intptr_t", "uintptr_t", "off_t"):
return (8 if not self.use_32bit else 4, 8 if not self.use_32bit else 4)
if "64" in alias:
return (8, 8 if not self.use_32bit else 4)
if "32" in alias:
return (4, 4)
if "16" in alias:
return (2, 2)
if alias.endswith("8") or "8_t" in alias:
return (1, 1)
if names[0] in self.typedef_types:
node = self.typedef_types[names[0]]
continue
break
if hasattr(node, "type"):
node = node.type
continue
break
resolved = self._resolve_typedefs(type_node)
return self._get_type_size_align(resolved, struct_sizes)
def _collect_struct_layouts(self, parser):
"""Build per-struct field offset/size metadata from AST definitions."""
ast_list = self._get_ast_list(parser)
struct_defs = self._collect_struct_definitions(ast_list)
layouts = {}
def build_fields(struct_node):
fields = {}
offset = 0
decls = getattr(struct_node, "decls", None) or []
for decl in decls:
field_name = getattr(decl, "name", None)
if not field_name:
continue
field_size, field_align = self._get_type_size_align_resolved(decl.type, self.struct_sizes)
if field_align <= 0:
field_align = 1
offset = (offset + field_align - 1) & ~(field_align - 1)
resolved_type = self._resolve_typedefs(decl.type)
aggregate = isinstance(resolved_type, (c_ast.Struct, c_ast.Union, c_ast.ArrayDecl))
fields[field_name] = {
"offset": offset,
"size": field_size,
"type": resolved_type,
"aggregate": aggregate,
}
offset += field_size
return fields
for struct_name, struct_node in struct_defs.items():
layouts[struct_name] = build_fields(struct_node)
# Also support anonymous `typedef struct { ... } Alias;` layouts.
for alias_name, alias_type in self.typedef_types.items():
node = alias_type
while node is not None:
node = self._resolve_typedefs(node)
if isinstance(node, c_ast.TypeDecl):
node = node.type
continue
if isinstance(node, (c_ast.Struct, c_ast.Union)):
if getattr(node, "decls", None):
key_name = getattr(node, "name", None) or alias_name
if key_name not in layouts:
layouts[key_name] = build_fields(node)
break
if isinstance(node, c_ast.PtrDecl):
node = node.type
continue
if isinstance(node, c_ast.ArrayDecl):
node = node.type
continue
if isinstance(node, c_ast.IdentifierType):
names = getattr(node, "names", None) or []
if len(names) == 1 and names[0] in self.typedef_types:
node = self.typedef_types[names[0]]
continue
break
self.struct_layouts = layouts
def _collect_global_var_types(self, parser):
"""Collect global variable declared types."""
self.global_var_types = {}
globals = parser.get_global_variables() if hasattr(parser, "get_global_variables") else []
for gv in globals:
if getattr(gv, "name", None) and getattr(gv, "type", None):
self.global_var_types[gv.name] = gv.type
def _collect_enum_constants(self, parser):
"""Collect enum constants and their integer values."""
ast_list = self._get_ast_list(parser)
enum_values = {}
outer = self
class EnumCollector(c_ast.NodeVisitor):
def __init__(self, out):
self.out = out
def visit_Enum(self, node):
enumerators = getattr(node, "values", None)
items = getattr(enumerators, "enumerators", None) if enumerators else None
if not items:
return
current_value = -1
for e in items:
value_node = getattr(e, "value", None)
evaluated = outer._eval_const_expr(value_node, self.out) if value_node is not None else None
if evaluated is not None:
current_value = evaluated
else:
current_value += 1
if getattr(e, "name", None):
self.out[e.name] = current_value
for ast in ast_list:
EnumCollector(enum_values).visit(ast)
self.enum_constants = enum_values
def _member_info_for_struct_name(self, struct_name, member_name):
"""Return field metadata for struct member access."""
fields = self.struct_layouts.get(struct_name, {})
info = fields.get(member_name)
if info is not None:
return info
# Fallback for common libc struct declarations that are forward-declared
# in pycparser fake headers (e.g. `struct tm` in <time.h>).
if struct_name == "tm":
tm_offsets = {
"tm_sec": 0,
"tm_min": 4,
"tm_hour": 8,
"tm_mday": 12,
"tm_mon": 16,
"tm_year": 20,
"tm_wday": 24,
"tm_yday": 28,
"tm_isdst": 32,
}
if member_name in tm_offsets:
return {
"offset": tm_offsets[member_name],
"size": 4,
"type": None,
"aggregate": False,
}
# Linux x86_64 glibc fallback for forward-declared struct stat.
if struct_name == "stat":
stat_fields = {
"st_size": (48, 8),
"st_atime": (72, 8),
"st_mtime": (88, 8),
"st_ctime": (104, 8),
}
if member_name in stat_fields:
off, sz = stat_fields[member_name]
return {
"offset": off,
"size": sz,
"type": None,
"aggregate": False,
}
return None
def _extract_struct_name_from_type(self, type_node):
"""Resolve a type node to a struct name if possible."""
node = self._resolve_typedefs(type_node)
last_alias = None
# Drill through wrappers to locate Struct/Union node.
while node is not None:
node = self._resolve_typedefs(node)
if isinstance(node, (c_ast.Struct, c_ast.Union)):
named = getattr(node, "name", None)
if named:
return named
# Anonymous struct: try to recover typedef alias that owns this node.
for alias_name, alias_type in self.typedef_types.items():
probe = alias_type
guard = 0
while probe is not None and guard < 16:
guard += 1
probe = self._resolve_typedefs(probe)
if probe is node:
if alias_name in self.struct_layouts:
return alias_name
break
if isinstance(probe, c_ast.TypeDecl):
probe = probe.type
continue
if isinstance(probe, c_ast.PtrDecl):
probe = probe.type
continue
if isinstance(probe, c_ast.ArrayDecl):
probe = probe.type
continue
break
if last_alias and last_alias in self.struct_layouts:
return last_alias
return None
if isinstance(node, c_ast.IdentifierType):
names = getattr(node, "names", None) or []
if len(names) == 1 and names[0] in self.typedef_types:
last_alias = names[0]
node = self.typedef_types[names[0]]
continue
break
if isinstance(node, c_ast.ArrayDecl):
node = node.type
continue
if isinstance(node, c_ast.PtrDecl):
node = node.type
continue
if isinstance(node, c_ast.TypeDecl):
node = node.type
continue
break
return None
def _infer_expr_type(self, expr):
"""Best-effort static type inference for codegen width decisions."""
if expr is None:
return None
if isinstance(expr, c_ast.ID):
name = expr.name
if name in self.current_var_types:
return self.current_var_types[name]
if name in self.global_var_types:
return self.global_var_types[name]
return None
if isinstance(expr, c_ast.Cast):
return getattr(expr, "to_type", None)
if isinstance(expr, c_ast.UnaryOp):
# *ptr
if expr.op == "*":
inner = self._infer_expr_type(expr.expr)
if isinstance(inner, c_ast.PtrDecl):
return inner.type
inner_resolved = self._resolve_typedefs(inner)
if isinstance(inner_resolved, c_ast.PtrDecl):
return inner_resolved.type
# &obj
if expr.op == "&":
return c_ast.PtrDecl(quals=[], type=self._infer_expr_type(expr.expr))
if expr.op in ("p++", "p--", "++", "--"):
return self._infer_expr_type(expr.expr)
return None
if isinstance(expr, c_ast.ArrayRef):
base_t = self._infer_expr_type(expr.name)
base_t = self._resolve_typedefs(base_t)
if isinstance(base_t, c_ast.ArrayDecl):
return base_t.type
if isinstance(base_t, c_ast.PtrDecl):
return base_t.type
return None
if isinstance(expr, c_ast.StructRef):
member_name = expr.field.name if getattr(expr, "field", None) and hasattr(expr.field, "name") else None
if not member_name:
return None
base_type = self._infer_expr_type(expr.name)
base_type = self._resolve_typedefs(base_type)
# For "->", dereference one pointer level.
if expr.type == "->":
if isinstance(base_type, c_ast.PtrDecl):
base_type = base_type.type
else:
resolved = self._resolve_typedefs(base_type)
if isinstance(resolved, c_ast.PtrDecl):
base_type = resolved.type
struct_name = self._extract_struct_name_from_type(base_type)
if not struct_name:
return None
info = self._member_info_for_struct_name(struct_name, member_name)
if not info:
return None
return info["type"]
return None
def _member_access_info(self, struct_ref):
"""Return (offset, size, aggregate) for a struct member, with safe defaults."""
member_name = struct_ref.field.name if getattr(struct_ref, "field", None) and hasattr(struct_ref.field, "name") else None
if not member_name:
return (0, 4, False)
base_type = self._infer_expr_type(struct_ref.name)
base_type = self._resolve_typedefs(base_type)
if struct_ref.type == "->":
if isinstance(base_type, c_ast.PtrDecl):
base_type = base_type.type
else:
resolved = self._resolve_typedefs(base_type)
if isinstance(resolved, c_ast.PtrDecl):
base_type = resolved.type
struct_name = self._extract_struct_name_from_type(base_type)
if not struct_name:
return (0, 8 if not self.use_32bit else 4, False)
info = self._member_info_for_struct_name(struct_name, member_name)
if not info:
return (0, 8 if not self.use_32bit else 4, False)
return (info["offset"], info["size"], info["aggregate"])
def _emit_load_from_address(self, addr_reg, size):
"""Load [addr_reg] into RAX/EAX with width-aware instruction."""
if size == 1:
self.output.append(f" MOVZX EAX, BYTE [{addr_reg}]")
elif size == 2:
self.output.append(f" MOVZX EAX, WORD [{addr_reg}]")
elif size == 8 and not self.use_32bit:
self.output.append(f" MOV RAX, QWORD [{addr_reg}]")
else:
self.output.append(f" MOV EAX, DWORD [{addr_reg}]")
def _emit_store_to_address(self, addr_reg, size):
"""Store RAX/EAX/AX/AL into [addr_reg] with width-aware instruction."""
if size == 1:
self.output.append(f" MOV BYTE [{addr_reg}], AL")
elif size == 2:
self.output.append(f" MOV WORD [{addr_reg}], AX")
elif size == 8 and not self.use_32bit:
self.output.append(f" MOV QWORD [{addr_reg}], RAX")
else:
self.output.append(f" MOV DWORD [{addr_reg}], EAX")
def _local_stack_offset(self, slot_index, offset=0):
"""Return RBP-relative offset for a local stack slot."""
spill_base = getattr(self, "function_param_spill_size", 0)
return spill_base + ((slot_index + 1) * 8) + offset
def _get_var_storage_size(self, var_name):
"""Best-effort storage size in bytes for a local/parameter variable."""
type_node = self.current_var_types.get(var_name)
if type_node is None:
return 4 if not self.use_32bit else 4
size, _ = self._get_type_size_align_resolved(type_node, self.struct_sizes)
if size <= 1:
return 1
if size <= 2:
return 2
if size <= 4:
return 4
return 8 if not self.use_32bit else 4
def _is_unsigned_integer_type(self, type_node):
"""Best-effort check for unsigned integer-like type nodes."""
node = self._resolve_typedefs(type_node)
guard = 0
while node is not None and guard < 16:
guard += 1
node = self._resolve_typedefs(node)
if isinstance(node, c_ast.TypeDecl):
node = node.type
continue
if isinstance(node, c_ast.IdentifierType):
names = [str(n).lower() for n in (getattr(node, "names", None) or [])]
return any(tok == "unsigned" or tok.startswith("uint") or tok.startswith("u_int") for tok in names)
if isinstance(node, c_ast.Enum):
return False
if isinstance(node, (c_ast.PtrDecl, c_ast.ArrayDecl, c_ast.Struct, c_ast.Union)):
return False
break
return False
def _expr_compare_width(self, expr):
"""Best-effort integer width (bytes) for relational comparisons."""
if isinstance(expr, c_ast.ID):
return self._get_var_storage_size(expr.name)
if isinstance(expr, c_ast.BinaryOp):
lsz = self._expr_compare_width(expr.left)
rsz = self._expr_compare_width(expr.right)
return max(lsz, rsz)
if isinstance(expr, c_ast.UnaryOp):
return self._expr_compare_width(expr.expr)
if isinstance(expr, c_ast.Cast):
target = getattr(expr, "to_type", None)
if target is not None:
sz, _ = self._get_type_size_align_resolved(target, self.struct_sizes)
if sz > 0:
return sz
return self._expr_compare_width(expr.expr)
if isinstance(expr, c_ast.TernaryOp):
return max(self._expr_compare_width(expr.iftrue), self._expr_compare_width(expr.iffalse))
if isinstance(expr, c_ast.Constant):
ctype = str(getattr(expr, "type", "")).lower()
if "char" in ctype:
return 1
if "short" in ctype:
return 2
if "long" in ctype:
return 8 if not self.use_32bit else 4
# Large integer constants (e.g. 0xFFFFFFFF / MZ_UINT32_MAX) should
# not be forced through 32-bit signed compare lowering.
raw_val = str(getattr(expr, "value", "")).strip()
if raw_val:
cleaned = re.sub(r'(?i)[uUlL]+$', '', raw_val)
try:
if cleaned.lower().startswith("0x"):
parsed = int(cleaned, 16)
elif cleaned.lower().startswith("0b"):
parsed = int(cleaned, 2)
elif cleaned.startswith("0") and len(cleaned) > 1 and cleaned.isdigit():
parsed = int(cleaned, 8)
else:
parsed = int(cleaned, 10)
if parsed > 0x7FFFFFFF or parsed < -0x80000000:
return 8 if not self.use_32bit else 4
except Exception:
pass
return 4
t = self._infer_expr_type(expr)
if t is not None:
sz, _ = self._get_type_size_align_resolved(t, self.struct_sizes)
if sz > 0:
return sz
return 8 if not self.use_32bit else 4
def _expr_is_unsigned(self, expr):
"""Best-effort unsignedness for relational comparisons."""
if isinstance(expr, c_ast.Constant):
ctype = str(getattr(expr, "type", "")).lower()
raw_val = str(getattr(expr, "value", "")).strip()
if "unsigned" in ctype or re.search(r'(?i)[u]+[l]*$', raw_val or ""):
return True
if raw_val:
cleaned = re.sub(r'(?i)[uUlL]+$', '', raw_val)
try:
if cleaned.lower().startswith("0x"):
parsed = int(cleaned, 16)
elif cleaned.lower().startswith("0b"):
parsed = int(cleaned, 2)
elif cleaned.startswith("0") and len(cleaned) > 1 and cleaned.isdigit():
parsed = int(cleaned, 8)
else:
parsed = int(cleaned, 10)
if parsed > 0x7FFFFFFF:
return True
except Exception:
pass
return False
if isinstance(expr, c_ast.Cast):
return self._is_unsigned_integer_type(getattr(expr, "to_type", None))
if isinstance(expr, c_ast.UnaryOp):
return self._expr_is_unsigned(expr.expr)
if isinstance(expr, c_ast.BinaryOp):
return self._expr_is_unsigned(expr.left) or self._expr_is_unsigned(expr.right)
inferred = self._infer_expr_type(expr)
return self._is_unsigned_integer_type(inferred)
def _prepare_call_arguments(self, call):
"""Prepare call arguments and return stack bytes to clean up after CALL."""
if not call.args or not getattr(call.args, 'exprs', None):
return 0
exprs = call.args.exprs
arg_regs = ([self.reg_rdi, self.reg_rsi, self.reg_rdx, self.reg_rcx] if self.use_32bit else [self.reg_rdi, self.reg_rsi, self.reg_rdx, self.reg_rcx, self.reg_r8, self.reg_r9])
word = 4 if self.use_32bit else 8
reg_count = min(len(exprs), len(arg_regs))
reg_exprs = exprs[:reg_count]
extra_exprs = exprs[reg_count:]
align_pad = 0
# Save register-argument expressions first.
for arg in reg_exprs:
self._generate_expression(arg)
self.output.append(f" PUSH {self.reg_rax} ; Save argument value")
if not self.use_32bit and ((len(reg_exprs) + len(extra_exprs)) % 2 == 1):
# Keep RSP 16-byte aligned at call sites.
self.output.append(f" PUSH 0 ; Call-site stack alignment pad")
align_pad = 1
# Stack arguments must appear right-to-left so arg7 is nearest return address.
for arg in reversed(extra_exprs):
self._generate_expression(arg)
self.output.append(f" PUSH {self.reg_rax} ; Stack argument")
for i in range(reg_count):
reg = arg_regs[i]
stack_offset = ((len(extra_exprs) + align_pad) * word) + ((reg_count - (i + 1)) * word)
if self.use_32bit:
self.output.append(f" MOV {reg}, DWORD [{self.reg_rsp} + {stack_offset}] ; Argument {i+1}")
else:
self.output.append(f" MOV {reg}, QWORD [{self.reg_rsp} + {stack_offset}] ; Argument {i+1}")
return (len(reg_exprs) + len(extra_exprs) + align_pad) * word
def _safe_append(self, line):
"""Safely append a line to output, ensuring no AST node objects are included.
This prevents AST nodes from being accidentally converted to strings
and output, which could cause assembly errors with labels like 'type'
or 'field'.
"""
# If line contains an AST node object, convert it safely
if isinstance(line, c_ast.Node):
# This should never happen, but protect against it
line = f"; ERROR: AST node object detected: {safe_str(line)}"
elif not isinstance(line, str):
# Convert non-string objects safely
line = safe_str(line)
# Check if line looks like it contains an AST node attribute that was output as a label
# Patterns like "type:" or "field:" at the start of a line (after whitespace)
import re
stripped = line.strip()
# Check for problematic labels that are AST attribute names
problematic_labels = ['type:', 'field:', 'name:', 'expr:', 'node:', 'struct_ref:', 'assign:']
if stripped in problematic_labels or (stripped.endswith(':') and len(stripped.split()) == 1 and stripped[:-1] in ['type', 'field', 'name', 'expr', 'node']):
# This looks like an AST node attribute was output as a label - skip it
return # Don't output this line
self.output.append(line)
def generate(self, parser):
"""Generate optimized code for all functions."""
self.output = []
self.needs_print_int_buffer = False
self.string_literals = {}
self.string_literal_counter = 0
self.external_functions = set()
self._current_parser = parser # Store parser reference for variable lookup
self._function_source_files = parser.get_function_source_files() if hasattr(parser, 'get_function_source_files') else {}
self._program_assertions = [
dict(entry, _consumed=False)
for entry in (parser.get_register_assertions() if self.enable_debug_gdb and hasattr(parser, 'get_register_assertions') else [])
]
self._program_memdumps = [
dict(entry, _consumed=False)
for entry in (parser.get_memdumps() if self.enable_debug_gdb and hasattr(parser, 'get_memdumps') else [])
]
self._debug_assert_counter = 0
self._debug_memdump_counter = 0
self.debug_assertions_meta = []
self.debug_memdumps_meta = []
self._collect_typedefs(parser)
self._collect_enum_constants(parser)
self._collect_struct_sizes(parser) # Auto-detect struct sizes from AST
self._collect_struct_layouts(parser)
self._collect_global_var_types(parser)
# Separate small and large functions, deduplicating by name
functions = parser.get_functions()
seen_funcs = {} # {func_name: func_node} to deduplicate
for func in functions:
func_name = func.decl.name if func.decl else "unknown"
# Skip functions with "unknown" names - they're likely parsing errors
if func_name == "unknown":
continue
# Only keep the first occurrence of each function
if func_name not in seen_funcs:
seen_funcs[func_name] = func
# Use deduplicated functions
unique_functions = list(seen_funcs.values())
self.known_function_symbols = set(seen_funcs.keys())
small_funcs = []
large_funcs = []
for func in unique_functions:
func_name = func.decl.name if func.decl else "unknown"
# Skip functions with "unknown" names
if func_name == "unknown":
continue
if self.enable_indexed_function_calls and func_name in self.function_data and self.function_data[func_name]['is_small']:
small_funcs.append(func)
else:
large_funcs.append(func)
# Generate code section
# Add BITS directive based on mode
if self.use_32bit:
self.output.append("BITS 32")
else:
self.output.append("BITS 64")
self.output.append("DEFAULT REL")
self.output.append("SECTION .text")
self.output.append("")
# Check if _start is already defined in assembly files
has_external_start = self.asm_parser and self.asm_parser.has_symbol('_start')
# Export all function symbols as global so they can be linked with external assembly files
self.output.append("; Export functions as global symbols for linking")
if not has_external_start:
self.output.append("GLOBAL _start ; Entry point")
all_function_names = set()
for func in small_funcs + large_funcs:
func_name = func.decl.name if func.decl else None
if func_name and func_name != "unknown":
all_function_names.add(func_name)
for func_name in sorted(all_function_names):
# Export plain C symbol names for FFI/dlsym users (ctypes, etc.).
self.output.append(f"GLOBAL {func_name}")
self.output.append(f"GLOBAL FUNC_{func_name}")
self.output.append("")
extern_insert_index = len(self.output)