Searched refs:Alternatives (Results 1 – 12 of 12) sorted by relevance
128 ambiguousData(llvm::ArrayRef<const ForestNode *> Alternatives) { in alignas()129 return Alternatives.size(); in alignas()162 llvm::ArrayRef<const ForestNode *> Alternatives) { in createAmbiguous() argument163 assert(!Alternatives.empty()); in createAmbiguous()164 assert(llvm::all_of(Alternatives, in createAmbiguous()170 Alternatives.front()->startTokenIndex(), in createAmbiguous()171 ForestNode::ambiguousData(Alternatives), Alternatives); in createAmbiguous()
18 // - Alternatives, where several different node types are allowed.59 // Statement is modeled using Alternatives, and IfStatement.base is Statement.60 class Alternatives<NodeType base_ = Tree> : NodeType { let base = base_; }
35 def Expression : Alternatives {57 def LiteralExpression : Alternatives<Expression> {121 def UserDefinedLiteralExpression : Alternatives<LiteralExpression> {264 def NameSpecifier : Alternatives {
113 Alternatives chapter
42 Alternatives chapter
187 Alternatives to manual installation
477 ##### Optimizations, Alternatives, and Tradeoffs
415 Named Alternatives
660 // Alternatives to match operations with or without an overflow CC result.
271 ### Alternatives For Lowering an n-D Vector Type to LLVM
676 ## Open Issues and Design Alternatives<a name="open_issues"></a>
610 ### Summary of Existing Alternatives a Picture<a name="observationssummary"></a>