reduction_utils.cuh 2.39 KB
Newer Older
1
/*
2
3
 * Adapted from
 * https://github.com/NVIDIA/FasterTransformer/blob/release/v5.3_tag/src/fastertransformer/kernels/reduce_kernel_utils.cuh
Woosuk Kwon's avatar
Woosuk Kwon committed
4
 * Copyright (c) 2023, The vLLM team.
5
6
7
8
9
10
11
12
13
14
15
16
17
18
 * Copyright (c) 2020-2023, NVIDIA CORPORATION.  All rights reserved.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
Woosuk Kwon's avatar
Woosuk Kwon committed
19
20
#pragma once

21
22
#include "cuda_compat.h"

Woosuk Kwon's avatar
Woosuk Kwon committed
23
namespace vllm {
24
template <typename T, int numLanes = WARP_SIZE>
Woosuk Kwon's avatar
Woosuk Kwon committed
25
__inline__ __device__ T warpReduceSum(T val) {
26
27
28
  static_assert(numLanes > 0 && (numLanes & (numLanes - 1)) == 0,
                "numLanes is not a positive power of 2!");
  static_assert(numLanes <= WARP_SIZE);
29
#pragma unroll
30
  for (int mask = numLanes >> 1; mask > 0; mask >>= 1)
31
    val += VLLM_SHFL_XOR_SYNC(val, mask);
Woosuk Kwon's avatar
Woosuk Kwon committed
32
33
34
  return val;
}

35
36
37
38
// Helper function to return the next largest power of 2
static constexpr int _nextPow2(unsigned int num) {
  if (num <= 1) return num;
  return 1 << (CHAR_BIT * sizeof(num) - __builtin_clz(num - 1));
39
40
}

Woosuk Kwon's avatar
Woosuk Kwon committed
41
/* Calculate the sum of all elements in a block */
42
template <typename T, int maxBlockSize = 1024>
Woosuk Kwon's avatar
Woosuk Kwon committed
43
__inline__ __device__ T blockReduceSum(T val) {
44
45
46
  static_assert(maxBlockSize <= 1024);
  if constexpr (maxBlockSize > WARP_SIZE) {
    val = warpReduceSum<T>(val);
47
48
    // Calculates max number of lanes that need to participate in the last
    // warpReduce
49
50
51
52
    constexpr int maxActiveLanes = (maxBlockSize + WARP_SIZE - 1) / WARP_SIZE;
    static __shared__ T shared[maxActiveLanes];
    int lane = threadIdx.x % WARP_SIZE;
    int wid = threadIdx.x / WARP_SIZE;
53
    if (lane == 0) shared[wid] = val;
Woosuk Kwon's avatar
Woosuk Kwon committed
54

55
    __syncthreads();
Woosuk Kwon's avatar
Woosuk Kwon committed
56

57
58
    val = (threadIdx.x < blockDim.x / float(WARP_SIZE)) ? shared[lane]
                                                        : (T)(0.0f);
59
60
61
62
63
    val = warpReduceSum<T, _nextPow2(maxActiveLanes)>(val);
  } else {
    // A single warpReduce is equal to blockReduce
    val = warpReduceSum<T, _nextPow2(maxBlockSize)>(val);
  }
Woosuk Kwon's avatar
Woosuk Kwon committed
64
65
66
  return val;
}

67
}  // namespace vllm