/external/libunwind_llvm/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/contrib/distributions/python/ops/bijectors/ |
D | permute.py | 87 def __init__(self, permutation, validate_args=False, name=None): argument 103 with ops.name_scope(name, "permute", values=[permutation]): 104 permutation = ops.convert_to_tensor( 105 permutation, 107 if not permutation.dtype.is_integer: 109 permutation.dtype.name)) 110 p = tensor_util.constant_value(permutation) 116 p, _ = nn_ops.top_k(-permutation, 117 k=array_ops.shape(permutation)[-1], 119 permutation = control_flow_ops.with_dependencies([ [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/tensorflow/tensorflow/compiler/tf2xla/lib/ |
D | data_format.cc | 32 std::vector<int64> permutation; in Contract() local 34 permutation.push_back(i); in Contract() 36 permutation.push_back(input_shape.rank() - 1); in Contract() 45 return xla::Reshape(xla::Transpose(input, permutation), contracted_shape); in Contract() 65 std::vector<int64> permutation; in Expand() local 67 permutation.push_back(i); in Expand() 72 permutation.push_back(dim + 1); in Expand() 74 return xla::Transpose(xla::Reshape(input, expanded_shape), permutation); in Expand()
|
/external/tensorflow/tensorflow/contrib/distributions/python/kernel_tests/bijectors/ |
D | permute_test.py | 44 permutation=permutation_ph, 53 bijector.permutation, 71 permutation=permutation_ph, 77 permutation = np.int32([2, 0, 1]) 79 y = x[..., permutation] 81 bijector = Permute(permutation=permutation, validate_args=True)
|
/external/tensorflow/tensorflow/compiler/xla/service/ |
D | gather_expander.cc | 41 std::vector<int64> permutation; in TransposeIndexVectorDimToLast() local 42 permutation.reserve(start_indices_shape.dimensions_size()); in TransposeIndexVectorDimToLast() 45 permutation.push_back(i); in TransposeIndexVectorDimToLast() 48 permutation.push_back(index_vector_dim); in TransposeIndexVectorDimToLast() 49 return MakeTransposeHlo(start_indices, permutation); in TransposeIndexVectorDimToLast() 255 std::vector<int64> permutation; in PermuteBatchAndOffsetDims() local 256 permutation.reserve(output_rank); in PermuteBatchAndOffsetDims() 263 permutation.push_back(offset_idx_counter++); in PermuteBatchAndOffsetDims() 265 permutation.push_back(batch_idx_counter++); in PermuteBatchAndOffsetDims() 269 return MakeTransposeHlo(accumulator, permutation); in PermuteBatchAndOffsetDims()
|
D | scatter_expander.cc | 43 std::vector<int64> permutation; in TransposeIndexVectorDimToLast() local 44 permutation.reserve(scatter_indices_shape.dimensions_size()); in TransposeIndexVectorDimToLast() 47 permutation.push_back(i); in TransposeIndexVectorDimToLast() 50 permutation.push_back(index_vector_dim); in TransposeIndexVectorDimToLast() 51 return MakeTransposeHlo(scatter_indices, permutation); in TransposeIndexVectorDimToLast() 96 std::vector<int64> permutation; in PermuteScatterAndWindowDims() local 98 permutation.reserve(updates_rank); in PermuteScatterAndWindowDims() 103 permutation.push_back(i); in PermuteScatterAndWindowDims() 107 permutation.push_back(window_dim); in PermuteScatterAndWindowDims() 110 return MakeTransposeHlo(updates, permutation); in PermuteScatterAndWindowDims()
|
/external/mesa3d/src/intel/compiler/ |
D | brw_fs_bank_conflicts.cpp | 733 struct permutation { struct 734 permutation() : v(NULL), size(0) {} in permutation() argument 736 permutation(unsigned n) : in permutation() function 739 permutation(const permutation &p) : in permutation() function 745 ~permutation() in ~permutation() argument 750 permutation & 751 operator=(permutation p) in operator =() argument 765 permutation 768 permutation map(p.num_atoms()); in identity_reg_permutation() 796 bank_characteristics(const permutation &map) in bank_characteristics() [all …]
|
/external/tensorflow/tensorflow/compiler/tf2xla/kernels/ |
D | batchtospace_op.cc | 85 std::vector<int64> permutation(reshaped_shape.size()); in BatchToSpace() local 86 permutation[0] = block_rank; in BatchToSpace() 88 permutation[1 + 2 * i] = block_rank + 1 + i; in BatchToSpace() 89 permutation[1 + 2 * i + 1] = i; in BatchToSpace() 91 std::iota(permutation.begin() + 1 + block_rank * 2, permutation.end(), in BatchToSpace() 93 xla::XlaOp permuted = xla::Transpose(reshaped, permutation); in BatchToSpace()
|
D | spacetobatch_op.cc | 115 std::vector<int64> permutation(reshaped_padded_shape.size()); in SpaceToBatch() local 117 permutation[i] = 1 + 2 * i + 1; in SpaceToBatch() 118 permutation[block_rank + 1 + i] = 1 + 2 * i; in SpaceToBatch() 120 permutation[block_rank] = 0; in SpaceToBatch() 121 std::iota(permutation.begin() + 1 + block_rank * 2, permutation.end(), in SpaceToBatch() 124 xla::Transpose(reshaped_padded, permutation); in SpaceToBatch()
|
/external/tensorflow/tensorflow/core/kernels/ |
D | transpose_op.cc | 112 std::vector<int32>* permutation) { in PermutationHelper() argument 123 *permutation = std::vector<int32>(perm_begin, perm_begin + dims); in PermutationHelper() 154 std::vector<int32> permutation; in Compute() local 157 OP_REQUIRES_OK(ctx, PermutationHelper<int32>(perm, dims, &permutation)); in Compute() 159 OP_REQUIRES_OK(ctx, PermutationHelper<int64>(perm, dims, &permutation)); in Compute() 167 const int32 d = permutation[i]; in Compute() 182 str_util::Join(permutation, ","), "}.")); in Compute() 190 input.shape(), permutation)) { in Compute() 201 OP_REQUIRES_OK(ctx, DoTranspose(ctx, input, permutation, output)); in Compute()
|
D | random_shuffle_op.cc | 52 std::vector<IntT> permutation(size); in IndexedShuffle() local 54 permutation[i] = i; in IndexedShuffle() 56 RandomShuffle(permutation.begin(), permutation.end(), uniform); in IndexedShuffle() 58 output_mat.template chip<0>(i) = input_mat.template chip<0>(permutation[i]); in IndexedShuffle()
|
D | sparse_cross_op.cc | 176 const std::vector<int>& permutation) const { in Generate() 180 for (int i = 0; i < permutation.size(); i++) { in Generate() 181 cross_vec[i] = columns_[i]->Feature(batch_index, permutation[i]); in Generate() 201 const std::vector<int>& permutation) const { in Generate() 204 for (size_t i = 0; i < permutation.size(); ++i) { in Generate() 205 uint64 hash_i = columns_[i]->Feature(batch_index, permutation[i]); in Generate() 244 std::vector<int> permutation(next_permutation_); in Next() local 260 return permutation; in Next() 335 const auto permutation = product_iterator.Next(); in Compute() local 336 updater.Update(b, cross_count, crosser.Generate(b, permutation)); in Compute()
|
/external/apache-commons-compress/src/main/java/org/apache/commons/compress/archivers/zip/ |
D | BinaryTree.java | 138 final int[] permutation = new int[originalBitLengths.length]; in decode() local 139 for (int k = 0; k < permutation.length; k++) { in decode() 140 permutation[k] = k; in decode() 154 permutation[c] = l; in decode() 174 codes[permutation[i]] = code; in decode()
|
/external/tensorflow/tensorflow/python/kernel_tests/ |
D | sparse_reorder_op_test.py | 41 def _SparseTensorValue_5x6(self, permutation): argument 46 ind = ind[permutation] 47 val = val[permutation] 85 input_val = self._SparseTensorValue_5x6(np.random.permutation(6)) 100 input_val = self._SparseTensorValue_5x6(np.random.permutation(6)) 113 input_val = self._SparseTensorValue_5x6(np.random.permutation(6))
|
D | sparse_tensors_map_ops_test.py | 52 def _SparseTensorValue_5x6(self, permutation): argument 57 ind = ind[permutation] 58 val = val[permutation] 63 def _SparseTensorValue_3x4(self, permutation): argument 68 ind = ind[permutation] 69 val = val[permutation]
|
/external/tensorflow/tensorflow/core/grappler/ |
D | utils.cc | 345 void PermuteNodesInPlace(GraphDef* graph, std::vector<int>* permutation, in PermuteNodesInPlace() argument 347 CHECK_EQ(graph->node_size(), permutation->size()); in PermuteNodesInPlace() 348 std::vector<int> inv_perm(permutation->size(), 0); in PermuteNodesInPlace() 350 for (size_t n = 0; n < permutation->size(); ++n) { in PermuteNodesInPlace() 351 inv_perm[(*permutation)[n]] = n; in PermuteNodesInPlace() 353 permutation->swap(inv_perm); in PermuteNodesInPlace() 355 for (std::size_t n = 0; n + 1 < permutation->size(); ++n) { in PermuteNodesInPlace() 356 while (n != (*permutation)[n]) { in PermuteNodesInPlace() 357 std::size_t r = (*permutation)[n]; in PermuteNodesInPlace() 359 std::swap((*permutation)[n], (*permutation)[r]); in PermuteNodesInPlace()
|
/external/tensorflow/tensorflow/contrib/layers/kernels/ |
D | sparse_feature_cross_kernel.cc | 176 const std::vector<int>& permutation) const { in Generate() 180 for (size_t i = 0; i < permutation.size(); i++) { in Generate() 181 cross_vec[i] = columns_[i]->Feature(batch_index, permutation[i]); in Generate() 201 const std::vector<int>& permutation) const { in Generate() 206 for (size_t i = 0; i < permutation.size(); ++i) { in Generate() 207 int64 hash_i = columns_[i]->Feature(batch_index, permutation[i]); in Generate() 236 const std::vector<int>& permutation) const { in Generate() 239 for (size_t i = 0; i < permutation.size(); ++i) { in Generate() 240 uint64 hash_i = columns_[i]->Feature(batch_index, permutation[i]); in Generate() 279 std::vector<int> permutation(next_permutation_); in Next() local [all …]
|
/external/tensorflow/tensorflow/core/api_def/base_api/ |
D | api_def_Lu.pbtxt | 25 packed into a single tensor, the permutation is applied to `input` instead of 26 the right hand side and the permutation `P` is returned as a list of indices 27 instead of a permutation matrix. 47 P represents a permutation matrix encoded as a list of indices each between `0` 48 and `M-1`, inclusive. If P_mat denotes the permutation matrix corresponding to
|
/external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
D | MatrixFunction.h | 206 …tion(const DynVectorType& blockStart, const DynVectorType& eivalToCluster, VectorType& permutation) in matrix_function_compute_permutation() argument 210 permutation.resize(eivalToCluster.rows()); in matrix_function_compute_permutation() 213 permutation[i] = indexNextEntry[cluster]; in matrix_function_compute_permutation() 220 void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, MatrixType& T) in matrix_function_permute_schur() argument 223 for (Index i = 0; i < permutation.rows() - 1; i++) { in matrix_function_permute_schur() 225 for (j = i; j < permutation.rows(); j++) { in matrix_function_permute_schur() 226 if (permutation(j) == i) break; in matrix_function_permute_schur() 228 eigen_assert(permutation(j) == i); in matrix_function_permute_schur() 235 std::swap(permutation.coeffRef(k), permutation.coeffRef(k+1)); in matrix_function_permute_schur() 452 Matrix<Index, Traits::RowsAtCompileTime, 1> permutation; [all …]
|
/external/tensorflow/tensorflow/compiler/xla/ |
D | util.cc | 80 bool IsPermutation(absl::Span<const int64> permutation, int64 rank) { in IsPermutation() argument 81 if (rank != permutation.size()) { in IsPermutation() 86 return absl::c_is_permutation(permutation, trivial_permutation); in IsPermutation() 109 bool IsIdentityPermutation(absl::Span<const int64> permutation) { in IsIdentityPermutation() argument 110 for (int64 i = 0; i < permutation.size(); ++i) { in IsIdentityPermutation() 111 if (permutation[i] != i) { in IsIdentityPermutation()
|
D | shape_util_test.cc | 698 std::vector<int64> permutation(3); in TEST() local 699 std::iota(permutation.begin(), permutation.end(), 0); in TEST() 702 absl::StrCat("permutation=", absl::StrJoin(permutation, ","))); in TEST() 707 s, ShapeUtil::PermuteDimensions(permutation, s), in TEST() 708 InversePermutation(permutation))); in TEST() 709 } while (std::next_permutation(permutation.begin(), permutation.end())); in TEST() 719 std::vector<int64> permutation(3); in TEST() local 720 std::iota(permutation.begin(), permutation.end(), 0); in TEST() 722 SCOPED_TRACE(absl::StrCat("permutation=", absl::StrJoin(permutation, ","))); in TEST() 724 auto permuted = ShapeUtil::PermuteDimensions(permutation, shape); in TEST() [all …]
|
/external/tensorflow/tensorflow/contrib/ignite/python/ops/ |
D | ignite_dataset_ops.py | 231 def __init__(self, name, type_id, fields=None, permutation=None): argument 243 self.permutation = permutation 303 def traversal_permutation_rec(self, permutation): argument 306 permutation.append(self) 308 for idx in self.permutation: 310 field.traversal_permutation_rec(permutation) 620 permutation = [children_sorted.index(child) for child in children] 625 return TypeTreeNode(field_name, type_id, children, permutation) 753 self.permutation = ops.convert_to_tensor( 766 self.schema, self.permutation)
|
/external/skqp/tests/ |
D | OpChainTest.cpp | 182 int permutation[kNumOps]; variable 184 permutation[i] = i; 198 std::swap(permutation[i], permutation[j]); 216 int value = permutation[i];
|