- Nov 29, 2010
-
-
Michael J. Spencer authored
llvm-svn: 120298
-
Rafael Espindola authored
llvm-svn: 120271
-
Rafael Espindola authored
llvm-svn: 120269
-
- Nov 28, 2010
-
-
Jakob Stoklund Olesen authored
Sometimes std::copy can become a memmove call, and that is not a good idea when copying relatively few bytes as we are doing. We also get a small win by changing two loops into one. llvm-svn: 120265
-
Jakob Stoklund Olesen authored
We always disallowed overlapping inserts with different values, and this makes the insertion code smaller and faster. If an overwriting insert is needed, it can be added as a separate method that trims any existing intervals before inserting. The immediate use cases for IntervalMap don't need this - they only use disjoint insertions. llvm-svn: 120264
-
Jay Foad authored
llvm-svn: 120262
-
Jay Foad authored
static methods that return a new APInt. llvm-svn: 120261
-
Chris Lattner authored
by Eric Dobson! llvm-svn: 120259
-
Jakob Stoklund Olesen authored
llvm-svn: 120256
-
Rafael Espindola authored
Factor some duplicated code into MCObjectStreamer::EmitLabel. llvm-svn: 120248
-
Rafael Espindola authored
llvm-svn: 120246
-
Rafael Espindola authored
llvm-svn: 120245
-
Rafael Espindola authored
llvm-svn: 120244
-
Rafael Espindola authored
llvm-svn: 120243
-
Rafael Espindola authored
llvm-svn: 120242
-
Rafael Espindola authored
and at least the 4 byte one will be needed to implement the .cfi_* directives. llvm-svn: 120240
-
Jakob Stoklund Olesen authored
These iterators don't point anywhere, and they can't be compared to anything. They are only good for assigning to. llvm-svn: 120239
-
Jakob Stoklund Olesen authored
This is a version of find() that always searches forwards and is faster for local searches. llvm-svn: 120237
-
Jakob Stoklund Olesen authored
llvm-svn: 120232
-
Anton Korobeynikov authored
llvm-svn: 120229
-
Anton Korobeynikov authored
llvm-svn: 120228
-
- Nov 27, 2010
-
-
Jakob Stoklund Olesen authored
llvm-svn: 120227
-
Jakob Stoklund Olesen authored
Implement iterator::erase() in a simple version that erases nodes when they become empty, but doesn't try to redistribute elements among siblings for better packing. Handle coalescing across leaf nodes which may require erasing entries. llvm-svn: 120226
-
Benjamin Kramer authored
llvm-svn: 120223
-
Daniel Dunbar authored
llvm-svn: 120219
-
Daniel Dunbar authored
llvm-svn: 120218
-
Daniel Dunbar authored
llvm-svn: 120217
-
Daniel Dunbar authored
llvm-svn: 120216
-
Daniel Dunbar authored
llvm-svn: 120215
-
Daniel Dunbar authored
llvm-svn: 120214
-
Daniel Dunbar authored
llvm-svn: 120213
-
Daniel Dunbar authored
llvm-svn: 120204
-
Daniel Dunbar authored
llvm-svn: 120203
-
Owen Anderson authored
by my recent GVN improvement. Looking through a single layer of PHI nodes when attempting to sink GEPs, we need to iteratively look through arbitrary PHI nests. llvm-svn: 120202
-
Daniel Dunbar authored
situations where on the common path an API can return a pointer to some direct memory, but which on an exceptional path may need to return a pointer to a temporary struct. llvm-svn: 120201
-
Daniel Dunbar authored
llvm-svn: 120200
-
Daniel Dunbar authored
llvm-svn: 120198
-
Daniel Dunbar authored
llvm-svn: 120195
-
Daniel Dunbar authored
llvm-svn: 120190
-
Daniel Dunbar authored
llvm-svn: 120188
-