hanchenye-llvm-project/clang/test/Preprocessor/hash_line.c

// The 1 and # should not go on the same line.
// RUN: %clang_cc1 -E %s | FileCheck --strict-whitespace %s
// CHECK: {{^1$}}
// CHECK-NEXT: {{^      #$}}
// CHECK-NEXT: {{^2$}}
// CHECK-NEXT: {{^           #$}}
#define EMPTY
#define IDENTITY(X) X
1
EMPTY #
2
IDENTITY() #
Initial checkin of testsuite llvm-svn: 38538 2006-06-18 13:42:02 +08:00			`// The 1 and # should not go on the same line.`
FileCheck'ize tests llvm-svn: 173484 2013-01-26 04:34:08 +08:00			`// RUN: %clang_cc1 -E %s \| FileCheck --strict-whitespace %s`
			`// CHECK: {{^1$}}`
Make Preprocessor::Lex non-recursive. Before this patch, Lex() would recurse whenever the current lexer changed (e.g. upon entry into a macro). This patch turns the recursion into a loop: the various lex routines now don't return a token when the current lexer changes, and at the top level Preprocessor::Lex() now loops until it finds a token. Normally, the recursion wouldn't end up being very deep, but the recursion depth can explode in edge cases like a bunch of consecutive macros which expand to nothing (like in the testcase test/Preprocessor/macro_expand_empty.c in this patch). <rdar://problem/14569770> llvm-svn: 190980 2013-09-19 08:41:32 +08:00			`// CHECK-NEXT: {{^ #$}}`
			`// CHECK-NEXT: {{^2$}}`
			`// CHECK-NEXT: {{^ #$}}`
Initial checkin of testsuite llvm-svn: 38538 2006-06-18 13:42:02 +08:00			`#define EMPTY`
Make Preprocessor::Lex non-recursive. Before this patch, Lex() would recurse whenever the current lexer changed (e.g. upon entry into a macro). This patch turns the recursion into a loop: the various lex routines now don't return a token when the current lexer changes, and at the top level Preprocessor::Lex() now loops until it finds a token. Normally, the recursion wouldn't end up being very deep, but the recursion depth can explode in edge cases like a bunch of consecutive macros which expand to nothing (like in the testcase test/Preprocessor/macro_expand_empty.c in this patch). <rdar://problem/14569770> llvm-svn: 190980 2013-09-19 08:41:32 +08:00			`#define IDENTITY(X) X`
			`1`
Initial checkin of testsuite llvm-svn: 38538 2006-06-18 13:42:02 +08:00			`EMPTY #`
Make Preprocessor::Lex non-recursive. Before this patch, Lex() would recurse whenever the current lexer changed (e.g. upon entry into a macro). This patch turns the recursion into a loop: the various lex routines now don't return a token when the current lexer changes, and at the top level Preprocessor::Lex() now loops until it finds a token. Normally, the recursion wouldn't end up being very deep, but the recursion depth can explode in edge cases like a bunch of consecutive macros which expand to nothing (like in the testcase test/Preprocessor/macro_expand_empty.c in this patch). <rdar://problem/14569770> llvm-svn: 190980 2013-09-19 08:41:32 +08:00			`2`
			`IDENTITY() #`