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

  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
PoisonChecking.cpp 25 // instruction itself (e.g. checks for overflow on nsw).
105 SmallVectorImpl<Value*> &Checks) {
118 Checks.push_back(B.CreateExtractValue(OverflowOp, 1));
123 Checks.push_back(B.CreateExtractValue(OverflowOp, 1));
131 Checks.push_back(B.CreateExtractValue(OverflowOp, 1));
136 Checks.push_back(B.CreateExtractValue(OverflowOp, 1));
144 Checks.push_back(B.CreateExtractValue(OverflowOp, 1));
149 Checks.push_back(B.CreateExtractValue(OverflowOp, 1));
158 Checks.push_back(Check);
167 Checks.push_back(Check)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopPredication.cpp 9 // The LoopPredication pass tries to convert loop variant range checks to loop
10 // invariant by widening checks across loop iterations. For example, it will
206 STATISTIC(TotalWidened, "Number of checks widened");
217 SkipProfitabilityChecks("loop-predication-skip-profitability-checks",
298 unsigned collectChecks(SmallVectorImpl<Value *> &Checks, Value *Condition,
304 // very coarse grained check and there can be more fine grained exit checks
532 // predicable range checks in a row. (Since, in the general case, we can't
533 // hoist the length checks until the dominating checks have been discharged
552 // shows up in range checks on arrays with immutable lengths
    [all...]
LoopDistribute.cpp 106 cl::desc("The maximum number of SCEV checks allowed for Loop "
113 "The maximum number of SCEV checks allowed for Loop "
771 // Don't distribute the loop if we need too many SCEV run-time checks, or
783 "too many SCEV run-time checks needed.\n");
793 // If we need run-time checks, version the loop now.
797 auto Checks = includeOnlyCrossPartitionChecks(AllChecks, PtrToPartition,
800 if (LAI->hasConvergentOp() && !Checks.empty()) {
811 if (!Pred.isAlwaysTrue() || !Checks.empty()) {
817 LLVM_DEBUG(LAI->getRuntimePointerChecking()->printChecks(dbgs(), Checks));
818 LoopVersioning LVer(*LAI, Checks, L, LI, DT, SE)
    [all...]
  /src/external/apache2/llvm/dist/clang/utils/TableGen/
MveEmitter.cpp 33 // untaken branches are required to pass all front-end validity checks such as
816 // checks, etc). Used for redeclaring MVE intrinsics in the arm_cde.h header.
1046 void GroupSemaChecks(std::map<std::string, std::set<std::string>> &Checks);
1732 std::map<std::string, std::set<std::string>> &Checks) {
1739 Checks[Check].insert(Int.fullName());
1966 std::map<std::string, std::set<std::string>> Checks;
1967 GroupSemaChecks(Checks);
1969 for (const auto &kv : Checks) {
2160 std::map<std::string, std::set<std::string>> Checks;
2161 GroupSemaChecks(Checks);
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LoopAccessAnalysis.h 48 /// \When performing memory disambiguation checks at runtime do not
53 /// Checks memory dependences among accesses to the same underlying
59 /// sometimes deal these potential dependencies by emitting runtime checks.
70 /// The latter case is safe because later checks guarantuee that there can't
98 // Can vectorize safely without RT checks. All dependences are known to be
101 // Can possibly vectorize with RT checks to overcome unknown dependencies.
198 /// Only checks sets with elements in \p CheckDeps.
262 /// A wrapper around ScalarEvolution, used to add runtime SCEV checks, and
290 /// vectorize this loop with runtime checks.
293 /// Result of the dependence checks, indicating whether the checke
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
LoopAccessAnalysis.cpp 88 cl::desc("When performing memory disambiguation checks at runtime do not "
93 /// The maximum iterations used to merge memory checks
97 "runtime memory checks. (default = 100)"),
238 SmallVector<RuntimePointerCheck, 4> Checks;
246 Checks.push_back(std::make_pair(&CGI, &CGJ));
249 return Checks;
254 assert(Checks.empty() && "Checks is not empty");
256 Checks = generateChecks();
342 // dependence. Not grouping the checks for a[i] and a[i + 9000] allow
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGExpr.cpp 697 SmallVector<std::pair<llvm::Value *, SanitizerMask>, 3> Checks;
701 // to skip null checks, and some alignment checks, for these pointers. This
723 // Skip the remaining checks in that case.
729 Checks.push_back(std::make_pair(IsNonNull, SanitizerKind::Null));
757 Checks.push_back(std::make_pair(LargeEnough, SanitizerKind::ObjectSize));
781 Checks.push_back(std::make_pair(Aligned, SanitizerKind::Alignment));
785 if (Checks.size() > 0) {
793 EmitCheck(Checks, SanitizerHandler::TypeMismatch, StaticData,
882 /// struct. We disable array bounds checks for such members
    [all...]
CGExprScalar.cpp 192 // We usually don't need overflow checks for binops with widened operands.
248 void EmitBinOpCheck(ArrayRef<std::pair<Value *, SanitizerMask>> Checks,
757 /// Create a binary op that checks for overflow.
1167 // Each of these checks needs to return 'false' when an issue was detected.
1169 llvm::SmallVector<std::pair<llvm::Value *, SanitizerMask>, 2> Checks;
1170 // So we can 'and' all the checks together, and still get 'false',
1171 // if at least one of the checks detected an issue.
1175 Checks.emplace_back(Check.second);
1185 Checks.emplace_back(Check.second);
1193 // EmitCheck() will 'and' all the checks together
    [all...]

Completed in 77 milliseconds