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

  /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/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/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/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/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/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/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/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...]
  /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...]
  /src/external/apache2/llvm/dist/llvm/lib/Support/
CommandLine.cpp 603 unsigned Distance = StringRef(Name).edit_distance(
605 if (!Best || Distance < BestDistance) {
607 BestDistance = 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.);

Completed in 37 milliseconds