google-research

1
// Copyright 2024 The Google Research Authors.
2
//
3
// Licensed under the Apache License, Version 2.0 (the "License");
4
// you may not use this file except in compliance with the License.
5
// You may obtain a copy of the License at
6
//
7
//     http://www.apache.org/licenses/LICENSE-2.0
8
//
9
// Unless required by applicable law or agreed to in writing, software
10
// distributed under the License is distributed on an "AS IS" BASIS,
11
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12
// See the License for the specific language governing permissions and
13
// limitations under the License.
14

15
#include "sparse/ops/cc/spmm_launcher.h"
16

17
namespace sgk {
18

19
// Simple CPU kernel launcher.
20
void LaunchSpmm(const Eigen::ThreadPoolDevice &d, int m, int k, int n,
21
                int nonzeros, const float *values, const int *row_indices,
22
                const int *row_offsets, const int *column_indices,
23
                const float *dense_matrix, const float *bias,
24
                float *output_matrix) {
25
  for (int i = 0; i < m; ++i) {
26
    for (int j = 0; j < n; ++j) {
27
      float accumulator = 0.0f;
28
      for (int l = row_offsets[i]; l < row_offsets[i + 1]; ++l) {
29
        int column_index = column_indices[l];
30
        accumulator += values[l] * dense_matrix[column_index * n + j];
31
      }
32
      // If we're passed a bias, we're running the fused kernel. Apply
33
      // the bias and ReLU.
34
      if (bias != nullptr) {
35
        accumulator += bias[i];
36
        accumulator = accumulator > 0 ? accumulator : 0;
37
      }
38
      output_matrix[i * n + j] = accumulator;
39
    }
40
  }
41
}
42

43
}  // namespace sgk
44