Home
last modified time | relevance | path

Searched refs:Distance (Results 1 – 25 of 163) sorted by relevance

1234567

/external/vulkan-validation-layers/libs/glm/gtx/
Dextend.inl17 genType const & Distance argument
20 return Origin + (Source - Origin) * Distance;
28 T const & Distance argument
31 return Origin + (Source - Origin) * Distance;
39 T const & Distance argument
42 return Origin + (Source - Origin) * Distance;
50 T const & Distance argument
53 return Origin + (Source - Origin) * Distance;
Dclosest_point.inl28 T Distance = dot(Vector, LineDirection); local
30 if(Distance <= T(0)) return a;
31 if(Distance >= LineLength) return b;
32 return a + LineDirection * Distance;
/external/v8/src/x64/
Dmacro-assembler-x64.h157 Label::Distance if_equal_distance = Label::kFar) {
163 Label::Distance if_equal_distance = Label::kFar) {
171 Label::Distance if_not_equal_distance = Label::kFar) {
177 Label::Distance if_not_equal_distance = Label::kFar) {
217 Label::Distance condition_met_distance = Label::kFar);
224 Label::Distance distance = Label::kFar) {
233 Label::Distance distance = Label::kFar) {
240 Label::Distance on_black_distance);
245 Label* value_is_white, Label::Distance distance);
475 Label::Distance near_jump = Label::kFar);
[all …]
Dmacro-assembler-x64.cc258 Label::Distance distance) { in InNewSpace()
1392 Label::Distance near_jump) { in SmiOrIfSmis()
1531 Label::Distance near_jump) { in JumpIfValidSmiValue()
1539 Label::Distance near_jump) { in JumpIfNotValidSmiValue()
1547 Label::Distance near_jump) { in JumpIfUIntValidSmiValue()
1555 Label::Distance near_jump) { in JumpIfUIntNotValidSmiValue()
1563 Label::Distance near_jump) { in JumpIfSmi()
1571 Label::Distance near_jump) { in JumpIfNotSmi()
1577 Label::Distance near_jump) { in JumpIfNotSmi()
1584 Label::Distance near_jump) { in JumpUnlessNonNegativeSmi()
[all …]
/external/clang/unittests/AST/
DASTTypeTraitsTest.cpp44 unsigned Distance = 1; in TEST() local
45 EXPECT_TRUE(DNT<Expr>().isBaseOf(DNT<Expr>(), &Distance)); in TEST()
46 EXPECT_EQ(0u, Distance); in TEST()
48 EXPECT_TRUE(DNT<Stmt>().isBaseOf(DNT<IfStmt>(), &Distance)); in TEST()
49 EXPECT_EQ(1u, Distance); in TEST()
51 Distance = 3; in TEST()
52 EXPECT_TRUE(DNT<DeclaratorDecl>().isBaseOf(DNT<ParmVarDecl>(), &Distance)); in TEST()
53 EXPECT_EQ(2u, Distance); in TEST()
/external/v8/src/x87/
Dmacro-assembler-x87.h88 Label::Distance if_equal_distance = Label::kFar) {
94 Label::Distance if_equal_distance = Label::kFar) {
102 Label::Distance if_not_equal_distance = Label::kFar) {
108 Label::Distance if_not_equal_distance = Label::kFar) {
137 Label::Distance condition_met_distance = Label::kFar);
141 Label::Distance condition_met_distance = Label::kFar);
146 Label::Distance distance = Label::kFar) {
153 Label::Distance distance = Label::kFar) {
159 Label* has_color, Label::Distance has_color_distance,
164 Label::Distance on_black_distance = Label::kFar);
[all …]
/external/v8/src/ia32/
Dmacro-assembler-ia32.h85 Label::Distance if_equal_distance = Label::kFar) {
91 Label::Distance if_equal_distance = Label::kFar) {
99 Label::Distance if_not_equal_distance = Label::kFar) {
105 Label::Distance if_not_equal_distance = Label::kFar) {
134 Label::Distance condition_met_distance = Label::kFar);
138 Label::Distance condition_met_distance = Label::kFar);
143 Label::Distance distance = Label::kFar) {
150 Label::Distance distance = Label::kFar) {
156 Label* has_color, Label::Distance has_color_distance,
161 Label::Distance on_black_distance = Label::kFar);
[all …]
/external/llvm/lib/Target/Hexagon/
DHexagonBranchRelaxation.cpp140 unsigned Distance = 0; in isJumpOutOfRange() local
159 Distance = std::abs((long long)InstOffset - BlockToInstOffset[TBB]) in isJumpOutOfRange()
161 return !HII->isJumpWithinBranchRange(&*FirstTerm, Distance); in isJumpOutOfRange()
172 Distance = std::abs((long long)InstOffset - BlockToInstOffset[FBB]) in isJumpOutOfRange()
174 return !HII->isJumpWithinBranchRange(&*SecondTerm, Distance); in isJumpOutOfRange()
/external/clang/lib/AST/
DASTTypeTraits.cpp42 bool ASTNodeKind::isBaseOf(ASTNodeKind Other, unsigned *Distance) const { in isBaseOf()
43 return isBaseOf(KindId, Other.KindId, Distance); in isBaseOf()
47 unsigned *Distance) { in isBaseOf() argument
54 if (Distance) in isBaseOf()
55 *Distance = Dist; in isBaseOf()
/external/vulkan-validation-layers/libs/glm/gtc/
Dulp.hpp69 GLM_FUNC_DECL genType next_float(genType const & x, uint const & Distance);
74 GLM_FUNC_DECL genType prev_float(genType const & x, uint const & Distance);
/external/v8/src/
Dlabel.h21 enum Distance { kNear, kFar }; enum
68 void link_to(int pos, Distance distance = kFar) {
/external/libcxx/include/experimental/
Dalgorithm26 template <class PopulationIterator, class SampleIterator, class Distance,
29 SampleIterator out, Distance n,
/external/llvm/include/llvm/Analysis/
DDependenceAnalysis.h107 const SCEV *Distance; // NULL implies no distance available. member
109 PeelLast(false), Splitable(false), Distance(nullptr) { } in DVEntry()
392 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind; enumerator
407 bool isDistance() const { return Kind == Distance; } in isDistance()
412 bool isLine() const { return Kind == Line || Kind == Distance; } in isLine()
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DExecutionDepsFix.cpp120 unsigned Distance; member in __anon16a38e880211::ExeDepsFix
172 dv->Dist = Distance; in Alloc()
422 dv->Dist = Distance; in visitSoftInstr()
456 Distance = 0; in runOnMachineFunction()
491 ++Distance; in runOnMachineFunction()
/external/llvm/lib/Analysis/
DLoopAccessAnalysis.cpp1100 bool MemoryDepChecker::couldPreventStoreLoadForward(uint64_t Distance, in couldPreventStoreLoadForward() argument
1124 if (Distance % VF && Distance / VF < NumItersForStoreLoadThroughMemory) { in couldPreventStoreLoadForward()
1131 DEBUG(dbgs() << "LAA: Distance " << Distance in couldPreventStoreLoadForward()
1148 static bool areStridedAccessesIndependent(uint64_t Distance, uint64_t Stride, in areStridedAccessesIndependent() argument
1152 assert(Distance > 0 && "The distance must be non-zero"); in areStridedAccessesIndependent()
1155 if (Distance % TypeByteSize) in areStridedAccessesIndependent()
1158 uint64_t ScaledDist = Distance / TypeByteSize; in areStridedAccessesIndependent()
1243 int64_t Distance = Val.getSExtValue(); in isDependent() local
1247 if (std::abs(Distance) > 0 && Stride > 1 && ATy == BTy && in isDependent()
1248 areStridedAccessesIndependent(std::abs(Distance), Stride, TypeByteSize)) { in isDependent()
[all …]
DDependenceAnalysis.cpp258 return DV[Level - 1].Distance; in getDistance()
316 assert((Kind == Line || Kind == Distance) && in getA()
325 assert((Kind == Line || Kind == Distance) && in getB()
334 assert((Kind == Line || Kind == Distance) && in getC()
343 assert(Kind == Distance && "Kind should be Distance"); in getD()
350 assert((Kind == Distance || Kind == Line || Kind == Point) && in getAssociatedLoop()
374 Kind = Distance; in setDistance()
592 const SCEV *Distance = getDistance(II); in dump() local
593 if (Distance) in dump()
594 OS << *Distance; in dump()
[all …]
/external/clang/lib/Basic/
DDiagnosticIDs.cpp580 unsigned Distance = O.getName().edit_distance(Group, true, BestDistance); in getNearestOption() local
581 if (Distance > BestDistance) in getNearestOption()
589 if (Distance == BestDistance) { in getNearestOption()
592 } else if (Distance < BestDistance) { in getNearestOption()
595 BestDistance = Distance; in getNearestOption()
/external/brotli/enc/
Dbit_cost.c29 #define FN(X) X ## Distance
Dcluster.h38 #define FN(X) X ## Distance
Dcluster.c48 #define FN(X) X ## Distance
Dhistogram.h40 #define FN(X) X ## Distance
/external/clang/lib/ASTMatchers/Dynamic/
DVariantValue.cpp43 unsigned Distance; in isConvertibleTo() local
44 if (!MatcherKind.isBaseOf(To.MatcherKind, &Distance)) in isConvertibleTo()
48 *Specificity = 100 - Distance; in isConvertibleTo()
/external/v8/src/s390/
Dassembler-s390.h773 void b(Condition cond, Label* l, Label::Distance dist = Label::kFar) {
778 void bc_short(Condition cond, Label* l, Label::Distance dist = Label::kFar) {
782 void beq(Label* l, Label::Distance dist = Label::kFar) { b(eq, l, dist); }
783 void bne(Label* l, Label::Distance dist = Label::kFar) { b(ne, l, dist); }
784 void blt(Label* l, Label::Distance dist = Label::kFar) { b(lt, l, dist); }
785 void ble(Label* l, Label::Distance dist = Label::kFar) { b(le, l, dist); }
786 void bgt(Label* l, Label::Distance dist = Label::kFar) { b(gt, l, dist); }
787 void bge(Label* l, Label::Distance dist = Label::kFar) { b(ge, l, dist); }
788 void b(Label* l, Label::Distance dist = Label::kFar) { b(al, l, dist); }
789 void jmp(Label* l, Label::Distance dist = Label::kFar) { b(al, l, dist); }
[all …]
/external/skia/src/shaders/gradients/
DSkTwoPointConicalGradient.h26 SkScalar getCenterX1() const { return SkPoint::Distance(fCenter1, fCenter2); } in getCenterX1()
/external/skia/src/core/
DSkPathMeasure.cpp241 SkScalar d = SkPoint::Distance(pts[0], pts[2]); in compute_quad_segs()
264 SkScalar d = SkPoint::Distance(minPt, maxPt); in compute_conic_segs()
288 SkScalar d = SkPoint::Distance(pts[0], pts[3]); in compute_cubic_segs()
332 SkScalar d = SkPoint::Distance(pts[0], pts[1]); in buildSegments()

1234567