-
Notifications
You must be signed in to change notification settings - Fork 94
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
add sparsity_csr remove_diagonal_elements kernel
- Loading branch information
Showing
14 changed files
with
346 additions
and
170 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,146 @@ | ||
| /*******************************<GINKGO LICENSE>****************************** | ||
| Copyright (c) 2017-2023, the Ginkgo authors | ||
| All rights reserved. | ||
| Redistribution and use in source and binary forms, with or without | ||
| modification, are permitted provided that the following conditions | ||
| are met: | ||
| 1. Redistributions of source code must retain the above copyright | ||
| notice, this list of conditions and the following disclaimer. | ||
| 2. Redistributions in binary form must reproduce the above copyright | ||
| notice, this list of conditions and the following disclaimer in the | ||
| documentation and/or other materials provided with the distribution. | ||
| 3. Neither the name of the copyright holder nor the names of its | ||
| contributors may be used to endorse or promote products derived from | ||
| this software without specific prior written permission. | ||
| THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS | ||
| IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED | ||
| TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A | ||
| PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | ||
| HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
| SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | ||
| LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | ||
| DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | ||
| THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | ||
| (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | ||
| OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | ||
| ******************************<GINKGO LICENSE>*******************************/ | ||
|
|
||
| #include "core/matrix/sparsity_csr_kernels.hpp" | ||
|
|
||
|
|
||
| #include <ginkgo/core/base/math.hpp> | ||
|
|
||
|
|
||
| #include "common/unified/base/kernel_launch.hpp" | ||
| #include "core/components/prefix_sum_kernels.hpp" | ||
|
|
||
|
|
||
| namespace gko { | ||
| namespace kernels { | ||
| namespace GKO_DEVICE_NAMESPACE { | ||
| /** | ||
| * @brief The SparsityCsr matrix format namespace. | ||
| * | ||
| * @ingroup sparsity_csr | ||
| */ | ||
| namespace sparsity_csr { | ||
|
|
||
|
|
||
| template <typename ValueType, typename IndexType> | ||
| void fill_in_dense(std::shared_ptr<const DefaultExecutor> exec, | ||
| const matrix::SparsityCsr<ValueType, IndexType>* input, | ||
| matrix::Dense<ValueType>* output) | ||
| { | ||
| run_kernel( | ||
| exec, | ||
| [] GKO_KERNEL(auto row, auto row_ptrs, auto col_idxs, auto value, | ||
| auto output) { | ||
| const auto begin = row_ptrs[row]; | ||
| const auto end = row_ptrs[row + 1]; | ||
| const auto val = *value; | ||
| for (auto nz = begin; nz < end; nz++) { | ||
| output(row, col_idxs[nz]) = val; | ||
| } | ||
| }, | ||
| input->get_size()[0], input->get_const_row_ptrs(), | ||
| input->get_const_col_idxs(), input->get_const_value(), output); | ||
| } | ||
|
|
||
| GKO_INSTANTIATE_FOR_EACH_VALUE_AND_INDEX_TYPE( | ||
| GKO_DECLARE_SPARSITY_CSR_FILL_IN_DENSE_KERNEL); | ||
|
|
||
|
|
||
| template <typename ValueType, typename IndexType> | ||
| void diagonal_element_prefix_sum( | ||
| std::shared_ptr<const DefaultExecutor> exec, | ||
| const matrix::SparsityCsr<ValueType, IndexType>* matrix, | ||
| IndexType* prefix_sum) | ||
| { | ||
| const auto num_rows = matrix->get_size()[0]; | ||
| run_kernel( | ||
| exec, | ||
| [] GKO_KERNEL(auto row, auto row_ptrs, auto col_idxs, auto prefix_sum) { | ||
| const auto begin = row_ptrs[row]; | ||
| const auto end = row_ptrs[row + 1]; | ||
| IndexType count = 0; | ||
| for (auto nz = begin; nz < end; nz++) { | ||
| if (col_idxs[nz] == row) { | ||
| count++; | ||
| } | ||
| } | ||
| prefix_sum[row] = count; | ||
| }, | ||
| num_rows, matrix->get_const_row_ptrs(), matrix->get_const_col_idxs(), | ||
| prefix_sum); | ||
| components::prefix_sum(exec, prefix_sum, num_rows + 1); | ||
| } | ||
|
|
||
| GKO_INSTANTIATE_FOR_EACH_VALUE_AND_INDEX_TYPE( | ||
| GKO_DECLARE_SPARSITY_CSR_DIAGONAL_ELEMENT_PREFIX_SUM_KERNEL); | ||
|
|
||
|
|
||
| template <typename ValueType, typename IndexType> | ||
| void remove_diagonal_elements(std::shared_ptr<const DefaultExecutor> exec, | ||
| const IndexType* row_ptrs, | ||
| const IndexType* col_idxs, | ||
| const IndexType* diag_prefix_sum, | ||
| matrix::SparsityCsr<ValueType, IndexType>* matrix) | ||
| { | ||
| const auto num_rows = matrix->get_size()[0]; | ||
| run_kernel( | ||
| exec, | ||
| [] GKO_KERNEL(auto row, auto in_row_ptrs, auto in_col_idxs, | ||
| auto diag_prefix_sum, auto out_row_ptrs, | ||
| auto out_col_idxs) { | ||
| const auto in_begin = in_row_ptrs[row]; | ||
| const auto in_end = in_row_ptrs[row + 1]; | ||
| auto out_idx = in_begin - diag_prefix_sum[row]; | ||
| for (auto nz = in_begin; nz < in_end; nz++) { | ||
| const auto col = in_col_idxs[nz]; | ||
| if (col != row) { | ||
| out_col_idxs[out_idx] = col; | ||
| out_idx++; | ||
| } | ||
| } | ||
| if (row == 0) { | ||
| out_row_ptrs[0] = 0; | ||
| } | ||
| out_row_ptrs[row + 1] = out_idx; | ||
| }, | ||
| num_rows, row_ptrs, col_idxs, diag_prefix_sum, matrix->get_row_ptrs(), | ||
| matrix->get_col_idxs()); | ||
| } | ||
|
|
||
| GKO_INSTANTIATE_FOR_EACH_VALUE_AND_INDEX_TYPE( | ||
| GKO_DECLARE_SPARSITY_CSR_REMOVE_DIAGONAL_ELEMENTS_KERNEL); | ||
|
|
||
|
|
||
| } // namespace sparsity_csr | ||
| } // namespace GKO_DEVICE_NAMESPACE | ||
| } // namespace kernels | ||
| } // namespace gko |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.