| /external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
| D | test-tree-wizard.rb | 84 Tokens = TokenScheme.build %w(A B C D E ID VAR) constant in TestPatternParser
85 include Tokens
88 @adaptor = CommonTreeAdaptor.new( Tokens.token_class )
89 @pattern_adaptor = Wizard::PatternAdaptor.new( Tokens.token_class )
90 @wizard = Wizard.new( :adaptor => @adaptor, :token_scheme => Tokens )
95 tree = Wizard::PatternParser.parse( 'ID', Tokens, @adaptor )
103 tree = Wizard::PatternParser.parse( 'ID[foo]', Tokens, @adaptor )
111 tree = Wizard::PatternParser.parse( '(A B)', Tokens, @adaptor )
122 tree = Wizard::PatternParser.parse( 'nil', Tokens, @adaptor )
130 tree = Wizard::PatternParser.parse( '(.)', Tokens, @adaptor )
[all …]
|
| /external/clang/lib/Lex/ |
| D | TokenLexer.cpp | 41 Tokens = &*Macro->tokens_begin(); in Init()
51 assert(Tokens[0].getLocation().isValid()); in Init()
52 assert((Tokens[0].getLocation().isFileID() || Tokens[0].is(tok::comment)) && in Init()
60 MacroDefStart = SM.getExpansionLoc(Tokens[0].getLocation()); in Init()
91 Tokens = TokArray; in Init()
115 delete [] Tokens; in destroy()
116 Tokens = nullptr; in destroy()
184 const Token &CurTok = Tokens[i]; in ExpandFunctionArguments()
185 if (i != 0 && !Tokens[i-1].is(tok::hashhash) && CurTok.hasLeadingSpace()) in ExpandFunctionArguments()
189 int ArgNo = Macro->getArgumentNum(Tokens[i+1].getIdentifierInfo()); in ExpandFunctionArguments()
[all …]
|
| D | Preprocessor.cpp | 326 ArrayRef<TokenValue> Tokens) { in MacroDefinitionEquals() argument
327 return Tokens.size() == MI->getNumTokens() && in MacroDefinitionEquals()
328 std::equal(Tokens.begin(), Tokens.end(), MI->tokens_begin()); in MacroDefinitionEquals()
333 ArrayRef<TokenValue> Tokens) const { in getLastMacroWithSpelling()
344 if (!MacroDefinitionEquals(Def.getMacroInfo(), Tokens)) in getLastMacroWithSpelling()
|
| /external/clang/lib/Format/ |
| D | Format.cpp | 780 assert(Tokens.empty()); in lex()
783 Tokens.push_back(getNextToken()); in lex()
787 if (Tokens.back()->NewlinesBefore > 0 || Tokens.back()->IsMultiline) in lex()
788 FirstInLineIndex = Tokens.size() - 1; in lex()
789 } while (Tokens.back()->Tok.isNot(tok::eof)); in lex()
790 return Tokens; in lex()
828 if (Tokens.size() < 3) in tryMergeLessLess()
832 if (Tokens.size() > 3) in tryMergeLessLess()
833 FourthTokenIsLess = (Tokens.end() - 4)[0]->is(tok::less); in tryMergeLessLess()
835 auto First = Tokens.end() - 3; in tryMergeLessLess()
[all …]
|
| D | TokenAnnotator.h | 42 : First(Line.Tokens.front().Tok), Level(Line.Level), in AnnotatedLine()
47 assert(!Line.Tokens.empty()); in AnnotatedLine()
54 for (std::list<UnwrappedLineNode>::const_iterator I = ++Line.Tokens.begin(), in AnnotatedLine()
55 E = Line.Tokens.end(); in AnnotatedLine()
85 template <typename... Ts> bool startsWith(Ts... Tokens) const { in startsWith() argument
86 return startsWith(First, Tokens...); in startsWith()
134 bool startsWith(FormatToken *Tok, A K1, Ts... Tokens) const { in startsWith() argument
135 return startsWith(Tok, K1) && startsWith(Tok->Next, Tokens...); in startsWith()
|
| D | UnwrappedLineParser.cpp | 126 else if (!Parser.Line->Tokens.empty()) in ScopedLineState()
127 Parser.CurrentLines = &Parser.Line->Tokens.back().Children; in ScopedLineState()
135 if (!Parser.Line->Tokens.empty()) { in ~ScopedLineState()
138 assert(Parser.Line->Tokens.empty()); in ~ScopedLineState()
173 IndexedTokenSource(ArrayRef<FormatToken *> Tokens) in IndexedTokenSource() argument
174 : Tokens(Tokens), Position(-1) {} in IndexedTokenSource()
178 return Tokens[Position]; in getNextToken()
188 return Tokens[Position]; in setPosition()
194 ArrayRef<FormatToken *> Tokens; member in clang::format::__anonfa4918600211::IndexedTokenSource
202 ArrayRef<FormatToken *> Tokens, in UnwrappedLineParser() argument
[all …]
|
| D | UnwrappedLineParser.h | 41 std::list<UnwrappedLineNode> Tokens; member
65 ArrayRef<FormatToken *> Tokens,
163 FormatTokenSource *Tokens; variable
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| D | TokenConstants.cs | 65 public static class Tokens class
67 public static readonly IToken EndOfFile = Tokens<CommonToken>.EndOfFile;
79 public static class Tokens<T>
|
| /external/llvm/lib/CodeGen/ |
| D | IfConversion.cpp | 201 void AnalyzeBlock(MachineBasicBlock *MBB, std::vector<IfcvtToken*> &Tokens);
204 void AnalyzeBlocks(MachineFunction &MF, std::vector<IfcvtToken*> &Tokens);
312 std::vector<IfcvtToken*> Tokens; in INITIALIZE_PASS_DEPENDENCY() local
320 AnalyzeBlocks(MF, Tokens); in INITIALIZE_PASS_DEPENDENCY()
321 while (!Tokens.empty()) { in INITIALIZE_PASS_DEPENDENCY()
322 IfcvtToken *Token = Tokens.back(); in INITIALIZE_PASS_DEPENDENCY()
323 Tokens.pop_back(); in INITIALIZE_PASS_DEPENDENCY()
418 while (!Tokens.empty()) { in INITIALIZE_PASS_DEPENDENCY()
419 IfcvtToken *Token = Tokens.back(); in INITIALIZE_PASS_DEPENDENCY()
420 Tokens.pop_back(); in INITIALIZE_PASS_DEPENDENCY()
[all …]
|
| /external/mesa3d/src/gallium/drivers/i915/ |
| D | i915_fpc_optimize.c | 320 out_tokens->Tokens = MALLOC(sizeof(union i915_full_token) * out_tokens->NumTokens); in i915_optimize()
331 copy_token(&out_tokens->Tokens[i] , &parse.FullToken); in i915_optimize()
334 i915_fpc_optimize_useless_mov_after_inst(&out_tokens->Tokens[i-1], &out_tokens->Tokens[i]); in i915_optimize()
335 i915_fpc_optimize_mov_after_alu(&out_tokens->Tokens[i-1], &out_tokens->Tokens[i]); in i915_optimize()
346 free(tokens->Tokens); in i915_optimize_free()
|
| /external/mesa3d/src/gallium/auxiliary/tgsi/ |
| D | tgsi_parse.c | 46 ctx->Tokens = tokens; in tgsi_parse_init()
88 copy_token(token, &ctx->Tokens[ctx->Position]); in next_token()
127 &ctx->Tokens[ctx->Position]; in tgsi_parse_token()
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/lexertest-simple/ |
| D | Test.tokens | 2 Tokens=7
|
| D | TestLexer.h | 15 #pragma mark Tokens
|
| D | TestLexerLexer.h | 16 #pragma mark Tokens
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| D | Tokens.cs | 35 public static class Tokens class
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| D | TreeConstants.cs | 37 public static readonly ITree INVALID_NODE = new CommonTree( Tokens.Invalid );
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/lexertest-simple/output1/ |
| D | TestLexerLexer.h | 15 #pragma mark Tokens
|
| D | TestLexer.h | 15 #pragma mark Tokens
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/output1/ |
| D | TreeRewriteLexer.h | 16 #pragma mark Tokens
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/combined/ |
| D | CombinedLexer.h | 16 #pragma mark Tokens
|
| D | CombinedParser.h | 13 #pragma mark Tokens
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/ |
| D | TreeRewriteLexer.h | 16 #pragma mark Tokens
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter3/ |
| D | token.ml | 2 * Lexer Tokens
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
| D | token.ml | 2 * Lexer Tokens
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter2/ |
| D | token.ml | 2 * Lexer Tokens
|