HomeSort by: relevance | last modified time | path
    Searched refs:Distance (Results 1 - 25 of 25) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonBranchRelaxation.cpp 154 unsigned Distance = 0;
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);
201 LLVM_DEBUG(dbgs() << "Long distance jump. isExtendable("
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_stacktrace.cc 123 static uptr Distance(uptr a, uptr b) { return a < b ? b - a : a - b; }
128 if (Distance(trace[i], pc) < Distance(trace[best], pc)) best = i;
  /src/external/apache2/llvm/dist/clang/lib/ASTMatchers/Dynamic/
Marshallers.cpp 29 unsigned Distance = Item.edit_distance(Search);
30 if (Distance < MaxEditDistance) {
31 MaxEditDistance = Distance;
50 unsigned Distance = NoPrefix.edit_distance(Search);
51 if (Distance < MaxEditDistance) {
52 MaxEditDistance = Distance;
VariantValue.cpp 48 unsigned Distance;
49 if (!NodeKind.isBaseOf(To.NodeKind, &Distance))
53 *Specificity = 100 - Distance;
  /src/external/apache2/llvm/dist/clang/lib/AST/
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;
  /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
sanitizer_stacktrace.cpp 166 static uptr Distance(uptr a, uptr b) { return a < b ? b - a : a - b; }
171 if (Distance(trace[i], pc) < Distance(trace[best], pc)) best = i;
  /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/
sanitizer_stacktrace.cpp 165 static uptr Distance(uptr a, uptr b) { return a < b ? b - a : a - b; }
170 if (Distance(trace[i], pc) < Distance(trace[best], pc)) best = i;
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
DependenceAnalysis.h 85 /// Dependence::DVEntry - Each level in the distance/direction vector
87 /// perhaps a distance.
102 const SCEV *Distance; // NULL implies no distance available.
104 PeelLast(false), Splitable(false), Distance(nullptr) { }
160 /// getDistance - Returns the distance (or NULL) associated with a
241 /// getDistance - Returns the distance (or NULL) associated with a
380 /// 3) Distance - The value d of the dependence distance;
386 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind
    [all...]
LoopAccessAnalysis.h 65 /// * A negative constant distance assuming program order.
77 /// * A positive constant distance assuming program order that is bigger
83 /// Safe distance: 2 x sizeof(a[0]), and 2 x sizeof(b[0]), respectively.
113 // We couldn't determine the direction or the distance.
130 // Backward, but the distance allows a vectorization factor of
289 /// If we see a non-constant dependence distance we can still try to
315 /// plausible dependence but the dependence distance is bigger than one
316 /// element access it records this distance in \p MaxSafeDepDistBytes (if this
317 /// distance is smaller than any other distance encountered so far)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MIRCanonicalizerPass.cpp 139 // Calculates the distance of MI from the beginning of its parent BB.
216 unsigned Distance = ~0U;
231 if (Delta < Distance) {
232 Distance = Delta;
MachinePipeliner.cpp 1167 /// Iterate over each circuit. Compute the delay(c) and distance(c)
1169 /// delay(c) - II*distance(c) <= 0. For each circuit, choose the smallest
1180 unsigned Distance = 1;
1182 // ii = ceil(delay / distance)
1183 unsigned CurMII = (Delay + Distance - 1) / Distance;
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
LoopAccessAnalysis.cpp 1168 // Otherwise compute the distance with SCEV between the base pointers.
1181 // Ensure that the calculated distance matches the type-based one after all
1300 bool MemoryDepChecker::couldPreventStoreLoadForward(uint64_t Distance,
1302 // If loads occur at a distance that is not a multiple of a feasible vector
1310 // Store-load forwarding distance.
1324 if (Distance % VF && Distance / VF < NumItersForStoreLoadThroughMemory) {
1332 dbgs() << "LAA: Distance " << Distance
1349 /// Given a non-constant (unknown) dependence-distance \p Dist between tw
    [all...]
DependenceAnalysis.cpp 275 // Returns the distance (or NULL) associated with a particular level.
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)");
360 // If constraint is a distance, returns D.
363 assert(Kind == Distance && "Kind should be Distance")
    [all...]
LoopCacheAnalysis.cpp 50 // with distance smaller than a configurable threshold.
53 cl::desc("Use this to specify the max. distance between array elements "
231 // Check the dependence distance at every loop level. There is temporal reuse
232 // if the distance at the given loop's depth is small (|d| <= MaxDistance) and
237 const SCEV *Distance = D->getDistance(Level);
238 const SCEVConstant *SCEVConst = dyn_cast_or_null<SCEVConstant>(Distance);
241 LLVM_DEBUG(dbgs().indent(2) << "No temporal reuse: distance unknown\n");
248 << "No temporal reuse: distance is not zero at depth=" << Level
254 << "No temporal reuse: distance is greater than MaxDistance at depth="
ScalarEvolution.cpp 9224 // First compute the unsigned distance from zero in the direction of Step.
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
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Basic/
DiagnosticIDs.cpp 695 unsigned Distance = O.getName().edit_distance(Group, true, BestDistance);
696 if (Distance > BestDistance)
704 if (Distance == BestDistance) {
705 // Two matches with the same distance, don't prefer one over the other.
707 } else if (Distance < BestDistance) {
710 BestDistance = Distance;
  /src/external/apache2/llvm/dist/llvm/lib/Option/
OptTable.cpp 305 unsigned Distance =
313 // though both have an unmodified editing distance of 1, since the
315 ++Distance;
317 if (Distance < BestDistance) {
318 BestDistance = Distance;
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
Iterator.cpp 226 const SVal &Distance) {
239 const auto IntDistOp = Distance.getAs<nonloc::ConcreteInt>();
260 // A distance between items in the container should not be very large.
Iterator.h 179 const SVal &Distance);
  /src/external/apache2/llvm/dist/clang/include/clang/AST/
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);
  /src/external/apache2/llvm/dist/llvm/lib/Support/
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) {
1026 Current += Distance;
1027 Column += Distance;
CommandLine.cpp 603 unsigned Distance = StringRef(Name).edit_distance(
605 if (!Best || Distance < BestDistance) {
607 BestDistance = Distance;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopInterchange.cpp 139 const SCEV *Distance = D->getDistance(II);
141 dyn_cast_or_null<SCEVConstant>(Distance);
  /src/external/apache2/llvm/dist/llvm/lib/FileCheck/
FileCheck.cpp 1480 // match distance and the number of lines skipped to get to this match.
1481 unsigned Distance = computeMatchDistance(Buffer.substr(i));
1482 double Quality = Distance + (NumLinesForward / 100.);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
SLPVectorizer.cpp 181 // Another limit for the alias checks: The maximum distance between load/store
1056 int UserLn = std::distance(UserTE->Scalars.begin(), It);
1450 // distance.
1451 for (unsigned Distance = 1; Distance != NumLanes; ++Distance) {
1454 int Lane = FirstLane + Direction * Distance;
2589 unsigned FoundLane = std::distance(Scalars.begin(), find(Scalars, V));
2592 FoundLane = std::distance(ReuseShuffleIndices.begin(),
4437 VecId = std::distance(FirstUsers.begin(), It)
    [all...]

Completed in 93 milliseconds