source: src/main.cc@ 12df6fe

ADT ast-experimental pthread-emulation qualifiedEnum
Last change on this file since 12df6fe was ffec1bf, checked in by Fangren Yu <f37yu@…>, 3 years ago

Merge branch 'master' of plg.uwaterloo.ca:software/cfa/cfa-cc
  • Property mode set to 100644
File size: 33.4 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
[68fe946e]11// Last Modified By : Andrew Beach
[6a896b0]12// Last Modified On : Mon Jul 18 11:08:00 2022
13// Update Count : 676
[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
[aff7e86]39#include "CodeGen/LinkOnce.h" // for translateLinkOnce
[bf2438c]40#include "CodeTools/DeclStats.h" // for printDeclStats
[3b3491b6]41#include "CodeTools/ResolvProtoDump.h" // for dumpAsResolvProto
[bf2438c]42#include "CodeTools/TrackLoc.h" // for fillLocations
[f57faf6f]43#include "Common/CodeLocationTools.hpp" // for forceFillCodeLocations
[bf2438c]44#include "Common/CompilerError.h" // for CompilerError
[55cbff8]45#include "Common/DeclStats.hpp" // for printDeclStats
46#include "Common/ResolvProtoDump.hpp" // for dumpAsResolverProto
[7abee38]47#include "Common/Stats.h"
[cbbd5b48]48#include "Common/PassVisitor.h"
[bf2438c]49#include "Common/SemanticError.h" // for SemanticError
50#include "Common/UnimplementedError.h" // for UnimplementedError
51#include "Common/utility.h" // for deleteAll, filter, printAll
[2cf3b87]52#include "Concurrency/Keywords.h" // for implementMutex, implement...
[9f5ecf5]53#include "Concurrency/Waitfor.h" // for generateWaitfor
[0c730d9]54#include "ControlStruct/ExceptDecl.h" // for translateExcept
[bf2438c]55#include "ControlStruct/ExceptTranslate.h" // for translateEHM
[b8ab91a]56#include "ControlStruct/FixLabels.hpp" // for fixLabels
[a488783]57#include "ControlStruct/HoistControlDecls.hpp" // hoistControlDecls
[bf2438c]58#include "ControlStruct/Mutate.h" // for mutate
59#include "GenPoly/Box.h" // for box
60#include "GenPoly/InstantiateGeneric.h" // for instantiateGeneric
61#include "GenPoly/Lvalue.h" // for convertLvalue
62#include "GenPoly/Specialize.h" // for convertSpecializations
63#include "InitTweak/FixInit.h" // for fix
64#include "InitTweak/GenInit.h" // for genInit
65#include "MakeLibCfa.h" // for makeLibCfa
66#include "Parser/ParseNode.h" // for DeclarationNode, buildList
67#include "Parser/TypedefTable.h" // for TypedefTable
68#include "ResolvExpr/AlternativePrinter.h" // for AlternativePrinter
[1622af5]69#include "ResolvExpr/CandidatePrinter.hpp" // for printCandidates
[bf2438c]70#include "ResolvExpr/Resolver.h" // for resolve
71#include "SymTab/Validate.h" // for validate
[9939dc3]72#include "SymTab/ValidateType.h" // for linkReferenceToTypes
[bffcd66]73#include "SynTree/LinkageSpec.h" // for Spec, Cforall, Intrinsic
[bf2438c]74#include "SynTree/Declaration.h" // for Declaration
75#include "SynTree/Visitor.h" // for acceptAll
76#include "Tuples/Tuples.h" // for expandMemberTuples, expan...
[a488783]77#include "Validate/Autogen.hpp" // for autogenerateRoutines
[298fe57]78#include "Validate/CompoundLiteral.hpp" // for handleCompoundLiterals
79#include "Validate/EliminateTypedef.hpp" // for eliminateTypedef
[1931bb01]80#include "Validate/EnumAndPointerDecay.hpp" // for decayEnumsAndPointers
[ce36b55]81#include "Validate/FindSpecialDecls.h" // for findGlobalDecls
[298fe57]82#include "Validate/FixQualifiedTypes.hpp" // for fixQualifiedTypes
[1931bb01]83#include "Validate/FixReturnTypes.hpp" // for fixReturnTypes
[9490621]84#include "Validate/ForallPointerDecay.hpp" // for decayForallPointers
[298fe57]85#include "Validate/GenericParameter.hpp" // for fillGenericParameters, tr...
86#include "Validate/HoistStruct.hpp" // for hoistStruct
[1931bb01]87#include "Validate/HoistTypeDecls.hpp" // for hoistTypeDecls
[ce36b55]88#include "Validate/InitializerLength.hpp" // for setLengthFromInitializer
89#include "Validate/LabelAddressFixer.hpp" // for fixLabelAddresses
[72e76fd]90#include "Validate/LinkReferenceToTypes.hpp" // for linkReferenceToTypes
[1931bb01]91#include "Validate/ReplaceTypedef.hpp" // for replaceTypedef
[4ec9513]92#include "Validate/ReturnCheck.hpp" // for checkReturnStatements
[1931bb01]93#include "Validate/VerifyCtorDtorAssign.hpp" // for verifyCtorDtorAssign
[a5f0529]94#include "Virtual/ExpandCasts.h" // for expandCasts
[51b73452]95
[3e96559]96static void NewPass( const char * const name ) {
97 Stats::Heap::newPass( name );
[1cb7fab2]98 using namespace Stats::Counters;
[b8665e3]99 {
[3e96559]100 static auto group = build<CounterGroup>( "Pass Visitor" );
101 auto pass = build<CounterGroup>( name, group );
[b8665e3]102 pass_visitor_stats.depth = 0;
[3e96559]103 pass_visitor_stats.avg = build<AverageCounter<double>>( "Average Depth", pass );
104 pass_visitor_stats.max = build<MaxCounter<double>>( "Max Depth", pass );
[b8665e3]105 }
106 {
[3e96559]107 static auto group = build<CounterGroup>( "Syntax Node" );
108 auto pass = build<CounterGroup>( name, group );
109 BaseSyntaxNode::new_nodes = build<SimpleCounter>( "Allocs", pass );
[b8665e3]110 }
[675716e]111}
112
[3e96559]113#define PASS( name, pass ) \
[ecaeac6e]114 if ( errorp ) { cerr << name << endl; } \
[675716e]115 NewPass(name); \
[4f97937]116 Stats::Time::StartBlock(name); \
117 pass; \
118 Stats::Time::StopBlock();
[0da3e2c]119
[8b7ee09]120LinkageSpec::Spec linkage = LinkageSpec::Cforall;
[0da3e2c]121TypedefTable typedefTable;
[cbaee0d]122DeclarationNode * parseTree = nullptr; // program parse tree
[81419b5]123
[ef22ad6]124static bool waiting_for_gdb = false; // flag to set cfa-cpp to wait for gdb on start
[dee1f89]125
[bffcd66]126static string PreludeDirector = "";
[4dcaed2]127
[77d601f]128static void parse_cmdline( int argc, char * argv[] );
[8b7ee09]129static void parse( FILE * input, LinkageSpec::Spec linkage, bool shouldExit = false );
[e6955b1]130static void dump( list< Declaration * > & translationUnit, ostream & out = cout );
[e499381]131static void dump( ast::TranslationUnit && transUnit, ostream & out = cout );
[e6955b1]132
[0afffee]133static void backtrace( int start ) { // skip first N stack frames
[74330e7]134 enum { Frames = 50, }; // maximum number of stack frames
[e6955b1]135 void * array[Frames];
[74330e7]136 size_t size = ::backtrace( array, Frames );
[0afffee]137 char ** messages = ::backtrace_symbols( array, size ); // does not demangle names
138
139 *index( messages[0], '(' ) = '\0'; // find executable name
140 cerr << "Stack back trace for: " << messages[0] << endl;
[e6955b1]141
[b542bfb]142 // skip last 2 stack frames after main
[74330e7]143 for ( unsigned int i = start; i < size - 2 && messages != nullptr; i += 1 ) {
[e6955b1]144 char * mangled_name = nullptr, * offset_begin = nullptr, * offset_end = nullptr;
[7006ba5]145
146 for ( char * p = messages[i]; *p; p += 1 ) { // find parantheses and +offset
[0afffee]147 if ( *p == '(' ) {
[46f6134]148 mangled_name = p;
[0afffee]149 } else if ( *p == '+' ) {
[e6955b1]150 offset_begin = p;
[0afffee]151 } else if ( *p == ')' ) {
[e6955b1]152 offset_end = p;
153 break;
154 } // if
155 } // for
156
157 // if line contains symbol, attempt to demangle
[b542bfb]158 int frameNo = i - start;
[e6955b1]159 if ( mangled_name && offset_begin && offset_end && mangled_name < offset_begin ) {
[0afffee]160 *mangled_name++ = '\0'; // delimit strings
[e6955b1]161 *offset_begin++ = '\0';
162 *offset_end++ = '\0';
163
[0afffee]164 int status;
[e6955b1]165 char * real_name = __cxxabiv1::__cxa_demangle( mangled_name, 0, 0, &status );
[0afffee]166 // bug in __cxa_demangle for single-character lower-case non-mangled names
[e6955b1]167 if ( status == 0 ) { // demangling successful ?
[b542bfb]168 cerr << "(" << frameNo << ") " << messages[i] << " : "
[e6955b1]169 << real_name << "+" << offset_begin << offset_end << endl;
170 } else { // otherwise, output mangled name
[b542bfb]171 cerr << "(" << frameNo << ") " << messages[i] << " : "
[0afffee]172 << mangled_name << "(/*unknown*/)+" << offset_begin << offset_end << endl;
[e6955b1]173 } // if
[0afffee]174
[e6955b1]175 free( real_name );
176 } else { // otherwise, print the whole line
[b542bfb]177 cerr << "(" << frameNo << ") " << messages[i] << endl;
[e6955b1]178 } // if
179 } // for
[b542bfb]180
[e6955b1]181 free( messages );
[b542bfb]182} // backtrace
183
[bffcd66]184#define SIGPARMS int sig __attribute__(( unused )), siginfo_t * sfp __attribute__(( unused )), ucontext_t * cxt __attribute__(( unused ))
185
[1f68d5d]186static void _Signal(struct sigaction & act, int sig, int flags ) {
[bffcd66]187 act.sa_flags = flags;
188
189 if ( sigaction( sig, &act, nullptr ) == -1 ) {
[77d601f]190 cerr << "*cfa-cpp compilation error* problem installing signal handler, error(" << errno << ") " << strerror( errno ) << endl;
[bffcd66]191 _exit( EXIT_FAILURE );
192 } // if
[1f68d5d]193}
194
195static void Signal( int sig, void (* handler)(SIGPARMS), int flags ) {
196 struct sigaction act;
197 act.sa_sigaction = (void (*)(int, siginfo_t *, void *))handler;
198 _Signal(act, sig, flags);
199} // Signal
200
201static void Signal( int sig, void (* handler)(int), int flags ) {
202 struct sigaction act;
203 act.sa_handler = handler;
204 _Signal(act, sig, flags);
[bffcd66]205} // Signal
206
207static void sigSegvBusHandler( SIGPARMS ) {
208 if ( sfp->si_addr == nullptr ) {
209 cerr << "Null pointer (nullptr) dereference." << endl;
210 } else {
211 cerr << (sig == SIGSEGV ? "Segment fault" : "Bus error") << " at memory location " << sfp->si_addr << "." << endl
212 << "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;
213 } // if
[b542bfb]214 backtrace( 2 ); // skip first 2 stack frames
[3e96559]215 abort(); // cause core dump for debugging
[e6955b1]216} // sigSegvBusHandler
[0da3e2c]217
[74330e7]218static void sigFpeHandler( SIGPARMS ) {
219 const char * msg;
220
221 switch ( sfp->si_code ) {
222 case FPE_INTDIV: case FPE_FLTDIV: msg = "divide by zero"; break;
223 case FPE_FLTOVF: msg = "overflow"; break;
224 case FPE_FLTUND: msg = "underflow"; break;
225 case FPE_FLTRES: msg = "inexact result"; break;
226 case FPE_FLTINV: msg = "invalid operation"; break;
227 default: msg = "unknown";
228 } // choose
229 cerr << "Computation error " << msg << " at location " << sfp->si_addr << endl
230 << "Possible cause is constant-expression evaluation invalid." << endl;
231 backtrace( 2 ); // skip first 2 stack frames
232 abort(); // cause core dump for debugging
233} // sigFpeHandler
234
[bffcd66]235static void sigAbortHandler( SIGPARMS ) {
[b542bfb]236 backtrace( 6 ); // skip first 6 stack frames
[1f68d5d]237 Signal( SIGABRT, SIG_DFL, SA_SIGINFO ); // reset default signal handler
[9be45a2]238 raise( SIGABRT ); // reraise SIGABRT
[b542bfb]239} // sigAbortHandler
240
[cbaee0d]241int main( int argc, char * argv[] ) {
[3b8e52c]242 FILE * input; // use FILE rather than istream because yyin is FILE
[d08beee]243 ostream * output = & cout;
[e6955b1]244 list< Declaration * > translationUnit;
245
[bffcd66]246 Signal( SIGSEGV, sigSegvBusHandler, SA_SIGINFO );
247 Signal( SIGBUS, sigSegvBusHandler, SA_SIGINFO );
[74330e7]248 Signal( SIGFPE, sigFpeHandler, SA_SIGINFO );
[bffcd66]249 Signal( SIGABRT, sigAbortHandler, SA_SIGINFO );
[b87a5ed]250
[bffcd66]251 // cout << "main" << endl;
[44bca7f]252 // for ( int i = 0; i < argc; i += 1 ) {
[bffcd66]253 // cout << '\t' << argv[i] << endl;
[44bca7f]254 // } // for
255
[e0bd0f9]256 parse_cmdline( argc, argv ); // process command-line arguments
[13de47bc]257 CodeGen::FixMain::setReplaceMain( !nomainp );
[b87a5ed]258
[ef22ad6]259 if ( waiting_for_gdb ) {
[bffcd66]260 cerr << "Waiting for gdb" << endl;
261 cerr << "run :" << endl;
262 cerr << " gdb attach " << getpid() << endl;
[dee1f89]263 raise(SIGSTOP);
[ef22ad6]264 } // if
[dee1f89]265
[b87a5ed]266 try {
[81419b5]267 // choose to read the program from a file or stdin
[3b8e52c]268 if ( optind < argc ) { // any commands after the flags ? => input file name
[b87a5ed]269 input = fopen( argv[ optind ], "r" );
[e0bd0f9]270 assertf( input, "cannot open %s because %s\n", argv[ optind ], strerror( errno ) );
[b87a5ed]271 optind += 1;
[3b8e52c]272 } else { // no input file name
[b87a5ed]273 input = stdin;
274 } // if
275
[79eaeb7]276 Stats::Time::StartGlobal();
[3c0d4cd]277 NewPass("Parse");
278 Stats::Time::StartBlock("Parse");
[675716e]279
[159c62e]280 // read in the builtins, extras, and the prelude
[de62360d]281 if ( ! nopreludep ) { // include gcc builtins
[faf8857]282 // -l is for initial build ONLY and builtins.cf is not in the lib directory so access it here.
[807ce84]283
[37fe352]284 assertf( !PreludeDirector.empty(), "Can't find prelude without option --prelude-dir must be used." );
[4dcaed2]285
[807ce84]286 // Read to gcc builtins, if not generating the cfa library
[37fe352]287 FILE * gcc_builtins = fopen( (PreludeDirector + "/gcc-builtins.cf").c_str(), "r" );
[6ce3ae9]288 assertf( gcc_builtins, "cannot open gcc-builtins.cf\n" );
289 parse( gcc_builtins, LinkageSpec::Compiler );
[81419b5]290
[159c62e]291 // read the extra prelude in, if not generating the cfa library
[37fe352]292 FILE * extras = fopen( (PreludeDirector + "/extras.cf").c_str(), "r" );
[3b8e52c]293 assertf( extras, "cannot open extras.cf\n" );
[f0994a1]294 parse( extras, LinkageSpec::BuiltinC );
[159c62e]295
[81419b5]296 if ( ! libcfap ) {
[faf8857]297 // read the prelude in, if not generating the cfa library
[e523b07]298 FILE * prelude = fopen( (PreludeDirector + "/prelude.cfa").c_str(), "r" );
299 assertf( prelude, "cannot open prelude.cfa\n" );
[35304009]300 parse( prelude, LinkageSpec::Intrinsic );
[fa4805f]301
302 // Read to cfa builtins, if not generating the cfa library
[37fe352]303 FILE * builtins = fopen( (PreludeDirector + "/builtins.cf").c_str(), "r" );
[fa4805f]304 assertf( builtins, "cannot open builtins.cf\n" );
[54d714e]305 parse( builtins, LinkageSpec::BuiltinCFA );
[b87a5ed]306 } // if
307 } // if
[81419b5]308
[926af74]309 parse( input, libcfap ? LinkageSpec::Intrinsic : LinkageSpec::Cforall, yydebug );
[71f4e4f]310
[b87a5ed]311 if ( parsep ) {
[e6955b1]312 parseTree->printList( cout );
[0da3e2c]313 delete parseTree;
[3e96559]314 return EXIT_SUCCESS;
[b87a5ed]315 } // if
316
[0da3e2c]317 buildList( parseTree, translationUnit );
318 delete parseTree;
[cbaee0d]319 parseTree = nullptr;
[b87a5ed]320
321 if ( astp ) {
[1ab4ce2]322 dump( translationUnit );
[3e96559]323 return EXIT_SUCCESS;
[b87a5ed]324 } // if
325
[036dd5f]326 // Temporary: fill locations after parsing so that every node has a location, for early error messages.
327 // Eventually we should pass the locations from the parser to every node, but this quick and dirty solution
328 // works okay for now.
329 CodeTools::fillLocations( translationUnit );
[3c0d4cd]330 Stats::Time::StopBlock();
[036dd5f]331
[4a8f150]332 if( useNewAST ) {
[3746f777]333 if (Stats::Counters::enabled) {
334 ast::pass_visitor_stats.avg = Stats::Counters::build<Stats::Counters::AverageCounter<double>>("Average Depth - New");
335 ast::pass_visitor_stats.max = Stats::Counters::build<Stats::Counters::MaxCounter<double>>("Max depth - New");
336 }
[9ea38de]337 auto transUnit = convert( move( translationUnit ) );
[9f5a19fa]338
[68fe946e]339 forceFillCodeLocations( transUnit );
340
[6a896b0]341 PASS( "Translate Exception Declarations", ControlStruct::translateExcept( transUnit ) );
342 if ( exdeclp ) {
343 dump( move( transUnit ) );
344 return EXIT_SUCCESS;
345 }
346
[1931bb01]347 PASS( "Verify Ctor, Dtor & Assign", Validate::verifyCtorDtorAssign( transUnit ) );
348 PASS( "Hoist Type Decls", Validate::hoistTypeDecls( transUnit ) );
349 // Hoist Type Decls pulls some declarations out of contexts where
350 // locations are not tracked. Perhaps they should be, but for now
351 // the full fill solves it.
352 forceFillCodeLocations( transUnit );
353
354 PASS( "Replace Typedefs", Validate::replaceTypedef( transUnit ) );
355 PASS( "Fix Return Types", Validate::fixReturnTypes( transUnit ) );
356 PASS( "Enum and Pointer Decay", Validate::decayEnumsAndPointers( transUnit ) );
[298fe57]357
[72e76fd]358 PASS( "Link Reference To Types", Validate::linkReferenceToTypes( transUnit ) );
359
[298fe57]360 PASS( "Fix Qualified Types", Validate::fixQualifiedTypes( transUnit ) );
361 PASS( "Hoist Struct", Validate::hoistStruct( transUnit ) );
362 PASS( "Eliminate Typedef", Validate::eliminateTypedef( transUnit ) );
[4ec9513]363 PASS( "Validate Generic Parameters", Validate::fillGenericParameters( transUnit ) );
364 PASS( "Translate Dimensions", Validate::translateDimensionParameters( transUnit ) );
365 PASS( "Check Function Returns", Validate::checkReturnStatements( transUnit ) );
366 PASS( "Fix Return Statements", InitTweak::fixReturnStatements( transUnit ) );
[4f6dda0]367 PASS( "Implement Concurrent Keywords", Concurrency::implementKeywords( transUnit ) );
[9490621]368 PASS( "Forall Pointer Decay", Validate::decayForallPointers( transUnit ) );
[a488783]369 PASS( "Hoist Control Declarations", ControlStruct::hoistControlDecls( transUnit ) );
370
371 PASS( "Generate Autogen Routines", Validate::autogenerateRoutines( transUnit ) );
372
[2cf3b87]373 PASS( "Implement Mutex", Concurrency::implementMutex( transUnit ) );
374 PASS( "Implement Thread Start", Concurrency::implementThreadStarter( transUnit ) );
375 PASS( "Compound Literal", Validate::handleCompoundLiterals( transUnit ) );
[ce36b55]376 PASS( "Set Length From Initializer", Validate::setLengthFromInitializer( transUnit ) );
377 PASS( "Find Global Decls", Validate::findGlobalDecls( transUnit ) );
378 PASS( "Fix Label Address", Validate::fixLabelAddresses( transUnit ) );
379
[1622af5]380 if ( symtabp ) {
381 return EXIT_SUCCESS;
382 } // if
383
384 if ( expraltp ) {
385 ResolvExpr::printCandidates( transUnit );
386 return EXIT_SUCCESS;
387 } // if
388
389 if ( validp ) {
390 dump( move( transUnit ) );
391 return EXIT_SUCCESS;
392 } // if
393
[5ee153d]394 PASS( "Translate Throws", ControlStruct::translateThrows( transUnit ) );
[b8ab91a]395 PASS( "Fix Labels", ControlStruct::fixLabels( transUnit ) );
[0c577f7]396 PASS( "Fix Names", CodeGen::fixNames( transUnit ) );
[a36eb2d]397 PASS( "Gen Init", InitTweak::genInit( transUnit ) );
[9f5a19fa]398 PASS( "Expand Member Tuples" , Tuples::expandMemberTuples( transUnit ) );
[68fe946e]399
[da6396f]400 if ( libcfap ) {
401 // Generate the bodies of cfa library functions.
402 LibCfa::makeLibCfa( transUnit );
403 } // if
[68fe946e]404
405 if ( declstatsp ) {
406 printDeclStats( transUnit );
407 return EXIT_SUCCESS;
408 } // if
409
410 if ( bresolvep ) {
411 dump( move( transUnit ) );
412 return EXIT_SUCCESS;
413 } // if
414
415 if ( resolvprotop ) {
[55cbff8]416 dumpAsResolverProto( transUnit );
[68fe946e]417 return EXIT_SUCCESS;
418 } // if
419
[9ea38de]420 PASS( "Resolve", ResolvExpr::resolve( transUnit ) );
[490fb92e]421 if ( exprp ) {
[e499381]422 dump( move( transUnit ) );
[490fb92e]423 return EXIT_SUCCESS;
424 } // if
425
[f57faf6f]426 forceFillCodeLocations( transUnit );
[4a8f150]427
[490fb92e]428 PASS( "Fix Init", InitTweak::fix(transUnit, buildingLibrary()));
[da6396f]429
[01d433e]430 // fix ObjectDecl - replaces ConstructorInit nodes
431 if ( ctorinitp ) {
432 dump( move( transUnit ) );
433 return EXIT_SUCCESS;
434 } // if
435
436 // Currently not working due to unresolved issues with UniqueExpr
437 PASS( "Expand Unique Expr", Tuples::expandUniqueExpr( transUnit ) ); // 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
[5f3ba11]438
[c8f5f7d]439 PASS( "Translate Tries", ControlStruct::translateTries( transUnit ) );
440 PASS( "Gen Waitfor", Concurrency::generateWaitFor( transUnit ) );
[9e23b446]441 PASS( "Convert Specializations", GenPoly::convertSpecializations( transUnit ) ); // needs to happen before tuple types are expanded
442
[5f3ba11]443
[9ea38de]444 translationUnit = convert( move( transUnit ) );
[a77257be]445 } else {
[6a896b0]446 PASS( "Translate Exception Declarations", ControlStruct::translateExcept( translationUnit ) );
447 if ( exdeclp ) {
448 dump( translationUnit );
449 return EXIT_SUCCESS;
450 } // if
451
[1931bb01]452 // add the assignment statement after the initialization of a type parameter
[b9f8274]453 PASS( "Validate", SymTab::validate( translationUnit ) );
[ce36b55]454
[1622af5]455 if ( symtabp ) {
456 deleteAll( translationUnit );
457 return EXIT_SUCCESS;
458 } // if
459
460 if ( expraltp ) {
461 PassVisitor<ResolvExpr::AlternativePrinter> printer( cout );
462 acceptAll( translationUnit, printer );
463 return EXIT_SUCCESS;
464 } // if
465
466 if ( validp ) {
467 dump( translationUnit );
468 return EXIT_SUCCESS;
469 } // if
470
[5ee153d]471 PASS( "Translate Throws", ControlStruct::translateThrows( translationUnit ) );
[b8ab91a]472 PASS( "Fix Labels", ControlStruct::fixLabels( translationUnit ) );
[0c577f7]473 PASS( "Fix Names", CodeGen::fixNames( translationUnit ) );
[a36eb2d]474 PASS( "Gen Init", InitTweak::genInit( translationUnit ) );
[9f5a19fa]475 PASS( "Expand Member Tuples" , Tuples::expandMemberTuples( translationUnit ) );
476
[da6396f]477 if ( libcfap ) {
478 // Generate the bodies of cfa library functions.
479 LibCfa::makeLibCfa( translationUnit );
480 } // if
[68fe946e]481
482 if ( declstatsp ) {
483 CodeTools::printDeclStats( translationUnit );
484 deleteAll( translationUnit );
485 return EXIT_SUCCESS;
486 } // if
487
488 if ( bresolvep ) {
489 dump( translationUnit );
490 return EXIT_SUCCESS;
491 } // if
492
493 CodeTools::fillLocations( translationUnit );
494
495 if ( resolvprotop ) {
496 CodeTools::dumpAsResolvProto( translationUnit );
497 return EXIT_SUCCESS;
498 } // if
499
[a77257be]500 PASS( "Resolve", ResolvExpr::resolve( translationUnit ) );
[490fb92e]501 if ( exprp ) {
502 dump( translationUnit );
503 return EXIT_SUCCESS;
504 }
[4615ac8]505
[490fb92e]506 PASS( "Fix Init", InitTweak::fix( translationUnit, buildingLibrary() ) );
[81419b5]507
[01d433e]508 // fix ObjectDecl - replaces ConstructorInit nodes
509 if ( ctorinitp ) {
510 dump ( translationUnit );
511 return EXIT_SUCCESS;
512 } // if
[71f4e4f]513
[01d433e]514 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
[c8f5f7d]515 PASS( "Translate Tries", ControlStruct::translateTries( translationUnit ) );
516 PASS( "Gen Waitfor", Concurrency::generateWaitFor( translationUnit ) );
[9e23b446]517 PASS( "Convert Specializations", GenPoly::convertSpecializations( translationUnit ) ); // needs to happen before tuple types are expanded
518
[01d433e]519 }
[626dbc10]520
[9e23b446]521
522 // PASS( "Convert Specializations", GenPoly::convertSpecializations( translationUnit ) ); // needs to happen before tuple types are expanded
[9f5ecf5]523
[675716e]524 PASS( "Expand Tuples", Tuples::expandTuples( translationUnit ) ); // xxx - is this the right place for this?
[626dbc10]525
526 if ( tuplep ) {
527 dump( translationUnit );
[3e96559]528 return EXIT_SUCCESS;
529 } // if
[141b786]530
[675716e]531 PASS( "Virtual Expand Casts", Virtual::expandCasts( translationUnit ) ); // Must come after translateEHM
[a5f0529]532
[675716e]533 PASS( "Instantiate Generics", GenPoly::instantiateGeneric( translationUnit ) );
[53d3ab4b]534 if ( genericsp ) {
535 dump( translationUnit );
[3e96559]536 return EXIT_SUCCESS;
537 } // if
[b4f8808]538
[675716e]539 PASS( "Convert L-Value", GenPoly::convertLvalue( translationUnit ) );
[53d3ab4b]540
[fea7ca7]541 if ( bboxp ) {
542 dump( translationUnit );
[3e96559]543 return EXIT_SUCCESS;
[926af74]544 } // if
[675716e]545 PASS( "Box", GenPoly::box( translationUnit ) );
[81419b5]546
[aff7e86]547 PASS( "Link-Once", CodeGen::translateLinkOnce( translationUnit ) );
548
549 // Code has been lowered to C, now we can start generation.
550
[8905f56]551 if ( bcodegenp ) {
552 dump( translationUnit );
[3e96559]553 return EXIT_SUCCESS;
554 } // if
[8905f56]555
[13de47bc]556 if ( optind < argc ) { // any commands after the flags and input file ? => output file name
557 output = new ofstream( argv[ optind ] );
558 } // if
[0270824]559
[7b15d7a]560 CodeTools::fillLocations( translationUnit );
[62ce290]561 PASS( "Code Gen", CodeGen::generate( translationUnit, *output, ! genproto, prettycodegenp, true, linemarks ) );
[0270824]562
[8e48fca4]563 CodeGen::FixMain::fix( translationUnit, *output,
564 (PreludeDirector + "/bootloader.c").c_str() );
[e6955b1]565 if ( output != &cout ) {
[b87a5ed]566 delete output;
567 } // if
[77d601f]568 } catch ( SemanticErrorException & e ) {
[b87a5ed]569 if ( errorp ) {
[e6955b1]570 cerr << "---AST at error:---" << endl;
571 dump( translationUnit, cerr );
572 cerr << endl << "---End of AST, begin error message:---\n" << endl;
[926af74]573 } // if
[d55d7a6]574 e.print();
[e6955b1]575 if ( output != &cout ) {
[b87a5ed]576 delete output;
577 } // if
[3e96559]578 return EXIT_FAILURE;
[77d601f]579 } catch ( UnimplementedError & e ) {
[e6955b1]580 cout << "Sorry, " << e.get_what() << " is not currently implemented" << endl;
581 if ( output != &cout ) {
[b87a5ed]582 delete output;
583 } // if
[3e96559]584 return EXIT_FAILURE;
[77d601f]585 } catch ( CompilerError & e ) {
[e6955b1]586 cerr << "Compiler Error: " << e.get_what() << endl;
[c850687]587 cerr << "(please report bugs to [REDACTED])" << endl;
[e6955b1]588 if ( output != &cout ) {
[b87a5ed]589 delete output;
590 } // if
[3e96559]591 return EXIT_FAILURE;
[77d601f]592 } catch ( std::bad_alloc & ) {
593 cerr << "*cfa-cpp compilation error* std::bad_alloc" << endl;
594 backtrace( 1 );
595 abort();
[3e96559]596 } catch ( ... ) {
[bffcd66]597 exception_ptr eptr = current_exception();
[4990812]598 try {
599 if (eptr) {
[bffcd66]600 rethrow_exception(eptr);
[3e96559]601 } else {
[77d601f]602 cerr << "*cfa-cpp compilation error* exception uncaught and unknown" << endl;
[3e96559]603 } // if
[77d601f]604 } catch( const exception & e ) {
605 cerr << "*cfa-cpp compilation error* uncaught exception \"" << e.what() << "\"\n";
[3e96559]606 } // try
607 return EXIT_FAILURE;
608 } // try
[b87a5ed]609
[39786813]610 deleteAll( translationUnit );
[1cb7fab2]611 Stats::print();
[3e96559]612 return EXIT_SUCCESS;
[d9a0e76]613} // main
[51b73452]614
[0da3e2c]615
[3e9de01]616static const char optstring[] = ":c:ghlLmNnpdOAP:S:twW:D:";
[3e96559]617
[62ce290]618enum { PreludeDir = 128 };
[3e96559]619static struct option long_opts[] = {
[1a69a90]620 { "colors", required_argument, nullptr, 'c' },
621 { "gdb", no_argument, nullptr, 'g' },
[3e96559]622 { "help", no_argument, nullptr, 'h' },
623 { "libcfa", no_argument, nullptr, 'l' },
[62ce290]624 { "linemarks", no_argument, nullptr, 'L' },
[3e96559]625 { "no-main", no_argument, 0, 'm' },
[62ce290]626 { "no-linemarks", no_argument, nullptr, 'N' },
627 { "no-prelude", no_argument, nullptr, 'n' },
[3e96559]628 { "prototypes", no_argument, nullptr, 'p' },
[7215000]629 { "deterministic-out", no_argument, nullptr, 'd' },
[a77257be]630 { "old-ast", no_argument, nullptr, 'O'},
631 { "new-ast", no_argument, nullptr, 'A'},
[62ce290]632 { "print", required_argument, nullptr, 'P' },
633 { "prelude-dir", required_argument, nullptr, PreludeDir },
634 { "statistics", required_argument, nullptr, 'S' },
[3e96559]635 { "tree", no_argument, nullptr, 't' },
636 { "", no_argument, nullptr, 0 }, // -w
637 { "", no_argument, nullptr, 0 }, // -W
638 { "", no_argument, nullptr, 0 }, // -D
639 { nullptr, 0, nullptr, 0 }
640}; // long_opts
641
642static const char * description[] = {
[aa88cb9a]643 "diagnostic color: never, always, auto", // -c
[3e9de01]644 "wait for gdb to attach", // -g
[aa88cb9a]645 "print translator help message", // -h
[3e9de01]646 "generate libcfa.c", // -l
647 "generate line marks", // -L
648 "do not replace main", // -m
649 "do not generate line marks", // -N
650 "do not read prelude", // -n
[aa88cb9a]651 "do not generate prelude prototypes => prelude not printed", // -p
[3e9de01]652 "only print deterministic output", // -d
653 "Use the old-ast", // -O
654 "Use the new-ast", // -A
655 "print", // -P
[62ce290]656 "<directory> prelude directory for debug/nodebug", // no flag
[aa88cb9a]657 "<option-list> enable profiling information: counters, heap, time, all, none", // -S
[3e9de01]658 "building cfa standard lib", // -t
659 "", // -w
660 "", // -W
661 "", // -D
[3e96559]662}; // description
663
[0c0f548]664static_assert( sizeof( long_opts ) / sizeof( long_opts[0] ) - 1 == sizeof( description ) / sizeof( description[0] ), "Long opts and description must match" );
[62ce290]665
666static struct Printopts {
667 const char * name;
668 int & flag;
669 int val;
670 const char * descript;
671} printopts[] = {
[0e464f6]672 { "ascodegen", codegenp, true, "print AST as codegen rather than AST" },
673 { "asterr", errorp, true, "print AST on error" },
[62ce290]674 { "declstats", declstatsp, true, "code property statistics" },
675 { "parse", yydebug, true, "yacc (parsing) debug information" },
676 { "pretty", prettycodegenp, true, "prettyprint for ascodegen flag" },
677 { "rproto", resolvprotop, true, "resolver-proto instance" },
[0e464f6]678 { "rsteps", resolvep, true, "print resolver steps" },
679 { "tree", parsep, true, "print parse tree" },
680 // code dumps
681 { "ast", astp, true, "print AST after parsing" },
[00da199]682 { "exdecl", exdeclp, true, "print AST after translating exception decls" },
[0e464f6]683 { "symevt", symtabp, true, "print AST after symbol table events" },
684 { "altexpr", expraltp, true, "print alternatives for expressions" },
685 { "astdecl", validp, true, "print AST after declaration validation pass" },
686 { "resolver", bresolvep, true, "print AST before resolver step" },
687 { "astexpr", exprp, true, "print AST after expression analysis" },
688 { "ctordtor", ctorinitp, true, "print AST after ctor/dtor are replaced" },
689 { "tuple", tuplep, true, "print AST after tuple expansion" },
690 { "astgen", genericsp, true, "print AST after instantiate generics" },
691 { "box", bboxp, true, "print AST before box step" },
692 { "codegen", bcodegenp, true, "print AST before code generation" },
[62ce290]693};
694enum { printoptsSize = sizeof( printopts ) / sizeof( printopts[0] ) };
695
[77d601f]696static void usage( char * argv[] ) {
[e0bd0f9]697 cout << "Usage: " << argv[0] << " [options] [input-file (default stdin)] [output-file (default stdout)], where options are:" << endl;
[3e96559]698 int i = 0, j = 1; // j skips starting colon
699 for ( ; long_opts[i].name != 0 && optstring[j] != '\0'; i += 1, j += 1 ) {
700 if ( long_opts[i].name[0] != '\0' ) { // hidden option, internal usage only
[62ce290]701 if ( strcmp( long_opts[i].name, "prelude-dir" ) != 0 ) { // flag
702 cout << " -" << optstring[j] << ",";
703 } else { // no flag
704 j -= 1; // compensate
705 cout << " ";
706 } // if
707 cout << " --" << left << setw(12) << long_opts[i].name << " ";
708 if ( strcmp( long_opts[i].name, "print" ) == 0 ) {
709 cout << "one of: " << endl;
710 for ( int i = 0; i < printoptsSize; i += 1 ) {
711 cout << setw(10) << " " << left << setw(10) << printopts[i].name << " " << printopts[i].descript << endl;
712 } // for
713 } else {
714 cout << description[i] << endl;
715 } // if
[3e96559]716 } // if
[62ce290]717 if ( optstring[j + 1] == ':' ) j += 1;
[3e96559]718 } // for
719 if ( long_opts[i].name != 0 || optstring[j] != '\0' ) assertf( false, "internal error, mismatch of option flags and names\n" );
720 exit( EXIT_FAILURE );
721} // usage
722
[e0bd0f9]723static void parse_cmdline( int argc, char * argv[] ) {
[0da3e2c]724 opterr = 0; // (global) prevent getopt from printing error messages
725
[c5e5109]726 bool Wsuppress = false, Werror = false;
[0da3e2c]727 int c;
[3e96559]728 while ( (c = getopt_long( argc, argv, optstring, long_opts, nullptr )) != -1 ) {
[0da3e2c]729 switch ( c ) {
[1a69a90]730 case 'c': // diagnostic colors
731 if ( strcmp( optarg, "always" ) == 0 ) {
732 ErrorHelpers::colors = ErrorHelpers::Colors::Always;
733 } else if ( strcmp( optarg, "never" ) == 0 ) {
734 ErrorHelpers::colors = ErrorHelpers::Colors::Never;
735 } else if ( strcmp( optarg, "auto" ) == 0 ) {
736 ErrorHelpers::colors = ErrorHelpers::Colors::Auto;
737 } // if
738 break;
[3e96559]739 case 'h': // help message
740 usage( argv ); // no return
[53d3ab4b]741 break;
[3e96559]742 case 'l': // generate libcfa.c
[0da3e2c]743 libcfap = true;
744 break;
[62ce290]745 case 'L': // generate line marks
[6de43b6]746 linemarks = true;
[c850687]747 break;
[3e96559]748 case 'm': // do not replace main
749 nomainp = true;
[0da3e2c]750 break;
[62ce290]751 case 'N': // do not generate line marks
[6de43b6]752 linemarks = false;
[c59bde6]753 break;
[62ce290]754 case 'n': // do not read prelude
[3e96559]755 nopreludep = true;
[0da3e2c]756 break;
[62ce290]757 case 'p': // generate prototypes for prelude functions
758 genproto = true;
[0da3e2c]759 break;
[7215000]760 case 'd': // don't print non-deterministic output
[a77257be]761 deterministic_output = true;
762 break;
763 case 'O': // don't print non-deterministic output
764 useNewAST = false;
765 break;
766 case 'A': // don't print non-deterministic output
767 useNewAST = true;
[7215000]768 break;
[62ce290]769 case 'P': // print options
770 for ( int i = 0;; i += 1 ) {
771 if ( i == printoptsSize ) {
772 cout << "Unknown --print option " << optarg << endl;
773 goto Default;
774 } // if
775 if ( strcmp( optarg, printopts[i].name ) == 0 ) {
776 printopts[i].flag = printopts[i].val;
777 break;
778 } // if
779 } // for
[0da3e2c]780 break;
[62ce290]781 case PreludeDir: // prelude directory for debug/nodebug, hidden
782 PreludeDirector = optarg;
[3b3491b6]783 break;
[3e96559]784 case 'S': // enable profiling information, argument comma separated list of names
785 Stats::parse_params( optarg );
[ebcc940]786 break;
[dee1f89]787 case 't': // building cfa stdlib
[0da3e2c]788 treep = true;
789 break;
[dee1f89]790 case 'g': // wait for gdb
791 waiting_for_gdb = true;
792 break;
[3e96559]793 case 'w': // suppress all warnings, hidden
[c5e5109]794 Wsuppress = true;
[44bca7f]795 break;
[3e96559]796 case 'W': // coordinate gcc -W with CFA, hidden
[44bca7f]797 if ( strcmp( optarg, "all" ) == 0 ) {
[68e9ace]798 SemanticWarning_EnableAll();
[44bca7f]799 } else if ( strcmp( optarg, "error" ) == 0 ) {
800 Werror = true;
801 } else {
802 char * warning = optarg;
803 Severity s;
804 if ( strncmp( optarg, "no-", 3 ) == 0 ) {
805 warning += 3;
806 s = Severity::Suppress;
807 } else {
808 s = Severity::Warn;
809 } // if
[68e9ace]810 SemanticWarning_Set( warning, s );
[44bca7f]811 } // if
812 break;
[3e96559]813 case 'D': // ignore -Dxxx, forwarded by cpp, hidden
[0da3e2c]814 break;
[3e96559]815 case '?': // unknown option
816 if ( optopt ) { // short option ?
817 cout << "Unknown option -" << (char)optopt << endl;
818 } else {
819 cout << "Unknown option " << argv[optind - 1] << endl;
820 } // if
821 goto Default;
822 case ':': // missing option
[ae47a23]823 if ( optopt ) { // short option ?
[3e96559]824 cout << "Missing option for -" << (char)optopt << endl;
[ae47a23]825 } else {
[3e96559]826 cout << "Missing option for " << argv[optind - 1] << endl;
[ae47a23]827 } // if
[3e96559]828 goto Default;
829 Default:
830 default:
831 usage( argv ); // no return
[0da3e2c]832 } // switch
833 } // while
[44bca7f]834
835 if ( Werror ) {
[68e9ace]836 SemanticWarning_WarningAsError();
[44bca7f]837 } // if
[c5e5109]838 if ( Wsuppress ) {
839 SemanticWarning_SuppressAll();
840 } // if
[44bca7f]841 // for ( const auto w : WarningFormats ) {
842 // cout << w.name << ' ' << (int)w.severity << endl;
843 // } // for
[0da3e2c]844} // parse_cmdline
845
[8b7ee09]846static void parse( FILE * input, LinkageSpec::Spec linkage, bool shouldExit ) {
[0da3e2c]847 extern int yyparse( void );
[cbaee0d]848 extern FILE * yyin;
[0da3e2c]849 extern int yylineno;
850
[8b7ee09]851 ::linkage = linkage; // set globals
[0da3e2c]852 yyin = input;
853 yylineno = 1;
854 int parseStatus = yyparse();
[81419b5]855
856 fclose( input );
[0da3e2c]857 if ( shouldExit || parseStatus != 0 ) {
858 exit( parseStatus );
[81419b5]859 } // if
[0da3e2c]860} // parse
[81419b5]861
[1ab4ce2]862static bool notPrelude( Declaration * decl ) {
863 return ! LinkageSpec::isBuiltin( decl->get_linkage() );
[0da3e2c]864} // notPrelude
[1ab4ce2]865
[e6955b1]866static void dump( list< Declaration * > & translationUnit, ostream & out ) {
867 list< Declaration * > decls;
[926af74]868
[62ce290]869 if ( genproto ) {
[e6955b1]870 filter( translationUnit.begin(), translationUnit.end(), back_inserter( decls ), notPrelude );
[1ab4ce2]871 } else {
872 decls = translationUnit;
[926af74]873 } // if
[1ab4ce2]874
[e39241b]875 // depending on commandline options, either generate code or dump the AST
876 if ( codegenp ) {
[62ce290]877 CodeGen::generate( decls, out, ! genproto, prettycodegenp );
[e39241b]878 } else {
879 printAll( decls, out );
[3e96559]880 } // if
[7f5566b]881 deleteAll( translationUnit );
[0da3e2c]882} // dump
[1ab4ce2]883
[e499381]884static void dump( ast::TranslationUnit && transUnit, ostream & out ) {
885 std::list< Declaration * > translationUnit = convert( move( transUnit ) );
886 dump( translationUnit, out );
887}
888
[51b73452]889// Local Variables: //
[b87a5ed]890// tab-width: 4 //
891// mode: c++ //
892// compile-command: "make install" //
[51b73452]893// End: //
Note: See TracBrowser for help on using the repository browser.