source: src/main.cc@ 40a1392

ADT arm-eh ast-experimental enum forall-pointer-decay jacob/cs343-translation new-ast-unique-expr pthread-emulation qualifiedEnum
Last change on this file since 40a1392 was 3e9de01, checked in by Peter A. Buhr <pabuhr@…>, 5 years ago

fix --help for cfa-cc by adding "OA" to optstring
  • Property mode set to 100644
File size: 25.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//
[3e96559]9// Author : Peter Buhr and Rob Schluntz
[b87a5ed]10// Created On : Fri May 15 23:12:02 2015
[3e9de01]11// Last Modified By : Peter A. Buhr
12// Last Modified On : Thu Oct 8 18:17:46 2020
13// Update Count : 637
[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...
[08fc48f]19#include <cassert> // for assertf
[bf2438c]20#include <cstdio> // for fopen, FILE, fclose, stdin
21#include <cstdlib> // for exit, free, abort, EXIT_F...
[bffcd66]22#include <csignal> // for signal, SIGABRT, SIGSEGV
[bf2438c]23#include <cstring> // for index
[be9288a]24#include <fstream> // for ofstream
[bf2438c]25#include <iostream> // for operator<<, basic_ostream
[62ce290]26#include <iomanip>
[bf2438c]27#include <iterator> // for back_inserter
28#include <list> // for list
[08fc48f]29#include <string> // for char_traits, operator<<
[e6955b1]30
[bffcd66]31using namespace std;
32
[9ea38de]33#include "AST/Convert.hpp"
[7f38b67a]34#include "CompilationState.h"
[bf2438c]35#include "../config.h" // for CFA_LIBDIR
36#include "CodeGen/FixMain.h" // for FixMain
37#include "CodeGen/FixNames.h" // for fixNames
38#include "CodeGen/Generate.h" // for generate
39#include "CodeTools/DeclStats.h" // for printDeclStats
[3b3491b6]40#include "CodeTools/ResolvProtoDump.h" // for dumpAsResolvProto
[bf2438c]41#include "CodeTools/TrackLoc.h" // for fillLocations
42#include "Common/CompilerError.h" // for CompilerError
[7abee38]43#include "Common/Stats.h"
[cbbd5b48]44#include "Common/PassVisitor.h"
[bf2438c]45#include "Common/SemanticError.h" // for SemanticError
46#include "Common/UnimplementedError.h" // for UnimplementedError
47#include "Common/utility.h" // for deleteAll, filter, printAll
[9f5ecf5]48#include "Concurrency/Waitfor.h" // for generateWaitfor
[bf2438c]49#include "ControlStruct/ExceptTranslate.h" // for translateEHM
50#include "ControlStruct/Mutate.h" // for mutate
51#include "GenPoly/Box.h" // for box
52#include "GenPoly/InstantiateGeneric.h" // for instantiateGeneric
53#include "GenPoly/Lvalue.h" // for convertLvalue
54#include "GenPoly/Specialize.h" // for convertSpecializations
55#include "InitTweak/FixInit.h" // for fix
56#include "InitTweak/GenInit.h" // for genInit
57#include "MakeLibCfa.h" // for makeLibCfa
58#include "Parser/ParseNode.h" // for DeclarationNode, buildList
59#include "Parser/TypedefTable.h" // for TypedefTable
60#include "ResolvExpr/AlternativePrinter.h" // for AlternativePrinter
61#include "ResolvExpr/Resolver.h" // for resolve
62#include "SymTab/Validate.h" // for validate
[bffcd66]63#include "SynTree/LinkageSpec.h" // for Spec, Cforall, Intrinsic
[bf2438c]64#include "SynTree/Declaration.h" // for Declaration
65#include "SynTree/Visitor.h" // for acceptAll
66#include "Tuples/Tuples.h" // for expandMemberTuples, expan...
[a5f0529]67#include "Virtual/ExpandCasts.h" // for expandCasts
[51b73452]68
[4615ac8]69
[3e96559]70static void NewPass( const char * const name ) {
71 Stats::Heap::newPass( name );
[1cb7fab2]72 using namespace Stats::Counters;
[b8665e3]73 {
[3e96559]74 static auto group = build<CounterGroup>( "Pass Visitor" );
75 auto pass = build<CounterGroup>( name, group );
[b8665e3]76 pass_visitor_stats.depth = 0;
[3e96559]77 pass_visitor_stats.avg = build<AverageCounter<double>>( "Average Depth", pass );
78 pass_visitor_stats.max = build<MaxCounter<double>>( "Max Depth", pass );
[b8665e3]79 }
80 {
[3e96559]81 static auto group = build<CounterGroup>( "Syntax Node" );
82 auto pass = build<CounterGroup>( name, group );
83 BaseSyntaxNode::new_nodes = build<SimpleCounter>( "Allocs", pass );
[b8665e3]84 }
[675716e]85}
86
[3e96559]87#define PASS( name, pass ) \
[ecaeac6e]88 if ( errorp ) { cerr << name << endl; } \
[675716e]89 NewPass(name); \
[4f97937]90 Stats::Time::StartBlock(name); \
91 pass; \
92 Stats::Time::StopBlock();
[0da3e2c]93
[8b7ee09]94LinkageSpec::Spec linkage = LinkageSpec::Cforall;
[0da3e2c]95TypedefTable typedefTable;
[cbaee0d]96DeclarationNode * parseTree = nullptr; // program parse tree
[81419b5]97
[ef22ad6]98static bool waiting_for_gdb = false; // flag to set cfa-cpp to wait for gdb on start
[dee1f89]99
[bffcd66]100static string PreludeDirector = "";
[4dcaed2]101
[e0bd0f9]102static void parse_cmdline( int argc, char *argv[] );
[8b7ee09]103static void parse( FILE * input, LinkageSpec::Spec linkage, bool shouldExit = false );
[e6955b1]104static void dump( list< Declaration * > & translationUnit, ostream & out = cout );
105
[0afffee]106static void backtrace( int start ) { // skip first N stack frames
[74330e7]107 enum { Frames = 50, }; // maximum number of stack frames
[e6955b1]108 void * array[Frames];
[74330e7]109 size_t size = ::backtrace( array, Frames );
[0afffee]110 char ** messages = ::backtrace_symbols( array, size ); // does not demangle names
111
112 *index( messages[0], '(' ) = '\0'; // find executable name
113 cerr << "Stack back trace for: " << messages[0] << endl;
[e6955b1]114
[b542bfb]115 // skip last 2 stack frames after main
[74330e7]116 for ( unsigned int i = start; i < size - 2 && messages != nullptr; i += 1 ) {
[e6955b1]117 char * mangled_name = nullptr, * offset_begin = nullptr, * offset_end = nullptr;
[7006ba5]118
119 for ( char * p = messages[i]; *p; p += 1 ) { // find parantheses and +offset
[0afffee]120 if ( *p == '(' ) {
[46f6134]121 mangled_name = p;
[0afffee]122 } else if ( *p == '+' ) {
[e6955b1]123 offset_begin = p;
[0afffee]124 } else if ( *p == ')' ) {
[e6955b1]125 offset_end = p;
126 break;
127 } // if
128 } // for
129
130 // if line contains symbol, attempt to demangle
[b542bfb]131 int frameNo = i - start;
[e6955b1]132 if ( mangled_name && offset_begin && offset_end && mangled_name < offset_begin ) {
[0afffee]133 *mangled_name++ = '\0'; // delimit strings
[e6955b1]134 *offset_begin++ = '\0';
135 *offset_end++ = '\0';
136
[0afffee]137 int status;
[e6955b1]138 char * real_name = __cxxabiv1::__cxa_demangle( mangled_name, 0, 0, &status );
[0afffee]139 // bug in __cxa_demangle for single-character lower-case non-mangled names
[e6955b1]140 if ( status == 0 ) { // demangling successful ?
[b542bfb]141 cerr << "(" << frameNo << ") " << messages[i] << " : "
[e6955b1]142 << real_name << "+" << offset_begin << offset_end << endl;
143 } else { // otherwise, output mangled name
[b542bfb]144 cerr << "(" << frameNo << ") " << messages[i] << " : "
[0afffee]145 << mangled_name << "(/*unknown*/)+" << offset_begin << offset_end << endl;
[e6955b1]146 } // if
[0afffee]147
[e6955b1]148 free( real_name );
149 } else { // otherwise, print the whole line
[b542bfb]150 cerr << "(" << frameNo << ") " << messages[i] << endl;
[e6955b1]151 } // if
152 } // for
[b542bfb]153
[e6955b1]154 free( messages );
[b542bfb]155} // backtrace
156
[bffcd66]157#define SIGPARMS int sig __attribute__(( unused )), siginfo_t * sfp __attribute__(( unused )), ucontext_t * cxt __attribute__(( unused ))
158
159static void Signal( int sig, void (*handler)(SIGPARMS), int flags ) {
160 struct sigaction act;
161
162 act.sa_sigaction = (void (*)(int, siginfo_t *, void *))handler;
163 act.sa_flags = flags;
164
165 if ( sigaction( sig, &act, nullptr ) == -1 ) {
166 cerr << "*CFA runtime error* problem installing signal handler, error(" << errno << ") " << strerror( errno ) << endl;
167 _exit( EXIT_FAILURE );
168 } // if
169} // Signal
170
171static void sigSegvBusHandler( SIGPARMS ) {
172 if ( sfp->si_addr == nullptr ) {
173 cerr << "Null pointer (nullptr) dereference." << endl;
174 } else {
175 cerr << (sig == SIGSEGV ? "Segment fault" : "Bus error") << " at memory location " << sfp->si_addr << "." << endl
176 << "Possible cause is reading outside the address space or writing to a protected area within the address space with an invalid pointer or subscript." << endl;
177 } // if
[b542bfb]178 backtrace( 2 ); // skip first 2 stack frames
[3e96559]179 abort(); // cause core dump for debugging
[e6955b1]180} // sigSegvBusHandler
[0da3e2c]181
[74330e7]182static void sigFpeHandler( SIGPARMS ) {
183 const char * msg;
184
185 switch ( sfp->si_code ) {
186 case FPE_INTDIV: case FPE_FLTDIV: msg = "divide by zero"; break;
187 case FPE_FLTOVF: msg = "overflow"; break;
188 case FPE_FLTUND: msg = "underflow"; break;
189 case FPE_FLTRES: msg = "inexact result"; break;
190 case FPE_FLTINV: msg = "invalid operation"; break;
191 default: msg = "unknown";
192 } // choose
193 cerr << "Computation error " << msg << " at location " << sfp->si_addr << endl
194 << "Possible cause is constant-expression evaluation invalid." << endl;
195 backtrace( 2 ); // skip first 2 stack frames
196 abort(); // cause core dump for debugging
197} // sigFpeHandler
198
[bffcd66]199static void sigAbortHandler( SIGPARMS ) {
[b542bfb]200 backtrace( 6 ); // skip first 6 stack frames
[bffcd66]201 Signal( SIGABRT, (void (*)(SIGPARMS))SIG_DFL, SA_SIGINFO ); // reset default signal handler
[9be45a2]202 raise( SIGABRT ); // reraise SIGABRT
[b542bfb]203} // sigAbortHandler
204
[cbaee0d]205int main( int argc, char * argv[] ) {
[3b8e52c]206 FILE * input; // use FILE rather than istream because yyin is FILE
[d08beee]207 ostream * output = & cout;
[e6955b1]208 list< Declaration * > translationUnit;
209
[bffcd66]210 Signal( SIGSEGV, sigSegvBusHandler, SA_SIGINFO );
211 Signal( SIGBUS, sigSegvBusHandler, SA_SIGINFO );
[74330e7]212 Signal( SIGFPE, sigFpeHandler, SA_SIGINFO );
[bffcd66]213 Signal( SIGABRT, sigAbortHandler, SA_SIGINFO );
[b87a5ed]214
[bffcd66]215 // cout << "main" << endl;
[44bca7f]216 // for ( int i = 0; i < argc; i += 1 ) {
[bffcd66]217 // cout << '\t' << argv[i] << endl;
[44bca7f]218 // } // for
219
[e0bd0f9]220 parse_cmdline( argc, argv ); // process command-line arguments
[13de47bc]221 CodeGen::FixMain::setReplaceMain( !nomainp );
[b87a5ed]222
[ef22ad6]223 if ( waiting_for_gdb ) {
[bffcd66]224 cerr << "Waiting for gdb" << endl;
225 cerr << "run :" << endl;
226 cerr << " gdb attach " << getpid() << endl;
[dee1f89]227 raise(SIGSTOP);
[ef22ad6]228 } // if
[dee1f89]229
[b87a5ed]230 try {
[81419b5]231 // choose to read the program from a file or stdin
[3b8e52c]232 if ( optind < argc ) { // any commands after the flags ? => input file name
[b87a5ed]233 input = fopen( argv[ optind ], "r" );
[e0bd0f9]234 assertf( input, "cannot open %s because %s\n", argv[ optind ], strerror( errno ) );
[b87a5ed]235 optind += 1;
[3b8e52c]236 } else { // no input file name
[b87a5ed]237 input = stdin;
238 } // if
239
[79eaeb7]240 Stats::Time::StartGlobal();
[3c0d4cd]241 NewPass("Parse");
242 Stats::Time::StartBlock("Parse");
[675716e]243
[159c62e]244 // read in the builtins, extras, and the prelude
[de62360d]245 if ( ! nopreludep ) { // include gcc builtins
[faf8857]246 // -l is for initial build ONLY and builtins.cf is not in the lib directory so access it here.
[807ce84]247
[37fe352]248 assertf( !PreludeDirector.empty(), "Can't find prelude without option --prelude-dir must be used." );
[4dcaed2]249
[807ce84]250 // Read to gcc builtins, if not generating the cfa library
[37fe352]251 FILE * gcc_builtins = fopen( (PreludeDirector + "/gcc-builtins.cf").c_str(), "r" );
[6ce3ae9]252 assertf( gcc_builtins, "cannot open gcc-builtins.cf\n" );
253 parse( gcc_builtins, LinkageSpec::Compiler );
[81419b5]254
[159c62e]255 // read the extra prelude in, if not generating the cfa library
[37fe352]256 FILE * extras = fopen( (PreludeDirector + "/extras.cf").c_str(), "r" );
[3b8e52c]257 assertf( extras, "cannot open extras.cf\n" );
[f0994a1]258 parse( extras, LinkageSpec::BuiltinC );
[159c62e]259
[81419b5]260 if ( ! libcfap ) {
[faf8857]261 // read the prelude in, if not generating the cfa library
[e523b07]262 FILE * prelude = fopen( (PreludeDirector + "/prelude.cfa").c_str(), "r" );
263 assertf( prelude, "cannot open prelude.cfa\n" );
[35304009]264 parse( prelude, LinkageSpec::Intrinsic );
[fa4805f]265
266 // Read to cfa builtins, if not generating the cfa library
[37fe352]267 FILE * builtins = fopen( (PreludeDirector + "/builtins.cf").c_str(), "r" );
[fa4805f]268 assertf( builtins, "cannot open builtins.cf\n" );
[54d714e]269 parse( builtins, LinkageSpec::BuiltinCFA );
[b87a5ed]270 } // if
271 } // if
[81419b5]272
[926af74]273 parse( input, libcfap ? LinkageSpec::Intrinsic : LinkageSpec::Cforall, yydebug );
[71f4e4f]274
[b87a5ed]275 if ( parsep ) {
[e6955b1]276 parseTree->printList( cout );
[0da3e2c]277 delete parseTree;
[3e96559]278 return EXIT_SUCCESS;
[b87a5ed]279 } // if
280
[0da3e2c]281 buildList( parseTree, translationUnit );
282 delete parseTree;
[cbaee0d]283 parseTree = nullptr;
[b87a5ed]284
285 if ( astp ) {
[1ab4ce2]286 dump( translationUnit );
[3e96559]287 return EXIT_SUCCESS;
[b87a5ed]288 } // if
289
[036dd5f]290 // Temporary: fill locations after parsing so that every node has a location, for early error messages.
291 // Eventually we should pass the locations from the parser to every node, but this quick and dirty solution
292 // works okay for now.
293 CodeTools::fillLocations( translationUnit );
[3c0d4cd]294 Stats::Time::StopBlock();
[036dd5f]295
[839ccbb]296 // add the assignment statement after the initialization of a type parameter
[675716e]297 PASS( "Validate", SymTab::validate( translationUnit, symtabp ) );
[81419b5]298 if ( symtabp ) {
[46f6134]299 deleteAll( translationUnit );
[3e96559]300 return EXIT_SUCCESS;
[b87a5ed]301 } // if
302
[81419b5]303 if ( expraltp ) {
[bff09c8]304 PassVisitor<ResolvExpr::AlternativePrinter> printer( cout );
[81419b5]305 acceptAll( translationUnit, printer );
[3e96559]306 return EXIT_SUCCESS;
[b87a5ed]307 } // if
308
309 if ( validp ) {
[1ab4ce2]310 dump( translationUnit );
[3e96559]311 return EXIT_SUCCESS;
[b87a5ed]312 } // if
313
[046a890]314 PASS( "Translate Throws", ControlStruct::translateThrows( translationUnit ) );
[675716e]315 PASS( "Fix Labels", ControlStruct::fixLabels( translationUnit ) );
316 PASS( "Fix Names", CodeGen::fixNames( translationUnit ) );
317 PASS( "Gen Init", InitTweak::genInit( translationUnit ) );
318 PASS( "Expand Member Tuples" , Tuples::expandMemberTuples( translationUnit ) );
[81419b5]319 if ( libcfap ) {
320 // generate the bodies of cfa library functions
321 LibCfa::makeLibCfa( translationUnit );
[b87a5ed]322 } // if
323
[fa2de95]324 if ( declstatsp ) {
325 CodeTools::printDeclStats( translationUnit );
326 deleteAll( translationUnit );
[3e96559]327 return EXIT_SUCCESS;
328 } // if
[fa2de95]329
[de62360d]330 if ( bresolvep ) {
[1ab4ce2]331 dump( translationUnit );
[3e96559]332 return EXIT_SUCCESS;
[de62360d]333 } // if
334
[76b378d]335 CodeTools::fillLocations( translationUnit );
336
[3b3491b6]337 if ( resolvprotop ) {
338 CodeTools::dumpAsResolvProto( translationUnit );
[3e96559]339 return EXIT_SUCCESS;
340 } // if
[3b3491b6]341
[a77257be]342 if( useNewAST) {
[9ea38de]343 auto transUnit = convert( move( translationUnit ) );
344 PASS( "Resolve", ResolvExpr::resolve( transUnit ) );
345 translationUnit = convert( move( transUnit ) );
[a77257be]346 } else {
347 PASS( "Resolve", ResolvExpr::resolve( translationUnit ) );
[9ea38de]348 }
[4615ac8]349
[81419b5]350 if ( exprp ) {
[1ab4ce2]351 dump( translationUnit );
[3e96559]352 return EXIT_SUCCESS;
[926af74]353 } // if
[81419b5]354
[71f4e4f]355 // fix ObjectDecl - replaces ConstructorInit nodes
[675716e]356 PASS( "Fix Init", InitTweak::fix( translationUnit, buildingLibrary() ) );
[ca1c11f]357 if ( ctorinitp ) {
358 dump ( translationUnit );
[3e96559]359 return EXIT_SUCCESS;
[926af74]360 } // if
[71f4e4f]361
[675716e]362 PASS( "Expand Unique Expr", 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
[626dbc10]363
[046a890]364 PASS( "Translate Tries" , ControlStruct::translateTries( translationUnit ) );
[6edd210]365
[675716e]366 PASS( "Gen Waitfor" , Concurrency::generateWaitFor( translationUnit ) );
[307a732]367
[675716e]368 PASS( "Convert Specializations", GenPoly::convertSpecializations( translationUnit ) ); // needs to happen before tuple types are expanded
[9f5ecf5]369
[675716e]370 PASS( "Expand Tuples", Tuples::expandTuples( translationUnit ) ); // xxx - is this the right place for this?
[626dbc10]371
372 if ( tuplep ) {
373 dump( translationUnit );
[3e96559]374 return EXIT_SUCCESS;
375 } // if
[141b786]376
[675716e]377 PASS( "Virtual Expand Casts", Virtual::expandCasts( translationUnit ) ); // Must come after translateEHM
[a5f0529]378
[675716e]379 PASS( "Instantiate Generics", GenPoly::instantiateGeneric( translationUnit ) );
[53d3ab4b]380 if ( genericsp ) {
381 dump( translationUnit );
[3e96559]382 return EXIT_SUCCESS;
383 } // if
[b4f8808]384
[675716e]385 PASS( "Convert L-Value", GenPoly::convertLvalue( translationUnit ) );
[53d3ab4b]386
[fea7ca7]387 if ( bboxp ) {
388 dump( translationUnit );
[3e96559]389 return EXIT_SUCCESS;
[926af74]390 } // if
[675716e]391 PASS( "Box", GenPoly::box( translationUnit ) );
[81419b5]392
[8905f56]393 if ( bcodegenp ) {
394 dump( translationUnit );
[3e96559]395 return EXIT_SUCCESS;
396 } // if
[8905f56]397
[13de47bc]398 if ( optind < argc ) { // any commands after the flags and input file ? => output file name
399 output = new ofstream( argv[ optind ] );
400 } // if
[0270824]401
[7b15d7a]402 CodeTools::fillLocations( translationUnit );
[62ce290]403 PASS( "Code Gen", CodeGen::generate( translationUnit, *output, ! genproto, prettycodegenp, true, linemarks ) );
[0270824]404
[37fe352]405 CodeGen::FixMain::fix( *output, (PreludeDirector + "/bootloader.c").c_str() );
[e6955b1]406 if ( output != &cout ) {
[b87a5ed]407 delete output;
408 } // if
[a16764a6]409 } catch ( SemanticErrorException &e ) {
[b87a5ed]410 if ( errorp ) {
[e6955b1]411 cerr << "---AST at error:---" << endl;
412 dump( translationUnit, cerr );
413 cerr << endl << "---End of AST, begin error message:---\n" << endl;
[926af74]414 } // if
[d55d7a6]415 e.print();
[e6955b1]416 if ( output != &cout ) {
[b87a5ed]417 delete output;
418 } // if
[3e96559]419 return EXIT_FAILURE;
[b87a5ed]420 } catch ( UnimplementedError &e ) {
[e6955b1]421 cout << "Sorry, " << e.get_what() << " is not currently implemented" << endl;
422 if ( output != &cout ) {
[b87a5ed]423 delete output;
424 } // if
[3e96559]425 return EXIT_FAILURE;
[b87a5ed]426 } catch ( CompilerError &e ) {
[e6955b1]427 cerr << "Compiler Error: " << e.get_what() << endl;
[c850687]428 cerr << "(please report bugs to [REDACTED])" << endl;
[e6955b1]429 if ( output != &cout ) {
[b87a5ed]430 delete output;
431 } // if
[3e96559]432 return EXIT_FAILURE;
433 } catch ( ... ) {
[bffcd66]434 exception_ptr eptr = current_exception();
[4990812]435 try {
436 if (eptr) {
[bffcd66]437 rethrow_exception(eptr);
[3e96559]438 } else {
[bffcd66]439 cerr << "Exception Uncaught and Unknown" << endl;
[3e96559]440 } // if
[bffcd66]441 } catch(const exception& e) {
442 cerr << "Uncaught Exception \"" << e.what() << "\"\n";
[3e96559]443 } // try
444 return EXIT_FAILURE;
445 } // try
[b87a5ed]446
[39786813]447 deleteAll( translationUnit );
[1cb7fab2]448 Stats::print();
[3e96559]449 return EXIT_SUCCESS;
[d9a0e76]450} // main
[51b73452]451
[0da3e2c]452
[3e9de01]453static const char optstring[] = ":c:ghlLmNnpdOAP:S:twW:D:";
[3e96559]454
[62ce290]455enum { PreludeDir = 128 };
[3e96559]456static struct option long_opts[] = {
[1a69a90]457 { "colors", required_argument, nullptr, 'c' },
458 { "gdb", no_argument, nullptr, 'g' },
[3e96559]459 { "help", no_argument, nullptr, 'h' },
460 { "libcfa", no_argument, nullptr, 'l' },
[62ce290]461 { "linemarks", no_argument, nullptr, 'L' },
[3e96559]462 { "no-main", no_argument, 0, 'm' },
[62ce290]463 { "no-linemarks", no_argument, nullptr, 'N' },
464 { "no-prelude", no_argument, nullptr, 'n' },
[3e96559]465 { "prototypes", no_argument, nullptr, 'p' },
[7215000]466 { "deterministic-out", no_argument, nullptr, 'd' },
[a77257be]467 { "old-ast", no_argument, nullptr, 'O'},
468 { "new-ast", no_argument, nullptr, 'A'},
[62ce290]469 { "print", required_argument, nullptr, 'P' },
470 { "prelude-dir", required_argument, nullptr, PreludeDir },
471 { "statistics", required_argument, nullptr, 'S' },
[3e96559]472 { "tree", no_argument, nullptr, 't' },
473 { "", no_argument, nullptr, 0 }, // -w
474 { "", no_argument, nullptr, 0 }, // -W
475 { "", no_argument, nullptr, 0 }, // -D
476 { nullptr, 0, nullptr, 0 }
477}; // long_opts
478
479static const char * description[] = {
[3e9de01]480 "diagnostic color: never, always, or auto.", // -c
481 "wait for gdb to attach", // -g
482 "print help message", // -h
483 "generate libcfa.c", // -l
484 "generate line marks", // -L
485 "do not replace main", // -m
486 "do not generate line marks", // -N
487 "do not read prelude", // -n
[62ce290]488 "generate prototypes for prelude functions", // -p
[3e9de01]489 "only print deterministic output", // -d
490 "Use the old-ast", // -O
491 "Use the new-ast", // -A
492 "print", // -P
[62ce290]493 "<directory> prelude directory for debug/nodebug", // no flag
494 "<option-list> enable profiling information:\n counters,heap,time,all,none", // -S
[3e9de01]495 "building cfa standard lib", // -t
496 "", // -w
497 "", // -W
498 "", // -D
[3e96559]499}; // description
500
[0c0f548]501static_assert( sizeof( long_opts ) / sizeof( long_opts[0] ) - 1 == sizeof( description ) / sizeof( description[0] ), "Long opts and description must match" );
[62ce290]502
503static struct Printopts {
504 const char * name;
505 int & flag;
506 int val;
507 const char * descript;
508} printopts[] = {
[0e464f6]509 { "ascodegen", codegenp, true, "print AST as codegen rather than AST" },
510 { "asterr", errorp, true, "print AST on error" },
[62ce290]511 { "declstats", declstatsp, true, "code property statistics" },
512 { "parse", yydebug, true, "yacc (parsing) debug information" },
513 { "pretty", prettycodegenp, true, "prettyprint for ascodegen flag" },
514 { "rproto", resolvprotop, true, "resolver-proto instance" },
[0e464f6]515 { "rsteps", resolvep, true, "print resolver steps" },
516 { "tree", parsep, true, "print parse tree" },
517 // code dumps
518 { "ast", astp, true, "print AST after parsing" },
519 { "symevt", symtabp, true, "print AST after symbol table events" },
520 { "altexpr", expraltp, true, "print alternatives for expressions" },
521 { "astdecl", validp, true, "print AST after declaration validation pass" },
522 { "resolver", bresolvep, true, "print AST before resolver step" },
523 { "astexpr", exprp, true, "print AST after expression analysis" },
524 { "ctordtor", ctorinitp, true, "print AST after ctor/dtor are replaced" },
525 { "tuple", tuplep, true, "print AST after tuple expansion" },
526 { "astgen", genericsp, true, "print AST after instantiate generics" },
527 { "box", bboxp, true, "print AST before box step" },
528 { "codegen", bcodegenp, true, "print AST before code generation" },
[62ce290]529};
530enum { printoptsSize = sizeof( printopts ) / sizeof( printopts[0] ) };
531
[3e96559]532static void usage( char *argv[] ) {
[e0bd0f9]533 cout << "Usage: " << argv[0] << " [options] [input-file (default stdin)] [output-file (default stdout)], where options are:" << endl;
[3e96559]534 int i = 0, j = 1; // j skips starting colon
535 for ( ; long_opts[i].name != 0 && optstring[j] != '\0'; i += 1, j += 1 ) {
536 if ( long_opts[i].name[0] != '\0' ) { // hidden option, internal usage only
[62ce290]537 if ( strcmp( long_opts[i].name, "prelude-dir" ) != 0 ) { // flag
538 cout << " -" << optstring[j] << ",";
539 } else { // no flag
540 j -= 1; // compensate
541 cout << " ";
542 } // if
543 cout << " --" << left << setw(12) << long_opts[i].name << " ";
544 if ( strcmp( long_opts[i].name, "print" ) == 0 ) {
545 cout << "one of: " << endl;
546 for ( int i = 0; i < printoptsSize; i += 1 ) {
547 cout << setw(10) << " " << left << setw(10) << printopts[i].name << " " << printopts[i].descript << endl;
548 } // for
549 } else {
550 cout << description[i] << endl;
551 } // if
[3e96559]552 } // if
[62ce290]553 if ( optstring[j + 1] == ':' ) j += 1;
[3e96559]554 } // for
555 if ( long_opts[i].name != 0 || optstring[j] != '\0' ) assertf( false, "internal error, mismatch of option flags and names\n" );
556 exit( EXIT_FAILURE );
557} // usage
558
[e0bd0f9]559static void parse_cmdline( int argc, char * argv[] ) {
[0da3e2c]560 opterr = 0; // (global) prevent getopt from printing error messages
561
[c5e5109]562 bool Wsuppress = false, Werror = false;
[0da3e2c]563 int c;
[3e96559]564 while ( (c = getopt_long( argc, argv, optstring, long_opts, nullptr )) != -1 ) {
[0da3e2c]565 switch ( c ) {
[1a69a90]566 case 'c': // diagnostic colors
567 if ( strcmp( optarg, "always" ) == 0 ) {
568 ErrorHelpers::colors = ErrorHelpers::Colors::Always;
569 } else if ( strcmp( optarg, "never" ) == 0 ) {
570 ErrorHelpers::colors = ErrorHelpers::Colors::Never;
571 } else if ( strcmp( optarg, "auto" ) == 0 ) {
572 ErrorHelpers::colors = ErrorHelpers::Colors::Auto;
573 } // if
574 break;
[3e96559]575 case 'h': // help message
576 usage( argv ); // no return
[53d3ab4b]577 break;
[3e96559]578 case 'l': // generate libcfa.c
[0da3e2c]579 libcfap = true;
580 break;
[62ce290]581 case 'L': // generate line marks
[6de43b6]582 linemarks = true;
[c850687]583 break;
[3e96559]584 case 'm': // do not replace main
585 nomainp = true;
[0da3e2c]586 break;
[62ce290]587 case 'N': // do not generate line marks
[6de43b6]588 linemarks = false;
[c59bde6]589 break;
[62ce290]590 case 'n': // do not read prelude
[3e96559]591 nopreludep = true;
[0da3e2c]592 break;
[62ce290]593 case 'p': // generate prototypes for prelude functions
594 genproto = true;
[0da3e2c]595 break;
[7215000]596 case 'd': // don't print non-deterministic output
[a77257be]597 deterministic_output = true;
598 break;
599 case 'O': // don't print non-deterministic output
600 useNewAST = false;
601 break;
602 case 'A': // don't print non-deterministic output
603 useNewAST = true;
[7215000]604 break;
[62ce290]605 case 'P': // print options
606 for ( int i = 0;; i += 1 ) {
607 if ( i == printoptsSize ) {
608 cout << "Unknown --print option " << optarg << endl;
609 goto Default;
610 } // if
611 if ( strcmp( optarg, printopts[i].name ) == 0 ) {
612 printopts[i].flag = printopts[i].val;
613 break;
614 } // if
615 } // for
[0da3e2c]616 break;
[62ce290]617 case PreludeDir: // prelude directory for debug/nodebug, hidden
618 PreludeDirector = optarg;
[3b3491b6]619 break;
[3e96559]620 case 'S': // enable profiling information, argument comma separated list of names
621 Stats::parse_params( optarg );
[ebcc940]622 break;
[dee1f89]623 case 't': // building cfa stdlib
[0da3e2c]624 treep = true;
625 break;
[dee1f89]626 case 'g': // wait for gdb
627 waiting_for_gdb = true;
628 break;
[3e96559]629 case 'w': // suppress all warnings, hidden
[c5e5109]630 Wsuppress = true;
[44bca7f]631 break;
[3e96559]632 case 'W': // coordinate gcc -W with CFA, hidden
[44bca7f]633 if ( strcmp( optarg, "all" ) == 0 ) {
[68e9ace]634 SemanticWarning_EnableAll();
[44bca7f]635 } else if ( strcmp( optarg, "error" ) == 0 ) {
636 Werror = true;
637 } else {
638 char * warning = optarg;
639 Severity s;
640 if ( strncmp( optarg, "no-", 3 ) == 0 ) {
641 warning += 3;
642 s = Severity::Suppress;
643 } else {
644 s = Severity::Warn;
645 } // if
[68e9ace]646 SemanticWarning_Set( warning, s );
[44bca7f]647 } // if
648 break;
[3e96559]649 case 'D': // ignore -Dxxx, forwarded by cpp, hidden
[0da3e2c]650 break;
[3e96559]651 case '?': // unknown option
652 if ( optopt ) { // short option ?
653 cout << "Unknown option -" << (char)optopt << endl;
654 } else {
655 cout << "Unknown option " << argv[optind - 1] << endl;
656 } // if
657 goto Default;
658 case ':': // missing option
[ae47a23]659 if ( optopt ) { // short option ?
[3e96559]660 cout << "Missing option for -" << (char)optopt << endl;
[ae47a23]661 } else {
[3e96559]662 cout << "Missing option for " << argv[optind - 1] << endl;
[ae47a23]663 } // if
[3e96559]664 goto Default;
665 Default:
666 default:
667 usage( argv ); // no return
[0da3e2c]668 } // switch
669 } // while
[44bca7f]670
671 if ( Werror ) {
[68e9ace]672 SemanticWarning_WarningAsError();
[44bca7f]673 } // if
[c5e5109]674 if ( Wsuppress ) {
675 SemanticWarning_SuppressAll();
676 } // if
[44bca7f]677 // for ( const auto w : WarningFormats ) {
678 // cout << w.name << ' ' << (int)w.severity << endl;
679 // } // for
[0da3e2c]680} // parse_cmdline
681
[8b7ee09]682static void parse( FILE * input, LinkageSpec::Spec linkage, bool shouldExit ) {
[0da3e2c]683 extern int yyparse( void );
[cbaee0d]684 extern FILE * yyin;
[0da3e2c]685 extern int yylineno;
686
[8b7ee09]687 ::linkage = linkage; // set globals
[0da3e2c]688 yyin = input;
689 yylineno = 1;
690 int parseStatus = yyparse();
[81419b5]691
692 fclose( input );
[0da3e2c]693 if ( shouldExit || parseStatus != 0 ) {
694 exit( parseStatus );
[81419b5]695 } // if
[0da3e2c]696} // parse
[81419b5]697
[1ab4ce2]698static bool notPrelude( Declaration * decl ) {
699 return ! LinkageSpec::isBuiltin( decl->get_linkage() );
[0da3e2c]700} // notPrelude
[1ab4ce2]701
[e6955b1]702static void dump( list< Declaration * > & translationUnit, ostream & out ) {
703 list< Declaration * > decls;
[926af74]704
[62ce290]705 if ( genproto ) {
[e6955b1]706 filter( translationUnit.begin(), translationUnit.end(), back_inserter( decls ), notPrelude );
[1ab4ce2]707 } else {
708 decls = translationUnit;
[926af74]709 } // if
[1ab4ce2]710
[e39241b]711 // depending on commandline options, either generate code or dump the AST
712 if ( codegenp ) {
[62ce290]713 CodeGen::generate( decls, out, ! genproto, prettycodegenp );
[e39241b]714 } else {
715 printAll( decls, out );
[3e96559]716 } // if
[7f5566b]717 deleteAll( translationUnit );
[0da3e2c]718} // dump
[1ab4ce2]719
[51b73452]720// Local Variables: //
[b87a5ed]721// tab-width: 4 //
722// mode: c++ //
723// compile-command: "make install" //
[51b73452]724// End: //
Note: See TracBrowser for help on using the repository browser.