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