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

  /src/external/apache2/llvm/dist/clang/include/clang/Tooling/Refactoring/
RefactoringActionRulesInternal.h 49 const std::tuple<RequirementTypes...> &Requirements,
51 // Check if the requirements we're interested in can be evaluated.
53 std::make_tuple(std::get<Is>(Requirements).evaluate(Context)...);
58 // requirements from Expected<> wrappers and then run it.
68 /// Scans the list of requirements in a rule and visits all the refactoring
69 /// options that are used by all the requirements.
89 const std::tuple<RequirementTypes...> &Requirements,
91 visitRefactoringOptionsImpl(Visitor, std::get<Is>(Requirements)...);
118 createRefactoringActionRule(const RequirementTypes &... Requirements) {
127 Rule(std::tuple<RequirementTypes...> Requirements)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
LoopVectorizationPlanner.h 262 LoopVectorizationRequirements &Requirements;
285 LoopVectorizationRequirements &Requirements,
288 PSE(PSE), Hints(Hints), Requirements(Requirements), ORE(ORE) {}
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Vectorize/
LoopVectorizationLegality.h 198 /// This holds vectorization requirements that must be verified late in
199 /// the process. The requirements are set by legalize and costmodel. Once
201 /// requirements can be verified by looking for metadata or compiler options.
205 /// Late evaluation of these requirements allows helpful diagnostics to be
258 GetLAA(GetLAA), ORE(ORE), Requirements(R), Hints(H), DB(DB), AC(AC),
532 /// Vectorization requirements that will go through late-evaluation.
533 LoopVectorizationRequirements *Requirements;
  /src/external/apache2/llvm/dist/llvm/lib/Linker/
IRMover.cpp 1234 // First build a map of the existing module flags and requirements.
1236 SmallSetVector<MDNode *, 16> Requirements;
1243 Requirements.insert(cast<MDNode>(Op->getOperand(2)));
1250 // requirements.
1265 if (Requirements.insert(cast<MDNode>(SrcOp->getOperand(2)))) {
1404 // Check all of the requirements.
1405 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
1406 MDNode *Requirement = Requirements[I];
  /src/external/apache2/llvm/dist/clang/lib/AST/
StmtPrinter.cpp 2311 auto Requirements = E->getRequirements();
2312 for (concepts::Requirement *Req : Requirements) {
  /src/external/apache2/llvm/dist/clang/lib/Serialization/
ASTReaderStmt.cpp 839 llvm::SmallVector<concepts::Requirement *, 4> Requirements;
922 Requirements.push_back(R);
924 std::copy(Requirements.begin(), Requirements.end(),
  /src/external/apache2/llvm/dist/llvm/lib/IR/
Verifier.cpp 456 SmallVectorImpl<const MDNode *> &Requirements);
1509 // Scan each flag, and track the flags and requirements.
1511 SmallVector<const MDNode*, 16> Requirements;
1513 visitModuleFlag(MDN, SeenIDs, Requirements);
1515 // Validate that the requirements in the module are valid.
1516 for (const MDNode *Requirement : Requirements) {
1539 SmallVectorImpl<const MDNode *> &Requirements) {
1558 // Sanity check the values for behaviors with additional requirements.
1585 // Append it to the list of requirements, to check once all module flags are
1587 Requirements.push_back(Value)
    [all...]

Completed in 25 milliseconds