- Aug 16, 2010
-
-
Fariborz Jahanian authored
definition. radar 8307865. llvm-svn: 111163
-
Dan Gohman authored
expression being loop invariant is not equivalent to the property of properly dominating the loop header. Other optimizations have also made this optimization less important. llvm-svn: 111160
-
Argyrios Kyrtzidis authored
llvm-svn: 111159
-
Argyrios Kyrtzidis authored
llvm-svn: 111158
-
Jakob Stoklund Olesen authored
llvm-svn: 111156
-
Jakob Stoklund Olesen authored
llvm-svn: 111155
-
Bob Wilson authored
llvm-svn: 111154
-
Bob Wilson authored
llvm-svn: 111153
-
Dan Gohman authored
llvm-svn: 111152
-
Dan Gohman authored
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
-
Douglas Gregor authored
llvm-svn: 111150
-
Bob Wilson authored
llvm-svn: 111149
-
Chris Lattner authored
64 bits (was 64-bit shift intended?)", pointed out by 'nobled' on llvmdev llvm-svn: 111148
-
Dan Gohman authored
llvm-svn: 111147
-
Dan Gohman authored
llvm-svn: 111145
-
Dan Gohman authored
llvm-svn: 111144
-
Dan Gohman authored
llvm-svn: 111143
-
Dan Gohman authored
llvm-svn: 111142
-
Anton Yartsev authored
llvm-svn: 111141
-
Dan Gohman authored
them to iterators. llvm-svn: 111140
-
Douglas Gregor authored
type class, so that we can adjust priorities appropriately when the preferred type for the context and the actual type of the completion are similar. This gets us one step closer to parity of the cached completion results with the non-cached completion results. llvm-svn: 111139
-
Dan Gohman authored
llvm-svn: 111138
-
Dan Gohman authored
llvm-svn: 111137
-
Dan Gohman authored
for each add instruction. Ditto for Mul. llvm-svn: 111136
-
Dan Gohman authored
llvm-svn: 111135
-
Abramo Bagnara authored
llvm-svn: 111134
-
Dan Gohman authored
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
-
Dan Gohman authored
This isn't necessary, because ScalarEvolution sorts them anyway, but it's tidier this way. llvm-svn: 111132
-
Dan Gohman authored
comparison and hash computation which don't require constructing temporary ID values. llvm-svn: 111131
-
Dan Gohman authored
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
-
Dan Gohman authored
llvm-svn: 111129
-
Dan Gohman authored
llvm-svn: 111128
-
Dan Gohman authored
with FoldingSetTrait::Profile. llvm-svn: 111127
-
Dan Gohman authored
llvm-svn: 111125
-
Dan Gohman authored
actually use ScalarEvolution. llvm-svn: 111124
-
Dan Gohman authored
indirectbr destination lists. llvm-svn: 111122
-
Dan Gohman authored
address-taken. This can occur normally, if the code which took the address got DCEd. llvm-svn: 111121
-
Jordy Rose authored
- Fix memcpy() and friends to actually invalidate the destination buffer. - Emit a different message for out-of-bounds buffer accesses if the buffer is being written to. - When conjuring symbols, let ValueManager figure out the type. llvm-svn: 111120
-
Charles Davis authored
sizes. llvm-svn: 111119
-
Charles Davis authored
Microsoft C++ ABI, for now. llvm-svn: 111118
-