Home
last modified time | relevance | path

Searched refs:sum_nnz (Results 1 – 4 of 4) sorted by relevance

/external/tensorflow/tensorflow/core/kernels/
Dsparse_sparse_binary_op_shared.cc193 const int64 sum_nnz = a_augmented_values.size(); in Compute() local
196 ctx->allocate_output(0, TensorShape({sum_nnz, num_dims}), in Compute()
199 ctx, ctx->allocate_output(1, TensorShape({sum_nnz}), &output_values_t)); in Compute()
202 for (int64 i = 0; i < sum_nnz; ++i) { in Compute()
220 UnalignedTensorMap(a_augmented_values.data(), sum_nnz); in Compute()
222 UnalignedTensorMap(b_augmented_values.data(), sum_nnz); in Compute()
Dsparse_add_op.cc146 const int64 sum_nnz = out_values.size(); in Compute() local
149 ctx->allocate_output(0, TensorShape({sum_nnz, num_dims}), in Compute()
152 ctx, ctx->allocate_output(1, TensorShape({sum_nnz}), &out_values_t)); in Compute()
156 for (i = 0; i < sum_nnz; ++i) { in Compute()
162 std::copy_n(out_values.begin(), sum_nnz, &out_values_flat(0)); in Compute()
Dsparse_add_grad_op.cc70 const int64 sum_nnz = backprop_val_grad->NumElements(); in Compute() local
107 while (i < a_nnz && j < b_nnz && k < sum_nnz) { in Compute()
117 while (i < a_nnz && k < sum_nnz) { in Compute()
122 while (j < b_nnz && k < sum_nnz) { in Compute()
Dsparse_conditional_accumulator.h216 int64 sum_nnz = 0; in AddToAccumGradFunction() local
218 sum_nnz++; in AddToAccumGradFunction()
238 sum_nnz++; in AddToAccumGradFunction()
243 sum_nnz++; in AddToAccumGradFunction()
250 sum_indices_vec->reserve(sum_nnz); in AddToAccumGradFunction()
253 sum_counts->reserve(sum_nnz); in AddToAccumGradFunction()
259 sum_shape.set_dim(0, sum_nnz); in AddToAccumGradFunction()
272 for (i = 0; i < sum_nnz; ++i) { in AddToAccumGradFunction()