source: src/main.cc@ 8f98b78

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors deferred_resn demangler enum forall-pointer-decay jacob/cs343-translation jenkins-sandbox new-ast new-ast-unique-expr new-env no_list persistent-indexer pthread-emulation qualifiedEnum resolv-new with_gc
Last change on this file since 8f98b78 was bff09c8, checked in by Rob Schluntz <rschlunt@…>, 8 years ago

Convert AlternativePrinter to PassVisitor

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