source: src/main.cc@ b12c036

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors deferred_resn demangler enum forall-pointer-decay jacob/cs343-translation jenkins-sandbox new-ast new-ast-unique-expr new-env no_list persistent-indexer pthread-emulation qualifiedEnum with_gc
Last change on this file since b12c036 was 4990812, checked in by Thierry Delisle <tdelisle@…>, 7 years ago

Added some debug for the fallthrough bug
  • Property mode set to 100644
File size: 19.8 KB
RevLine 
[b87a5ed]1//
2// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
3//
4// The contents of this file are covered under the licence agreement in the
5// file "LICENCE" distributed with Cforall.
6//
[71f4e4f]7// main.cc --
[b87a5ed]8//
[843054c2]9// Author : Richard C. Bilson
[b87a5ed]10// Created On : Fri May 15 23:12:02 2015
[c59bde6]11// Last Modified By : Peter A. Buhr
[c5e5109]12// Last Modified On : Mon May 7 14:35:57 2018
13// Update Count : 492
[b87a5ed]14//
15
[bf2438c]16#include <cxxabi.h> // for __cxa_demangle
17#include <execinfo.h> // for backtrace, backtrace_symbols
18#include <getopt.h> // for no_argument, optind, geto...
19#include <signal.h> // for signal, SIGABRT, SIGSEGV
[08fc48f]20#include <cassert> // for assertf
[bf2438c]21#include <cstdio> // for fopen, FILE, fclose, stdin
22#include <cstdlib> // for exit, free, abort, EXIT_F...
23#include <cstring> // for index
[be9288a]24#include <fstream> // for ofstream
[bf2438c]25#include <iostream> // for operator<<, basic_ostream
26#include <iterator> // for back_inserter
27#include <list> // for list
[08fc48f]28#include <string> // for char_traits, operator<<
[e6955b1]29
[bf2438c]30#include "../config.h" // for CFA_LIBDIR
31#include "CodeGen/FixMain.h" // for FixMain
32#include "CodeGen/FixNames.h" // for fixNames
33#include "CodeGen/Generate.h" // for generate
34#include "CodeTools/DeclStats.h" // for printDeclStats
35#include "CodeTools/TrackLoc.h" // for fillLocations
36#include "Common/CompilerError.h" // for CompilerError
[cbbd5b48]37#include "Common/Heap.h"
38#include "Common/PassVisitor.h"
[bf2438c]39#include "Common/SemanticError.h" // for SemanticError
40#include "Common/UnimplementedError.h" // for UnimplementedError
41#include "Common/utility.h" // for deleteAll, filter, printAll
[9f5ecf5]42#include "Concurrency/Waitfor.h" // for generateWaitfor
[bf2438c]43#include "ControlStruct/ExceptTranslate.h" // for translateEHM
44#include "ControlStruct/Mutate.h" // for mutate
45#include "GenPoly/Box.h" // for box
46#include "GenPoly/InstantiateGeneric.h" // for instantiateGeneric
47#include "GenPoly/Lvalue.h" // for convertLvalue
48#include "GenPoly/Specialize.h" // for convertSpecializations
49#include "InitTweak/FixInit.h" // for fix
50#include "InitTweak/GenInit.h" // for genInit
51#include "MakeLibCfa.h" // for makeLibCfa
52#include "Parser/LinkageSpec.h" // for Spec, Cforall, Intrinsic
53#include "Parser/ParseNode.h" // for DeclarationNode, buildList
54#include "Parser/TypedefTable.h" // for TypedefTable
55#include "ResolvExpr/AlternativePrinter.h" // for AlternativePrinter
56#include "ResolvExpr/Resolver.h" // for resolve
57#include "SymTab/Validate.h" // for validate
58#include "SynTree/Declaration.h" // for Declaration
59#include "SynTree/Visitor.h" // for acceptAll
60#include "Tuples/Tuples.h" // for expandMemberTuples, expan...
[a5f0529]61#include "Virtual/ExpandCasts.h" // for expandCasts
[51b73452]62
63using namespace std;
64
[6edd210]65#define PASS(name, pass) \
[ecaeac6e]66 if ( errorp ) { cerr << name << endl; } \
67 HeapStats::newPass(name); \
[6edd210]68 pass;
[0da3e2c]69
[8b7ee09]70LinkageSpec::Spec linkage = LinkageSpec::Cforall;
[0da3e2c]71TypedefTable typedefTable;
[cbaee0d]72DeclarationNode * parseTree = nullptr; // program parse tree
[81419b5]73
[926af74]74extern int yydebug; // set for -g flag (Grammar)
[b87a5ed]75bool
76 astp = false,
[de62360d]77 bresolvep = false,
[fea7ca7]78 bboxp = false,
[8905f56]79 bcodegenp = false,
[ca1c11f]80 ctorinitp = false,
[41a7137]81 declstatsp = false,
[b87a5ed]82 exprp = false,
83 expraltp = false,
[53d3ab4b]84 genericsp = false,
[b87a5ed]85 libcfap = false,
[de62360d]86 nopreludep = false,
[1ab4ce2]87 noprotop = false,
[3fe34ae]88 nomainp = false,
[de62360d]89 parsep = false,
[b87a5ed]90 resolvep = false, // used in AlternativeFinder
91 symtabp = false,
[d3b7937]92 treep = false,
[626dbc10]93 tuplep = false,
[b87a5ed]94 validp = false,
[de62360d]95 errorp = false,
[35b1bf4]96 codegenp = false,
[c850687]97 prettycodegenp = false,
[6de43b6]98 linemarks = false;
[b87a5ed]99
[926af74]100static void parse_cmdline( int argc, char *argv[], const char *& filename );
[8b7ee09]101static void parse( FILE * input, LinkageSpec::Spec linkage, bool shouldExit = false );
[e6955b1]102static void dump( list< Declaration * > & translationUnit, ostream & out = cout );
103
[0afffee]104static void backtrace( int start ) { // skip first N stack frames
[e6955b1]105 enum { Frames = 50 };
106 void * array[Frames];
[0afffee]107 int size = ::backtrace( array, Frames );
108 char ** messages = ::backtrace_symbols( array, size ); // does not demangle names
109
110 *index( messages[0], '(' ) = '\0'; // find executable name
111 cerr << "Stack back trace for: " << messages[0] << endl;
[e6955b1]112
[b542bfb]113 // skip last 2 stack frames after main
114 for ( int i = start; i < size - 2 && messages != nullptr; i += 1 ) {
[e6955b1]115 char * mangled_name = nullptr, * offset_begin = nullptr, * offset_end = nullptr;
116 for ( char *p = messages[i]; *p; ++p ) { // find parantheses and +offset
[0afffee]117 if ( *p == '(' ) {
[46f6134]118 mangled_name = p;
[0afffee]119 } else if ( *p == '+' ) {
[e6955b1]120 offset_begin = p;
[0afffee]121 } else if ( *p == ')' ) {
[e6955b1]122 offset_end = p;
123 break;
124 } // if
125 } // for
126
127 // if line contains symbol, attempt to demangle
[b542bfb]128 int frameNo = i - start;
[e6955b1]129 if ( mangled_name && offset_begin && offset_end && mangled_name < offset_begin ) {
[0afffee]130 *mangled_name++ = '\0'; // delimit strings
[e6955b1]131 *offset_begin++ = '\0';
132 *offset_end++ = '\0';
133
[0afffee]134 int status;
[e6955b1]135 char * real_name = __cxxabiv1::__cxa_demangle( mangled_name, 0, 0, &status );
[0afffee]136 // bug in __cxa_demangle for single-character lower-case non-mangled names
[e6955b1]137 if ( status == 0 ) { // demangling successful ?
[b542bfb]138 cerr << "(" << frameNo << ") " << messages[i] << " : "
[e6955b1]139 << real_name << "+" << offset_begin << offset_end << endl;
140 } else { // otherwise, output mangled name
[b542bfb]141 cerr << "(" << frameNo << ") " << messages[i] << " : "
[0afffee]142 << mangled_name << "(/*unknown*/)+" << offset_begin << offset_end << endl;
[e6955b1]143 } // if
[0afffee]144
[e6955b1]145 free( real_name );
146 } else { // otherwise, print the whole line
[b542bfb]147 cerr << "(" << frameNo << ") " << messages[i] << endl;
[e6955b1]148 } // if
149 } // for
[b542bfb]150
[e6955b1]151 free( messages );
[b542bfb]152} // backtrace
153
154void sigSegvBusHandler( int sig_num ) {
155 cerr << "*CFA runtime error* program cfa-cpp terminated with "
156 << (sig_num == SIGSEGV ? "segment fault" : "bus error")
[0afffee]157 << "." << endl;
[b542bfb]158 backtrace( 2 ); // skip first 2 stack frames
[e6955b1]159 exit( EXIT_FAILURE );
160} // sigSegvBusHandler
[0da3e2c]161
[b3c36f4]162void sigAbortHandler( __attribute__((unused)) int sig_num ) {
[b542bfb]163 backtrace( 6 ); // skip first 6 stack frames
164 signal( SIGABRT, SIG_DFL); // reset default signal handler
165 raise( SIGABRT ); // reraise SIGABRT
166} // sigAbortHandler
167
168
[cbaee0d]169int main( int argc, char * argv[] ) {
[3b8e52c]170 FILE * input; // use FILE rather than istream because yyin is FILE
[e6955b1]171 ostream *output = & cout;
[926af74]172 const char *filename = nullptr;
[e6955b1]173 list< Declaration * > translationUnit;
174
175 signal( SIGSEGV, sigSegvBusHandler );
176 signal( SIGBUS, sigSegvBusHandler );
[b542bfb]177 signal( SIGABRT, sigAbortHandler );
[b87a5ed]178
[44bca7f]179 // std::cout << "main" << std::endl;
180 // for ( int i = 0; i < argc; i += 1 ) {
181 // std::cout << '\t' << argv[i] << std::endl;
182 // } // for
183
[0da3e2c]184 parse_cmdline( argc, argv, filename ); // process command-line arguments
[13de47bc]185 CodeGen::FixMain::setReplaceMain( !nomainp );
[b87a5ed]186
187 try {
[81419b5]188 // choose to read the program from a file or stdin
[3b8e52c]189 if ( optind < argc ) { // any commands after the flags ? => input file name
[b87a5ed]190 input = fopen( argv[ optind ], "r" );
[3b8e52c]191 assertf( input, "cannot open %s\n", argv[ optind ] );
[d029162e]192 // if running cfa-cpp directly, might forget to pass -F option (and really shouldn't have to)
[926af74]193 if ( filename == nullptr ) filename = argv[ optind ];
[37024fd]194 // prelude filename comes in differently
195 if ( libcfap ) filename = "prelude.cf";
[b87a5ed]196 optind += 1;
[3b8e52c]197 } else { // no input file name
[b87a5ed]198 input = stdin;
[2a7e29b]199 // if running cfa-cpp directly, might forget to pass -F option. Since this takes from stdin, pass
200 // a fake name along
[926af74]201 if ( filename == nullptr ) filename = "stdin";
[b87a5ed]202 } // if
203
[159c62e]204 // read in the builtins, extras, and the prelude
[de62360d]205 if ( ! nopreludep ) { // include gcc builtins
[faf8857]206 // -l is for initial build ONLY and builtins.cf is not in the lib directory so access it here.
[807ce84]207
208 // Read to gcc builtins, if not generating the cfa library
[6ce3ae9]209 FILE * gcc_builtins = fopen( libcfap | treep ? "../prelude/gcc-builtins.cf" : CFA_LIBDIR "/gcc-builtins.cf", "r" );
210 assertf( gcc_builtins, "cannot open gcc-builtins.cf\n" );
211 parse( gcc_builtins, LinkageSpec::Compiler );
[81419b5]212
[159c62e]213 // read the extra prelude in, if not generating the cfa library
[375a068]214 FILE * extras = fopen( libcfap | treep ? "../prelude/extras.cf" : CFA_LIBDIR "/extras.cf", "r" );
[3b8e52c]215 assertf( extras, "cannot open extras.cf\n" );
[f0994a1]216 parse( extras, LinkageSpec::BuiltinC );
[159c62e]217
[81419b5]218 if ( ! libcfap ) {
[faf8857]219 // read the prelude in, if not generating the cfa library
[375a068]220 FILE * prelude = fopen( treep ? "../prelude/prelude.cf" : CFA_LIBDIR "/prelude.cf", "r" );
[3b8e52c]221 assertf( prelude, "cannot open prelude.cf\n" );
[35304009]222 parse( prelude, LinkageSpec::Intrinsic );
[fa4805f]223
224 // Read to cfa builtins, if not generating the cfa library
225 FILE * builtins = fopen( libcfap | treep ? "../prelude/builtins.cf" : CFA_LIBDIR "/builtins.cf", "r" );
226 assertf( builtins, "cannot open builtins.cf\n" );
[54d714e]227 parse( builtins, LinkageSpec::BuiltinCFA );
[b87a5ed]228 } // if
229 } // if
[81419b5]230
[926af74]231 parse( input, libcfap ? LinkageSpec::Intrinsic : LinkageSpec::Cforall, yydebug );
[71f4e4f]232
[b87a5ed]233 if ( parsep ) {
[e6955b1]234 parseTree->printList( cout );
[0da3e2c]235 delete parseTree;
[b87a5ed]236 return 0;
237 } // if
238
[0da3e2c]239 buildList( parseTree, translationUnit );
240 delete parseTree;
[cbaee0d]241 parseTree = nullptr;
[b87a5ed]242
243 if ( astp ) {
[1ab4ce2]244 dump( translationUnit );
[b87a5ed]245 return 0;
246 } // if
247
[839ccbb]248 // add the assignment statement after the initialization of a type parameter
[6edd210]249 PASS( "validate", SymTab::validate( translationUnit, symtabp ) );
[81419b5]250 if ( symtabp ) {
[46f6134]251 deleteAll( translationUnit );
[b87a5ed]252 return 0;
253 } // if
254
[81419b5]255 if ( expraltp ) {
[bff09c8]256 PassVisitor<ResolvExpr::AlternativePrinter> printer( cout );
[81419b5]257 acceptAll( translationUnit, printer );
[b87a5ed]258 return 0;
259 } // if
260
261 if ( validp ) {
[1ab4ce2]262 dump( translationUnit );
[b87a5ed]263 return 0;
264 } // if
265
[6edd210]266 PASS( "mutate", ControlStruct::mutate( translationUnit ) );
267 PASS( "fixNames", CodeGen::fixNames( translationUnit ) );
268 PASS( "genInit", InitTweak::genInit( translationUnit ) );
269 PASS( "expandMemberTuples" , Tuples::expandMemberTuples( translationUnit ) );
[81419b5]270 if ( libcfap ) {
271 // generate the bodies of cfa library functions
272 LibCfa::makeLibCfa( translationUnit );
[b87a5ed]273 } // if
274
[fa2de95]275 if ( declstatsp ) {
276 CodeTools::printDeclStats( translationUnit );
277 deleteAll( translationUnit );
278 return 0;
279 }
280
[de62360d]281 if ( bresolvep ) {
[1ab4ce2]282 dump( translationUnit );
[de62360d]283 return 0;
284 } // if
285
[76b378d]286 CodeTools::fillLocations( translationUnit );
287
[6edd210]288 PASS( "resolve", ResolvExpr::resolve( translationUnit ) );
[81419b5]289 if ( exprp ) {
[1ab4ce2]290 dump( translationUnit );
[ca1c11f]291 return 0;
[926af74]292 } // if
[81419b5]293
[71f4e4f]294 // fix ObjectDecl - replaces ConstructorInit nodes
[6edd210]295 PASS( "fixInit", InitTweak::fix( translationUnit, filename, libcfap || treep ) );
[ca1c11f]296 if ( ctorinitp ) {
297 dump ( translationUnit );
298 return 0;
[926af74]299 } // if
[71f4e4f]300
[6edd210]301 PASS( "expandUniqueExpr", Tuples::expandUniqueExpr( translationUnit ) ); // xxx - is this the right place for this? want to expand ASAP so tha, sequent passes don't need to worry about double-visiting a unique expr - needs to go after InitTweak::fix so that copy constructed return declarations are reused
[141b786]302 Tuples::expandUniqueExpr( translationUnit );
[626dbc10]303
[6edd210]304 PASS( "translateEHM" , ControlStruct::translateEHM( translationUnit ) );
305
306 PASS( "generateWaitfor" , Concurrency::generateWaitFor( translationUnit ) );
[307a732]307
[6edd210]308 PASS( "convertSpecializations", GenPoly::convertSpecializations( translationUnit ) ); // needs to happen before tuple types are expanded
[9f5ecf5]309
[6edd210]310 PASS( "expandTuples", Tuples::expandTuples( translationUnit ) ); // xxx - is this the right place for this?
[626dbc10]311
312 if ( tuplep ) {
313 dump( translationUnit );
314 return 0;
315 }
[141b786]316
[6edd210]317 PASS( "virtual expandCasts", Virtual::expandCasts( translationUnit ) ); // Must come after translateEHM
[a5f0529]318
[6edd210]319 PASS( "instantiateGenerics", GenPoly::instantiateGeneric( translationUnit ) );
[53d3ab4b]320 if ( genericsp ) {
321 dump( translationUnit );
322 return 0;
323 }
[6edd210]324 PASS( "convertLvalue", GenPoly::convertLvalue( translationUnit ) );
[fea7ca7]325
[53d3ab4b]326
[fea7ca7]327 if ( bboxp ) {
328 dump( translationUnit );
329 return 0;
[926af74]330 } // if
[6edd210]331 PASS( "box", GenPoly::box( translationUnit ) );
[81419b5]332
[8905f56]333 if ( bcodegenp ) {
334 dump( translationUnit );
335 return 0;
336 }
337
[13de47bc]338 if ( optind < argc ) { // any commands after the flags and input file ? => output file name
339 output = new ofstream( argv[ optind ] );
340 } // if
[0270824]341
[7b15d7a]342 CodeTools::fillLocations( translationUnit );
[6edd210]343 PASS( "codegen", CodeGen::generate( translationUnit, *output, ! noprotop, prettycodegenp, true, linemarks ) );
[0270824]344
[13de47bc]345 CodeGen::FixMain::fix( *output, treep ? "../prelude/bootloader.c" : CFA_LIBDIR "/bootloader.c" );
[e6955b1]346 if ( output != &cout ) {
[b87a5ed]347 delete output;
348 } // if
[a16764a6]349 } catch ( SemanticErrorException &e ) {
[b87a5ed]350 if ( errorp ) {
[e6955b1]351 cerr << "---AST at error:---" << endl;
352 dump( translationUnit, cerr );
353 cerr << endl << "---End of AST, begin error message:---\n" << endl;
[926af74]354 } // if
[d55d7a6]355 e.print();
[e6955b1]356 if ( output != &cout ) {
[b87a5ed]357 delete output;
358 } // if
359 return 1;
360 } catch ( UnimplementedError &e ) {
[e6955b1]361 cout << "Sorry, " << e.get_what() << " is not currently implemented" << endl;
362 if ( output != &cout ) {
[b87a5ed]363 delete output;
364 } // if
365 return 1;
366 } catch ( CompilerError &e ) {
[e6955b1]367 cerr << "Compiler Error: " << e.get_what() << endl;
[c850687]368 cerr << "(please report bugs to [REDACTED])" << endl;
[e6955b1]369 if ( output != &cout ) {
[b87a5ed]370 delete output;
371 } // if
372 return 1;
[4990812]373 } catch(...) {
374 std::exception_ptr eptr = std::current_exception();
375 try {
376 if (eptr) {
377 std::rethrow_exception(eptr);
378 }
379 else {
380 std::cerr << "Exception Uncaught and Unkown" << std::endl;
381 }
382 } catch(const std::exception& e) {
383 std::cerr << "Unaught Exception \"" << e.what() << "\"\n";
384 }
385 return 1;
386 }// try
[b87a5ed]387
[39786813]388 deleteAll( translationUnit );
[6d611fb]389 if(!libcfap && !treep) HeapStats::printStats();
[b87a5ed]390 return 0;
[d9a0e76]391} // main
[51b73452]392
[cbaee0d]393void parse_cmdline( int argc, char * argv[], const char *& filename ) {
[6de43b6]394 enum { Ast, Bbox, Bresolver, CtorInitFix, DeclStats, Expr, ExprAlt, Grammar, LibCFA, Linemarks, Nolinemarks, Nopreamble, Parse, Prototypes, Resolver, Symbol, Tree, TupleExpansion, Validate, };
[0da3e2c]395
396 static struct option long_opts[] = {
397 { "ast", no_argument, 0, Ast },
398 { "before-box", no_argument, 0, Bbox },
399 { "before-resolver", no_argument, 0, Bresolver },
400 { "ctorinitfix", no_argument, 0, CtorInitFix },
[41a7137]401 { "decl-stats", no_argument, 0, DeclStats },
[0da3e2c]402 { "expr", no_argument, 0, Expr },
403 { "expralt", no_argument, 0, ExprAlt },
404 { "grammar", no_argument, 0, Grammar },
405 { "libcfa", no_argument, 0, LibCFA },
[6de43b6]406 { "line-marks", no_argument, 0, Linemarks },
407 { "no-line-marks", no_argument, 0, Nolinemarks },
[0da3e2c]408 { "no-preamble", no_argument, 0, Nopreamble },
409 { "parse", no_argument, 0, Parse },
410 { "no-prototypes", no_argument, 0, Prototypes },
411 { "resolver", no_argument, 0, Resolver },
412 { "symbol", no_argument, 0, Symbol },
413 { "tree", no_argument, 0, Tree },
[626dbc10]414 { "tuple-expansion", no_argument, 0, TupleExpansion },
[0da3e2c]415 { "validate", no_argument, 0, Validate },
416 { 0, 0, 0, 0 }
417 }; // long_opts
418 int long_index;
419
420 opterr = 0; // (global) prevent getopt from printing error messages
421
[c5e5109]422 bool Wsuppress = false, Werror = false;
[0da3e2c]423 int c;
[44bca7f]424 while ( (c = getopt_long( argc, argv, "abBcCdefgGlLmnNpqrstTvwW:yzZD:F:", long_opts, &long_index )) != -1 ) {
[0da3e2c]425 switch ( c ) {
426 case Ast:
427 case 'a': // dump AST
428 astp = true;
429 break;
430 case Bresolver:
431 case 'b': // print before resolver steps
432 bresolvep = true;
433 break;
[626dbc10]434 case 'B': // print before box steps
[0da3e2c]435 bboxp = true;
436 break;
437 case CtorInitFix:
[e39241b]438 case 'c': // print after constructors and destructors are replaced
[0da3e2c]439 ctorinitp = true;
440 break;
[8905f56]441 case 'C': // print before code generation
442 bcodegenp = true;
443 break;
[41a7137]444 case DeclStats:
445 case 'd':
446 declstatsp = true;
447 break;
[0da3e2c]448 case Expr:
449 case 'e': // dump AST after expression analysis
450 exprp = true;
451 break;
452 case ExprAlt:
453 case 'f': // print alternatives for expressions
454 expraltp = true;
455 break;
456 case Grammar:
457 case 'g': // bison debugging info (grammar rules)
[926af74]458 yydebug = true;
[0da3e2c]459 break;
[44bca7f]460 case 'G': // dump AST after instantiate generics
[53d3ab4b]461 genericsp = true;
462 break;
[0da3e2c]463 case LibCFA:
464 case 'l': // generate libcfa.c
465 libcfap = true;
466 break;
[6de43b6]467 case Linemarks:
468 case 'L': // print lines marks
469 linemarks = true;
[c850687]470 break;
[0da3e2c]471 case Nopreamble:
472 case 'n': // do not read preamble
473 nopreludep = true;
474 break;
[6de43b6]475 case Nolinemarks:
476 case 'N': // suppress line marks
477 linemarks = false;
[c59bde6]478 break;
[0da3e2c]479 case Prototypes:
480 case 'p': // generate prototypes for preamble functions
481 noprotop = true;
482 break;
[3fe34ae]483 case 'm': // don't replace the main
484 nomainp = true;
485 break;
[0da3e2c]486 case Parse:
487 case 'q': // dump parse tree
488 parsep = true;
489 break;
490 case Resolver:
491 case 'r': // print resolver steps
492 resolvep = true;
493 break;
494 case Symbol:
495 case 's': // print symbol table events
496 symtabp = true;
497 break;
498 case Tree:
499 case 't': // build in tree
500 treep = true;
501 break;
[626dbc10]502 case TupleExpansion:
503 case 'T': // print after tuple expansion
504 tuplep = true;
505 break;
[0da3e2c]506 case 'v': // dump AST after decl validation pass
507 validp = true;
508 break;
[44bca7f]509 case 'w':
[c5e5109]510 Wsuppress = true;
[44bca7f]511 break;
512 case 'W':
513 if ( strcmp( optarg, "all" ) == 0 ) {
[68e9ace]514 SemanticWarning_EnableAll();
[44bca7f]515 } else if ( strcmp( optarg, "error" ) == 0 ) {
516 Werror = true;
517 } else {
518 char * warning = optarg;
519 Severity s;
520 if ( strncmp( optarg, "no-", 3 ) == 0 ) {
521 warning += 3;
522 s = Severity::Suppress;
523 } else {
524 s = Severity::Warn;
525 } // if
[68e9ace]526 SemanticWarning_Set( warning, s );
[44bca7f]527 } // if
528 break;
[e39241b]529 case 'y': // dump AST on error
[0da3e2c]530 errorp = true;
531 break;
[e39241b]532 case 'z': // dump as codegen rather than AST
[0da3e2c]533 codegenp = true;
[e39241b]534 break;
535 case 'Z': // prettyprint during codegen (i.e. print unmangled names, etc.)
[35b1bf4]536 prettycodegenp = true;
[0da3e2c]537 break;
538 case 'D': // ignore -Dxxx
539 break;
540 case 'F': // source file-name without suffix
541 filename = optarg;
542 break;
543 case '?':
[ae47a23]544 if ( optopt ) { // short option ?
545 assertf( false, "Unknown option: -%c\n", (char)optopt );
546 } else {
547 assertf( false, "Unknown option: %s\n", argv[optind - 1] );
548 } // if
[b6d7f44]549 #if defined(__GNUC__) && __GNUC__ >= 7
[af98d27]550 __attribute__((fallthrough));
551 #endif
[0da3e2c]552 default:
553 abort();
554 } // switch
555 } // while
[44bca7f]556
557 if ( Werror ) {
[68e9ace]558 SemanticWarning_WarningAsError();
[44bca7f]559 } // if
[c5e5109]560 if ( Wsuppress ) {
561 SemanticWarning_SuppressAll();
562 } // if
[44bca7f]563 // for ( const auto w : WarningFormats ) {
564 // cout << w.name << ' ' << (int)w.severity << endl;
565 // } // for
[0da3e2c]566} // parse_cmdline
567
[8b7ee09]568static void parse( FILE * input, LinkageSpec::Spec linkage, bool shouldExit ) {
[0da3e2c]569 extern int yyparse( void );
[cbaee0d]570 extern FILE * yyin;
[0da3e2c]571 extern int yylineno;
572
[8b7ee09]573 ::linkage = linkage; // set globals
[0da3e2c]574 yyin = input;
575 yylineno = 1;
576 typedefTable.enterScope();
577 int parseStatus = yyparse();
[81419b5]578
579 fclose( input );
[0da3e2c]580 if ( shouldExit || parseStatus != 0 ) {
581 exit( parseStatus );
[81419b5]582 } // if
[0da3e2c]583} // parse
[81419b5]584
[1ab4ce2]585static bool notPrelude( Declaration * decl ) {
586 return ! LinkageSpec::isBuiltin( decl->get_linkage() );
[0da3e2c]587} // notPrelude
[1ab4ce2]588
[e6955b1]589static void dump( list< Declaration * > & translationUnit, ostream & out ) {
590 list< Declaration * > decls;
[926af74]591
[1ab4ce2]592 if ( noprotop ) {
[e6955b1]593 filter( translationUnit.begin(), translationUnit.end(), back_inserter( decls ), notPrelude );
[1ab4ce2]594 } else {
595 decls = translationUnit;
[926af74]596 } // if
[1ab4ce2]597
[e39241b]598 // depending on commandline options, either generate code or dump the AST
599 if ( codegenp ) {
600 CodeGen::generate( decls, out, ! noprotop, prettycodegenp );
601 } else {
602 printAll( decls, out );
603 }
[7f5566b]604 deleteAll( translationUnit );
[0da3e2c]605} // dump
[1ab4ce2]606
[51b73452]607// Local Variables: //
[b87a5ed]608// tab-width: 4 //
609// mode: c++ //
610// compile-command: "make install" //
[51b73452]611// End: //
Note: See TracBrowser for help on using the repository browser.