Benjamin Kramer 2321e6a4d4 Teach instcombine to transform ... (X >s -1) ? C1 : C2 and (X <s 0) ? C2 : C1 into ((X >>s 31) & (C2 - C1)) + C1, avoiding the conditional. This optimization could be extended to take non-const C1 and C2 but we better stay conservative to avoid code size bloat for now. for int sel(int n) { return n >= 0 ? 60 : 100; } we now generate sarl $31, %edi andl $40, %edi leal 60(%rdi), %eax instead of testl %edi, %edi movl $60, %ecx movl $100, %eax cmovnsl %ecx, %eax llvm-svn: 107866		2010-07-08 11:39:10 +00:00
clang	Wrap the new ext-warn on extraneous comma on the last entry of an enumerator	2010-07-08 10:52:01 +00:00
compiler-rt	fix install location	2010-07-04 18:29:23 +00:00
libcxx	First loop test passed. The data structure and search algorithm is still crude and in-flux. But this milestone needed to be locked in. Right now every loop is implemented in terms of a structure that will handle the most complicated {min, max} loop. Though only *-loops are tested at the moment. In a future iteration *-loops will likely be optimized a little more. The only tests are for basic posix so far, but I have prototype code running for extended posix and ecma. The prototype code lacks the complicating properties of the real <regex> requirements though.	2010-07-07 19:14:52 +00:00
lldb	Updated to build against the latest LLVM release.	2010-07-08 02:13:18 +00:00
llvm	Teach instcombine to transform	2010-07-08 11:39:10 +00:00