Change Parser::ParseCaseStatement to use an iterative approach to parsing
multiple sequential case statements instead of doing it with recursion. This
fixes a problem where we run out of stack space parsing 100K directly nested
cases.
There are a couple other problems that prevent this from being useful in
practice (right now the example only parses correctly with -disable-free and
doesn't work with -emit-llvm), but this is a start.
I'm not including a testcase because it is large and uninteresting for
regtesting.
Sebastian, I would appreciate it if you could scrutinize the smart pointer
gymnastics I do.
llvm-svn: 66011
diff --git a/clang/Driver/PrintParserCallbacks.cpp b/clang/Driver/PrintParserCallbacks.cpp
index b14f266..0a6d09a 100644
--- a/clang/Driver/PrintParserCallbacks.cpp
+++ b/clang/Driver/PrintParserCallbacks.cpp
@@ -272,8 +272,7 @@
ExprArg LHSVal,
SourceLocation DotDotDotLoc,
ExprArg RHSVal,
- SourceLocation ColonLoc,
- StmtArg SubStmt) {
+ SourceLocation ColonLoc) {
llvm::cout << __FUNCTION__ << "\n";
return StmtEmpty();
}