Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
OpenDAS
vllm_cscc
Commits
cd0cd851
Unverified
Commit
cd0cd851
authored
Mar 17, 2025
by
Lu Fang
Committed by
GitHub
Mar 17, 2025
Browse files
[MISC] More AMD unused var clean up (#14926)
Signed-off-by:
Lu Fang
<
lufang@fb.com
>
parent
0a74bfce
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
4 additions
and
4 deletions
+4
-4
csrc/rocm/attention.cu
csrc/rocm/attention.cu
+4
-4
No files found.
csrc/rocm/attention.cu
View file @
cd0cd851
...
...
@@ -127,7 +127,7 @@ __device__ __forceinline__ T from_float(const float& inp) {
template
<
typename
T
>
__device__
__forceinline__
_B16x4
from_floatx4
(
const
floatx4
&
inp
)
{
union
tmpcvt
{
[[
maybe_unused
]]
union
tmpcvt
{
uint16_t
u
;
_Float16
f
;
__hip_bfloat16
b
;
...
...
@@ -160,7 +160,7 @@ __device__ __forceinline__ _B16x4 from_floatx4(const floatx4& inp) {
template
<
typename
T
>
__device__
__forceinline__
_B16x4
addx4
(
const
_B16x4
&
inp1
,
const
_B16x4
&
inp2
)
{
union
tmpcvt
{
[[
maybe_unused
]]
union
tmpcvt
{
uint16_t
u
;
_Float16
f
;
__hip_bfloat16
b
;
...
...
@@ -1273,9 +1273,9 @@ __launch_bounds__(NUM_THREADS) void paged_attention_ll4mi_reduce_kernel(
const
int
seq_idx
=
blockIdx
.
y
;
const
int
context_len
=
context_lens
[
seq_idx
];
const
int
num_partitions
=
DIVIDE_ROUND_UP
(
context_len
,
PARTITION_SIZE
);
constexpr
int
NUM_WARPS
=
NUM_THREADS
/
WARP_SIZE
;
[[
maybe_unused
]]
constexpr
int
NUM_WARPS
=
NUM_THREADS
/
WARP_SIZE
;
const
int
warpid
=
threadIdx
.
x
/
WARP_SIZE
;
const
int
laneid
=
threadIdx
.
x
%
WARP_SIZE
;
[[
maybe_unused
]]
const
int
laneid
=
threadIdx
.
x
%
WARP_SIZE
;
__shared__
float
shared_global_exp_sum
;
// max num partitions supported is warp_size * NPAR_LOOPS
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment