X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/331dbc1bb7fac0b108adc5591bd9308a39629287..6ce2d93a9b49afbc196e764923d539bc0caa1120:/src/main.c diff --git a/src/main.c b/src/main.c index 6deec48a..84b2566f 100644 --- a/src/main.c +++ b/src/main.c @@ -1,6 +1,7 @@ -/* Top level entry point of bison, - Copyright 1984, 1986, 1989, 1992, 1995, 2000, 2001 - Free Software Foundation, Inc. +/* Top level entry point of Bison. + + Copyright (C) 1984, 1986, 1989, 1992, 1995, 2000, 2001, 2002, 2004, + 2005, 2006, 2007 Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -16,107 +17,184 @@ You should have received a copy of the GNU General Public License along with Bison; see the file COPYING. If not, write to - the Free Software Foundation, Inc., 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. */ - + the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, + Boston, MA 02110-1301, USA. */ +#include #include "system.h" -#include "getargs.h" -#include "files.h" + +#include +#include +#include +#include +#include + +#include "LR0.h" #include "complain.h" +#include "conflicts.h" #include "derives.h" -#include "output.h" -#include "reader.h" +#include "files.h" +#include "getargs.h" +#include "gram.h" #include "lalr.h" -#include "reduce.h" +#include "muscle_tab.h" #include "nullable.h" +#include "output.h" #include "print.h" -#include "LR0.h" -#include "conflicts.h" #include "print_graph.h" -#include "muscle_tab.h" +#include "reader.h" +#include "reduce.h" +#include "scan-code.h" +#include "scan-gram.h" +#include "scan-skel.h" #include "symtab.h" -#include "lex.h" +#include "tables.h" +#include "uniqstr.h" + -/* The name this program was run with, for messages. */ -char *program_name; int main (int argc, char *argv[]) { program_name = argv[0]; setlocale (LC_ALL, ""); - bindtextdomain (PACKAGE, LOCALEDIR); - textdomain (PACKAGE); + (void) bindtextdomain (PACKAGE, LOCALEDIR); + (void) bindtextdomain ("bison-runtime", LOCALEDIR); + (void) textdomain (PACKAGE); + + uniqstrs_new (); - lineno = 0; getargs (argc, argv); + timevar_report = trace_flag & trace_time; + init_timevar (); + timevar_start (TV_TOTAL); + + if (trace_flag & trace_bitsets) + bitset_stats_enable (); + muscle_init (); /* Read the input. Copy some parts of it to FGUARD, FACTION, FTABLE and FATTRS. In file reader.c. The other parts are recorded in the grammar; see gram.h. */ + + timevar_push (TV_READER); reader (); - if (complain_message_count) - exit (1); + timevar_pop (TV_READER); + + if (complaint_issued) + goto finish; /* Find useless nonterminals and productions and reduce the grammar. */ + timevar_push (TV_REDUCE); reduce_grammar (); + timevar_pop (TV_REDUCE); /* Record other info about the grammar. In files derives and nullable. */ - set_derives (); - set_nullable (); + timevar_push (TV_SETS); + derives_compute (); + nullable_compute (); + timevar_pop (TV_SETS); /* Convert to nondeterministic finite state machine. In file LR0. See state.h for more info. */ + timevar_push (TV_LR0); generate_states (); + timevar_pop (TV_LR0); /* make it deterministic. In file lalr. */ + timevar_push (TV_LALR); lalr (); + timevar_pop (TV_LALR); /* Find and record any conflicts: places where one token of lookahead is not enough to disambiguate the parsing. In file conflicts. Also resolve s/r conflicts based on precedence declarations. */ - solve_conflicts (); + timevar_push (TV_CONFLICTS); + conflicts_solve (); + { + state_number old_to_new[nstates]; + state_number nstates_old = nstates; + state_remove_unreachable_states (old_to_new); + lalr_update_state_numbers (old_to_new, nstates_old); + conflicts_update_state_numbers (old_to_new, nstates_old); + } conflicts_print (); + timevar_pop (TV_CONFLICTS); + + /* Compute the parser tables. */ + timevar_push (TV_ACTIONS); + tables_generate (); + timevar_pop (TV_ACTIONS); + + grammar_rules_never_reduced_report + (_("rule never reduced because of conflicts")); /* Output file names. */ compute_output_file_names (); + /* Output the detailed report on the grammar. */ + if (report_flag) + { + timevar_push (TV_REPORT); + print_results (); + timevar_pop (TV_REPORT); + } + + /* Output the graph. */ + if (graph_flag) + { + timevar_push (TV_GRAPH); + print_graph (); + timevar_pop (TV_GRAPH); + } + /* Stop if there were errors, to avoid trashing previous output files. */ - if (complain_message_count) - exit (1); + if (complaint_issued) + goto finish; - /* Output the detailed report on the grammar. */ - if (verbose_flag) - print_results (); - - /* Output the VCG graph. */ - if (graph_flag) - print_graph (); + /* Lookahead tokens are no longer needed. */ + timevar_push (TV_FREE); + lalr_free (); + timevar_pop (TV_FREE); /* Output the tables and the parser to ftable. In file output. */ + timevar_push (TV_PARSER); output (); + timevar_pop (TV_PARSER); - /* Free the symbol table data structure. */ - free_symtab (); - + timevar_push (TV_FREE); + nullable_free (); + derives_free (); + tables_free (); + states_free (); reduce_free (); - free_conflicts (); - free_nullable (); - free_derives (); - - output_files (); - - /* If using alloca.c, flush the alloca'ed memory for the benefit of - people running Bison as a library in IDEs. */ -#if C_ALLOCA - alloca (0); -#endif - - return complain_message_count ? EXIT_FAILURE : EXIT_SUCCESS; + conflicts_free (); + grammar_free (); + output_file_names_free (); + + /* The scanner memory cannot be released right after parsing, as it + contains things such as user actions, prologue, epilogue etc. */ + gram_scanner_free (); + muscle_free (); + uniqstrs_free (); + code_scanner_free (); + skel_scanner_free (); + quotearg_free (); + timevar_pop (TV_FREE); + + if (trace_flag & trace_bitsets) + bitset_stats_dump (stderr); + + finish: + + /* Stop timing and print the times. */ + timevar_stop (TV_TOTAL); + timevar_print (stderr); + + return complaint_issued ? EXIT_FAILURE : EXIT_SUCCESS; }