llvm-svn: 111537

The Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 16.00.30319.01
implements parts of C++0x based on the draft standard. An old version of
the draft had a bug that makes std::pair<T1*, T2*>(something, 0) fail to
compile. This is because the template<class U, class V> pair(U&& x, V&& y)
constructor is selected, even though it later fails to implicitly convert
U and V to frist_type and second_type.

This has been fixed in n3090, but it seems that Microsoft is not going to
update msvc.

llvm-svn: 111535

llvm-svn: 111534

rdar://8277890

llvm-svn: 111533

llvm-svn: 111531

llvm-svn: 111530

llvm-svn: 111518

llvm-svn: 111517

base registers were required. This will allow for slightly better packing
of the locals when alignment padding is necessary after callee saved registers.

llvm-svn: 111508

llvm-svn: 111500

call and jumps.

llvm-svn: 111496

of the two.

llvm-svn: 111495

llvm-svn: 111494

llvm-svn: 111489

llvm-svn: 111481

llvm-svn: 111468

llvm-svn: 111456

llvm-svn: 111453

which I broke with a recent patch.

llvm-svn: 111452

If any def of a machine-sink candidate has local uses, it's obviously not safe to sink it to a successor block. This bug has been hidden because a later check for critical-edge disable these illegal optimizations. This patch should significantly reduce the amount of time spent on checking dominator information for obviously unsafe sinking.

llvm-svn: 111450

a reference instead of pointer.

llvm-svn: 111445

using a pair.  This tidies up the code a bit.  While setting things up, add
a (currently unused) field to keep track of how the value is extended.

llvm-svn: 111444

frame index reference to an object in the local block is seen, check if
it's near enough to any previously allocaated base register to re-use.

rdar://8277890

llvm-svn: 111443

constructed with an output filename of "-". In particular, allow the
file descriptor to be closed, and close the file descriptor in the
destructor if it hasn't been explicitly closed already, to ensure
that any write errors are detected.

llvm-svn: 111436

decomposition that it is doing is very basicaa specific and is only used
by basicaa.

Now with less tree breakingness.

llvm-svn: 111433

llvm-svn: 111432

llvm-svn: 111430

llvm-svn: 111425

map discovers the iterated dominance frontier for free.

llvm-svn: 111400

We must complete the DFS, otherwise we might miss needed phi-defs, and
prematurely color live ranges with a non-dominating value.

This is not a big deal since we get to color more of the CFG and the next
mapValue call will be faster.

llvm-svn: 111397

llvm-svn: 111394

LiveIntervalMap maps values from a parent LiveInterval to a child interval that
is a strict subset. It will create phi-def values as needed to preserve the
VNInfo SSA form in the child interval.

This leads to an algorithm very similar to the one in SSAUpdaterImpl.h, but with
enough differences that the code can't be reused:

- We don't need to manipulate PHI instructions.
- LiveIntervals have kills.
- We have MachineDominatorTree.
- We can use df_iterator.

llvm-svn: 111393

form of", it doesn't pass tests.

llvm-svn: 111385

llvm-svn: 111384

llvm-svn: 111383

llvm-svn: 111382

directives for putting contents in .bss, for example.

llvm-svn: 111376

decomposition that it is doing is very basicaa specific and is only used
by basicaa.

llvm-svn: 111375

Nothing fancy, just ask the target if any currently available base reg
is in range for the instruction under consideration and use the first one
that is. Placeholder ARM implementation simply returns false for now.

ongoing saga of rdar://8277890

llvm-svn: 111374

llvm-svn: 111366