https://gcc.gnu.org/bugzilla/show_bug.cgi?id=120141
Bug ID: 120141
Summary: [RVV] Noop are not removed
Product: gcc
Version: 16.0
Status: UNCONFIRMED
Severity: normal
Priority: P3
Component: target
Assi
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=109605
Wojciech Mula changed:
What|Removed |Added
CC||wojciech_mula at poczta dot
onet.p
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=119911
Bug ID: 119911
Summary: [RVV] Suboptimal code generation for multiple
extracting 0-th elements of vector
Product: gcc
Version: 16.0
Status: UNCONFIRMED
Severit
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=119040
Bug ID: 119040
Summary: [PPC/Altivec] Missing bit-level optimization (select)
Product: gcc
Version: unknown
Status: UNCONFIRMED
Severity: normal
Priority: P3
Co
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=117421
--- Comment #4 from Wojciech Mula ---
Although, there's no word-wise set for equality, thus I think this sequence
would be better.
```
lbu a0, 1(a1)
lbu a2, 0(a1)
lbu a3, 2(a1)
lb a1, 3(a1)
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=117421
--- Comment #3 from Wojciech Mula ---
It's worth noting, that Clang first synthesizes a 32-bit word from individual
bytes, and then use a single comparison.
```
ext_is_gzip(std::basic_string_view>):
li a2, 4
bne a0, a2,
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=109279
--- Comment #20 from Wojciech Mula ---
This constants is worth checking (appears in division by 10):
```
unsigned long ccd() {
return 0xcccd;
}
```
riscv64-unknown-linux-gnu-g++ (crosstool-NG UNKNOWN) 15.0.0 2024
(experime
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=117421
--- Comment #2 from Wojciech Mula ---
First of all, thanks for looking at this!
> I should note that -mno-strict-align still does not do it but that is because
> it might be slow still to do unaligned access.
OK, maybe `-mno-strict-align` sh
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=117421
Bug ID: 117421
Summary: [RISCV] Use byte comparison instead of word comparison
Product: gcc
Version: 15.0
Status: UNCONFIRMED
Severity: normal
Priority: P3
Comp
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=114809
Bug ID: 114809
Summary: [RISC-V RVV] Counting elements might be simpler
Product: gcc
Version: 14.0
Status: UNCONFIRMED
Severity: normal
Priority: P3
Component:
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=114747
Bug ID: 114747
Summary: [RISC-V RVV] Wrong SEW set for mixed-size intrinsics
Product: gcc
Version: 13.2.0
Status: UNCONFIRMED
Severity: normal
Priority: P3
Comp
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=114172
Wojciech Mula changed:
What|Removed |Added
CC||wojciech_mula at poczta dot
onet.p
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=88798
--- Comment #8 from Wojciech Mula ---
Thank you for the answer. Thus my question is: is it possible to delay
conversion from kmasks into ints? I'm not a language lawyer, but I guess a `x
binop y` has to be treated as `(int)x binop (int)y`. If it'
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=88798
--- Comment #6 from Wojciech Mula ---
Hongtao, thank you for your patch and for pinging back! I checked the code from
this issue against version 11.2.0 (Debian 11.2.0-14), but still, there are
KMOVQs before performing any bit ops. Here is the out
14 matches
Mail list logo
