Evan Cheng 25f9364cbd Optimize some vfp comparisons to integer ones. This patch implements the simplest case when the following conditions are met: ... 1. The arguments are f32. 2. The arguments are loads and they have no uses other than the comparison. 3. The comparison code is EQ or NE. e.g. vldr.32 s0, [r1] vldr.32 s1, [r0] vcmpe.f32 s1, s0 vmrs apsr_nzcv, fpscr beq LBB0_2 => ldr r1, [r1] ldr r0, [r0] cmp r0, r1 beq LBB0_2 More complicated cases will be implemented in subsequent patches. llvm-svn: 107852		2010-07-08 02:08:50 +00:00
clang	allow this to pass on 32-bit hosts.	2010-07-08 00:23:21 +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	Test that debug symbols have the correct order as specified by the order file.	2010-07-08 00:17:29 +00:00
llvm	Optimize some vfp comparisons to integer ones. This patch implements the simplest case when the following conditions are met:	2010-07-08 02:08:50 +00:00