RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-19 11:02:59 +02:00
Code Issues Projects Releases Wiki Activity
142,098 Commits 4 Branches 5 Tags 704 MiB
daf4fef1f9
Commit Graph

2 Commits

Author SHA1 Message Date
Chad Rosier
3e660d9f35 Remove extra whitespace. NFC. 
llvm-svn: 268248
 2016-05-02 16:45:00 +00:00
Haicheng Wu
9e87f080cd [CVP] Convert an SDiv to a UDiv if both operands are known to be nonnegative 
The motivating example is this

for (j = n; j > 1; j = i) {
   i = j / 2;
}

The signed division is safely to be changed to an unsigned division (j is known
to be larger than 1 from the loop guard) and later turned into a single shift
without considering the sign bit.

llvm-svn: 263406
 2016-03-14 03:24:28 +00:00