| /external/llvm-project/libunwind/src/ |
| D | CompactUnwinder.hpp | 127 uint32_t permutation = in stepWithCompactEncodingFrameless() local
139 permunreg[0] = permutation / 120; in stepWithCompactEncodingFrameless()
140 permutation -= (permunreg[0] * 120); in stepWithCompactEncodingFrameless()
141 permunreg[1] = permutation / 24; in stepWithCompactEncodingFrameless()
142 permutation -= (permunreg[1] * 24); in stepWithCompactEncodingFrameless()
143 permunreg[2] = permutation / 6; in stepWithCompactEncodingFrameless()
144 permutation -= (permunreg[2] * 6); in stepWithCompactEncodingFrameless()
145 permunreg[3] = permutation / 2; in stepWithCompactEncodingFrameless()
146 permutation -= (permunreg[3] * 2); in stepWithCompactEncodingFrameless()
147 permunreg[4] = permutation; in stepWithCompactEncodingFrameless()
[all …]
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| D | permutation_util.h | 31 bool IsPermutation(absl::Span<const int64> permutation);
41 const Container& input, absl::Span<const int64> permutation) { in Permute() argument
44 CHECK_EQ(permutation.size(), data.size()); in Permute()
45 CHECK(IsPermutation(permutation)); in Permute()
47 for (size_t i = 0; i < permutation.size(); ++i) { in Permute()
48 output[i] = data[permutation[i]]; in Permute()
60 const Container& input, absl::Span<const int64> permutation) { in PermuteInverse() argument
63 CHECK_EQ(permutation.size(), data.size()); in PermuteInverse()
64 CHECK(IsPermutation(permutation)); in PermuteInverse()
66 for (size_t i = 0; i < permutation.size(); ++i) { in PermuteInverse()
[all …]
|
| D | permutation_util.cc | 23 bool IsPermutation(absl::Span<const int64> permutation) { in IsPermutation() argument
24 absl::InlinedVector<bool, 8> seen(permutation.size(), false); in IsPermutation()
25 for (int64 p : permutation) { in IsPermutation()
26 if (p < 0 || p >= permutation.size() || seen[p]) { in IsPermutation()
55 bool IsIdentityPermutation(absl::Span<const int64> permutation) { in IsIdentityPermutation() argument
56 for (int64 i = 0; i < permutation.size(); ++i) { in IsIdentityPermutation()
57 if (permutation[i] != i) { in IsIdentityPermutation()
|
| /external/llvm-project/lldb/tools/compact-unwind/ |
| D | compact-unwind-dumper.c | 516 uint32_t permutation = in print_encoding_x86_64() local
561 permunreg[0] = permutation / 120; // 120 == 5! in print_encoding_x86_64()
562 permutation -= (permunreg[0] * 120); in print_encoding_x86_64()
563 permunreg[1] = permutation / 24; // 24 == 4! in print_encoding_x86_64()
564 permutation -= (permunreg[1] * 24); in print_encoding_x86_64()
565 permunreg[2] = permutation / 6; // 6 == 3! in print_encoding_x86_64()
566 permutation -= (permunreg[2] * 6); in print_encoding_x86_64()
567 permunreg[3] = permutation / 2; // 2 == 2! in print_encoding_x86_64()
568 permutation -= (permunreg[3] * 2); in print_encoding_x86_64()
569 permunreg[4] = permutation; // 1 == 1! in print_encoding_x86_64()
[all …]
|
| /external/llvm-project/lldb/source/Symbol/ |
| D | CompactUnwindInfo.cpp | 805 uint32_t permutation = EXTRACT_BITS( in CreateUnwindPlan_x86_64() local
867 permunreg[0] = permutation / 120; // 120 == 5! in CreateUnwindPlan_x86_64()
868 permutation -= (permunreg[0] * 120); in CreateUnwindPlan_x86_64()
869 permunreg[1] = permutation / 24; // 24 == 4! in CreateUnwindPlan_x86_64()
870 permutation -= (permunreg[1] * 24); in CreateUnwindPlan_x86_64()
871 permunreg[2] = permutation / 6; // 6 == 3! in CreateUnwindPlan_x86_64()
872 permutation -= (permunreg[2] * 6); in CreateUnwindPlan_x86_64()
873 permunreg[3] = permutation / 2; // 2 == 2! in CreateUnwindPlan_x86_64()
874 permutation -= (permunreg[3] * 2); in CreateUnwindPlan_x86_64()
875 permunreg[4] = permutation; // 1 == 1! in CreateUnwindPlan_x86_64()
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/ |
| D | LevenbergMarquardtEstimator.java | 125 private int[] permutation; field in LevenbergMarquardtEstimator
258 permutation = new int[cols]; in estimate()
289 int pk = permutation[k]; in estimate()
318 int pj = permutation[j]; in estimate()
345 int pj = permutation[j]; in estimate()
359 int pj = permutation[j]; in estimate()
385 int pj = permutation[j]; in estimate()
435 int pj = permutation[j]; in estimate()
503 lmDir[permutation[j]] = qy[j]; in determineLMParameter()
506 lmDir[permutation[j]] = 0; in determineLMParameter()
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
| D | LevenbergMarquardtOptimizer.java | 122 private int[] permutation; field in LevenbergMarquardtOptimizer
251 permutation = new int[cols]; in doOptimize()
289 int pk = permutation[k]; in doOptimize()
318 int pj = permutation[j]; in doOptimize()
346 int pj = permutation[j]; in doOptimize()
363 int pj = permutation[j]; in doOptimize()
388 int pj = permutation[j]; in doOptimize()
445 int pj = permutation[j]; in doOptimize()
510 lmDir[permutation[j]] = qy[j]; in determineLMParameter()
513 lmDir[permutation[j]] = 0; in determineLMParameter()
[all …]
|
| /external/llvm-project/mlir/test/Dialect/Affine/ |
| D | loop-permute.mlir | 1 // RUN: mlir-opt -allow-unregistered-dialect %s -test-loop-permutation="permutation-map=1,2,0" | Fi…
2 // RUN: mlir-opt -allow-unregistered-dialect %s -test-loop-permutation="permutation-map=1,0,2" | Fi…
3 // RUN: mlir-opt -allow-unregistered-dialect %s -test-loop-permutation="permutation-map=0,1,2" | Fi…
4 // RUN: mlir-opt -allow-unregistered-dialect %s -test-loop-permutation="permutation-map=0,2,1" | Fi…
5 // RUN: mlir-opt -allow-unregistered-dialect %s -test-loop-permutation="permutation-map=2,0,1" | Fi…
6 // RUN: mlir-opt -allow-unregistered-dialect %s -test-loop-permutation="permutation-map=2,1,0" | Fi…
|
| /external/deqp-deps/SPIRV-Tools/source/fuzz/ |
| D | transformation_permute_phi_operands.cpp | 29 uint32_t result_id, const std::vector<uint32_t>& permutation) { in TransformationPermutePhiOperands() argument
32 for (auto index : permutation) { in TransformationPermutePhiOperands()
48 if (static_cast<uint32_t>(message_.permutation().size()) != in IsApplicable()
55 std::vector<uint32_t> permutation(message_.permutation().begin(), in IsApplicable() local
56 message_.permutation().end()); in IsApplicable()
57 assert(!fuzzerutil::HasDuplicates(permutation) && in IsApplicable()
63 return permutation.empty() || in IsApplicable()
64 fuzzerutil::IsPermutationOfRange(permutation, 0, in IsApplicable()
76 for (auto index : message_.permutation()) { in Apply()
|
| D | transformation_permute_function_parameters.cpp | 33 const std::vector<uint32_t>& permutation) { in TransformationPermuteFunctionParameters() argument
37 for (auto index : permutation) { in TransformationPermuteFunctionParameters()
56 std::vector<uint32_t> permutation(message_.permutation().begin(), in IsApplicable() local
57 message_.permutation().end()); in IsApplicable()
63 if (static_cast<uint32_t>(permutation.size()) != arg_size) { in IsApplicable()
68 assert(!fuzzerutil::HasDuplicates(permutation) && in IsApplicable()
76 if (!permutation.empty() && in IsApplicable()
77 !fuzzerutil::IsPermutationOfRange(permutation, 0, arg_size - 1)) { in IsApplicable()
102 for (auto index : message_.permutation()) { in Apply()
122 for (auto index : message_.permutation()) { in Apply()
[all …]
|
| D | fuzzer_pass_permute_phi_operands.cpp | 55 std::vector<uint32_t> permutation(inst.NumInOperands() / 2); in Apply() local
56 std::iota(permutation.begin(), permutation.end(), 0); in Apply()
57 GetFuzzerContext()->Shuffle(&permutation); in Apply()
60 inst.result_id(), std::move(permutation))); in Apply()
|
| D | fuzzer_pass_permute_function_parameters.cpp | 61 std::vector<uint32_t> permutation(arg_size); in Apply() local
62 std::iota(permutation.begin(), permutation.end(), 0); in Apply()
63 GetFuzzerContext()->Shuffle(&permutation); in Apply()
67 function_id, GetFuzzerContext()->GetFreshId(), permutation)); in Apply()
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/source/fuzz/ |
| D | transformation_permute_phi_operands.cpp | 29 uint32_t result_id, const std::vector<uint32_t>& permutation) { in TransformationPermutePhiOperands() argument
32 for (auto index : permutation) { in TransformationPermutePhiOperands()
48 if (static_cast<uint32_t>(message_.permutation().size()) != in IsApplicable()
55 std::vector<uint32_t> permutation(message_.permutation().begin(), in IsApplicable() local
56 message_.permutation().end()); in IsApplicable()
57 assert(!fuzzerutil::HasDuplicates(permutation) && in IsApplicable()
63 return permutation.empty() || in IsApplicable()
64 fuzzerutil::IsPermutationOfRange(permutation, 0, in IsApplicable()
76 for (auto index : message_.permutation()) { in Apply()
|
| D | transformation_permute_function_parameters.cpp | 32 const std::vector<uint32_t>& permutation) { in TransformationPermuteFunctionParameters() argument
36 for (auto index : permutation) { in TransformationPermuteFunctionParameters()
55 std::vector<uint32_t> permutation(message_.permutation().begin(), in IsApplicable() local
56 message_.permutation().end()); in IsApplicable()
62 if (static_cast<uint32_t>(permutation.size()) != arg_size) { in IsApplicable()
67 assert(!fuzzerutil::HasDuplicates(permutation) && in IsApplicable()
75 if (!permutation.empty() && in IsApplicable()
76 !fuzzerutil::IsPermutationOfRange(permutation, 0, arg_size - 1)) { in IsApplicable()
101 for (auto index : message_.permutation()) { in Apply()
121 for (auto index : message_.permutation()) { in Apply()
[all …]
|
| D | fuzzer_pass_permute_phi_operands.cpp | 53 std::vector<uint32_t> permutation(inst.NumInOperands() / 2); in Apply() local
54 std::iota(permutation.begin(), permutation.end(), 0); in Apply()
55 GetFuzzerContext()->Shuffle(&permutation); in Apply()
58 inst.result_id(), std::move(permutation))); in Apply()
|
| D | fuzzer_pass_permute_function_parameters.cpp | 58 std::vector<uint32_t> permutation(arg_size); in Apply() local
59 std::iota(permutation.begin(), permutation.end(), 0); in Apply()
60 GetFuzzerContext()->Shuffle(&permutation); in Apply()
64 function_id, GetFuzzerContext()->GetFreshId(), permutation)); in Apply()
|
| /external/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| D | transformation_permute_phi_operands.cpp | 29 uint32_t result_id, const std::vector<uint32_t>& permutation) { in TransformationPermutePhiOperands() argument
32 for (auto index : permutation) { in TransformationPermutePhiOperands()
48 if (static_cast<uint32_t>(message_.permutation().size()) != in IsApplicable()
55 std::vector<uint32_t> permutation(message_.permutation().begin(), in IsApplicable() local
56 message_.permutation().end()); in IsApplicable()
57 assert(!fuzzerutil::HasDuplicates(permutation) && in IsApplicable()
63 return permutation.empty() || in IsApplicable()
64 fuzzerutil::IsPermutationOfRange(permutation, 0, in IsApplicable()
76 for (auto index : message_.permutation()) { in Apply()
|
| D | transformation_permute_function_parameters.cpp | 33 const std::vector<uint32_t>& permutation) { in TransformationPermuteFunctionParameters() argument
37 for (auto index : permutation) { in TransformationPermuteFunctionParameters()
56 std::vector<uint32_t> permutation(message_.permutation().begin(), in IsApplicable() local
57 message_.permutation().end()); in IsApplicable()
63 if (static_cast<uint32_t>(permutation.size()) != arg_size) { in IsApplicable()
68 assert(!fuzzerutil::HasDuplicates(permutation) && in IsApplicable()
76 if (!permutation.empty() && in IsApplicable()
77 !fuzzerutil::IsPermutationOfRange(permutation, 0, arg_size - 1)) { in IsApplicable()
102 for (auto index : message_.permutation()) { in Apply()
122 for (auto index : message_.permutation()) { in Apply()
[all …]
|
| D | fuzzer_pass_permute_phi_operands.cpp | 55 std::vector<uint32_t> permutation(inst.NumInOperands() / 2); in Apply() local
56 std::iota(permutation.begin(), permutation.end(), 0); in Apply()
57 GetFuzzerContext()->Shuffle(&permutation); in Apply()
60 inst.result_id(), std::move(permutation))); in Apply()
|
| D | fuzzer_pass_permute_function_parameters.cpp | 61 std::vector<uint32_t> permutation(arg_size); in Apply() local
62 std::iota(permutation.begin(), permutation.end(), 0); in Apply()
63 GetFuzzerContext()->Shuffle(&permutation); in Apply()
67 function_id, GetFuzzerContext()->GetFreshId(), permutation)); in Apply()
|
| /external/tensorflow/tensorflow/compiler/tf2xla/lib/ |
| D | data_format.cc | 34 std::vector<int64> permutation; in Contract() local
36 permutation.push_back(i); in Contract()
38 permutation.push_back(input_shape.rank() - 1); in Contract()
47 return xla::Reshape(xla::Transpose(input, permutation), contracted_shape); in Contract()
68 std::vector<int64> permutation; in Expand() local
70 permutation.push_back(i); in Expand()
75 permutation.push_back(dim + 1); in Expand()
77 return xla::Transpose(xla::Reshape(input, expanded_shape), permutation); in Expand()
|
| /external/tensorflow/tensorflow/python/kernel_tests/linalg/ |
| D | linear_operator_permutation_test.py | 28 from tensorflow.python.ops.linalg import linear_operator_permutation as permutation unknown
67 operator = permutation.LinearOperatorPermutation(
79 permutation.LinearOperatorPermutation(perm)
82 permutation.LinearOperatorPermutation(perm)
86 permutation.LinearOperatorPermutation(perm)
91 permutation.LinearOperatorPermutation(perm).to_dense(),
95 permutation.LinearOperatorPermutation(perm).to_dense(),
99 permutation.LinearOperatorPermutation(perm).to_dense(),
|
| /external/angle/src/tests/gl_tests/ |
| D | SwizzleTest.cpp | 51 swizzlePermutation permutation; in SwizzleTest() local
52 permutation.swizzleRed = r; in SwizzleTest()
53 permutation.swizzleGreen = g; in SwizzleTest()
54 permutation.swizzleBlue = b; in SwizzleTest()
55 permutation.swizzleAlpha = a; in SwizzleTest()
56 mPermutations.push_back(permutation); in SwizzleTest()
171 for (const auto &permutation : mPermutations) in runTest2D() local
173 glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_R, permutation.swizzleRed); in runTest2D()
174 glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_G, permutation.swizzleGreen); in runTest2D()
175 glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_B, permutation.swizzleBlue); in runTest2D()
[all …]
|
| /external/llvm-project/flang/runtime/ |
| D | descriptor.cpp | 159 SubscriptValue *subscript, const int *permutation) const { in IncrementSubscripts()
161 int k{permutation ? permutation[j] : j}; in IncrementSubscripts()
172 SubscriptValue *subscript, const int *permutation) const { in DecrementSubscripts()
174 int k{permutation ? permutation[j] : j}; in DecrementSubscripts()
185 const SubscriptValue *subscript, const int *permutation) const { in ZeroBasedElementNumber()
189 int k{permutation ? permutation[j] : j}; in ZeroBasedElementNumber()
198 std::size_t elementNumber, const int *permutation) const { in SubscriptsForZeroBasedElementNumber()
202 int k{permutation ? permutation[j] : j}; in SubscriptsForZeroBasedElementNumber()
211 int k{permutation ? permutation[j] : j}; in SubscriptsForZeroBasedElementNumber()
|
| /external/tensorflow/tensorflow/core/kernels/ |
| D | transpose_op.cc | 98 std::vector<int32>* permutation) { in PermutationHelper() argument
109 *permutation = std::vector<int32>(perm_begin, perm_begin + dims); in PermutationHelper()
140 std::vector<int32> permutation; in Compute() local
143 OP_REQUIRES_OK(ctx, PermutationHelper<int32>(perm, dims, &permutation)); in Compute()
145 OP_REQUIRES_OK(ctx, PermutationHelper<int64>(perm, dims, &permutation)); in Compute()
153 const int32 d = permutation[i]; in Compute()
167 absl::StrJoin(permutation, ","), "}.")); in Compute()
175 input.shape(), permutation)) { in Compute()
186 OP_REQUIRES_OK(ctx, DoTranspose(ctx, input, permutation, output)); in Compute()
|