-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathcode_generator.cpp
More file actions
2291 lines (1956 loc) · 80.1 KB
/
Copy pathcode_generator.cpp
File metadata and controls
2291 lines (1956 loc) · 80.1 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
#include "code_generator.h"
#include <iostream>
#include <sstream>
#include <algorithm>
#include <iomanip>
// Instruction implementation
std::string Instruction::toString() const {
std::stringstream ss;
switch (opcode) {
case MOV: ss << "mov"; break;
case LOAD: ss << "load"; break;
case STORE: ss << "store"; break;
case ADD: ss << "add"; break;
case SUB: ss << "sub"; break;
case MUL: ss << "mul"; break;
case DIV: ss << "div"; break;
case MOD: ss << "mod"; break;
case FADD: ss << "fadd"; break;
case FSUB: ss << "fsub"; break;
case FMUL: ss << "fmul"; break;
case FDIV: ss << "fdiv"; break;
case AND: ss << "and"; break;
case OR: ss << "or"; break;
case XOR: ss << "xor"; break;
case NOT: ss << "not"; break;
case CMP: ss << "cmp"; break;
case FCMP: ss << "fcmp"; break;
case JMP: ss << "jmp"; break;
case JE: ss << "je"; break;
case JNE: ss << "jne"; break;
case JL: ss << "jl"; break;
case JLE: ss << "jle"; break;
case JG: ss << "jg"; break;
case JGE: ss << "jge"; break;
case CALL: ss << "call"; break;
case RET: ss << "ret"; break;
case PUSH: ss << "push"; break;
case POP: ss << "pop"; break;
case NOP: ss << "nop"; break;
case LABEL: ss << label << ":"; return ss.str();
default: ss << "unknown"; break;
}
if (!label.empty()) {
ss << " " << label;
} else {
for (size_t i = 0; i < operands.size(); ++i) {
if (i > 0) ss << ", ";
else ss << " ";
if (operands[i]) {
ss << operands[i]->name;
} else {
ss << "null";
}
}
if (has_immediate) {
if (!operands.empty()) ss << ", ";
else ss << " ";
ss << "#" << immediate;
}
}
return ss.str();
}
// BasicBlock implementation
void BasicBlock::addInstruction(std::unique_ptr<Instruction> instr) {
instructions.push_back(std::move(instr));
}
void BasicBlock::addSuccessor(BasicBlock* block) {
successors.push_back(block);
block->predecessors.push_back(this);
}
// Function implementation
BasicBlock* Function::createBlock(const std::string& label) {
auto block = std::make_unique<BasicBlock>(label);
BasicBlock* ptr = block.get();
blocks.push_back(std::move(block));
return ptr;
}
BasicBlock* Function::getBlock(const std::string& label) {
for (auto& block : blocks) {
if (block->label == label) {
return block.get();
}
}
return nullptr;
}
// CodeGenerator implementation
CodeGenerator::CodeGenerator()
: current_class_name(""), target_platform(TargetPlatform::MACOS_X64), output_format(OutputFormat::ASSEMBLY),
current_function(nullptr), current_block(nullptr),
next_register_id(0), next_label_id(0), stack_offset(0), semantic_analyzer(nullptr) {
initializeBuiltinFunctions();
// Initialize available registers (simplified x86-64 subset)
for (int i = 0; i < 8; ++i) {
std::string name = "r" + std::to_string(i);
available_registers.push_back(std::make_shared<Register>(i, Register::GENERAL, name));
}
// Initialize floating point registers
for (int i = 0; i < 8; ++i) {
std::string name = "xmm" + std::to_string(i);
available_registers.push_back(std::make_shared<Register>(i + 100, Register::FLOAT, name));
}
}
CodeGenerator::CodeGenerator(SemanticAnalyzer* analyzer)
: current_class_name(""), target_platform(TargetPlatform::MACOS_X64), output_format(OutputFormat::ASSEMBLY),
current_function(nullptr), current_block(nullptr),
next_register_id(0), next_label_id(0), stack_offset(0), semantic_analyzer(analyzer) {
initializeBuiltinFunctions();
// Initialize available registers (simplified x86-64 subset)
for (int i = 0; i < 8; ++i) {
std::string name = "r" + std::to_string(i);
available_registers.push_back(std::make_shared<Register>(i, Register::GENERAL, name));
}
// Initialize floating point registers
for (int i = 0; i < 8; ++i) {
std::string name = "xmm" + std::to_string(i);
available_registers.push_back(std::make_shared<Register>(i + 100, Register::FLOAT, name));
}
}
CodeGenerator::CodeGenerator(TargetPlatform platform, OutputFormat format)
: current_class_name(""), target_platform(platform), output_format(format),
current_function(nullptr), current_block(nullptr),
next_register_id(0), next_label_id(0), stack_offset(0), semantic_analyzer(nullptr) {
initializeBuiltinFunctions();
// Initialize available registers (simplified x86-64 subset)
for (int i = 0; i < 8; ++i) {
std::string name = "r" + std::to_string(i);
available_registers.push_back(std::make_shared<Register>(i, Register::GENERAL, name));
}
// Initialize floating point registers
for (int i = 0; i < 8; ++i) {
std::string name = "xmm" + std::to_string(i);
available_registers.push_back(std::make_shared<Register>(i + 100, Register::FLOAT, name));
}
}
CodeGenerator::CodeGenerator(SemanticAnalyzer* analyzer, TargetPlatform platform, OutputFormat format)
: current_class_name(""), target_platform(platform), output_format(format),
current_function(nullptr), current_block(nullptr),
next_register_id(0), next_label_id(0), stack_offset(0), semantic_analyzer(analyzer) {
initializeBuiltinFunctions();
// Initialize available registers (simplified x86-64 subset)
for (int i = 0; i < 8; ++i) {
std::string name = "r" + std::to_string(i);
available_registers.push_back(std::make_shared<Register>(i, Register::GENERAL, name));
}
// Initialize floating point registers
for (int i = 0; i < 8; ++i) {
std::string name = "xmm" + std::to_string(i);
available_registers.push_back(std::make_shared<Register>(i + 100, Register::FLOAT, name));
}
}
bool CodeGenerator::generate(ASTNode* root, const std::string& output_file) {
if (!root) {
addError("No AST to generate code from");
return false;
}
if (root->type != ASTNodeType::PROGRAM) {
addError("Root node is not a program");
return false;
}
generateProgram(static_cast<Program*>(root));
if (hasErrors()) {
for (const auto& error : errors) {
std::cerr << error << std::endl;
}
return false;
}
// Perform optimizations
optimizeCode();
// Generate output based on format
switch (output_format) {
case OutputFormat::ASSEMBLY:
writeAssembly(output_file + ".s");
break;
case OutputFormat::OBJECT:
writeAssembly(output_file + ".s");
writeObjectFile(output_file + ".o");
break;
case OutputFormat::EXECUTABLE:
writeAssembly(output_file + ".s");
writeObjectFile(output_file + ".o");
writeExecutable(output_file + getExecutableExtension());
break;
}
return true;
}
bool CodeGenerator::generate(ASTNode* root, const std::string& output_file, SemanticAnalyzer* analyzer) {
semantic_analyzer = analyzer;
return generate(root, output_file);
}
bool CodeGenerator::generate(ASTNode* root, const std::string& output_file, TargetPlatform platform, OutputFormat format) {
target_platform = platform;
output_format = format;
return generate(root, output_file);
}
// Platform and format configuration methods
void CodeGenerator::setTargetPlatform(TargetPlatform platform) {
target_platform = platform;
}
void CodeGenerator::setOutputFormat(OutputFormat format) {
output_format = format;
}
TargetPlatform CodeGenerator::getTargetPlatform() const {
return target_platform;
}
OutputFormat CodeGenerator::getOutputFormat() const {
return output_format;
}
std::string CodeGenerator::getPlatformName() const {
switch (target_platform) {
case TargetPlatform::WINDOWS_X64: return "Windows x64";
case TargetPlatform::MACOS_X64: return "macOS x64";
case TargetPlatform::MACOS_ARM64: return "macOS ARM64";
case TargetPlatform::LINUX_X64: return "Linux x64";
case TargetPlatform::LINUX_ARM64: return "Linux ARM64";
default: return "Unknown";
}
}
std::string CodeGenerator::getExecutableExtension() const {
switch (target_platform) {
case TargetPlatform::WINDOWS_X64: return ".exe";
case TargetPlatform::MACOS_X64:
case TargetPlatform::MACOS_ARM64: return ".app";
case TargetPlatform::LINUX_X64:
case TargetPlatform::LINUX_ARM64: return "";
default: return "";
}
}
void CodeGenerator::generateProgram(Program* program) {
// Generate runtime support first
generateRuntimeSupport();
// Generate all functions and classes
for (auto& stmt : program->statements) {
generateStatement(stmt.get());
}
// Generate main entry point if no main function exists
if (function_map.find("main") == function_map.end()) {
setupFunction("main");
emit(Instruction::MOV, allocateRegister(), 0); // Return 0
emit(Instruction::RET);
finalizeFunction();
}
}
void CodeGenerator::generateStatement(Statement* stmt) {
if (!stmt) return;
switch (stmt->type) {
case ASTNodeType::VAR_DECL:
generateVarDecl(static_cast<VarDecl*>(stmt));
break;
case ASTNodeType::CONST_DECL:
generateConstDecl(static_cast<ConstDecl*>(stmt));
break;
case ASTNodeType::FUNC_DECL:
generateFuncDecl(static_cast<FuncDecl*>(stmt));
break;
case ASTNodeType::CLASS_DECL:
generateClassDecl(static_cast<ClassDecl*>(stmt));
break;
case ASTNodeType::SIGNAL_DECL:
generateSignalDecl(static_cast<SignalDecl*>(stmt));
break;
case ASTNodeType::ENUM_DECL:
generateEnumDecl(static_cast<EnumDecl*>(stmt));
break;
case ASTNodeType::BLOCK:
generateBlockStmt(static_cast<BlockStmt*>(stmt));
break;
case ASTNodeType::IF_STMT:
generateIfStmt(static_cast<IfStmt*>(stmt));
break;
case ASTNodeType::WHILE_STMT:
generateWhileStmt(static_cast<WhileStmt*>(stmt));
break;
case ASTNodeType::FOR_STMT:
generateForStmt(static_cast<ForStmt*>(stmt));
break;
case ASTNodeType::MATCH_STMT:
generateMatchStmt(static_cast<MatchStmt*>(stmt));
break;
case ASTNodeType::RETURN_STMT:
generateReturnStmt(static_cast<ReturnStmt*>(stmt));
break;
case ASTNodeType::EXPRESSION_STMT:
generateExpressionStmt(static_cast<ExpressionStmt*>(stmt));
break;
case ASTNodeType::BREAK_STMT:
generateBreakStmt(static_cast<BreakStmt*>(stmt));
break;
case ASTNodeType::CONTINUE_STMT:
generateContinueStmt(static_cast<ContinueStmt*>(stmt));
break;
case ASTNodeType::PASS_STMT:
emit(Instruction::NOP);
break;
default:
addError("Unknown statement type in code generation");
break;
}
}
void CodeGenerator::generateVarDecl(VarDecl* decl) {
auto var_reg = allocateRegister();
var_reg->name = decl->name;
variables[decl->name] = var_reg;
if (decl->initializer) {
auto init_reg = generateExpression(decl->initializer.get());
emit(Instruction::MOV, var_reg, init_reg);
freeRegister(init_reg);
} else {
// Initialize to null/zero
emit(Instruction::MOV, var_reg, 0);
}
}
void CodeGenerator::generateConstDecl(ConstDecl* decl) {
auto const_reg = allocateRegister();
const_reg->name = decl->name;
variables[decl->name] = const_reg;
auto value_reg = generateExpression(decl->value.get());
emit(Instruction::MOV, const_reg, value_reg);
freeRegister(value_reg);
}
void CodeGenerator::generateFuncDecl(FuncDecl* decl) {
setupFunction(decl->name);
// Set up parameters
for (size_t i = 0; i < decl->parameters.size(); ++i) {
auto param_reg = allocateRegister();
param_reg->name = decl->parameters[i].name;
variables[decl->parameters[i].name] = param_reg;
current_function->parameters.push_back(param_reg);
}
// Generate function body
generateStatement(decl->body.get());
// Ensure function returns
if (current_block->instructions.empty() ||
current_block->instructions.back()->opcode != Instruction::RET) {
if (!decl->return_type.empty() && decl->return_type != "void") {
// Return default value
auto return_reg = allocateRegister();
emit(Instruction::MOV, return_reg, 0);
emit(Instruction::RET);
} else {
emit(Instruction::RET);
}
}
finalizeFunction();
}
void CodeGenerator::generateClassDecl(ClassDecl* decl) {
current_class_name = decl->name;
// First, register all class member variables
for (auto& member : decl->members) {
if (member->type == ASTNodeType::VAR_DECL) {
VarDecl* var_decl = static_cast<VarDecl*>(member.get());
auto member_reg = allocateRegister();
member_reg->name = var_decl->name;
class_members[var_decl->name] = member_reg;
}
}
// Then generate methods
for (auto& member : decl->members) {
if (member->type == ASTNodeType::FUNC_DECL) {
FuncDecl* method = static_cast<FuncDecl*>(member.get());
std::string mangled_name = decl->name + "_" + method->name;
setupFunction(mangled_name);
// Add 'self' parameter for instance methods
if (!method->is_static) {
auto self_reg = allocateRegister();
self_reg->name = "self";
variables["self"] = self_reg;
current_function->parameters.push_back(self_reg);
}
// Add method parameters
for (const auto& param : method->parameters) {
auto param_reg = allocateRegister();
param_reg->name = param.name;
variables[param.name] = param_reg;
current_function->parameters.push_back(param_reg);
}
generateStatement(method->body.get());
if (current_block->instructions.empty() ||
current_block->instructions.back()->opcode != Instruction::RET) {
emit(Instruction::RET);
}
finalizeFunction();
}
}
current_class_name = "";
}
void CodeGenerator::generateSignalDecl(SignalDecl* decl) {
(void)decl; // Mark parameter as intentionally unused
// Signals are handled by the runtime system
// Generate signal registration code
auto signal_name_reg = allocateRegister();
emit(Instruction::MOV, signal_name_reg, 0); // Load string address
// Call runtime signal registration
emit(Instruction::CALL, "_register_signal");
freeRegister(signal_name_reg);
}
void CodeGenerator::generateEnumDecl(EnumDecl* decl) {
(void)decl; // Mark parameter as intentionally unused
// Enums are compile-time constants, so we don't generate runtime code
// The enum values are already resolved during semantic analysis
// In a full implementation, we might generate debug information for the enum
}
void CodeGenerator::generateBlockStmt(BlockStmt* stmt) {
for (auto& statement : stmt->statements) {
generateStatement(statement.get());
}
}
void CodeGenerator::generateIfStmt(IfStmt* stmt) {
auto condition_reg = generateExpression(stmt->condition.get());
std::string else_label = generateLabel("else");
std::string end_label = generateLabel("endif");
// Compare condition with false/zero
emit(Instruction::CMP, condition_reg, 0);
emit(Instruction::JE, else_label);
freeRegister(condition_reg);
// Generate then branch
generateStatement(stmt->then_branch.get());
emit(Instruction::JMP, end_label);
// Generate else branch
emitLabel(else_label);
if (stmt->else_branch) {
generateStatement(stmt->else_branch.get());
}
emitLabel(end_label);
}
void CodeGenerator::generateWhileStmt(WhileStmt* stmt) {
std::string loop_label = generateLabel("while_loop");
std::string end_label = generateLabel("while_end");
pushBreakLabel(end_label);
pushContinueLabel(loop_label);
emitLabel(loop_label);
auto condition_reg = generateExpression(stmt->condition.get());
emit(Instruction::CMP, condition_reg, 0);
emit(Instruction::JE, end_label);
freeRegister(condition_reg);
generateStatement(stmt->body.get());
emit(Instruction::JMP, loop_label);
emitLabel(end_label);
popBreakLabel();
popContinueLabel();
}
void CodeGenerator::generateForStmt(ForStmt* stmt) {
// Generate iterator setup
auto iterable_reg = generateExpression(stmt->iterable.get());
auto iterator_reg = allocateRegister();
auto loop_var_reg = allocateRegister();
loop_var_reg->name = stmt->variable;
variables[stmt->variable] = loop_var_reg;
std::string loop_label = generateLabel("for_loop");
std::string end_label = generateLabel("for_end");
pushBreakLabel(end_label);
pushContinueLabel(loop_label);
// Initialize iterator
emit(Instruction::MOV, iterator_reg, 0);
emitLabel(loop_label);
// Check if iterator is valid (simplified)
emit(Instruction::CALL, "_iterator_valid");
auto valid_reg = allocateRegister();
emit(Instruction::CMP, valid_reg, 0);
emit(Instruction::JE, end_label);
freeRegister(valid_reg);
// Get current value
emit(Instruction::CALL, "_iterator_get");
emit(Instruction::MOV, loop_var_reg, allocateRegister());
generateStatement(stmt->body.get());
// Advance iterator
emit(Instruction::CALL, "_iterator_next");
emit(Instruction::JMP, loop_label);
emitLabel(end_label);
freeRegister(iterable_reg);
freeRegister(iterator_reg);
popBreakLabel();
popContinueLabel();
}
void CodeGenerator::generateReturnStmt(ReturnStmt* stmt) {
if (stmt->value) {
auto return_reg = generateExpression(stmt->value.get());
// Move return value to designated return register
if (current_function && current_function->return_register) {
emit(Instruction::MOV, current_function->return_register, return_reg);
}
freeRegister(return_reg);
}
emit(Instruction::RET);
}
void CodeGenerator::generateExpressionStmt(ExpressionStmt* stmt) {
auto result_reg = generateExpression(stmt->expression.get());
freeRegister(result_reg);
}
void CodeGenerator::generateBreakStmt(BreakStmt* stmt) {
(void)stmt; // Mark parameter as intentionally unused
std::string break_label = getCurrentBreakLabel();
if (!break_label.empty()) {
emit(Instruction::JMP, break_label);
} else {
addError("Break statement outside of loop");
}
}
void CodeGenerator::generateContinueStmt(ContinueStmt* stmt) {
(void)stmt; // Mark parameter as intentionally unused
std::string continue_label = getCurrentContinueLabel();
if (!continue_label.empty()) {
emit(Instruction::JMP, continue_label);
} else {
addError("Continue statement outside of loop");
}
}
std::shared_ptr<Register> CodeGenerator::generateExpression(Expression* expr) {
if (!expr) return nullptr;
switch (expr->type) {
case ASTNodeType::LITERAL:
return generateLiteralExpr(static_cast<LiteralExpr*>(expr));
case ASTNodeType::IDENTIFIER:
return generateIdentifierExpr(static_cast<IdentifierExpr*>(expr));
case ASTNodeType::BINARY_OP:
return generateBinaryOpExpr(static_cast<BinaryOpExpr*>(expr));
case ASTNodeType::UNARY_OP:
return generateUnaryOpExpr(static_cast<UnaryOpExpr*>(expr));
case ASTNodeType::CALL:
return generateCallExpr(static_cast<CallExpr*>(expr));
case ASTNodeType::MEMBER_ACCESS:
return generateMemberAccessExpr(static_cast<MemberAccessExpr*>(expr));
case ASTNodeType::ARRAY_ACCESS:
return generateArrayAccessExpr(static_cast<ArrayAccessExpr*>(expr));
case ASTNodeType::ARRAY_LITERAL:
return generateArrayLiteralExpr(static_cast<ArrayLiteralExpr*>(expr));
case ASTNodeType::DICT_LITERAL:
return generateDictLiteralExpr(static_cast<DictLiteralExpr*>(expr));
case ASTNodeType::LAMBDA:
return generateLambdaExpr(static_cast<LambdaExpr*>(expr));
case ASTNodeType::TERNARY:
return generateTernaryExpr(static_cast<TernaryExpr*>(expr));
default:
addError("Unknown expression type in code generation");
return allocateRegister();
}
}
std::shared_ptr<Register> CodeGenerator::generateLiteralExpr(LiteralExpr* expr) {
auto result_reg = allocateRegister();
switch (expr->literal_type) {
case TokenType::INTEGER: {
int value = std::stoi(expr->value);
emit(Instruction::MOV, result_reg, value);
break;
}
case TokenType::FLOAT: {
// For simplicity, convert float to int representation
float value = std::stof(expr->value);
result_reg = allocateRegister(Register::FLOAT);
emit(Instruction::MOV, result_reg, static_cast<int>(value * 1000)); // Scale for demo
break;
}
case TokenType::STRING: {
// Load string address (simplified)
emit(Instruction::MOV, result_reg, 0); // String table address
break;
}
case TokenType::BOOLEAN: {
int value = (expr->value == "true") ? 1 : 0;
emit(Instruction::MOV, result_reg, value);
break;
}
case TokenType::NULL_LITERAL: {
emit(Instruction::MOV, result_reg, 0);
break;
}
default:
emit(Instruction::MOV, result_reg, 0);
break;
}
return result_reg;
}
// Machine code generation
std::vector<uint8_t> CodeGenerator::generateMachineCode() {
std::vector<uint8_t> machine_code;
// Convert our intermediate representation to machine code
for (auto& func : functions) {
for (auto& block : func->blocks) {
for (auto& instr : block->instructions) {
std::vector<uint8_t> instr_bytes = generateInstructionBytes(instr.get());
machine_code.insert(machine_code.end(), instr_bytes.begin(), instr_bytes.end());
}
}
}
return machine_code;
}
// Generate machine code bytes for a single instruction
std::vector<uint8_t> CodeGenerator::generateInstructionBytes(Instruction* instr) {
std::vector<uint8_t> bytes;
switch (target_platform) {
case TargetPlatform::WINDOWS_X64:
case TargetPlatform::LINUX_X64:
case TargetPlatform::MACOS_X64:
bytes = generateX86_64Instruction(instr);
break;
case TargetPlatform::MACOS_ARM64:
case TargetPlatform::LINUX_ARM64:
bytes = generateARM64Instruction(instr);
break;
default:
// Fallback to simple NOP
bytes.push_back(0x90); // x86 NOP
break;
}
return bytes;
}
// Generate x86_64 machine code for an instruction
std::vector<uint8_t> CodeGenerator::generateX86_64Instruction(Instruction* instr) {
std::vector<uint8_t> bytes;
switch (instr->opcode) {
case Instruction::MOV:
if (instr->has_immediate) {
// mov reg, imm32
bytes.push_back(0x48); // REX.W prefix for 64-bit
bytes.push_back(0xc7);
bytes.push_back(0xc0); // ModR/M for RAX
// Add immediate value (little endian)
uint32_t imm = static_cast<uint32_t>(instr->immediate);
bytes.push_back(imm & 0xFF);
bytes.push_back((imm >> 8) & 0xFF);
bytes.push_back((imm >> 16) & 0xFF);
bytes.push_back((imm >> 24) & 0xFF);
} else {
// mov reg, reg
bytes.push_back(0x48); // REX.W prefix
bytes.push_back(0x89);
bytes.push_back(0xc0); // ModR/M for mov rax, rax
}
break;
case Instruction::ADD:
if (instr->has_immediate) {
// add reg, imm32
bytes.push_back(0x48); // REX.W prefix
bytes.push_back(0x81);
bytes.push_back(0xc0); // ModR/M for add rax, imm32
uint32_t imm = static_cast<uint32_t>(instr->immediate);
bytes.push_back(imm & 0xFF);
bytes.push_back((imm >> 8) & 0xFF);
bytes.push_back((imm >> 16) & 0xFF);
bytes.push_back((imm >> 24) & 0xFF);
} else {
// add reg, reg
bytes.push_back(0x48); // REX.W prefix
bytes.push_back(0x01);
bytes.push_back(0xc0); // ModR/M for add rax, rax
}
break;
case Instruction::SUB:
if (instr->has_immediate) {
// sub reg, imm32
bytes.push_back(0x48); // REX.W prefix
bytes.push_back(0x81);
bytes.push_back(0xe8); // ModR/M for sub rax, imm32
uint32_t imm = static_cast<uint32_t>(instr->immediate);
bytes.push_back(imm & 0xFF);
bytes.push_back((imm >> 8) & 0xFF);
bytes.push_back((imm >> 16) & 0xFF);
bytes.push_back((imm >> 24) & 0xFF);
} else {
// sub reg, reg
bytes.push_back(0x48); // REX.W prefix
bytes.push_back(0x29);
bytes.push_back(0xc0); // ModR/M for sub rax, rax
}
break;
case Instruction::CALL:
// call rel32 (placeholder)
bytes.push_back(0xe8);
bytes.push_back(0x00);
bytes.push_back(0x00);
bytes.push_back(0x00);
bytes.push_back(0x00);
break;
case Instruction::RET:
bytes.push_back(0xc3); // ret
break;
case Instruction::PUSH:
bytes.push_back(0x50); // push rax (simplified)
break;
case Instruction::POP:
bytes.push_back(0x58); // pop rax (simplified)
break;
case Instruction::NOP:
bytes.push_back(0x90); // nop
break;
default:
// Unknown instruction, emit NOP
bytes.push_back(0x90);
break;
}
return bytes;
}
// Generate ARM64 machine code for an instruction
std::vector<uint8_t> CodeGenerator::generateARM64Instruction(Instruction* instr) {
std::vector<uint8_t> bytes;
switch (instr->opcode) {
case Instruction::MOV:
if (instr->has_immediate) {
// mov x0, #imm16
uint32_t imm = static_cast<uint32_t>(instr->immediate) & 0xFFFF;
uint32_t instruction = 0xd2800000 | (imm << 5); // mov x0, #imm16
bytes.push_back(instruction & 0xFF);
bytes.push_back((instruction >> 8) & 0xFF);
bytes.push_back((instruction >> 16) & 0xFF);
bytes.push_back((instruction >> 24) & 0xFF);
} else {
// mov x0, x1
bytes.push_back(0xe0); // mov x0, x1
bytes.push_back(0x03);
bytes.push_back(0x01);
bytes.push_back(0xaa);
}
break;
case Instruction::ADD:
if (instr->has_immediate) {
// add x0, x0, #imm12
uint32_t imm = static_cast<uint32_t>(instr->immediate) & 0xFFF;
uint32_t instruction = 0x91000000 | (imm << 10); // add x0, x0, #imm12
bytes.push_back(instruction & 0xFF);
bytes.push_back((instruction >> 8) & 0xFF);
bytes.push_back((instruction >> 16) & 0xFF);
bytes.push_back((instruction >> 24) & 0xFF);
} else {
// add x0, x0, x1
bytes.push_back(0x00); // add x0, x0, x1
bytes.push_back(0x00);
bytes.push_back(0x01);
bytes.push_back(0x8b);
}
break;
case Instruction::SUB:
if (instr->has_immediate) {
// sub x0, x0, #imm12
uint32_t imm = static_cast<uint32_t>(instr->immediate) & 0xFFF;
uint32_t instruction = 0xd1000000 | (imm << 10); // sub x0, x0, #imm12
bytes.push_back(instruction & 0xFF);
bytes.push_back((instruction >> 8) & 0xFF);
bytes.push_back((instruction >> 16) & 0xFF);
bytes.push_back((instruction >> 24) & 0xFF);
} else {
// sub x0, x0, x1
bytes.push_back(0x00); // sub x0, x0, x1
bytes.push_back(0x00);
bytes.push_back(0x01);
bytes.push_back(0xcb);
}
break;
case Instruction::CALL:
// bl #0 (placeholder)
bytes.push_back(0x00);
bytes.push_back(0x00);
bytes.push_back(0x00);
bytes.push_back(0x94);
break;
case Instruction::RET:
bytes.push_back(0xc0); // ret
bytes.push_back(0x03);
bytes.push_back(0x5f);
bytes.push_back(0xd6);
break;
case Instruction::NOP:
bytes.push_back(0x1f); // nop
bytes.push_back(0x20);
bytes.push_back(0x03);
bytes.push_back(0xd5);
break;
default:
// Unknown instruction, emit NOP
bytes.push_back(0x1f);
bytes.push_back(0x20);
bytes.push_back(0x03);
bytes.push_back(0xd5);
break;
}
return bytes;
}
std::shared_ptr<Register> CodeGenerator::generateIdentifierExpr(IdentifierExpr* expr) {
// First check local variables
auto it = variables.find(expr->name);
if (it != variables.end()) {
auto result_reg = allocateRegister();
emit(Instruction::MOV, result_reg, it->second);
return result_reg;
}
// Then check class member variables
auto class_it = class_members.find(expr->name);
if (class_it != class_members.end()) {
auto result_reg = allocateRegister();
emit(Instruction::MOV, result_reg, class_it->second);
return result_reg;
}
// Check semantic analyzer's symbol table if available
if (semantic_analyzer) {
auto global_scope = semantic_analyzer->getGlobalScope();
if (global_scope) {
// Check for variables in global scope
auto symbol = global_scope->findSymbol(expr->name);
if (symbol) {
// Create a register for this variable if not already created
auto var_reg = allocateRegister();
var_reg->name = expr->name;
variables[expr->name] = var_reg;
auto result_reg = allocateRegister();
emit(Instruction::MOV, result_reg, var_reg);
return result_reg;
}
// Check for functions in global scope
auto function = global_scope->findFunction(expr->name);
if (function) {
// Return function address for function references
auto result_reg = allocateRegister();
emit(Instruction::MOV, result_reg, 0); // Function address placeholder
return result_reg;
}
}
// Check class members if we're in a class context
if (!current_class_name.empty()) {
auto& classes = semantic_analyzer->getClasses();
auto class_it = classes.find(current_class_name);
if (class_it != classes.end()) {
// Check class member variables
auto member_it = class_it->second.members.find(expr->name);
if (member_it != class_it->second.members.end()) {
// Create a register for this class member if not already created
auto member_reg = allocateRegister();
member_reg->name = expr->name;
class_members[expr->name] = member_reg;
auto result_reg = allocateRegister();
emit(Instruction::MOV, result_reg, member_reg);
return result_reg;
}
// Check class methods
auto method_it = class_it->second.methods.find(expr->name);
if (method_it != class_it->second.methods.end()) {
// Return function address for method references
auto result_reg = allocateRegister();
emit(Instruction::MOV, result_reg, 0); // Function address placeholder
return result_reg;
}
}
}
}
addError("Undefined variable: " + expr->name);
return allocateRegister();
}
std::shared_ptr<Register> CodeGenerator::generateBinaryOpExpr(BinaryOpExpr* expr) {
auto left_reg = generateExpression(expr->left.get());
auto right_reg = generateExpression(expr->right.get());
auto result_reg = allocateRegister();
switch (expr->operator_type) {
case TokenType::PLUS:
emit(Instruction::ADD, result_reg, left_reg, right_reg);
break;
case TokenType::MINUS:
emit(Instruction::SUB, result_reg, left_reg, right_reg);
break;
case TokenType::MULTIPLY:
emit(Instruction::MUL, result_reg, left_reg, right_reg);
break;
case TokenType::DIVIDE:
emit(Instruction::DIV, result_reg, left_reg, right_reg);
break;