RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-12-04 18:06:49 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

update some notes slightly

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@89913 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2009-11-26 01:51:18 +00:00
parent 11fe72661d
commit 9c6a0dcf0e
1 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
lib/Target/README.txt
View File

@ -220,7 +220,7 @@ so cool to turn it into something like:
... which would only do one 32-bit XOR per loop iteration instead of two.
It would also be nice to recognize the reg->size doesn't alias reg->node[i], but
alas.
this requires TBAA.
//===---------------------------------------------------------------------===//
@ -280,6 +280,9 @@ unsigned int popcount(unsigned int input) {
return count;
}
This is a form of idiom recognition for loops, the same thing that could be
useful for recognizing memset/memcpy.
//===---------------------------------------------------------------------===//
These should turn into single 16-bit (unaligned?) loads on little/big endian
@ -343,7 +346,7 @@ PHI Slicing could be extended to do this.
//===---------------------------------------------------------------------===//
LSR should know what GPR types a target has. This code:
LSR should know what GPR types a target has from TargetData. This code:
volatile short X, Y; // globals
@ -369,7 +372,6 @@ LBB1_2:
LSR should reuse the "+" IV for the exit test.
//===---------------------------------------------------------------------===//
Tail call elim should be more aggressive, checking to see if the call is