/external/tensorflow/tensorflow/core/util/ |
D | permutation_output_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 | 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/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/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/ |
D | HexagonBranchRelaxation.cpp | 156 unsigned Distance = 0; in isJumpOutOfRange() local 175 Distance = std::abs((long long)InstOffset - BlockToInstOffset[TBB]) in isJumpOutOfRange() 177 return !HII->isJumpWithinBranchRange(*FirstTerm, Distance); in isJumpOutOfRange() 188 Distance = std::abs((long long)InstOffset - BlockToInstOffset[FBB]) in isJumpOutOfRange() 190 return !HII->isJumpWithinBranchRange(*SecondTerm, Distance); in isJumpOutOfRange()
|
/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/grpc-grpc/examples/csharp/RouteGuide/RouteGuide/ |
D | RouteGuide.cs | 824 public int Distance { property in Routeguide.RouteSummary 860 if (Distance != other.Distance) return false; in Equals() 870 if (Distance != 0) hash ^= Distance.GetHashCode(); in GetHashCode() 893 if (Distance != 0) { in WriteTo() 895 output.WriteInt32(Distance); in WriteTo() 915 if (Distance != 0) { in CalculateSize() 916 size += 1 + pb::CodedOutputStream.ComputeInt32Size(Distance); in CalculateSize() 938 if (other.Distance != 0) { in MergeFrom() 939 Distance = other.Distance; in MergeFrom() 964 Distance = input.ReadInt32(); in MergeFrom()
|
/external/v8/src/ia32/ |
D | macro-assembler-ia32.h | 69 Label::Distance condition_met_distance = Label::kFar); 166 Label::Distance distance = Label::kFar) { 172 Label::Distance distance = Label::kFar) { 490 Label::Distance if_equal_distance = Label::kFar) { 495 Label::Distance if_equal_distance = Label::kFar) { 503 Label::Distance if_not_equal_distance = Label::kFar) { 509 Label::Distance if_not_equal_distance = Label::kFar) { 600 Label::Distance dst = Label::kFar); 619 Label::Distance distance = Label::kFar) { 625 Label::Distance distance = Label::kFar) { [all …]
|
/external/v8/src/x64/ |
D | macro-assembler-x64.h | 253 Label::Distance condition_met_distance = Label::kFar); 311 Label::Distance near_jump = Label::kFar); 548 Label::Distance if_equal_distance = Label::kFar) { 553 Label::Distance if_equal_distance = Label::kFar) { 561 Label::Distance if_not_equal_distance = Label::kFar) { 567 Label::Distance if_not_equal_distance = Label::kFar) { 672 Label::Distance near_jump = Label::kFar); 676 Label::Distance near_jump = Label::kFar); 754 Label::Distance dst = Label::kFar); 876 Label::Distance near_jump); [all …]
|
/external/v8/src/ |
D | label.h | 21 enum Distance { enum 88 void link_to(int pos, Distance distance = kFar) {
|
/external/skia/src/gpu/gradients/ |
D | GrTwoPointConicalGradientLayout.cpp | 181 if (SkScalarNearlyZero(SkPoint::Distance(center1, center2))) { in TestCreate() 186 if (SkScalarNearlyZero(SkPoint::Distance(center1, center2))) { in TestCreate() 194 radius2 = radius1 + SkPoint::Distance(center1, center2); in TestCreate() 208 SkScalarNearlyZero(SkPoint::Distance(center1, center2))) { in TestCreate()
|
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
D | DependenceAnalysis.h | 102 const SCEV *Distance; // NULL implies no distance available. member 104 PeelLast(false), Splitable(false), Distance(nullptr) { } in DVEntry() 382 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind; enumerator 397 bool isDistance() const { return Kind == Distance; } in isDistance() 402 bool isLine() const { return Kind == Line || Kind == Distance; } in isLine()
|
/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/skqp/src/gpu/gradients/ |
D | GrTwoPointConicalGradientLayout.cpp | 181 if (SkScalarNearlyZero(SkPoint::Distance(center1, center2))) { in TestCreate() 186 if (SkScalarNearlyZero(SkPoint::Distance(center1, center2))) { in TestCreate() 194 radius2 = radius1 + SkPoint::Distance(center1, center2); in TestCreate() 208 SkScalarNearlyZero(SkPoint::Distance(center1, center2))) { in TestCreate()
|
/external/llvm/lib/Analysis/ |
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 …]
|
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 …]
|
/external/swiftshader/third_party/llvm-7.0/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() 593 const SCEV *Distance = getDistance(II); in dump() local 594 if (Distance) in dump() 595 OS << *Distance; in dump() [all …]
|
D | LoopAccessAnalysis.cpp | 1276 bool MemoryDepChecker::couldPreventStoreLoadForward(uint64_t Distance, in couldPreventStoreLoadForward() argument 1300 if (Distance % VF && Distance / VF < NumItersForStoreLoadThroughMemory) { in couldPreventStoreLoadForward() 1308 dbgs() << "LAA: Distance " << Distance in couldPreventStoreLoadForward() 1392 static bool areStridedAccessesIndependent(uint64_t Distance, uint64_t Stride, in areStridedAccessesIndependent() argument 1396 assert(Distance > 0 && "The distance must be non-zero"); in areStridedAccessesIndependent() 1399 if (Distance % TypeByteSize) in areStridedAccessesIndependent() 1402 uint64_t ScaledDist = Distance / TypeByteSize; in areStridedAccessesIndependent() 1493 int64_t Distance = Val.getSExtValue(); in isDependent() local 1496 if (std::abs(Distance) > 0 && Stride > 1 && ATy == BTy && in isDependent() 1497 areStridedAccessesIndependent(std::abs(Distance), Stride, TypeByteSize)) { in isDependent() [all …]
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
D | ExecutionDepsFix.cpp | 120 unsigned Distance; member in __anon1b4d15520211::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/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/brotli/c/enc/ |
D | bit_cost.c | 29 #define FN(X) X ## Distance
|
D | cluster.h | 38 #define FN(X) X ## Distance
|