2019-10-09 00:16:26 +08:00
|
|
|
; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
|
2018-05-22 14:32:10 +08:00
|
|
|
; RUN: llc -march=amdgcn -mcpu=gfx900 -verify-machineinstrs < %s | FileCheck -enable-var-scope -check-prefixes=GCN,GFX9 %s
|
2020-02-01 01:49:00 +08:00
|
|
|
; RUN: llc -march=amdgcn -mcpu=tonga -verify-machineinstrs < %s | FileCheck -enable-var-scope -check-prefixes=GCN,VI,CIVI %s
|
|
|
|
; RUN: llc -march=amdgcn -mcpu=bonaire -verify-machineinstrs < %s | FileCheck -enable-var-scope -check-prefixes=GCN,CI,CIVI %s
|
2020-01-13 19:07:53 +08:00
|
|
|
; RUN: llc -march=amdgcn -mcpu=tonga -verify-machineinstrs < %s | FileCheck -enable-var-scope -check-prefixes=GCN,CIVI,VI %s
|
|
|
|
; RUN: llc -march=amdgcn -mcpu=bonaire -verify-machineinstrs < %s | FileCheck -enable-var-scope -check-prefixes=GCN,CIVI,CI %s
|
2017-02-28 06:15:25 +08:00
|
|
|
|
2017-03-22 05:39:51 +08:00
|
|
|
define amdgpu_kernel void @s_lshr_v2i16(<2 x i16> addrspace(1)* %out, <2 x i16> %lhs, <2 x i16> %rhs) #0 {
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-LABEL: s_lshr_v2i16:
|
|
|
|
; GFX9: ; %bb.0:
|
|
|
|
; GFX9-NEXT: s_load_dwordx2 s[2:3], s[0:1], 0x24
|
|
|
|
; GFX9-NEXT: s_load_dword s4, s[0:1], 0x2c
|
|
|
|
; GFX9-NEXT: s_load_dword s0, s[0:1], 0x30
|
|
|
|
; GFX9-NEXT: s_waitcnt lgkmcnt(0)
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; GFX9-NEXT: v_mov_b32_e32 v0, s4
|
|
|
|
; GFX9-NEXT: v_pk_lshrrev_b16 v2, s0, v0
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: v_mov_b32_e32 v0, s2
|
|
|
|
; GFX9-NEXT: v_mov_b32_e32 v1, s3
|
|
|
|
; GFX9-NEXT: global_store_dword v[0:1], v2, off
|
|
|
|
; GFX9-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; VI-LABEL: s_lshr_v2i16:
|
|
|
|
; VI: ; %bb.0:
|
|
|
|
; VI-NEXT: s_load_dwordx2 s[2:3], s[0:1], 0x24
|
|
|
|
; VI-NEXT: s_load_dword s5, s[0:1], 0x2c
|
|
|
|
; VI-NEXT: s_load_dword s0, s[0:1], 0x30
|
|
|
|
; VI-NEXT: s_mov_b32 s4, 0xffff
|
|
|
|
; VI-NEXT: s_waitcnt lgkmcnt(0)
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v0, s2
|
2020-01-13 19:07:53 +08:00
|
|
|
; VI-NEXT: s_lshr_b32 s1, s5, 16
|
|
|
|
; VI-NEXT: s_lshr_b32 s6, s0, 16
|
|
|
|
; VI-NEXT: s_lshr_b32 s1, s1, s6
|
|
|
|
; VI-NEXT: s_and_b32 s5, s5, s4
|
|
|
|
; VI-NEXT: s_and_b32 s0, s0, s4
|
|
|
|
; VI-NEXT: s_lshr_b32 s0, s5, s0
|
|
|
|
; VI-NEXT: s_lshl_b32 s1, s1, 16
|
|
|
|
; VI-NEXT: s_or_b32 s0, s0, s1
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: v_mov_b32_e32 v1, s3
|
2020-01-13 19:07:53 +08:00
|
|
|
; VI-NEXT: v_mov_b32_e32 v2, s0
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: flat_store_dword v[0:1], v2
|
|
|
|
; VI-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; CI-LABEL: s_lshr_v2i16:
|
|
|
|
; CI: ; %bb.0:
|
|
|
|
; CI-NEXT: s_load_dwordx2 s[4:5], s[0:1], 0x9
|
|
|
|
; CI-NEXT: s_load_dword s2, s[0:1], 0xb
|
|
|
|
; CI-NEXT: s_load_dword s0, s[0:1], 0xc
|
|
|
|
; CI-NEXT: s_mov_b32 s3, 0xffff
|
|
|
|
; CI-NEXT: s_mov_b32 s7, 0xf000
|
|
|
|
; CI-NEXT: s_mov_b32 s6, -1
|
|
|
|
; CI-NEXT: s_waitcnt lgkmcnt(0)
|
|
|
|
; CI-NEXT: s_lshr_b32 s1, s2, 16
|
|
|
|
; CI-NEXT: s_lshr_b32 s8, s0, 16
|
2020-01-13 19:07:53 +08:00
|
|
|
; CI-NEXT: s_lshr_b32 s1, s1, s8
|
|
|
|
; CI-NEXT: s_and_b32 s2, s2, s3
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_and_b32 s0, s0, s3
|
2020-01-13 19:07:53 +08:00
|
|
|
; CI-NEXT: s_lshr_b32 s0, s2, s0
|
|
|
|
; CI-NEXT: s_lshl_b32 s1, s1, 16
|
|
|
|
; CI-NEXT: s_or_b32 s0, s0, s1
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: v_mov_b32_e32 v0, s0
|
|
|
|
; CI-NEXT: buffer_store_dword v0, off, s[4:7], 0
|
|
|
|
; CI-NEXT: s_endpgm
|
2017-02-28 06:15:25 +08:00
|
|
|
%result = lshr <2 x i16> %lhs, %rhs
|
|
|
|
store <2 x i16> %result, <2 x i16> addrspace(1)* %out
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2017-03-22 05:39:51 +08:00
|
|
|
define amdgpu_kernel void @v_lshr_v2i16(<2 x i16> addrspace(1)* %out, <2 x i16> addrspace(1)* %in) #0 {
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-LABEL: v_lshr_v2i16:
|
|
|
|
; GFX9: ; %bb.0:
|
|
|
|
; GFX9-NEXT: s_load_dwordx4 s[0:3], s[0:1], 0x24
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: v_lshlrev_b32_e32 v0, 2, v0
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_waitcnt lgkmcnt(0)
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: global_load_dword v1, v0, s[2:3]
|
|
|
|
; GFX9-NEXT: global_load_dword v2, v0, s[2:3] offset:4
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_waitcnt vmcnt(0)
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: v_pk_lshrrev_b16 v1, v2, v1
|
|
|
|
; GFX9-NEXT: global_store_dword v0, v1, s[0:1]
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; VI-LABEL: v_lshr_v2i16:
|
|
|
|
; VI: ; %bb.0:
|
|
|
|
; VI-NEXT: s_load_dwordx4 s[0:3], s[0:1], 0x24
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: v_lshlrev_b32_e32 v4, 2, v0
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: s_waitcnt lgkmcnt(0)
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v1, s3
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: v_add_u32_e32 v0, vcc, s2, v4
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v1, vcc, 0, v1, vcc
|
|
|
|
; VI-NEXT: v_add_u32_e32 v2, vcc, 4, v0
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v3, vcc, 0, v1, vcc
|
|
|
|
; VI-NEXT: flat_load_dword v5, v[0:1]
|
|
|
|
; VI-NEXT: flat_load_dword v2, v[2:3]
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v1, s1
|
|
|
|
; VI-NEXT: v_add_u32_e32 v0, vcc, s0, v4
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: v_addc_u32_e32 v1, vcc, 0, v1, vcc
|
2020-10-16 15:09:38 +08:00
|
|
|
; VI-NEXT: s_waitcnt vmcnt(0)
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: v_lshrrev_b16_e32 v3, v2, v5
|
|
|
|
; VI-NEXT: v_lshrrev_b16_sdwa v2, v2, v5 dst_sel:WORD_1 dst_unused:UNUSED_PAD src0_sel:WORD_1 src1_sel:WORD_1
|
|
|
|
; VI-NEXT: v_or_b32_e32 v2, v3, v2
|
|
|
|
; VI-NEXT: flat_store_dword v[0:1], v2
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; CI-LABEL: v_lshr_v2i16:
|
|
|
|
; CI: ; %bb.0:
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: s_load_dwordx4 s[4:7], s[0:1], 0x9
|
|
|
|
; CI-NEXT: s_mov_b32 s3, 0xf000
|
|
|
|
; CI-NEXT: s_mov_b32 s2, 0
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: v_lshlrev_b32_e32 v0, 2, v0
|
|
|
|
; CI-NEXT: v_mov_b32_e32 v1, 0
|
|
|
|
; CI-NEXT: s_waitcnt lgkmcnt(0)
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: s_mov_b64 s[0:1], s[6:7]
|
|
|
|
; CI-NEXT: buffer_load_dword v2, v[0:1], s[0:3], 0 addr64
|
|
|
|
; CI-NEXT: buffer_load_dword v3, v[0:1], s[0:3], 0 addr64 offset:4
|
2020-01-07 23:43:46 +08:00
|
|
|
; CI-NEXT: s_mov_b32 s0, 0xffff
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: s_mov_b64 s[6:7], s[2:3]
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_waitcnt vmcnt(1)
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v4, 16, v2
|
|
|
|
; CI-NEXT: s_waitcnt vmcnt(0)
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v5, 16, v3
|
2020-01-07 23:43:46 +08:00
|
|
|
; CI-NEXT: v_and_b32_e32 v2, s0, v2
|
|
|
|
; CI-NEXT: v_and_b32_e32 v3, s0, v3
|
2020-02-01 01:49:00 +08:00
|
|
|
; CI-NEXT: v_lshr_b32_e32 v2, v2, v3
|
|
|
|
; CI-NEXT: v_lshr_b32_e32 v3, v4, v5
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: v_lshlrev_b32_e32 v3, 16, v3
|
|
|
|
; CI-NEXT: v_or_b32_e32 v2, v2, v3
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: buffer_store_dword v2, v[0:1], s[4:7], 0 addr64
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_endpgm
|
2017-02-28 06:15:25 +08:00
|
|
|
%tid = call i32 @llvm.amdgcn.workitem.id.x()
|
|
|
|
%tid.ext = sext i32 %tid to i64
|
|
|
|
%in.gep = getelementptr inbounds <2 x i16>, <2 x i16> addrspace(1)* %in, i64 %tid.ext
|
|
|
|
%out.gep = getelementptr inbounds <2 x i16>, <2 x i16> addrspace(1)* %out, i64 %tid.ext
|
|
|
|
%b_ptr = getelementptr <2 x i16>, <2 x i16> addrspace(1)* %in.gep, i32 1
|
|
|
|
%a = load <2 x i16>, <2 x i16> addrspace(1)* %in.gep
|
|
|
|
%b = load <2 x i16>, <2 x i16> addrspace(1)* %b_ptr
|
|
|
|
%result = lshr <2 x i16> %a, %b
|
|
|
|
store <2 x i16> %result, <2 x i16> addrspace(1)* %out.gep
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2017-03-22 05:39:51 +08:00
|
|
|
define amdgpu_kernel void @lshr_v_s_v2i16(<2 x i16> addrspace(1)* %out, <2 x i16> addrspace(1)* %in, <2 x i16> %sgpr) #0 {
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-LABEL: lshr_v_s_v2i16:
|
|
|
|
; GFX9: ; %bb.0:
|
|
|
|
; GFX9-NEXT: s_load_dwordx4 s[4:7], s[0:1], 0x24
|
|
|
|
; GFX9-NEXT: s_load_dword s0, s[0:1], 0x34
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: v_lshlrev_b32_e32 v0, 2, v0
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_waitcnt lgkmcnt(0)
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: global_load_dword v1, v0, s[6:7]
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_waitcnt vmcnt(0)
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: v_pk_lshrrev_b16 v1, s0, v1
|
|
|
|
; GFX9-NEXT: global_store_dword v0, v1, s[4:5]
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; VI-LABEL: lshr_v_s_v2i16:
|
|
|
|
; VI: ; %bb.0:
|
|
|
|
; VI-NEXT: s_load_dwordx4 s[4:7], s[0:1], 0x24
|
|
|
|
; VI-NEXT: s_load_dword s0, s[0:1], 0x34
|
2020-01-14 06:54:17 +08:00
|
|
|
; VI-NEXT: v_lshlrev_b32_e32 v2, 2, v0
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: s_waitcnt lgkmcnt(0)
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v1, s7
|
|
|
|
; VI-NEXT: v_add_u32_e32 v0, vcc, s6, v2
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v1, vcc, 0, v1, vcc
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: flat_load_dword v3, v[0:1]
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: s_lshr_b32 s1, s0, 16
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: v_add_u32_e32 v0, vcc, s4, v2
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v2, s1
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v1, s5
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v1, vcc, 0, v1, vcc
|
2020-10-16 15:09:38 +08:00
|
|
|
; VI-NEXT: s_waitcnt vmcnt(0)
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: v_lshrrev_b16_e32 v4, s0, v3
|
|
|
|
; VI-NEXT: v_lshrrev_b16_sdwa v2, v2, v3 dst_sel:WORD_1 dst_unused:UNUSED_PAD src0_sel:DWORD src1_sel:WORD_1
|
|
|
|
; VI-NEXT: v_or_b32_e32 v2, v4, v2
|
|
|
|
; VI-NEXT: flat_store_dword v[0:1], v2
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; CI-LABEL: lshr_v_s_v2i16:
|
|
|
|
; CI: ; %bb.0:
|
|
|
|
; CI-NEXT: s_load_dwordx4 s[4:7], s[0:1], 0x9
|
2020-01-07 23:43:46 +08:00
|
|
|
; CI-NEXT: s_load_dword s8, s[0:1], 0xd
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_mov_b32 s3, 0xf000
|
|
|
|
; CI-NEXT: s_mov_b32 s2, 0
|
|
|
|
; CI-NEXT: v_lshlrev_b32_e32 v0, 2, v0
|
|
|
|
; CI-NEXT: s_waitcnt lgkmcnt(0)
|
|
|
|
; CI-NEXT: s_mov_b64 s[0:1], s[6:7]
|
|
|
|
; CI-NEXT: v_mov_b32_e32 v1, 0
|
|
|
|
; CI-NEXT: buffer_load_dword v2, v[0:1], s[0:3], 0 addr64
|
2020-01-07 23:43:46 +08:00
|
|
|
; CI-NEXT: s_mov_b32 s0, 0xffff
|
|
|
|
; CI-NEXT: s_lshr_b32 s1, s8, 16
|
|
|
|
; CI-NEXT: s_and_b32 s8, s8, s0
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_mov_b64 s[6:7], s[2:3]
|
|
|
|
; CI-NEXT: s_waitcnt vmcnt(0)
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v3, 16, v2
|
2020-01-07 23:43:46 +08:00
|
|
|
; CI-NEXT: v_and_b32_e32 v2, s0, v2
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v3, s1, v3
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v2, s8, v2
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: v_lshlrev_b32_e32 v3, 16, v3
|
|
|
|
; CI-NEXT: v_or_b32_e32 v2, v2, v3
|
|
|
|
; CI-NEXT: buffer_store_dword v2, v[0:1], s[4:7], 0 addr64
|
|
|
|
; CI-NEXT: s_endpgm
|
2017-02-28 06:15:25 +08:00
|
|
|
%tid = call i32 @llvm.amdgcn.workitem.id.x()
|
|
|
|
%tid.ext = sext i32 %tid to i64
|
|
|
|
%in.gep = getelementptr inbounds <2 x i16>, <2 x i16> addrspace(1)* %in, i64 %tid.ext
|
|
|
|
%out.gep = getelementptr inbounds <2 x i16>, <2 x i16> addrspace(1)* %out, i64 %tid.ext
|
|
|
|
%vgpr = load <2 x i16>, <2 x i16> addrspace(1)* %in.gep
|
|
|
|
%result = lshr <2 x i16> %vgpr, %sgpr
|
|
|
|
store <2 x i16> %result, <2 x i16> addrspace(1)* %out.gep
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2017-03-22 05:39:51 +08:00
|
|
|
define amdgpu_kernel void @lshr_s_v_v2i16(<2 x i16> addrspace(1)* %out, <2 x i16> addrspace(1)* %in, <2 x i16> %sgpr) #0 {
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-LABEL: lshr_s_v_v2i16:
|
|
|
|
; GFX9: ; %bb.0:
|
|
|
|
; GFX9-NEXT: s_load_dwordx4 s[4:7], s[0:1], 0x24
|
|
|
|
; GFX9-NEXT: s_load_dword s0, s[0:1], 0x34
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: v_lshlrev_b32_e32 v0, 2, v0
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_waitcnt lgkmcnt(0)
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: global_load_dword v1, v0, s[6:7]
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_waitcnt vmcnt(0)
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: v_pk_lshrrev_b16 v1, v1, s0
|
|
|
|
; GFX9-NEXT: global_store_dword v0, v1, s[4:5]
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; VI-LABEL: lshr_s_v_v2i16:
|
|
|
|
; VI: ; %bb.0:
|
|
|
|
; VI-NEXT: s_load_dwordx4 s[4:7], s[0:1], 0x24
|
|
|
|
; VI-NEXT: s_load_dword s0, s[0:1], 0x34
|
2020-01-14 06:54:17 +08:00
|
|
|
; VI-NEXT: v_lshlrev_b32_e32 v2, 2, v0
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: s_waitcnt lgkmcnt(0)
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v1, s7
|
|
|
|
; VI-NEXT: v_add_u32_e32 v0, vcc, s6, v2
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v1, vcc, 0, v1, vcc
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: flat_load_dword v3, v[0:1]
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: s_lshr_b32 s1, s0, 16
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: v_add_u32_e32 v0, vcc, s4, v2
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v2, s1
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v1, s5
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v1, vcc, 0, v1, vcc
|
2020-10-16 15:09:38 +08:00
|
|
|
; VI-NEXT: s_waitcnt vmcnt(0)
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: v_lshrrev_b16_e64 v4, v3, s0
|
|
|
|
; VI-NEXT: v_lshrrev_b16_sdwa v2, v3, v2 dst_sel:WORD_1 dst_unused:UNUSED_PAD src0_sel:WORD_1 src1_sel:DWORD
|
|
|
|
; VI-NEXT: v_or_b32_e32 v2, v4, v2
|
|
|
|
; VI-NEXT: flat_store_dword v[0:1], v2
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; CI-LABEL: lshr_s_v_v2i16:
|
|
|
|
; CI: ; %bb.0:
|
|
|
|
; CI-NEXT: s_load_dwordx4 s[4:7], s[0:1], 0x9
|
2020-01-07 23:43:46 +08:00
|
|
|
; CI-NEXT: s_load_dword s8, s[0:1], 0xd
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_mov_b32 s3, 0xf000
|
|
|
|
; CI-NEXT: s_mov_b32 s2, 0
|
|
|
|
; CI-NEXT: v_lshlrev_b32_e32 v0, 2, v0
|
|
|
|
; CI-NEXT: s_waitcnt lgkmcnt(0)
|
|
|
|
; CI-NEXT: s_mov_b64 s[0:1], s[6:7]
|
|
|
|
; CI-NEXT: v_mov_b32_e32 v1, 0
|
|
|
|
; CI-NEXT: buffer_load_dword v2, v[0:1], s[0:3], 0 addr64
|
2020-01-07 23:43:46 +08:00
|
|
|
; CI-NEXT: s_mov_b32 s0, 0xffff
|
|
|
|
; CI-NEXT: s_lshr_b32 s1, s8, 16
|
|
|
|
; CI-NEXT: s_and_b32 s8, s8, s0
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_mov_b64 s[6:7], s[2:3]
|
|
|
|
; CI-NEXT: s_waitcnt vmcnt(0)
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v3, 16, v2
|
2020-01-07 23:43:46 +08:00
|
|
|
; CI-NEXT: v_and_b32_e32 v2, s0, v2
|
|
|
|
; CI-NEXT: v_lshr_b32_e32 v3, s1, v3
|
|
|
|
; CI-NEXT: v_lshr_b32_e32 v2, s8, v2
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: v_lshlrev_b32_e32 v3, 16, v3
|
|
|
|
; CI-NEXT: v_or_b32_e32 v2, v2, v3
|
|
|
|
; CI-NEXT: buffer_store_dword v2, v[0:1], s[4:7], 0 addr64
|
|
|
|
; CI-NEXT: s_endpgm
|
2017-02-28 06:15:25 +08:00
|
|
|
%tid = call i32 @llvm.amdgcn.workitem.id.x()
|
|
|
|
%tid.ext = sext i32 %tid to i64
|
|
|
|
%in.gep = getelementptr inbounds <2 x i16>, <2 x i16> addrspace(1)* %in, i64 %tid.ext
|
|
|
|
%out.gep = getelementptr inbounds <2 x i16>, <2 x i16> addrspace(1)* %out, i64 %tid.ext
|
|
|
|
%vgpr = load <2 x i16>, <2 x i16> addrspace(1)* %in.gep
|
|
|
|
%result = lshr <2 x i16> %sgpr, %vgpr
|
|
|
|
store <2 x i16> %result, <2 x i16> addrspace(1)* %out.gep
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2017-03-22 05:39:51 +08:00
|
|
|
define amdgpu_kernel void @lshr_imm_v_v2i16(<2 x i16> addrspace(1)* %out, <2 x i16> addrspace(1)* %in) #0 {
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-LABEL: lshr_imm_v_v2i16:
|
|
|
|
; GFX9: ; %bb.0:
|
|
|
|
; GFX9-NEXT: s_load_dwordx4 s[0:3], s[0:1], 0x24
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: v_lshlrev_b32_e32 v0, 2, v0
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_waitcnt lgkmcnt(0)
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: global_load_dword v1, v0, s[2:3]
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_waitcnt vmcnt(0)
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: v_pk_lshrrev_b16 v1, v1, 8 op_sel_hi:[1,0]
|
|
|
|
; GFX9-NEXT: global_store_dword v0, v1, s[0:1]
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; VI-LABEL: lshr_imm_v_v2i16:
|
|
|
|
; VI: ; %bb.0:
|
|
|
|
; VI-NEXT: s_load_dwordx4 s[0:3], s[0:1], 0x24
|
|
|
|
; VI-NEXT: v_lshlrev_b32_e32 v2, 2, v0
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; VI-NEXT: v_mov_b32_e32 v4, 8
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: s_waitcnt lgkmcnt(0)
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v1, s3
|
|
|
|
; VI-NEXT: v_add_u32_e32 v0, vcc, s2, v2
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v1, vcc, 0, v1, vcc
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: flat_load_dword v3, v[0:1]
|
|
|
|
; VI-NEXT: v_add_u32_e32 v0, vcc, s0, v2
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v1, s1
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v1, vcc, 0, v1, vcc
|
2020-10-16 15:09:38 +08:00
|
|
|
; VI-NEXT: s_waitcnt vmcnt(0)
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: v_lshrrev_b16_e64 v2, v3, 8
|
|
|
|
; VI-NEXT: v_lshrrev_b16_sdwa v3, v3, v4 dst_sel:WORD_1 dst_unused:UNUSED_PAD src0_sel:WORD_1 src1_sel:DWORD
|
|
|
|
; VI-NEXT: v_or_b32_e32 v2, v2, v3
|
|
|
|
; VI-NEXT: flat_store_dword v[0:1], v2
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; CI-LABEL: lshr_imm_v_v2i16:
|
|
|
|
; CI: ; %bb.0:
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: s_load_dwordx4 s[4:7], s[0:1], 0x9
|
|
|
|
; CI-NEXT: s_mov_b32 s3, 0xf000
|
|
|
|
; CI-NEXT: s_mov_b32 s2, 0
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: v_lshlrev_b32_e32 v0, 2, v0
|
|
|
|
; CI-NEXT: v_mov_b32_e32 v1, 0
|
|
|
|
; CI-NEXT: s_waitcnt lgkmcnt(0)
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: s_mov_b64 s[0:1], s[6:7]
|
|
|
|
; CI-NEXT: buffer_load_dword v2, v[0:1], s[0:3], 0 addr64
|
|
|
|
; CI-NEXT: s_mov_b64 s[6:7], s[2:3]
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_waitcnt vmcnt(0)
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v3, 16, v2
|
|
|
|
; CI-NEXT: v_and_b32_e32 v2, 0xffff, v2
|
|
|
|
; CI-NEXT: v_lshr_b32_e32 v3, 8, v3
|
2020-01-13 19:07:53 +08:00
|
|
|
; CI-NEXT: v_lshr_b32_e32 v2, 8, v2
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: v_lshlrev_b32_e32 v3, 16, v3
|
|
|
|
; CI-NEXT: v_or_b32_e32 v2, v2, v3
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: buffer_store_dword v2, v[0:1], s[4:7], 0 addr64
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_endpgm
|
2017-02-28 06:15:25 +08:00
|
|
|
%tid = call i32 @llvm.amdgcn.workitem.id.x()
|
|
|
|
%tid.ext = sext i32 %tid to i64
|
|
|
|
%in.gep = getelementptr inbounds <2 x i16>, <2 x i16> addrspace(1)* %in, i64 %tid.ext
|
|
|
|
%out.gep = getelementptr inbounds <2 x i16>, <2 x i16> addrspace(1)* %out, i64 %tid.ext
|
|
|
|
%vgpr = load <2 x i16>, <2 x i16> addrspace(1)* %in.gep
|
|
|
|
%result = lshr <2 x i16> <i16 8, i16 8>, %vgpr
|
|
|
|
store <2 x i16> %result, <2 x i16> addrspace(1)* %out.gep
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2017-03-22 05:39:51 +08:00
|
|
|
define amdgpu_kernel void @lshr_v_imm_v2i16(<2 x i16> addrspace(1)* %out, <2 x i16> addrspace(1)* %in) #0 {
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-LABEL: lshr_v_imm_v2i16:
|
|
|
|
; GFX9: ; %bb.0:
|
|
|
|
; GFX9-NEXT: s_load_dwordx4 s[0:3], s[0:1], 0x24
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: v_lshlrev_b32_e32 v0, 2, v0
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_waitcnt lgkmcnt(0)
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: global_load_dword v1, v0, s[2:3]
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_waitcnt vmcnt(0)
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: v_pk_lshrrev_b16 v1, 8, v1 op_sel_hi:[0,1]
|
|
|
|
; GFX9-NEXT: global_store_dword v0, v1, s[0:1]
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; VI-LABEL: lshr_v_imm_v2i16:
|
|
|
|
; VI: ; %bb.0:
|
|
|
|
; VI-NEXT: s_load_dwordx4 s[0:3], s[0:1], 0x24
|
|
|
|
; VI-NEXT: v_lshlrev_b32_e32 v2, 2, v0
|
|
|
|
; VI-NEXT: s_waitcnt lgkmcnt(0)
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v1, s3
|
|
|
|
; VI-NEXT: v_add_u32_e32 v0, vcc, s2, v2
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v1, vcc, 0, v1, vcc
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; VI-NEXT: flat_load_dword v0, v[0:1]
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v3, s1
|
|
|
|
; VI-NEXT: v_add_u32_e32 v2, vcc, s0, v2
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v3, vcc, 0, v3, vcc
|
2020-10-16 15:09:38 +08:00
|
|
|
; VI-NEXT: s_waitcnt vmcnt(0)
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; VI-NEXT: v_lshrrev_b32_e32 v1, 24, v0
|
|
|
|
; VI-NEXT: v_lshlrev_b32_e32 v1, 16, v1
|
|
|
|
; VI-NEXT: v_or_b32_sdwa v0, v0, v1 dst_sel:DWORD dst_unused:UNUSED_PAD src0_sel:BYTE_1 src1_sel:DWORD
|
|
|
|
; VI-NEXT: flat_store_dword v[2:3], v0
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; CI-LABEL: lshr_v_imm_v2i16:
|
|
|
|
; CI: ; %bb.0:
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: s_load_dwordx4 s[4:7], s[0:1], 0x9
|
|
|
|
; CI-NEXT: s_mov_b32 s3, 0xf000
|
|
|
|
; CI-NEXT: s_mov_b32 s2, 0
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: v_lshlrev_b32_e32 v0, 2, v0
|
|
|
|
; CI-NEXT: v_mov_b32_e32 v1, 0
|
|
|
|
; CI-NEXT: s_waitcnt lgkmcnt(0)
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: s_mov_b64 s[0:1], s[6:7]
|
|
|
|
; CI-NEXT: buffer_load_dword v2, v[0:1], s[0:3], 0 addr64
|
|
|
|
; CI-NEXT: s_mov_b64 s[6:7], s[2:3]
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_waitcnt vmcnt(0)
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v2, 8, v2
|
|
|
|
; CI-NEXT: v_and_b32_e32 v2, 0xff00ff, v2
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: buffer_store_dword v2, v[0:1], s[4:7], 0 addr64
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_endpgm
|
2017-02-28 06:15:25 +08:00
|
|
|
%tid = call i32 @llvm.amdgcn.workitem.id.x()
|
|
|
|
%tid.ext = sext i32 %tid to i64
|
|
|
|
%in.gep = getelementptr inbounds <2 x i16>, <2 x i16> addrspace(1)* %in, i64 %tid.ext
|
|
|
|
%out.gep = getelementptr inbounds <2 x i16>, <2 x i16> addrspace(1)* %out, i64 %tid.ext
|
|
|
|
%vgpr = load <2 x i16>, <2 x i16> addrspace(1)* %in.gep
|
|
|
|
%result = lshr <2 x i16> %vgpr, <i16 8, i16 8>
|
|
|
|
store <2 x i16> %result, <2 x i16> addrspace(1)* %out.gep
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2017-03-22 05:39:51 +08:00
|
|
|
define amdgpu_kernel void @v_lshr_v4i16(<4 x i16> addrspace(1)* %out, <4 x i16> addrspace(1)* %in) #0 {
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-LABEL: v_lshr_v4i16:
|
|
|
|
; GFX9: ; %bb.0:
|
|
|
|
; GFX9-NEXT: s_load_dwordx4 s[0:3], s[0:1], 0x24
|
2020-01-07 23:43:46 +08:00
|
|
|
; GFX9-NEXT: v_lshlrev_b32_e32 v4, 3, v0
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_waitcnt lgkmcnt(0)
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: global_load_dwordx2 v[0:1], v4, s[2:3]
|
|
|
|
; GFX9-NEXT: global_load_dwordx2 v[2:3], v4, s[2:3] offset:8
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_waitcnt vmcnt(0)
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: v_pk_lshrrev_b16 v1, v3, v1
|
|
|
|
; GFX9-NEXT: v_pk_lshrrev_b16 v0, v2, v0
|
|
|
|
; GFX9-NEXT: global_store_dwordx2 v4, v[0:1], s[0:1]
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; VI-LABEL: v_lshr_v4i16:
|
|
|
|
; VI: ; %bb.0:
|
|
|
|
; VI-NEXT: s_load_dwordx4 s[0:3], s[0:1], 0x24
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: v_lshlrev_b32_e32 v4, 3, v0
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: s_waitcnt lgkmcnt(0)
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v1, s3
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: v_add_u32_e32 v0, vcc, s2, v4
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: v_addc_u32_e32 v1, vcc, 0, v1, vcc
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: v_add_u32_e32 v2, vcc, 8, v0
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v3, vcc, 0, v1, vcc
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: flat_load_dwordx2 v[0:1], v[0:1]
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: flat_load_dwordx2 v[2:3], v[2:3]
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v5, s1
|
|
|
|
; VI-NEXT: v_add_u32_e32 v4, vcc, s0, v4
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v5, vcc, 0, v5, vcc
|
2020-10-16 15:09:38 +08:00
|
|
|
; VI-NEXT: s_waitcnt vmcnt(0)
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: v_lshrrev_b16_e32 v6, v3, v1
|
|
|
|
; VI-NEXT: v_lshrrev_b16_sdwa v1, v3, v1 dst_sel:WORD_1 dst_unused:UNUSED_PAD src0_sel:WORD_1 src1_sel:WORD_1
|
|
|
|
; VI-NEXT: v_lshrrev_b16_e32 v3, v2, v0
|
|
|
|
; VI-NEXT: v_lshrrev_b16_sdwa v0, v2, v0 dst_sel:WORD_1 dst_unused:UNUSED_PAD src0_sel:WORD_1 src1_sel:WORD_1
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: v_or_b32_e32 v1, v6, v1
|
2020-01-07 23:43:46 +08:00
|
|
|
; VI-NEXT: v_or_b32_e32 v0, v3, v0
|
|
|
|
; VI-NEXT: flat_store_dwordx2 v[4:5], v[0:1]
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; CI-LABEL: v_lshr_v4i16:
|
|
|
|
; CI: ; %bb.0:
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: s_load_dwordx4 s[4:7], s[0:1], 0x9
|
|
|
|
; CI-NEXT: s_mov_b32 s3, 0xf000
|
|
|
|
; CI-NEXT: s_mov_b32 s2, 0
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: v_lshlrev_b32_e32 v0, 3, v0
|
|
|
|
; CI-NEXT: v_mov_b32_e32 v1, 0
|
|
|
|
; CI-NEXT: s_waitcnt lgkmcnt(0)
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: s_mov_b64 s[0:1], s[6:7]
|
|
|
|
; CI-NEXT: buffer_load_dwordx2 v[2:3], v[0:1], s[0:3], 0 addr64
|
|
|
|
; CI-NEXT: buffer_load_dwordx2 v[4:5], v[0:1], s[0:3], 0 addr64 offset:8
|
2020-01-07 23:43:46 +08:00
|
|
|
; CI-NEXT: s_mov_b32 s0, 0xffff
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: s_mov_b64 s[6:7], s[2:3]
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_waitcnt vmcnt(1)
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v6, 16, v2
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v7, 16, v3
|
|
|
|
; CI-NEXT: s_waitcnt vmcnt(0)
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v8, 16, v4
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v9, 16, v5
|
2020-01-07 23:43:46 +08:00
|
|
|
; CI-NEXT: v_and_b32_e32 v2, s0, v2
|
|
|
|
; CI-NEXT: v_and_b32_e32 v4, s0, v4
|
|
|
|
; CI-NEXT: v_and_b32_e32 v3, s0, v3
|
|
|
|
; CI-NEXT: v_and_b32_e32 v5, s0, v5
|
2020-02-01 01:49:00 +08:00
|
|
|
; CI-NEXT: v_lshr_b32_e32 v3, v3, v5
|
|
|
|
; CI-NEXT: v_lshr_b32_e32 v5, v7, v9
|
|
|
|
; CI-NEXT: v_lshr_b32_e32 v2, v2, v4
|
|
|
|
; CI-NEXT: v_lshr_b32_e32 v4, v6, v8
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: v_lshlrev_b32_e32 v5, 16, v5
|
|
|
|
; CI-NEXT: v_lshlrev_b32_e32 v4, 16, v4
|
|
|
|
; CI-NEXT: v_or_b32_e32 v3, v3, v5
|
|
|
|
; CI-NEXT: v_or_b32_e32 v2, v2, v4
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: buffer_store_dwordx2 v[2:3], v[0:1], s[4:7], 0 addr64
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_endpgm
|
2017-02-28 06:15:25 +08:00
|
|
|
%tid = call i32 @llvm.amdgcn.workitem.id.x()
|
|
|
|
%tid.ext = sext i32 %tid to i64
|
|
|
|
%in.gep = getelementptr inbounds <4 x i16>, <4 x i16> addrspace(1)* %in, i64 %tid.ext
|
|
|
|
%out.gep = getelementptr inbounds <4 x i16>, <4 x i16> addrspace(1)* %out, i64 %tid.ext
|
|
|
|
%b_ptr = getelementptr <4 x i16>, <4 x i16> addrspace(1)* %in.gep, i32 1
|
|
|
|
%a = load <4 x i16>, <4 x i16> addrspace(1)* %in.gep
|
|
|
|
%b = load <4 x i16>, <4 x i16> addrspace(1)* %b_ptr
|
|
|
|
%result = lshr <4 x i16> %a, %b
|
|
|
|
store <4 x i16> %result, <4 x i16> addrspace(1)* %out.gep
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2017-03-22 05:39:51 +08:00
|
|
|
define amdgpu_kernel void @lshr_v_imm_v4i16(<4 x i16> addrspace(1)* %out, <4 x i16> addrspace(1)* %in) #0 {
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-LABEL: lshr_v_imm_v4i16:
|
|
|
|
; GFX9: ; %bb.0:
|
|
|
|
; GFX9-NEXT: s_load_dwordx4 s[0:3], s[0:1], 0x24
|
|
|
|
; GFX9-NEXT: v_lshlrev_b32_e32 v2, 3, v0
|
|
|
|
; GFX9-NEXT: s_waitcnt lgkmcnt(0)
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: global_load_dwordx2 v[0:1], v2, s[2:3]
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_waitcnt vmcnt(0)
|
|
|
|
; GFX9-NEXT: v_pk_lshrrev_b16 v1, 8, v1 op_sel_hi:[0,1]
|
|
|
|
; GFX9-NEXT: v_pk_lshrrev_b16 v0, 8, v0 op_sel_hi:[0,1]
|
2020-08-14 04:51:07 +08:00
|
|
|
; GFX9-NEXT: global_store_dwordx2 v2, v[0:1], s[0:1]
|
2019-10-09 00:16:26 +08:00
|
|
|
; GFX9-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; VI-LABEL: lshr_v_imm_v4i16:
|
|
|
|
; VI: ; %bb.0:
|
|
|
|
; VI-NEXT: s_load_dwordx4 s[0:3], s[0:1], 0x24
|
|
|
|
; VI-NEXT: v_lshlrev_b32_e32 v2, 3, v0
|
|
|
|
; VI-NEXT: s_waitcnt lgkmcnt(0)
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v1, s3
|
|
|
|
; VI-NEXT: v_add_u32_e32 v0, vcc, s2, v2
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v1, vcc, 0, v1, vcc
|
|
|
|
; VI-NEXT: flat_load_dwordx2 v[0:1], v[0:1]
|
|
|
|
; VI-NEXT: v_mov_b32_e32 v3, s1
|
|
|
|
; VI-NEXT: v_add_u32_e32 v2, vcc, s0, v2
|
|
|
|
; VI-NEXT: v_addc_u32_e32 v3, vcc, 0, v3, vcc
|
2020-10-16 15:09:38 +08:00
|
|
|
; VI-NEXT: s_waitcnt vmcnt(0)
|
2019-10-09 00:16:26 +08:00
|
|
|
; VI-NEXT: v_lshrrev_b32_e32 v4, 24, v1
|
|
|
|
; VI-NEXT: v_lshrrev_b32_e32 v5, 24, v0
|
|
|
|
; VI-NEXT: v_lshlrev_b32_e32 v4, 16, v4
|
|
|
|
; VI-NEXT: v_lshlrev_b32_e32 v5, 16, v5
|
|
|
|
; VI-NEXT: v_or_b32_sdwa v1, v1, v4 dst_sel:DWORD dst_unused:UNUSED_PAD src0_sel:BYTE_1 src1_sel:DWORD
|
|
|
|
; VI-NEXT: v_or_b32_sdwa v0, v0, v5 dst_sel:DWORD dst_unused:UNUSED_PAD src0_sel:BYTE_1 src1_sel:DWORD
|
|
|
|
; VI-NEXT: flat_store_dwordx2 v[2:3], v[0:1]
|
|
|
|
; VI-NEXT: s_endpgm
|
|
|
|
;
|
|
|
|
; CI-LABEL: lshr_v_imm_v4i16:
|
|
|
|
; CI: ; %bb.0:
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: s_load_dwordx4 s[4:7], s[0:1], 0x9
|
|
|
|
; CI-NEXT: s_mov_b32 s3, 0xf000
|
|
|
|
; CI-NEXT: s_mov_b32 s2, 0
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: v_lshlrev_b32_e32 v0, 3, v0
|
|
|
|
; CI-NEXT: v_mov_b32_e32 v1, 0
|
|
|
|
; CI-NEXT: s_waitcnt lgkmcnt(0)
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: s_mov_b64 s[0:1], s[6:7]
|
|
|
|
; CI-NEXT: buffer_load_dwordx2 v[2:3], v[0:1], s[0:3], 0 addr64
|
2020-01-07 23:43:46 +08:00
|
|
|
; CI-NEXT: s_mov_b32 s0, 0xff00ff
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: s_mov_b64 s[6:7], s[2:3]
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_waitcnt vmcnt(0)
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v3, 8, v3
|
|
|
|
; CI-NEXT: v_lshrrev_b32_e32 v2, 8, v2
|
2020-01-07 23:43:46 +08:00
|
|
|
; CI-NEXT: v_and_b32_e32 v3, s0, v3
|
|
|
|
; CI-NEXT: v_and_b32_e32 v2, s0, v2
|
[AMDGPU] Remove dubious logic in bidirectional list scheduler
Summary:
pickNodeBidirectional tried to compare the best top candidate and the
best bottom candidate by examining TopCand.Reason and BotCand.Reason.
This is unsound because, after calling pickNodeFromQueue, Cand.Reason
does not reflect the most important reason why Cand was chosen. Rather
it reflects the most recent reason why it beat some other potential
candidate, which could have been for some low priority tie breaker
reason.
I have seen this cause problems where TopCand is a good candidate, but
because TopCand.Reason is ORDER (which is very low priority) it is
repeatedly ignored in favour of a mediocre BotCand. This is not how
bidirectional scheduling is supposed to work.
To fix this I changed the code to always compare TopCand and BotCand
directly, like the generic implementation of pickNodeBidirectional does.
This removes some uncommented AMDGPU-specific logic; if this logic turns
out to be important then perhaps it could be moved into an override of
tryCandidate instead.
Graphics shader benchmarking on gfx10 shows a lot more positive than
negative effects from this change.
Reviewers: arsenm, tstellar, rampitec, kzhuravl, vpykhtin, dstuttard, tpr, atrick, MatzeB
Subscribers: jvesely, wdng, nhaehnle, yaxunl, t-tye, hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D68338
2019-10-07 22:33:59 +08:00
|
|
|
; CI-NEXT: buffer_store_dwordx2 v[2:3], v[0:1], s[4:7], 0 addr64
|
2019-10-09 00:16:26 +08:00
|
|
|
; CI-NEXT: s_endpgm
|
2017-02-28 06:15:25 +08:00
|
|
|
%tid = call i32 @llvm.amdgcn.workitem.id.x()
|
|
|
|
%tid.ext = sext i32 %tid to i64
|
|
|
|
%in.gep = getelementptr inbounds <4 x i16>, <4 x i16> addrspace(1)* %in, i64 %tid.ext
|
|
|
|
%out.gep = getelementptr inbounds <4 x i16>, <4 x i16> addrspace(1)* %out, i64 %tid.ext
|
|
|
|
%vgpr = load <4 x i16>, <4 x i16> addrspace(1)* %in.gep
|
|
|
|
%result = lshr <4 x i16> %vgpr, <i16 8, i16 8, i16 8, i16 8>
|
|
|
|
store <4 x i16> %result, <4 x i16> addrspace(1)* %out.gep
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
|
|
|
declare i32 @llvm.amdgcn.workitem.id.x() #1
|
|
|
|
|
|
|
|
attributes #0 = { nounwind }
|
|
|
|
attributes #1 = { nounwind readnone }
|