Acse.y 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720
  1. %{
  2. /*
  3. * Andrea Di Biagio
  4. * Politecnico di Milano, 2007
  5. *
  6. * Acse.y
  7. * Formal Languages & Compilers Machine, 2007/2008
  8. *
  9. */
  10. /*************************************************************************
  11. Compiler for the language LANCE
  12. ***************************************************************************/
  13. #include <stdio.h>
  14. #include <stdlib.h>
  15. #include <assert.h>
  16. #include "axe_struct.h"
  17. #include "axe_engine.h"
  18. #include "symbol_table.h"
  19. #include "axe_errors.h"
  20. #include "collections.h"
  21. #include "axe_expressions.h"
  22. #include "axe_gencode.h"
  23. #include "axe_utils.h"
  24. #include "axe_array.h"
  25. #include "axe_cflow_graph.h"
  26. #include "cflow_constants.h"
  27. #include "axe_transform.h"
  28. #include "axe_reg_alloc.h"
  29. #include "reg_alloc_constants.h"
  30. #include "axe_io_manager.h"
  31. #ifndef NDEBUG
  32. # include "axe_debug.h"
  33. #endif
  34. /* global variables */
  35. int line_num; /* this variable will keep track of the
  36. * source code line number. Every time that a newline
  37. * is encountered while parsing the input file, this
  38. * value is increased by 1. This value is then used
  39. * for error tracking: if the parser returns an error
  40. * or a warning, this value is used in order to notify
  41. * in which line of code the error has been found */
  42. int num_error; /* the number of errors found in the code. This value
  43. * is increased by 1 every time a new error is found
  44. * in the code. */
  45. int num_warning; /* As for the `num_error' global variable, this one
  46. * keeps track of all the warning messages displayed */
  47. /* errorcode is defined inside "axe_engine.c" */
  48. extern int errorcode; /* this variable is used to test if an error is found
  49. * while parsing the input file. It also is set
  50. * to notify if the compiler internal state is invalid.
  51. * When the parsing process is started, the value
  52. * of `errorcode' is set to the value of the macro
  53. * `AXE_OK' defined in "axe_constants.h".
  54. * As long as everything (the parsed source code and
  55. * the internal state of the compiler) is correct,
  56. * the value of `errorcode' is set to `AXE_OK'.
  57. * When an error occurs (because the input file contains
  58. * one or more syntax errors or because something went
  59. * wrong in the machine internal state), the errorcode
  60. * is set to a value that is different from `AXE_OK'. */
  61. extern int cflow_errorcode; /* As for `errorcode' this value is used to
  62. * test if an error occurs during the creation process of
  63. * a control flow graph. More informations can be found
  64. * analyzing the file `axe_cflow_graph.h'. */
  65. /* program informations */
  66. t_program_infos *program; /* The singleton instance of `program'.
  67. * An instance of `t_program_infos' holds in its
  68. * internal structure, all the useful informations
  69. * about a program. For example: the assembly
  70. * (code and directives); the symbol table;
  71. * the label manager (see axe_labels.h) etc. */
  72. t_cflow_Graph *graph; /* An instance of a control flow graph. This instance
  73. * will be generated starting from `program' and will
  74. * be used during the register allocation process */
  75. t_reg_allocator *RA; /* Register allocator. It implements the "Linear scan"
  76. * algorythm */
  77. t_io_infos *file_infos; /* input and output files used by the compiler */
  78. %}
  79. %expect 1
  80. /*=========================================================================
  81. SEMANTIC RECORDS
  82. =========================================================================*/
  83. %union {
  84. int intval;
  85. char *svalue;
  86. t_axe_expression expr;
  87. t_axe_declaration *decl;
  88. t_list *list;
  89. t_axe_label *label;
  90. t_while_statement while_stmt;
  91. }
  92. /*=========================================================================
  93. TOKENS
  94. =========================================================================*/
  95. %start program
  96. %token LBRACE RBRACE LPAR RPAR LSQUARE RSQUARE
  97. %token SEMI COLON PLUS MINUS MUL_OP DIV_OP MOD_OP
  98. %token AND_OP OR_OP NOT_OP
  99. %token ASSIGN LT GT SHL_OP SHR_OP EQ NOTEQ LTEQ GTEQ
  100. %token ANDAND OROR
  101. %token COMMA
  102. %token FOR
  103. %token RETURN
  104. %token READ
  105. %token WRITE
  106. %token PLUSINFTY MINUSINFTY UNDEF
  107. %token <label> DO
  108. %token <while_stmt> WHILE
  109. %token <label> IF
  110. %token <label> ELSE
  111. %token <intval> TYPE
  112. %token <svalue> IDENTIFIER
  113. %token <intval> NUMBER
  114. %type <expr> exp
  115. %type <decl> declaration
  116. %type <list> declaration_list
  117. %type <label> if_stmt
  118. /*=========================================================================
  119. OPERATOR PRECEDENCES
  120. =========================================================================*/
  121. %left COMMA
  122. %left ASSIGN
  123. %left OROR
  124. %left ANDAND
  125. %left OR_OP
  126. %left AND_OP
  127. %left EQ NOTEQ
  128. %left LT GT LTEQ GTEQ
  129. %left SHL_OP SHR_OP
  130. %left MINUS PLUS
  131. %left MUL_OP DIV_OP
  132. %right NOT
  133. /*=========================================================================
  134. BISON GRAMMAR
  135. =========================================================================*/
  136. %%
  137. /* `program' is the starting non-terminal of the grammar.
  138. * A program is composed by:
  139. 1. declarations (zero or more);
  140. 2. A list of instructions. (at least one instruction!).
  141. * When the rule associated with the non-terminal `program' is executed,
  142. * the parser notify it to the `program' singleton instance. */
  143. program : var_declarations statements
  144. {
  145. /* Notify the end of the program. Once called
  146. * the function `set_end_Program' - if necessary -
  147. * introduces a `HALT' instruction into the
  148. * list of instructions. */
  149. set_end_Program(program);
  150. /* return from yyparse() */
  151. YYACCEPT;
  152. }
  153. ;
  154. var_declarations : var_declarations var_declaration { /* does nothing */ }
  155. | /* empty */ { /* does nothing */ }
  156. ;
  157. var_declaration : TYPE declaration_list SEMI
  158. {
  159. /* update the program infos by adding new variables */
  160. set_new_variables(program, $1, $2);
  161. }
  162. ;
  163. declaration_list : declaration_list COMMA declaration
  164. { /* add the new declaration to the list of declarations */
  165. $$ = addElement($1, $3, -1);
  166. if (! $3->isArray) {
  167. char *s = malloc(sizeof(char)*strlen($3->ID) + 3);
  168. strcpy(s, $3->ID);
  169. s = strcat(s, "_i");
  170. $$ = addElement($$, alloc_declaration(s, 0, 0, 0), -1);
  171. }
  172. }
  173. | declaration
  174. {
  175. /* add the new declaration to the list of declarations */
  176. $$ = addElement(NULL, $1, -1);
  177. if (! $1->isArray) {
  178. char *s = malloc(sizeof(char)*strlen($1->ID) + 3);
  179. strcpy(s, $1->ID);
  180. s = strcat(s, "_i");
  181. $$ = addElement($$, alloc_declaration(s, 0, 0, 0), -1);
  182. }
  183. }
  184. ;
  185. declaration : IDENTIFIER ASSIGN NUMBER
  186. {
  187. /* create a new instance of t_axe_declaration */
  188. $$ = alloc_declaration($1, 0, 0, $3);
  189. /* test if an `out of memory' occurred */
  190. if ($$ == NULL)
  191. notifyError(AXE_OUT_OF_MEMORY);
  192. }
  193. | IDENTIFIER LSQUARE NUMBER RSQUARE
  194. {
  195. /* create a new instance of t_axe_declaration */
  196. $$ = alloc_declaration($1, 1, $3, 0);
  197. /* test if an `out of memory' occurred */
  198. if ($$ == NULL)
  199. notifyError(AXE_OUT_OF_MEMORY);
  200. }
  201. | IDENTIFIER
  202. {
  203. /* create a new instance of t_axe_declaration */
  204. $$ = alloc_declaration($1, 0, 0, 0);
  205. /* test if an `out of memory' occurred */
  206. if ($$ == NULL)
  207. notifyError(AXE_OUT_OF_MEMORY);
  208. }
  209. ;
  210. /* A block of code can be either a single statement or
  211. * a set of statements enclosed between braces */
  212. code_block : statement { /* does nothing */ }
  213. | LBRACE statements RBRACE { /* does nothing */ }
  214. ;
  215. /* One or more code statements */
  216. statements : statements statement { /* does nothing */ }
  217. | statement { /* does nothing */ }
  218. ;
  219. /* A statement can be either an assignment statement or a control statement
  220. * or a read/write statement or a semicolon */
  221. statement : assign_statement SEMI { /* does nothing */ }
  222. | control_statement { /* does nothing */ }
  223. | read_write_statement SEMI { /* does nothing */ }
  224. | SEMI { gen_nop_instruction(program); }
  225. ;
  226. control_statement : if_statement { /* does nothing */ }
  227. | while_statement { /* does nothing */ }
  228. | do_while_statement SEMI { /* does nothing */ }
  229. | return_statement SEMI { /* does nothing */ }
  230. ;
  231. read_write_statement : read_statement { /* does nothing */ }
  232. | write_statement { /* does nothing */ }
  233. ;
  234. assign_statement : IDENTIFIER LSQUARE exp RSQUARE ASSIGN exp
  235. {
  236. /* Notify to `program' that the value $6
  237. * have to be assigned to the location
  238. * addressed by $1[$3]. Where $1 is obviously
  239. * the array/pointer identifier, $3 is an expression
  240. * that holds an integer value. That value will be
  241. * used as an index for the array $1 */
  242. storeArrayElement(program, $1, $3, $6);
  243. /* free the memory associated with the IDENTIFIER.
  244. * The use of the free instruction is required
  245. * because of the value associated with IDENTIFIER.
  246. * The value of IDENTIFIER is a string created
  247. * by a call to the function `strdup' (see Acse.lex) */
  248. free($1);
  249. }
  250. | IDENTIFIER ASSIGN exp
  251. {
  252. int location, infty;
  253. t_axe_instruction *instr;
  254. /* in order to assign a value to a variable, we have to
  255. * know where the variable is located (i.e. in which register).
  256. * the function `get_symbol_location' is used in order
  257. * to retrieve the register location assigned to
  258. * a given identifier.
  259. * A symbol table keeps track of the location of every
  260. * declared variable.
  261. * `get_symbol_location' perform a query on the symbol table
  262. * in order to discover the correct location of
  263. * the variable with $1 as identifier */
  264. /* get the location of the symbol with the given ID. */
  265. location = get_symbol_location(program, $1, 0);
  266. infty = get_symbol_location(program, strcat($1, "_i"), 0);
  267. /* update the value of location */
  268. if ($3.expression_type == IMMEDIATE) {
  269. gen_move_immediate(program, location, $3.value);
  270. gen_addi_instruction(program, infty, REG_0, $3.infty);
  271. }
  272. else {
  273. instr = gen_add_instruction
  274. (program, location, REG_0, $3.value, CG_DIRECT_ALL);
  275. gen_add_instruction(program, infty, REG_0, $3.infty,
  276. CG_DIRECT_ALL);
  277. }
  278. /* free the memory associated with the IDENTIFIER */
  279. free($1);
  280. }
  281. ;
  282. if_statement : if_stmt
  283. {
  284. /* fix the `label_else' */
  285. assignLabel(program, $1);
  286. }
  287. | if_stmt ELSE
  288. {
  289. /* reserve a new label that points to the address where to jump if
  290. * `exp' is verified */
  291. $2 = newLabel(program);
  292. /* exit from the if-else */
  293. gen_bt_instruction (program, $2, 0);
  294. /* fix the `label_else' */
  295. assignLabel(program, $1);
  296. }
  297. code_block
  298. {
  299. /* fix the `label_else' */
  300. assignLabel(program, $2);
  301. }
  302. ;
  303. if_stmt : IF
  304. {
  305. /* the label that points to the address where to jump if
  306. * `exp' is not verified */
  307. $1 = newLabel(program);
  308. }
  309. LPAR exp RPAR
  310. {
  311. if ($4.expression_type == IMMEDIATE)
  312. gen_load_immediate(program, $4.value);
  313. else
  314. gen_andb_instruction(program, $4.value,
  315. $4.value, $4.value, CG_DIRECT_ALL);
  316. /* if `exp' returns FALSE, jump to the label $1 */
  317. gen_beq_instruction (program, $1, 0);
  318. }
  319. code_block { $$ = $1; }
  320. ;
  321. while_statement : WHILE
  322. {
  323. /* initialize the value of the non-terminal */
  324. $1 = create_while_statement();
  325. /* reserve and fix a new label */
  326. $1.label_condition
  327. = assignNewLabel(program);
  328. }
  329. LPAR exp RPAR
  330. {
  331. if ($4.expression_type == IMMEDIATE)
  332. gen_load_immediate(program, $4.value);
  333. else
  334. gen_andb_instruction(program, $4.value,
  335. $4.value, $4.value, CG_DIRECT_ALL);
  336. /* reserve a new label. This new label will point
  337. * to the first instruction after the while code
  338. * block */
  339. $1.label_end = newLabel(program);
  340. /* if `exp' returns FALSE, jump to the label $1.label_end */
  341. gen_beq_instruction (program, $1.label_end, 0);
  342. }
  343. code_block
  344. {
  345. /* jump to the beginning of the loop */
  346. gen_bt_instruction
  347. (program, $1.label_condition, 0);
  348. /* fix the label `label_end' */
  349. assignLabel(program, $1.label_end);
  350. }
  351. ;
  352. do_while_statement : DO
  353. {
  354. /* the label that points to the address where to jump if
  355. * `exp' is not verified */
  356. $1 = newLabel(program);
  357. /* fix the label */
  358. assignLabel(program, $1);
  359. }
  360. code_block WHILE LPAR exp RPAR
  361. {
  362. if ($6.expression_type == IMMEDIATE)
  363. gen_load_immediate(program, $6.value);
  364. else
  365. gen_andb_instruction(program, $6.value,
  366. $6.value, $6.value, CG_DIRECT_ALL);
  367. /* if `exp' returns TRUE, jump to the label $1 */
  368. gen_bne_instruction (program, $1, 0);
  369. }
  370. ;
  371. return_statement : RETURN
  372. {
  373. /* insert an HALT instruction */
  374. gen_halt_instruction(program);
  375. }
  376. ;
  377. read_statement : READ LPAR IDENTIFIER RPAR
  378. {
  379. int location, infty;
  380. /* read from standard input an integer value and assign
  381. * it to a variable associated with the given identifier */
  382. /* get the location of the symbol with the given ID */
  383. /* lookup the symbol table and fetch the register location
  384. * associated with the IDENTIFIER $3. */
  385. location = get_symbol_location(program, $3, 0);
  386. infty = get_symbol_location(program, strcat($3, "_i"), 0);
  387. /* insert a read instruction */
  388. gen_read_instruction (program, location);
  389. gen_addi_instruction(program, infty, REG_0, 1);
  390. /* free the memory associated with the IDENTIFIER */
  391. free($3);
  392. }
  393. ;
  394. write_statement : WRITE LPAR exp RPAR
  395. {
  396. int location, infty;
  397. if ($3.expression_type == IMMEDIATE)
  398. {
  399. /* load `immediate' into a new register. Returns the new register
  400. * identifier or REG_INVALID if an error occurs */
  401. location = gen_load_immediate(program, $3.value);
  402. infty = gen_load_immediate(program, $3.infty);
  403. }
  404. else {
  405. location = $3.value;
  406. infty = $3.infty;
  407. }
  408. /* write to standard output an integer value */
  409. gen_write_instruction (program, location);
  410. gen_write_instruction (program, infty);
  411. }
  412. ;
  413. exp: NUMBER { $$ = create_expression_inf ($1, 1, IMMEDIATE); }
  414. | UNDEF { $$ = create_expression_inf (0, 0, IMMEDIATE); }
  415. | PLUSINFTY { $$ = create_expression_inf (1, -1, IMMEDIATE); }
  416. | MINUSINFTY { $$ = create_expression_inf (2, -1, IMMEDIATE); }
  417. | IDENTIFIER {
  418. int location, infty;
  419. /* get the location of the symbol with the given ID */
  420. location = get_symbol_location(program, $1, 0);
  421. infty = get_symbol_location(program, strcat($1, "_i"), 0);
  422. /* return the register location of IDENTIFIER as
  423. * a value for `exp' */
  424. $$ = create_expression_inf (location, infty, REGISTER);
  425. /* free the memory associated with the IDENTIFIER */
  426. free($1);
  427. }
  428. | IDENTIFIER LSQUARE exp RSQUARE {
  429. int reg;
  430. /* load the value IDENTIFIER[exp]
  431. * into `arrayElement' */
  432. reg = loadArrayElement(program, $1, $3);
  433. /* create a new expression */
  434. $$ = create_expression (reg, REGISTER);
  435. /* free the memory associated with the IDENTIFIER */
  436. free($1);
  437. }
  438. | NOT_OP NUMBER { if ($2 == 0)
  439. $$ = create_expression (1, IMMEDIATE);
  440. else
  441. $$ = create_expression (0, IMMEDIATE);
  442. }
  443. | NOT_OP IDENTIFIER {
  444. int identifier_location;
  445. int output_register;
  446. /* get the location of the symbol with the given ID */
  447. identifier_location =
  448. get_symbol_location(program, $2, 0);
  449. /* generate a NOT instruction. In order to do this,
  450. * at first we have to ask for a free register where
  451. * to store the result of the NOT instruction. */
  452. output_register = getNewRegister(program);
  453. /* Now we are able to generate a NOT instruction */
  454. gen_notl_instruction (program, output_register
  455. , identifier_location);
  456. $$ = create_expression (output_register, REGISTER);
  457. /* free the memory associated with the IDENTIFIER */
  458. free($2);
  459. }
  460. | exp AND_OP exp {
  461. $$ = handle_bin_numeric_op(program, $1, $3, ANDB);
  462. }
  463. | exp OR_OP exp {
  464. $$ = handle_bin_numeric_op(program, $1, $3, ORB);
  465. }
  466. | exp PLUS exp {
  467. $$ = handle_bin_numeric_op(program, $1, $3, ADD);
  468. }
  469. | exp MINUS exp {
  470. $$ = handle_bin_numeric_op(program, $1, $3, SUB);
  471. }
  472. | exp MUL_OP exp {
  473. $$ = handle_bin_numeric_op(program, $1, $3, MUL);
  474. }
  475. | exp DIV_OP exp {
  476. $$ = handle_bin_numeric_op(program, $1, $3, DIV);
  477. }
  478. | exp LT exp {
  479. $$ = handle_binary_comparison (program, $1, $3, _LT_);
  480. }
  481. | exp GT exp {
  482. $$ = handle_binary_comparison (program, $1, $3, _GT_);
  483. }
  484. | exp EQ exp {
  485. if (($1.expression_type == IMMEDIATE) &&
  486. ($3.expression_type == IMMEDIATE)) {
  487. int undef = ($1.infty * $3.infty != 0);
  488. int value = (($1.infty + $3.infty) * ($1.value == $3.value)) != 0;
  489. $$ = create_expression_inf(value, undef, IMMEDIATE);
  490. }
  491. else {
  492. int temp_reg = getNewRegister(program);
  493. int infty_reg = getNewRegister(program);
  494. int value_reg = getNewRegister(program);
  495. gen_mul_instruction(program, infty_reg, $1.infty, $3.infty,
  496. CG_DIRECT_ALL);
  497. gen_sne_instruction(program, infty_reg);
  498. gen_eorl_instruction(program, value_reg, $1.infty, $3.infty,
  499. CG_DIRECT_ALL);
  500. gen_seq_instruction(program, value_reg);
  501. gen_sub_instruction(program, temp_reg, $1.value, $3.value,
  502. CG_DIRECT_ALL);
  503. gen_seq_instruction(program, temp_reg);
  504. gen_mul_instruction(program, value_reg, temp_reg, value_reg,
  505. CG_DIRECT_ALL);
  506. $$ = create_expression_inf(value_reg, infty_reg, REGISTER);
  507. }
  508. }
  509. | exp NOTEQ exp {
  510. $$ = handle_binary_comparison (program, $1, $3, _NOTEQ_);
  511. }
  512. | exp LTEQ exp {
  513. $$ = handle_binary_comparison (program, $1, $3, _LTEQ_);
  514. }
  515. | exp GTEQ exp {
  516. $$ = handle_binary_comparison (program, $1, $3, _GTEQ_);
  517. }
  518. | exp SHL_OP exp { $$ = handle_bin_numeric_op(program, $1, $3, SHL); }
  519. | exp SHR_OP exp { $$ = handle_bin_numeric_op(program, $1, $3, SHR); }
  520. | exp ANDAND exp { $$ = handle_bin_numeric_op(program, $1, $3, ANDL); }
  521. | exp OROR exp { $$ = handle_bin_numeric_op(program, $1, $3, ORL); }
  522. | LPAR exp RPAR { $$ = $2; }
  523. | MINUS exp {
  524. if ($2.expression_type == IMMEDIATE)
  525. {
  526. $$ = $2;
  527. $$.value = - ($$.value);
  528. }
  529. else
  530. {
  531. t_axe_expression exp_r0;
  532. /* create an expression for regisrer REG_0 */
  533. exp_r0.value = REG_0;
  534. exp_r0.expression_type = REGISTER;
  535. $$ = handle_bin_numeric_op
  536. (program, exp_r0, $2, SUB);
  537. }
  538. }
  539. ;
  540. %%
  541. /*=========================================================================
  542. MAIN
  543. =========================================================================*/
  544. int main (int argc, char **argv)
  545. {
  546. /* initialize all the compiler data structures and global variables */
  547. init_compiler(argc, argv);
  548. /* start the parsing procedure */
  549. yyparse();
  550. #ifndef NDEBUG
  551. fprintf(stdout, "Parsing process completed. \n");
  552. #endif
  553. /* test if the parsing process completed succesfully */
  554. checkConsistency();
  555. #ifndef NDEBUG
  556. fprintf(stdout, "Creating a control flow graph. \n");
  557. #endif
  558. /* create the control flow graph */
  559. graph = createFlowGraph(program->instructions);
  560. checkConsistency();
  561. #ifndef NDEBUG
  562. assert(program != NULL);
  563. assert(program->sy_table != NULL);
  564. assert(file_infos != NULL);
  565. assert(file_infos->syTable_output != NULL);
  566. printSymbolTable(program->sy_table, file_infos->syTable_output);
  567. printGraphInfos(graph, file_infos->cfg_1, 0);
  568. fprintf(stdout, "Updating the basic blocks. \n");
  569. #endif
  570. /* update the control flow graph by inserting load and stores inside
  571. * every basic block */
  572. graph = insertLoadAndStoreInstr(program, graph);
  573. #ifndef NDEBUG
  574. fprintf(stdout, "Executing a liveness analysis on the intermediate code \n");
  575. #endif
  576. performLivenessAnalysis(graph);
  577. checkConsistency();
  578. #ifndef NDEBUG
  579. printGraphInfos(graph, file_infos->cfg_2, 1);
  580. #endif
  581. #ifndef NDEBUG
  582. fprintf(stdout, "Starting the register allocation process. \n");
  583. #endif
  584. /* initialize the register allocator by using the control flow
  585. * informations stored into the control flow graph */
  586. RA = initializeRegAlloc(graph);
  587. /* execute the linear scan algorythm */
  588. execute_linear_scan(RA);
  589. #ifndef NDEBUG
  590. printRegAllocInfos(RA, file_infos->reg_alloc_output);
  591. #endif
  592. #ifndef NDEBUG
  593. fprintf(stdout, "Updating the control flow informations. \n");
  594. #endif
  595. /* apply changes to the program informations by using the informations
  596. * of the register allocation process */
  597. updateProgramInfos(program, graph, RA);
  598. #ifndef NDEBUG
  599. fprintf(stdout, "Writing the assembly file... \n");
  600. #endif
  601. writeAssembly(program, file_infos->output_file_name);
  602. #ifndef NDEBUG
  603. fprintf(stdout, "Assembly written on file \"%s\".\n", file_infos->output_file_name);
  604. #endif
  605. /* shutdown the compiler */
  606. shutdownCompiler(0);
  607. return 0;
  608. }
  609. /*=========================================================================
  610. YYERROR
  611. =========================================================================*/
  612. int yyerror(const char* errmsg)
  613. {
  614. errorcode = AXE_SYNTAX_ERROR;
  615. return 0;
  616. }