| /external/tensorflow/tensorflow/core/util/ |
| D | permutation_input_iterator.h | 72 template <typename Distance>
73 __host__ __device__ __forceinline__ self_type operator+(Distance n) const {
79 template <typename Distance>
80 __host__ __device__ __forceinline__ self_type& operator+=(Distance n) {
86 template <typename Distance>
87 __host__ __device__ __forceinline__ self_type operator-(Distance n) const {
93 template <typename Distance>
94 __host__ __device__ __forceinline__ self_type& operator-=(Distance n) {
106 template <typename Distance>
107 __host__ __device__ __forceinline__ reference operator[](Distance n) const {
|
| D | transform_output_iterator.h | 92 template <typename Distance>
93 __host__ __device__ __forceinline__ self_type operator+(Distance n) const {
99 template <typename Distance>
100 __host__ __device__ __forceinline__ self_type& operator+=(Distance n) {
106 template <typename Distance>
107 __host__ __device__ __forceinline__ self_type operator-(Distance n) const {
113 template <typename Distance>
114 __host__ __device__ __forceinline__ self_type& operator-=(Distance n) {
126 template <typename Distance>
127 __host__ __device__ __forceinline__ reference operator[](Distance n) const {
|
| /external/vulkan-validation-layers/libs/glm/gtx/ |
| D | extend.inl | 17 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;
|
| D | closest_point.inl | 28 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/ |
| D | macro-assembler-x64.h | 157 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 …]
|
| D | macro-assembler-x64.cc | 258 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/ |
| D | ASTTypeTraitsTest.cpp | 44 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/ |
| D | macro-assembler-x87.h | 88 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/ |
| D | macro-assembler-ia32.h | 85 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/ |
| D | HexagonBranchRelaxation.cpp | 140 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/ |
| D | ASTTypeTraits.cpp | 42 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/flatbuffers/tests/MyGame/Example/ |
| D | Ability.cs | 20 public uint Distance { get { return __p.bb.GetUint(__p.bb_pos + 4); } } property
23 public static Offset<Ability> CreateAbility(FlatBufferBuilder builder, uint Id, uint Distance) { in CreateAbility()
25 builder.PutUint(Distance); in CreateAbility()
|
| /external/vulkan-validation-layers/libs/glm/gtc/ |
| D | ulp.hpp | 69 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/ |
| D | label.h | 21 enum Distance { kNear, kFar }; enum
68 void link_to(int pos, Distance distance = kFar) {
|
| /external/llvm/lib/Analysis/ |
| D | DependenceAnalysis.cpp | 258 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 …]
|
| D | LoopAccessAnalysis.cpp | 1100 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 …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | DependenceAnalysis.h | 107 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/ |
| D | ExecutionDepsFix.cpp | 120 unsigned Distance; member in __anon97c1a3490211::ExeDepsFix
172 dv->Dist = Distance; in Alloc()
422 dv->Dist = Distance; in visitSoftInstr()
456 Distance = 0; in runOnMachineFunction()
491 ++Distance; in runOnMachineFunction()
|
| /external/clang/lib/Basic/ |
| D | DiagnosticIDs.cpp | 580 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/skia/src/shaders/gradients/ |
| D | SkTwoPointConicalGradient_gpu.cpp | 171 if (SkScalarNearlyZero(SkPoint::Distance(center1, center2))) { in TestCreate()
176 if (SkScalarNearlyZero(SkPoint::Distance(center1, center2))) { in TestCreate()
184 radius2 = radius1 + SkPoint::Distance(center1, center2); in TestCreate()
198 SkScalarNearlyZero(SkPoint::Distance(center1, center2))) { in TestCreate()
|
| /external/skqp/src/shaders/gradients/ |
| D | SkTwoPointConicalGradient_gpu.cpp | 171 if (SkScalarNearlyZero(SkPoint::Distance(center1, center2))) { in TestCreate()
176 if (SkScalarNearlyZero(SkPoint::Distance(center1, center2))) { in TestCreate()
184 radius2 = radius1 + SkPoint::Distance(center1, center2); in TestCreate()
198 SkScalarNearlyZero(SkPoint::Distance(center1, center2))) { in TestCreate()
|
| /external/clang/lib/ASTMatchers/Dynamic/ |
| D | VariantValue.cpp | 43 unsigned Distance; in isConvertibleTo() local
44 if (!MatcherKind.isBaseOf(To.MatcherKind, &Distance)) in isConvertibleTo()
48 *Specificity = 100 - Distance; in isConvertibleTo()
|
| /external/v8/src/s390/ |
| D | assembler-s390.h | 773 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/brotli/c/enc/ |
| D | bit_cost.c | 29 #define FN(X) X ## Distance
|
| D | cluster.h | 38 #define FN(X) X ## Distance
|