llvm-svn: 17191

* Convert register numbers from their opcode value to the real value, e.g.
  PPC::R1 => 1 and PPC::F1 => 1
* Add correct handling of loading of global values which are PC-relative --
  implement ha16() and lo16()

llvm-svn: 17190

llvm-svn: 17187

* Use LLVM_SRC_ROOT as the anchor for the Target.td file
* Use MFLAGS instead of MAKEFLAGS for recursive makes so we don't try
  to build a target "w" or "s" mysteriously.

llvm-svn: 17186

llvm-svn: 17185

to write, but this is all my brain can muster for tonight.

llvm-svn: 17184

be listed second as that is how the instructions are usually created (and is the
correct asm syntax) so that it's assembled correctly from its constituents

llvm-svn: 17183

The decimal value given in the manual (8 or 9) really needs to be multiplied by
a factor of 32 because of the group of 5 zero bits after the register code.

llvm-svn: 17182

llvm-svn: 17181

llvm-svn: 17180

llvm-svn: 17179

llvm-svn: 17178

Assembler/2004-10-22-BCWriterUndefBug.llx

llvm-svn: 17177

llvm-svn: 17176

as the shift amount operand to a shift instruction.  This was causing us to
emit unnecessary clear operations for code such as:
int foo(int x) { return 1 << x; }

llvm-svn: 17175

llvm-svn: 17174

llvm-svn: 17173

llvm-svn: 17172

auto-generated dependency rule.

llvm-svn: 17171

this allows us to have sub-targets whose depth in the tree is not the same as it
is for the standard X86/PowerPC/Sparc.

llvm-svn: 17170

llvm-svn: 17169

llvm-svn: 17168

llvm-svn: 17167

llvm-svn: 17166

llvm-svn: 17165

llvm-svn: 17164

llvm-svn: 17163

llvm-svn: 17161

New testcase.  Check for the ability to promote a malloc whose initialzed state is checked by the program

llvm-svn: 17160

llvm-svn: 17157

llvm-svn: 17156

llvm-svn: 17155

llvm-svn: 17151

llvm-svn: 17150

  including registers, constants, and partial support for global addresses
* The JIT is disabled by default to allow building llvm-gcc, which wants to test
  running programs during configure

llvm-svn: 17149

llvm-svn: 17147

llvm-svn: 17146

Instead of unconditionally copying all phi node values into temporaries for
all successor blocks, generate code that will determine what successor
block will be called and then copy only those phi node values needed by
the successor block.

This seems to cut down namd execution time from being 8% higher than GCC to
4% higher than GCC.

llvm-svn: 17144

  - Support added for functions, basic blocks, constant pool, constants,
    registers, and some basic support for globals, all untested
* Turn assert()s into abort()s so that unimplemented functions fail in release

llvm-svn: 17143

doing... I guess they're right.

llvm-svn: 17142