llvm-svn: 1376

llvm-svn: 1360

llvm-svn: 1345

llvm-svn: 1344

getStructOffsetType supports array indexing

llvm-svn: 1343

llvm-svn: 1342

llvm-svn: 1341

llvm-svn: 1340

llvm-svn: 1339

llvm-svn: 1315

-cleangcc pass now remove type names that are never referenced and type names for pointers to primitive types.

llvm-svn: 1312

llvm-svn: 1298

llvm-svn: 1296

  ConvertExpressionToType
* Make ValueHandle's remove instruction from maps when they are deleted so that
  no false map hits occur if a subsequent instruction is allocated to the same
  space in memory.  This was a VERY VERY VERY EVIL NASTY BUG to track down. :-P

llvm-svn: 1288

llvm-svn: 1286

llvm-svn: 1273

llvm-svn: 1271

llvm-svn: 1248

llvm-svn: 1246

llvm-svn: 1219

* Only check to see if uses of instructions can be converted for expressions... so we don't look at all of the uses of a constant.  This was making the code unnecessarily conservative

llvm-svn: 1218

llvm-svn: 1214

llvm-svn: 1203

llvm-svn: 1174

llvm-svn: 1160

llvm-svn: 1152

llvm-svn: 1151

llvm-svn: 1144

Cleanup ExprTypeConvert a bit.

llvm-svn: 1141

llvm-svn: 1140

llvm-svn: 1128

llvm-svn: 1127

llvm-svn: 1125

* 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

llvm-svn: 1119

llvm-svn: 1118

llvm-svn: 1117

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