OpenHarmony/third_party_mesa3d
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

nir/algebraic: extend lowering patterns for conversions on smaller bit sizes

Browse Source 
Conversions on smaller bit sizes should also be collapsed when composed.

This also adds more patterns on the
intS -> intB -> floatB ==> intS -> floatB
lowering so as to deal with any int size C > B instead of a fixed intB.

Closes: #7776
Acked-by: Alyssa Rosenzweig <alyssa.rosenzweig@collabora.com>
Reviewed-by: Georg Lehmann <dadschoorse@gmail.com>
Signed-off-by: Isabella Basso <isabellabdoamaral@usp.br>
Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/20965>
This commit is contained in:
Isabella Basso
2023-03-10 17:20:09 -03:00
committed by Marge Bot
parent a27bcd63d0
commit 79c94ef52e
1 changed files with 21 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
src/compiler/nir/nir_opt_algebraic.py
View File

@@ -993,10 +993,8 @@ for s in [16, 32, 64]:
if s < B:
optimizations.extend([
# S = smaller, B = bigger
# typeS -> typeB -> typeS ==> identity
# floatS -> floatB -> floatS ==> identity
(('f2f{}'.format(s), ('f2f{}'.format(B), 'a@{}'.format(s))), a),
(('i2i{}'.format(s), ('i2i{}'.format(B), 'a@{}'.format(s))), a),
(('u2u{}'.format(s), ('u2u{}'.format(B), 'a@{}'.format(s))), a),
# bool1 -> typeB -> typeS ==> bool1 -> typeS
(('f2f{}'.format(s), ('b2f{}'.format(B), 'a@1')), ('b2f{}'.format(s), a)),
@@ -1010,10 +1008,27 @@ for s in [16, 32, 64]:
# int? -> floatB -> floatS ==> int? -> floatS
(('f2f{}'.format(s), ('u2f{}'.format(B), a)), ('u2f{}'.format(s), a)),
(('f2f{}'.format(s), ('i2f{}'.format(B), a)), ('i2f{}'.format(s), a)),
])
# intS -> intB -> floatB ==> intS -> floatB
(('u2f{}'.format(B), ('u2u{}'.format(B), 'a@{}'.format(s))), ('u2f{}'.format(B), a)),
(('i2f{}'.format(B), ('i2i{}'.format(B), 'a@{}'.format(s))), ('i2f{}'.format(B), a)),
for S in [1, 8, 16, 32]:
for B in [8, 16, 32, 64]:
if B <= S:
continue
optimizations.extend([
# intS -> intB -> intS ==> identity
(('i2i{}'.format(S), ('i2i{}'.format(B), 'a@{}'.format(S))), a),
(('u2u{}'.format(S), ('u2u{}'.format(B), 'a@{}'.format(S))), a),
])
if B < 16:
continue
for C in [8, 16, 32, 64]:
if C <= S:
continue
optimizations.extend([
# intS -> intC -> floatB ==> intS -> floatB
(('u2f{}'.format(B), ('u2u{}'.format(C), 'a@{}'.format(S))), ('u2f{}'.format(B), a)),
(('i2f{}'.format(B), ('i2i{}'.format(C), 'a@{}'.format(S))), ('i2f{}'.format(B), a)),
])
# mediump variants of the above