https://gcc.gnu.org/bugzilla/show_bug.cgi?id=109592
--- Comment #4 from Jeffrey A. Law <law at gcc dot gnu.org> ---
If we need to handle subregs here, I would suggest something like this
if (SUBREG_P (XEXP (op0, 0))
&& subreg_lowpart_p (op0)
... other tests ...
That way we know we're extracting the low word of the subreg. But I'm not sure
at all why we need to handle them in this code. I would expect generic
optimizers to strip away the subregs in the result if they are extraneous.
It's not clear why you check the size of the subreg modes. It seems like this
optimization should work even for a paradoxical subreg (bitsize of inner will
be smaller than bitsize of outer).
In general if you only have one statement in an arm of an IF-THEN-ELSE, then it
need not be inside a { } block.
Rather than using magic numbers like
INTVAL (op1) + 8 == 32
Instead use mode information.
INTVAL (op) + GET_MODE_BITSIZE (QImode) == GET_MODE_BITSIZE (SImode)
// code for QI->SI expansion
Then repeat for the other mode combinations.
Note that we probably should go ahead and support QI->HI. While it doesn't
happen for RISC-V, it could likely happen on other architectures. So you end
up wanting to supprot
QI->HI, QI->SI QI->DI
HI->SI, HI->DI
SI->DI
I don't know if it happens in practice, so check first to see what we do for a
zero extension variant of your original test. If we need to handle that too,
it can be easily done by changing the shifts we recognize.
Anyway, it looks like you're on the right track. I would suggest further
discussions happen on gcc-patches.
Anyway, it definitely looks like you're on the right track.
