llvm-project

Commit Graph

Author	SHA1	Message	Date
Philip Reames	8ef4b961a3	[knownbits] Preserve known bits for small shift recurrences The motivation for this is that I'm looking at an example that uses shifts as induction variables. There's lots of other omissions, but one of the first I noticed is that we can't compute tight known bits. (This indirectly causes SCEV's range analysis to produce very poor results as well.) Differential Revision: https://reviews.llvm.org/D96440	2021-02-11 17:56:36 -08:00
Philip Reames	81c51891ad	[tests] Precommit tests for D96440	2021-02-11 10:48:07 -08:00

Author

SHA1

Message

Date

Philip Reames

8ef4b961a3

[knownbits] Preserve known bits for small shift recurrences

The motivation for this is that I'm looking at an example that uses shifts as induction variables. There's lots of other omissions, but one of the first I noticed is that we can't compute tight known bits. (This indirectly causes SCEV's range analysis to produce very poor results as well.)

Differential Revision: https://reviews.llvm.org/D96440

2021-02-11 17:56:36 -08:00

Philip Reames

81c51891ad

[tests] Precommit tests for D96440

2021-02-11 10:48:07 -08:00

2 Commits