/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
H A D | HexagonBranchRelaxation.cpp | 154 unsigned Distance = 0; local 173 Distance = std::abs((long long)InstOffset - BlockToInstOffset[TBB]) 175 return !HII->isJumpWithinBranchRange(*FirstTerm, Distance); 186 Distance = std::abs((long long)InstOffset - BlockToInstOffset[FBB]) 188 return !HII->isJumpWithinBranchRange(*SecondTerm, Distance);
|
/netbsd-current/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
H A D | sanitizer_stacktrace.cc | 123 static uptr Distance(uptr a, uptr b) { return a < b ? b - a : a - b; } function in namespace:__sanitizer 128 if (Distance(trace[i], pc) < Distance(trace[best], pc)) best = i;
|
/netbsd-current/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
H A D | sanitizer_stacktrace.cc | 127 static uptr Distance(uptr a, uptr b) { return a < b ? b - a : a - b; } function in namespace:__sanitizer 132 if (Distance(trace[i], pc) < Distance(trace[best], pc)) best = i;
|
/netbsd-current/external/apache2/llvm/dist/clang/lib/ASTMatchers/Dynamic/ |
H A D | Marshallers.cpp | 29 unsigned Distance = Item.edit_distance(Search); local 30 if (Distance < MaxEditDistance) { 31 MaxEditDistance = Distance; 50 unsigned Distance = NoPrefix.edit_distance(Search); local 51 if (Distance < MaxEditDistance) { 52 MaxEditDistance = Distance;
|
H A D | VariantValue.cpp | 48 unsigned Distance; local 49 if (!NodeKind.isBaseOf(To.NodeKind, &Distance)) 53 *Specificity = 100 - Distance;
|
/netbsd-current/external/apache2/llvm/dist/clang/lib/AST/ |
H A D | ASTTypeTraits.cpp | 49 bool ASTNodeKind::isBaseOf(ASTNodeKind Other, unsigned *Distance) const { 50 return isBaseOf(KindId, Other.KindId, Distance); 54 unsigned *Distance) { 61 if (Distance) 62 *Distance = Dist; 53 isBaseOf(NodeKindId Base, NodeKindId Derived, unsigned *Distance) argument
|
/netbsd-current/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
H A D | sanitizer_stacktrace.cpp | 165 static uptr Distance(uptr a, uptr b) { return a < b ? b - a : a - b; } function in namespace:__sanitizer 170 if (Distance(trace[i], pc) < Distance(trace[best], pc)) best = i;
|
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
H A D | DependenceAnalysis.h | 102 const SCEV *Distance; // NULL implies no distance available. member in struct:llvm::Dependence::DVEntry 104 PeelLast(false), Splitable(false), Distance(nullptr) { } 380 /// 3) Distance - The value d of the dependence distance; 386 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind; enumerator in enum:llvm::DependenceInfo::Constraint::ConstraintKind 400 /// isDistance - Return true if the constraint is of kind Distance. 401 bool isDistance() const { return Kind == Distance; } 404 /// Since Distance's can also be represented as Lines, we also return 405 /// true if the constraint is of kind Distance. 406 bool isLine() const { return Kind == Line || Kind == Distance; } 445 /// setDistance - Change a constraint to Distance [all...] |
H A D | LoopAccessAnalysis.h | 328 bool couldPreventStoreLoadForward(uint64_t Distance, uint64_t TypeByteSize);
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
H A D | MIRCanonicalizerPass.cpp | 216 unsigned Distance = ~0U; local 231 if (Delta < Distance) { 232 Distance = Delta;
|
H A D | MachinePipeliner.cpp | 1180 unsigned Distance = 1; local 1183 unsigned CurMII = (Delay + Distance - 1) / Distance;
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Analysis/ |
H A D | LoopAccessAnalysis.cpp | 1300 bool MemoryDepChecker::couldPreventStoreLoadForward(uint64_t Distance, argument 1324 if (Distance % VF && Distance / VF < NumItersForStoreLoadThroughMemory) { 1332 dbgs() << "LAA: Distance " << Distance 1417 /// \p Distance is the positive distance and \p TypeByteSize is type size in 1421 static bool areStridedAccessesIndependent(uint64_t Distance, uint64_t Stride, argument 1425 assert(Distance > 0 && "The distance must be non-zero"); 1428 if (Distance % TypeByteSize) 1431 uint64_t ScaledDist = Distance / TypeByteSiz 1522 int64_t Distance = Val.getSExtValue(); local [all...] |
H A D | DependenceAnalysis.cpp | 278 return DV[Level - 1].Distance; 336 assert((Kind == Line || Kind == Distance) && 337 "Kind should be Line (or Distance)"); 345 assert((Kind == Line || Kind == Distance) && 346 "Kind should be Line (or Distance)"); 354 assert((Kind == Line || Kind == Distance) && 355 "Kind should be Line (or Distance)"); 363 assert(Kind == Distance && "Kind should be Distance"); 370 assert((Kind == Distance || Kin 613 const SCEV *Distance = getDistance(II); local 615 OS << *Distance; local 1185 APInt Distance = ConstDelta; // these need to be initialized local 1373 APInt Distance = APDelta; // these need to be initialzed local [all...] |
H A D | LoopCacheAnalysis.cpp | 237 const SCEV *Distance = D->getDistance(Level); 238 const SCEVConstant *SCEVConst = dyn_cast_or_null<SCEVConstant>(Distance);
|
H A D | ScalarEvolution.cpp | 9226 const SCEV *Distance = CountDown ? Start : getNegativeSCEV(Start); 9230 // N = Distance (as unsigned) 9232 APInt MaxBECount = getUnsignedRangeMax(applyLoopGuards(Distance, L)); 9233 APInt MaxBECountBase = getUnsignedRangeMax(Distance); 9244 const SCEV *Zero = getZero(Distance->getType()); 9245 const SCEV *One = getOne(Distance->getType()); 9246 const SCEV *DistancePlusOne = getAddExpr(Distance, One); 9248 // If Distance + 1 doesn't overflow, we can compute the maximum distance 9249 // as "unsigned_max(Distance + 1) - 1". 9253 return ExitLimit(Distance, getConstan [all...] |
/netbsd-current/external/apache2/llvm/dist/clang/lib/Basic/ |
H A D | DiagnosticIDs.cpp | 695 unsigned Distance = O.getName().edit_distance(Group, true, BestDistance); 696 if (Distance > BestDistance) 704 if (Distance == BestDistance) { 707 } else if (Distance < BestDistance) { 710 BestDistance = Distance;
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Option/ |
H A D | OptTable.cpp | 305 unsigned Distance = local 315 ++Distance; 317 if (Distance < BestDistance) { 318 BestDistance = Distance;
|
/netbsd-current/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
H A D | Iterator.cpp | 226 const SVal &Distance) { 239 const auto IntDistOp = Distance.getAs<nonloc::ConcreteInt>(); 224 advancePosition(ProgramStateRef State, const SVal &Iter, OverloadedOperatorKind Op, const SVal &Distance) argument
|
H A D | Iterator.h | 179 const SVal &Distance);
|
/netbsd-current/external/apache2/llvm/dist/clang/include/clang/AST/ |
H A D | ASTTypeTraits.h | 80 /// \param Distance If non-null, used to return the distance between \c this 82 bool isBaseOf(ASTNodeKind Other, unsigned *Distance = nullptr) const; 163 /// \param Distance If non-null, used to return the distance between \c Base 165 static bool isBaseOf(NodeKindId Base, NodeKindId Derived, unsigned *Distance);
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Support/ |
H A D | YAMLParser.cpp | 389 /// Skip \a Distance UTF-8 code units. Updates \a Cur and \a Column. 390 void skip(uint32_t Distance); 1025 void Scanner::skip(uint32_t Distance) { argument 1026 Current += Distance; 1027 Column += Distance;
|
H A D | CommandLine.cpp | 603 unsigned Distance = StringRef(Name).edit_distance( local 605 if (!Best || Distance < BestDistance) { 607 BestDistance = Distance;
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
H A D | LoopInterchange.cpp | 139 const SCEV *Distance = D->getDistance(II); local 141 dyn_cast_or_null<SCEVConstant>(Distance);
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/FileCheck/ |
H A D | FileCheck.cpp | 1481 unsigned Distance = computeMatchDistance(Buffer.substr(i)); local 1482 double Quality = Distance + (NumLinesForward / 100.);
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 1451 for (unsigned Distance = 1; Distance != NumLanes; ++Distance) { 1454 int Lane = FirstLane + Direction * Distance;
|