HomeSort by: relevance | last modified time | path
    Searched defs:Cases (Results 1 - 12 of 12) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
StringSwitch.h 9 // statement whose cases are string literals.
22 /// A switch()-like statement whose cases are string literals.
38 /// .Cases("violet", "purple", Violet)
88 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, T Value) {
92 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2,
94 return Case(S0, Value).Cases(S1, S2, Value);
97 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2,
99 return Case(S0, Value).Cases(S1, S2, S3, Value);
102 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2,
104 return Case(S0, Value).Cases(S1, S2, S3, S4, Value)
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Tooling/Transformer/
RewriteRule.h 85 // (`RewriteRule::Explanation`) instead. Notes serve the rare cases wherein
158 /// cases so that user doesn't need to specify which factory function to
270 // as a `Case` and a rule is a list of cases.
272 // Rule cases have an additional, implicit, component: the parameters. These are
285 SmallVector<Case, 1> Cases;
328 // of its cases. Anywhere you'd use `anyOf(m1.bind("id1"), m2.bind("id2"))` and
339 // We have three cases to consider (for some equality function, `eq`):
422 /// Builds a single matcher for the rule, covering all of the rule's cases.
423 /// Only supports Rules whose cases' matchers share the same base "kind"
  /src/external/apache2/llvm/dist/clang/lib/ARCMigrate/
TransProtectedScope.cpp 57 SmallVectorImpl<CaseInfo> &Cases;
60 CaseCollector(ParentMap &PMap, SmallVectorImpl<CaseInfo> &Cases)
61 : PMap(PMap), Cases(Cases) { }
80 Cases.push_back(
99 SmallVector<CaseInfo, 16> Cases;
107 CaseCollector(BodyCtx.getParentMap(), Cases)
150 for (unsigned i = 0; i != Cases.size(); i++) {
151 CaseInfo &info = Cases[i];
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
DAGISelMatcherOpt.cpp 394 SmallVector<std::pair<const SDNodeInfo*, Matcher*>, 8> Cases;
399 Cases.push_back(std::make_pair(&COM->getOpcode(), COM->takeNext()));
403 MatcherPtr.reset(new SwitchOpcodeMatcher(Cases));
410 SmallVector<std::pair<MVT::SimpleValueType, Matcher*>, 8> Cases;
423 Matcher *PrevMatcher = Cases[Entry-1].second;
431 Cases[Entry-1].second = new ScopeMatcher(Entries);
435 Entry = Cases.size()+1;
436 Cases.push_back(std::make_pair(CTMTy, MatcherWithoutCTM));
440 for (auto &M : Cases) {
449 if (Cases.size() != 1)
    [all...]
DirectiveEmitter.cpp 365 llvm::StringSet<> &Cases) {
371 if (Cases.find(ClauseFormattedName) == Cases.end()) {
372 Cases.insert(ClauseFormattedName);
408 llvm::StringSet<> Cases;
411 Dir.getName(), DirLang, Cases);
414 Dir.getName(), DirLang, Cases);
417 Dir.getName(), DirLang, Cases);
420 Dir.getName(), DirLang, Cases);
GICombinerEmitter.cpp 628 std::vector<std::pair<std::string, std::string>> Cases;
629 Cases.reserve(Rules.size());
635 Cases.push_back(
647 StringMatcher Matcher("RuleIdentifier", Cases, OS);
DAGISelMatcher.h 470 /// to one matcher per opcode. If the opcode doesn't match any of the cases,
474 SmallVector<std::pair<const SDNodeInfo*, Matcher*>, 8> Cases;
476 SwitchOpcodeMatcher(ArrayRef<std::pair<const SDNodeInfo*, Matcher*> > cases)
477 : Matcher(SwitchOpcode), Cases(cases.begin(), cases.end()) {}
484 unsigned getNumCases() const { return Cases.size(); }
486 const SDNodeInfo &getCaseOpcode(unsigned i) const { return *Cases[i].first; }
487 Matcher *getCaseMatcher(unsigned i) { return Cases[i].second; }
488 const Matcher *getCaseMatcher(unsigned i) const { return Cases[i].second;
    [all...]
  /src/external/apache2/llvm/dist/clang/utils/TableGen/
ClangASTPropertiesEmitter.cpp 86 std::vector<TypeCase> Cases;
172 // Find all the type cases.
175 CasedTypeInfos[typeCase.getParentType()].Cases.push_back(typeCase);
786 if (typeCases.Cases.empty()) {
789 "no cases found for \"" + type.getCXXTypeName() + "\"");
792 assert(!typeCases.Cases.empty());
793 PrintFatalError(typeCases.Cases.front().getLoc(),
828 for (TypeCase typeCase : typeCases.Cases) {
  /src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/src/
sysinfo.cc 294 } Cases[] = {{"hw.l1dcachesize", "Data", 1, CacheCounts[1]},
298 for (auto& C : Cases) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
SwitchLoweringUtils.h 35 /// A cluster of cases suitable for jump table lowering.
37 /// A cluster of cases suitable for bit test lowering.
89 /// Sort Clusters and merge adjacent cases.
218 BitTestInfo Cases;
228 Cases(std::move(C)), Prob(Pr), OmitRangeCheck(false) {}
235 /// Return the number of cases within a range.
  /src/external/apache2/llvm/dist/llvm/utils/benchmark/src/
sysinfo.cc 292 } Cases[] = {{"hw.l1dcachesize", "Data", 1, CacheCounts[1]},
296 for (auto& C : Cases) {
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 137 // Remove additional occurrences coming from condensed cases and keep the
301 /// Transform simple list of \p SI's cases into list of CaseRange's \p Cases.
302 /// \post \p Cases wouldn't contain references to \p SI's default BB.
303 /// \returns Number of \p SI's cases that do not reference \p SI's default BB.
304 unsigned Clusterify(CaseVector &Cases, SwitchInst *SI) {
307 // Start with "simple" cases
308 for (auto Case : SI->cases()) {
311 Cases.push_back(CaseRange(Case.getCaseValue(), Case.getCaseValue(),
316 llvm::sort(Cases, CaseCmp())
    [all...]

Completed in 75 milliseconds