| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
| |
llvm-svn: 203318
|
| |
|
|
|
|
| |
blocks when building in C mode, and serialize and deserialize the attribute.
llvm-svn: 203317
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
This is already done for shifts. Allow it for rotations as well. E.g.:
(rotl:i32 x, (trunc (and y, 31))) -> (rotl:i32 x, (and (trunc y), 31))
Use the newly factored-out distributeTruncateThroughAnd.
With this patch and some X86.td tweaks we should be able to remove redundant
masking of the rotation amount like in the example above. HW implicitly
performs this masking.
The testcase will be added as part of the X86 patch.
llvm-svn: 203316
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
This is the new idiom:
x<<(y&31) | x>>((0-y)&31)
which is recognized as:
x ROTL (y&31)
The change refines matchRotateSub. In
Neg & (OpSize - 1) == (OpSize - Pos) & (OpSize - 1), if Pos is
Pos' & (OpSize - 1) we can just use Pos' instead of Pos.
llvm-svn: 203315
|
| |
|
|
|
|
|
|
|
|
| |
Slightly change the wording in the function comment. Originally, it can be
misunderstood as we turned the input into two subsequent rotates.
Better connect the comment which talks about Mask and the code which used
LoBits. Renamed variable to MaskLoBits.
llvm-svn: 203314
|
| |
|
|
| |
llvm-svn: 203313
|
| |
|
|
|
|
| |
SystemRuntimeMacOSX::PopulatePendingItemsForQueue().
llvm-svn: 203312
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
be split and the result type widened.
When the condition of a vselect has to be split it makes no sense widening the
vselect and thereby widening the condition. We end up in an endless loop of
widening (vselect result type) and splitting (condition mask type) doing this.
Instead, split both the condition and the vselect and widen the result.
I ran this over the test suite with i686 and mattr=+sse and saw no regressions.
Fixes PR18036.
llvm-svn: 203311
|
| |
|
|
|
|
|
|
| |
r203274
this is not installing itself for Mach-O binaries.
llvm-svn: 203310
|
| |
|
|
|
|
|
| |
horrible/fragile.
rdar://problem/16264854
llvm-svn: 203309
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Summary:
COMDAT_SELECT_SAME_SIZE is a COMDAT type that I presume exist only in COFF.
The semantics of the type is that linker should merge such COMDAT sections if
their sizes are the same. Otherwise it's an error.
Reviewers: Bigcheese, shankarke, kledzik
CC: llvm-commits
Differential Revision: http://llvm-reviews.chandlerc.com/D2996
llvm-svn: 203308
|
| |
|
|
| |
llvm-svn: 203307
|
| |
|
|
| |
llvm-svn: 203306
|
| |
|
|
| |
llvm-svn: 203305
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
First: refactor out the emission of entries into the .debug_loc section
into its own routine.
Second: add a new class ByteStreamer that can be used to either emit
using an AsmPrinter or hash using DIEHash the series of bytes that
would be emitted. Use this in all of the location emission routines
for the .debug_loc section.
No functional change intended outside of a few additional comments
in verbose assembly.
llvm-svn: 203304
|
| |
|
|
|
|
| |
to the hash.
llvm-svn: 203303
|
| |
|
|
| |
llvm-svn: 203302
|
| |
|
|
| |
llvm-svn: 203301
|
| |
|
|
|
|
| |
This breaks linux buildbots. Go figure.
llvm-svn: 203300
|
| |
|
|
|
|
|
|
| |
sometimes have dangerous side-effects where the range temporary is destroyed, taking the underlying iterators out with it.
This changes the iterators so that they are no longer implemented in terms of ranges (so it's a very partial revert of the existing rangification efforts).
llvm-svn: 203299
|
| |
|
|
| |
llvm-svn: 203298
|
| |
|
|
| |
llvm-svn: 203297
|
| |
|
|
|
|
| |
Suggested by Adrian Prantl in code review for r203187.
llvm-svn: 203296
|
| |
|
|
| |
llvm-svn: 203295
|
| |
|
|
|
|
| |
Looks like GCC implements the lambda->function pointer conversion differently.
llvm-svn: 203294
|
| |
|
|
|
|
| |
Looks like GCC implements the lambda->function pointer conversion differently.
llvm-svn: 203293
|
| |
|
|
| |
llvm-svn: 203292
|
| |
|
|
| |
llvm-svn: 203291
|
| |
|
|
|
|
| |
that anyone using quoted with padding is really confused, but it should work the way the rest of iostreams works.
llvm-svn: 203290
|
| |
|
|
|
|
| |
No functionality change.
llvm-svn: 203289
|
| |
|
|
|
|
| |
No functionality change.
llvm-svn: 203288
|
| |
|
|
|
|
| |
declaration.
llvm-svn: 203287
|
| |
|
|
| |
llvm-svn: 203286
|
| |
|
|
|
|
| |
EXPECT_TRUE/FALSE is also more idiomatic for booleans than EXPECT_EQ
llvm-svn: 203284
|
| |
|
|
|
|
|
|
|
| |
unreachable code heuristics.
This one could possibly be refined even further; e.g. looking
at the initializer and see if it is truly a configuration value.
llvm-svn: 203283
|
| |
|
|
| |
llvm-svn: 203282
|
| |
|
|
|
| |
Reviewed-by: Michel Dänzer <michel.daenzer@amd.com>
llvm-svn: 203281
|
| |
|
|
|
|
|
|
| |
These are sometimes created by the shrink to boolean optimization in the
globalopt pass.
Reviewed-by: Michel Dänzer <michel.daenzer@amd.com>
llvm-svn: 203280
|
| |
|
|
|
|
| |
This compiles cleanly with lldb/lld/clang-tools-extra/llvm.
llvm-svn: 203279
|
| |
|
|
|
|
| |
iterator_range decls(). The same is true for the noload versions of these APIs. Updating all of the usages of the iterators with range-based for loops.
llvm-svn: 203278
|
| |
|
|
|
|
| |
This is a precursor to moving to std::unique_ptr.
llvm-svn: 203277
|
| |
|
|
|
|
| |
No functionality change.
llvm-svn: 203276
|
| |
|
|
|
|
| |
This is a precursor to moving to std::unique_ptr.
llvm-svn: 203275
|
| |
|
|
|
|
| |
instace of ProcessElfCore or ProcessMachCore respectively.
llvm-svn: 203274
|
| |
|
|
|
|
|
|
|
|
| |
Previously, the assertions in PointerIntPair would try to calculate the value
(1 << NumLowBitsAvailable); the inferred type here is 'int', so if there were
more than 31 bits available we'd get a shift overflow.
Also, add a rudimentary unit test file for PointerIntPair.
llvm-svn: 203273
|
| |
|
|
|
|
|
|
|
|
| |
files.
Patch by Konrad Kleine.
Differential Revision: http://llvm-reviews.chandlerc.com/D2967
llvm-svn: 203272
|
| |
|
|
| |
llvm-svn: 203271
|
| |
|
|
|
|
| |
It has a lot of them with complex types. C++11 really shines here.
llvm-svn: 203270
|
| |
|
|
|
|
|
| |
The integrated assembler now works for ppc. Since this was the last use of the
bg/p predicate and Hal says that it is now dead, drop the predicate too.
llvm-svn: 203269
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
After hitting the malloc() breakpoint on FreeBSD our top frame is actually
an inlined function malloc_init.
* frame #0: 0x0000000800dcba19 libc.so.7`malloc [inlined] malloc_init at malloc.c:5397
frame #1: 0x0000000800dcba19 libc.so.7`malloc(size=1024) + 9 at malloc.c:5949
frame #2: 0x00000000004006e5 test_step_out_of_malloc_into_function_b_with_dwarf`b(val=1) + 37 at main2.cpp:29
Add a heuristic to keep stepping out until we come to a non-malloc caller,
before checking if it is our desired caller from the test code.
llvm.org/pr17944
llvm-svn: 203268
|