llvm-svn: 42835

Implemented ImutAVLTree::isEqual.

llvm-svn: 42833

illegal.  Thanks to gabor for pointing this out!

llvm-svn: 42832

llvm-svn: 42825

llvm-svn: 42824

llvm-svn: 42823

Surprisingly complicated.
Adds getTargetNode for 2 outputs, no inputs (missing).

llvm-svn: 42822

llvm-svn: 42821

Fix an extremely stupid bug that prevented first round of coalescing (physical registers only) from happening.

llvm-svn: 42820

ADT/DenseSet.h
ADT/ImmutableMap.h
ADT/ImmutableSet.h

llvm-svn: 42816

llvm-svn: 42815

llvm-svn: 42814

implemented on top of a functional AVL tree.  The AVL balancing code
is inspired by the OCaml implementation of Map, which also uses a functional
AVL tree.

Documentation is currently limited and cleanups are planned, but this code
compiles and has been tested.

llvm-svn: 42813

Do not walk invalid iterator.

llvm-svn: 42812

llvm-svn: 42806

llvm-svn: 42805

llvm-svn: 42789

llvm-svn: 42788

llvm-svn: 42787

llvm-svn: 42786

llvm-svn: 42785

instead of four.

llvm-svn: 42784

llvm-svn: 42783

calling the traits implementation of isEqual.

llvm-svn: 42782

llvm-svn: 42781

llvm-svn: 42780

- Added a function to hold the stack location 
  where GP must be stored during LowerCALL
- AsmPrinter now emits directives based on
  relocation type
- PIC_ set to default relocation type (same as GCC)

llvm-svn: 42779

- Modified instruction format to handle pseudo instructions
- Added LoadAddr SDNode to load symbols.

llvm-svn: 42778

llvm-svn: 42775

llvm-svn: 42774

for consistency.

llvm-svn: 42769

default of IntrWriteMem, to at least indicate that it doesn't
"capture" the argument pointer.

llvm-svn: 42768

instead of four.

llvm-svn: 42765

Joshua Haberman!

llvm-svn: 42763

use ISD::{S,U}DIVREM and ISD::{S,U}MUL_HIO. Move the lowering code
associated with these operators into target-independent in LegalizeDAG.cpp
and TargetLowering.cpp.

llvm-svn: 42762

llvm-svn: 42761

llvm-svn: 42760

Check if one of the two results unneeded so see if a simpler operator
could bs used. Also check to see if each of the two computations could be
simplified if they were split into separate operators. Factor out the code
that calls visit() so that it can be used for this purpose.

llvm-svn: 42759

llvm-svn: 42758

llvm-svn: 42757