llvm-svn: 1157

by using a better naming scheme.

llvm-svn: 1156

corresponding *.ll files.

llvm-svn: 1155

is already pushed to stack by a previous call to the same method.

llvm-svn: 1154

llvm-svn: 1153

llvm-svn: 1152

llvm-svn: 1151

llvm-svn: 1150

llvm-svn: 1147

were declared, and in some cases when they were unintialized.

llvm-svn: 1146

llvm-svn: 1145

llvm-svn: 1144

llvm-svn: 1142

Cleanup ExprTypeConvert a bit.

llvm-svn: 1141

llvm-svn: 1140

llvm-svn: 1139

Avoids having to handle some special cases that cause complex interactions
with instr. selection.

llvm-svn: 1138

llvm-svn: 1137

llvm-svn: 1136

llvm-svn: 1135

version of his gccas.  Plus another dumb bug fix (the bug, not the fix).

llvm-svn: 1134

%.ll is not a pre-existing file.

llvm-svn: 1133

llvm-svn: 1132

llvm-svn: 1130

llvm-svn: 1128

llvm-svn: 1127

llvm-svn: 1125

llvm-svn: 1124

llvm-svn: 1123

* fix minor bug with taking datasize of unsized array type
* Insert code to support speculative changes later

llvm-svn: 1122

Convert backward conversion of expression trees into a new more powerful bidirectional approach.  Add transforms for more instructions.

llvm-svn: 1121

Fixed selection to create a TmpInstruction for each integer CC register
(since it is an implicit side-effect, unlike FP CC registers which are
explicit operands).

llvm-svn: 1120

llvm-svn: 1119

llvm-svn: 1118

llvm-svn: 1117

IGNode::pushOnStack().

llvm-svn: 1116

llvm-svn: 1115

//  1. PHI nodes with multiple entries for the same predecessor.  GCC sometimes
//     generates code that looks like this:
//
//  bb7:  br bool %cond1004, label %bb8, label %bb8
//  bb8: %reg119 = phi uint [ 0, %bb7 ], [ 1, %bb7 ]
//
//     which is completely illegal LLVM code.  To compensate for this, we insert
//     an extra basic block, and convert the code to look like this:
//
//  bb7: br bool %cond1004, label %bbX, label %bb8
//  bbX: br label bb8
//  bb8: %reg119 = phi uint [ 0, %bbX ], [ 1, %bb7 ]
//

llvm-svn: 1114

llvm-svn: 1113

llvm-svn: 1112