| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
| |
llvm-svn: 132505
|
| |
|
|
|
|
|
|
|
| |
I was confused whether new uint8_t[] would zero-initialize the returned
array, and it seems that so is gcc-4.0.
This should fix the test failures on darwin 9.
llvm-svn: 132500
|
| |
|
|
| |
llvm-svn: 132488
|
| |
|
|
| |
llvm-svn: 132487
|
| |
|
|
| |
llvm-svn: 132486
|
| |
|
|
|
|
| |
MemCpyOpt::processStore. If something accesses the dest of the "copy" between the call and the copy, the performCallSlotOptzn transformation is not valid.
llvm-svn: 132485
|
| |
|
|
|
|
|
|
| |
DBG_VALUEs. This approach has several downsides, for example, it does not work when dbg value is a constant integer, it does not work if reg is defined more than once, it places end of debug value range markers in the wrong place. It even causes misleading incorrect debug info when duplicate DBG_VALUE instructions point to same reg def.
Instead, use simpler approach and let DBG_VALUE follow its predecessor instruction. After live debug value analysis pass, all DBG_VALUE instruction are placed at the right place. Thanks Jakob for the hint!
llvm-svn: 132483
|
| |
|
|
| |
llvm-svn: 132479
|
| |
|
|
|
|
|
|
| |
Testcase will come when we use it.
Part of rdar://9119939
llvm-svn: 132476
|
| |
|
|
|
|
|
| |
This saves two virtual function calls and an Allocatable BitVector test,
making RAFast run 2% faster.
llvm-svn: 132471
|
| |
|
|
|
|
|
|
|
|
| |
Parsing a register name/number for .cfi directives can't assume that a
register name starts with a '%' token. Be more flexible and check for a
register number instead. Still unlikely to be perfect, but it allows us
to parse both plain identifiers as register names and integers as register
numbers, which is what we're wanting to support at this point.
llvm-svn: 132466
|
| |
|
|
|
|
| |
rdar://problem/6373334
llvm-svn: 132458
|
| |
|
|
|
|
| |
Found by valgrind.
llvm-svn: 132457
|
| |
|
|
| |
llvm-svn: 132456
|
| |
|
|
|
|
| |
No functional change.
llvm-svn: 132455
|
| |
|
|
| |
llvm-svn: 132451
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
register classes.
It provides information for each register class that cannot be
determined statically, like:
- The number of allocatable registers in a class after filtering out the
reserved and invalid registers.
- The preferred allocation order with registers that overlap callee-saved
registers last.
- The last callee-saved register that overlaps a given physical register.
This information usually doesn't change between functions, so it is
reused for compiling multiple functions when possible. The many
possible combinations of reserved and callee saves registers makes it
unfeasible to compute this information statically in TableGen.
Use RegisterClassInfo to count available registers in various heuristics
in SimpleRegisterCoalescing, making the pass run 4% faster.
llvm-svn: 132450
|
| |
|
|
| |
llvm-svn: 132448
|
| |
|
|
| |
llvm-svn: 132444
|
| |
|
|
|
|
|
|
|
|
|
|
| |
instead of the first instruction in the block. This is a bit of a hack; "Clobber" isn't really the right marking in the first place. memdep doesn't really have any way of properly expressing "unanalyzable" at the moment. Using it on the terminator is much less ambiguous than using it on an arbitrary instruction, though.
In the given testcase, the "Clobber" was pointing to a load, and GVN was incorrectly assuming that meant that the "Clobber" load overlapped the load being analyzed (when they are actually unrelated).
The included testcase tests both this commit and r132434.
Part two of rdar://9429882. (r132434 was mislabeled.)
llvm-svn: 132442
|
| |
|
|
|
|
|
|
| |
is is deemed unanalyzable (and we execute one of the "goto PredTranslationFailure" statements), make sure we don't put information about the predecessors of that block into the returned data structures; this can lead to, among other things, extraneous results (which will confuse passes using memdep). Fixes an assert in GVN compiling ruby. Part of rdar://problem/9521954 .
Testcase coming up soon.
llvm-svn: 132434
|
| |
|
|
| |
llvm-svn: 132433
|
| |
|
|
|
|
| |
.debug_loc entries.
llvm-svn: 132427
|
| |
|
|
| |
llvm-svn: 132424
|
| |
|
|
|
|
|
|
| |
types if the vector type is legal.
Fixes rdar://9306086
llvm-svn: 132420
|
| |
|
|
| |
llvm-svn: 132419
|
| |
|
|
|
|
| |
the TargetLowering enum.
llvm-svn: 132418
|
| |
|
|
| |
llvm-svn: 132416
|
| |
|
|
|
|
|
| |
This commit caused regressions in i386 flops-[568], matrix, salsa20,
256.bzip2, and enc-md5.
llvm-svn: 132413
|
| |
|
|
|
|
| |
rdar://problem/5660695
llvm-svn: 132411
|
| |
|
|
|
|
|
|
| |
floating-point comparison, generate a mask of 0s or 1s, and generally
DTRT with NaNs. Only profitable when the user wants a materialized 0
or 1 at runtime. rdar://problem/5993888
llvm-svn: 132404
|
| |
|
|
| |
llvm-svn: 132402
|
| |
|
|
|
|
|
|
| |
Add TargetRegisterInfo::hasSubClassEq and use it to check for compatible
register classes instead of trying to list all register classes in
X86's getLoadStoreRegOpcode.
llvm-svn: 132398
|
| |
|
|
| |
llvm-svn: 132396
|
| |
|
|
| |
llvm-svn: 132395
|
| |
|
|
|
|
|
|
|
| |
patch we add a flag to enable a new type legalization decision - to promote
integer elements in vectors. Currently, the rest of the codegen does not support
this kind of legalization. This flag will be removed when the transition is
complete.
llvm-svn: 132394
|
| |
|
|
|
|
| |
patch to TargetLowering.cpp. rdar://problem/5660695
llvm-svn: 132388
|
| |
|
|
|
|
|
|
|
|
| |
For targets with no itinerary (x86) it is a nop by default. For
targets with issue width already expressed in the itinerary (ARM) it
bypasses a scoreboard check but otherwise does not affect the
schedule. It does make the code more consistent and complete and
allows new targets to specify their issue width in an arbitrary way.
llvm-svn: 132385
|
| |
|
|
|
|
|
| |
landing pad, forward llvm.eh.resume calls to it instead of turning them
invalidly into invokes.
llvm-svn: 132382
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
turns out that it could cause an infinite loop in some situations. If this code
is triggered and it converts a cleanup into a catchall, but that cleanup was in
already in a cleanup, then the _Unwind_SjLj_Resume could infinite loop. I.e.,
the code doesn't consume the exception object and passes it on to
_Unwind_SjLj_Resume. But _USjLjR expects it to be consumed (since it's landing
at a catchall instead of a cleanup). So it uses the values that are presently
there, which are the values that tell it to jump to the fake landing pad.
<rdar://problem/9508402>
llvm-svn: 132381
|
| |
|
|
|
|
| |
eagerly.
llvm-svn: 132377
|
| |
|
|
| |
llvm-svn: 132373
|
| |
|
|
|
|
| |
debug_pubtypes list.
llvm-svn: 132371
|
| |
|
|
|
|
| |
so that their sign extended forms are congruent when no overflow occurs.
llvm-svn: 132360
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
When assigned ranges are evicted, they are put in the RS_Evicted stage and are
not allowed to evict anything else. That prevents looping automatically.
When evicting ranges just to get a cheaper register, use only spill weights to
find the possible candidates. Avoid breaking hints for this purpose, it is not
worth it.
Start implementing more complex eviction heuristics, guarded by the temporary
-complex-eviction flag. The initial version permits a heavier range to be
evicted if it doesn't have any uses where the evicting range is live. This makes
it a good candidate for live ranfge splitting.
llvm-svn: 132358
|
| |
|
|
|
|
| |
space, and the destination address space. Fix up the interface on MemIntrinsic and MemTransferInst to make this clear, and fix InstructionDereferencesPointer in LazyValueInfo.cpp to use the interface properly.
llvm-svn: 132356
|
| |
|
|
| |
llvm-svn: 132355
|
| |
|
|
| |
llvm-svn: 132353
|
| |
|
|
| |
llvm-svn: 132351
|
| |
|
|
|
|
|
| |
sub with a non-constant. Fix comments, enlarge test case.
rdar://problem/6501862
llvm-svn: 132348
|