llvm-svn: 111156

llvm-svn: 111155

llvm-svn: 111154

llvm-svn: 111153

llvm-svn: 111152

middle, copy the elements in two groups, rather than copying all the
elements and then doing an erase on the middle of the result. These
are SmallVectors, so we shouldn't expect to hit dynamic allocation
in the common case.

llvm-svn: 111151

llvm-svn: 111149

64 bits (was 64-bit shift intended?)", pointed out by 'nobled' on llvmdev

llvm-svn: 111148

llvm-svn: 111147

llvm-svn: 111145

llvm-svn: 111144

llvm-svn: 111143

llvm-svn: 111142

them to iterators.

llvm-svn: 111140

llvm-svn: 111138

llvm-svn: 111137

for each add instruction. Ditto for Mul.

llvm-svn: 111136

llvm-svn: 111135

uninteresting, just put all the operands on one list and make
GenerateReassociations make the decision about what's interesting.
This is simpler, and it avoids an extra ScalarEvolution::getAddExpr call.

llvm-svn: 111133

This isn't necessary, because ScalarEvolution sorts them anyway,
but it's tidier this way.

llvm-svn: 111132

comparison and hash computation which don't require constructing
temporary ID values.

llvm-svn: 111131

implementations of equality comparison and hash computation. This
can be used to optimize node lookup by avoiding creating lots of
temporary ID values just for hashing and comparison purposes.

llvm-svn: 111130

llvm-svn: 111129

llvm-svn: 111128

with FoldingSetTrait::Profile.

llvm-svn: 111127

llvm-svn: 111125

actually use ScalarEvolution.

llvm-svn: 111124

indirectbr destination lists.

llvm-svn: 111122

address-taken. This can occur normally, if the code which took the
address got DCEd.

llvm-svn: 111121

llvm-svn: 111115

llvm-svn: 111112

llvm-svn: 111111

llvm-svn: 111109

llvm-svn: 111108

llvm-svn: 111104

llvm-svn: 111102

llvm-svn: 111096

llvm-svn: 111095

llvm-svn: 111094

encoding is correct for the built-in assembler.

Based on a patch from Chris.

llvm-svn: 111083