Commits

Show all
Author Commit Message Labels Comments Date
Evan Cheng
Preliminary ARM debug support based on patch by Mikael of FlexyCore.
Tags
checker-132
Evan Cheng
Some code clean up.
Bill Wendling
Only perform SETO/SETC to JO/JC conversion if extractvalue is coming from an arithmetic with overflow instruction.
Tags
checker/checker-132
Nuno Lopes
fix typo. thanks Baldrick for noticing
Nuno Lopes
add gcc 4.1.2 from redhat to the list of broken compilers
Duncan Sands
Update these instructions to the 2.4 release.
Duncan Sands
For amusement, implement SADDO, SSUBO, UADDO, USUBO for promoted integer types, eg: i16 on ppc-32, or i24 on any platform. Complete support for arbitrary precision integers would require handling expanded integer types, eg: i128, but I couldn't be bothered.
Duncan Sands
Mention the Ada and Fortran front-ends.
convert-repo
update tags
Duncan Sands
Don't dereference the end() iterator. This was causing a bunch of failures when running "make ENABLE_EXPENSIVE_CHECKS=1 check".
Mon P Wang
Added a little more information that vector shifts require vector shift amount.
Mon P Wang
Fixed a bug when trying to optimize a extract vector element of a bit convert that changes the number of elements of a shuffle.
Evan Cheng
Fix MachineCodeEmitter to use uintptr_t instead of intptr_t. This avoids some overflow issues. Patch by Thomas Jablin.
Bill Wendling
Whitespace changes.
Dale Johannesen
Rewrite instructions for configuring external tests to reflect reality.
Evan Cheng
Fix a bug introduced by r59265. If lazy compilation is disabled, return actual function ptr instead of ptr to stub if function is already compiled.
Chris Lattner
move an entry, add some notes, remove a completed item (IMPLICIT_DEF)
Chris Lattner
Allow basicaa to walk through geps with identical indices in parallel, allowing it to decide that P/Q must alias if A/B must alias in things like: P = gep A, 0, i, 1 Q = gep B, 0, i, 1 This allows GVN to delete 62 more instructions out of 403.gcc.
Bill Wendling
Whitespace fixes.
Dan Gohman
Update CalcLatency to work in terms of edge latencies, rather than node latencies. Use CalcLatency instead of manual code in CalculatePriorities to keep it consistent. Previously it computed slightly different results.
Evan Cheng
Fix a couple of Dwarf bugs. - Emit DW_AT_byte_size for struct and union of size zero. - Emit DW_AT_declaration for forward type declaration.
Tags
checker-131
Scott Michel
CellSPU: - Fix bug 3185, with misc other cleanups. - Needed to implement SPUInstrInfo::InsertBranch(). CAUTION: Not sure what gets or needs to get passed to InsertBranch() to insert a conditional branch. This will abort for now until a good test case shows up.
Bill Wendling
Implement fast-isel conversion of a branch instruction that's branching on an overflow/carry from the "arithmetic with overflow" intrinsics. It searches the machine basic block from bottom to top to find the SETO/SETC instruction that is its conditional. If an instruction modifies EFLAGS before it reaches the SETO/SETC instruction, then it defaults to the normal instruction emission.
Dan Gohman
Rewrite the SDep class, and simplify some of the related code. The Cost field is removed. It was only being used in a very limited way, to indicate when the scheduler should attempt to protect a live register, and it isn't really needed to do that. If we ever want the scheduler to start inserting copies in non-prohibitive situations, we'll have to rethink some things anyway. A Latency field is added. Instead of giving each node a single fixed latency, each e…
Chris Lattner
loosen up an assertion that isn't valid when called from invalidateCachedPointerInfo. Thanks to Bill for sending me a testcase.
Dan Gohman
Minor code simplification.
Bill Wendling
Add sub/mul overflow intrinsics. This currently doesn't have a target-independent way of determining overflow on multiplication. It's very tricky. Patch by Zoltan Varga!
Chris Lattner
Teach GVN to invalidate some memdep information when it does an RAUW of a pointer. This allows is to catch more equivalencies. For example, the type_lists_compatible_p function used to require two iterations of the gvn pass (!) to delete its 18 redundant loads because the first pass would CSE all the addressing computation cruft, which would unblock the second memdep/gvn passes from recognizing them. This change allows memdep/gvn to catch all 18 when run just once on the function (as is typical :) instead of just 3. On all of 403.gcc, this bumps up the # reundandancies found from: 63 gvn - Number of instructions PRE'd 153991 gvn - Number of instructions deleted 50069 gvn - Number of loads deleted to: 63 gvn - Number of instructions PRE'd 154137 gvn - Number of instructions deleted 50185 gvn - Number of loads deleted +120 loads deleted isn't bad.
Duncan Sands
Fix PR3117: not all nodes being legalized. The essential problem was that the DAG can contain random unused nodes which were never analyzed. When remapping a value of a node being processed, such a node may become used and need to be analyzed; however due to operands being transformed during analysis the node may morph into a different one. Users of the morphing node need to be updated, and this wasn't happening. While there I added a bunch o…
Chris Lattner
Teach BasicAA::getModRefInfo(CallSite, CallSite) some tricks based on readnone/readonly functions. Teach memdep to look past readonly calls when analyzing deps for a readonly call. This allows elimination of a few more calls from 403.gcc: before: 63 gvn - Number of instructions PRE'd 153986 gvn - Number of instructions deleted 50069 gvn - Number of loads deleted after: 63 gvn - Number of instructions PRE'd 153991 gvn - Number of instructions deleted 50069 gvn …
  1. Prev
  2. Next