Skip to content
  1. May 24, 2009
  2. May 22, 2009
    • Dan Gohman's avatar
      Teach IndVarSimplify's FixUsesBeforeDefs to handle InvokeInsts by · 781b75a7
      Dan Gohman authored
      assuming that the use of the value is in a block dominated by the
      "normal" destination. LangRef.html and other documentation sources
      don't explicitly guarantee this, but it seems to be assumed in
      other places in LLVM at least.
      
      This fixes an assertion failure on the included testcase, which
      is derived from the Ada testsuite.
      
      FixUsesBeforeDefs is a temporary measure which I'm looking to
      replace with a more capable solution.
      
      llvm-svn: 72266
      781b75a7
  3. May 19, 2009
    • Dan Gohman's avatar
      Remove an irrelevant comment. · 67587ce2
      Dan Gohman authored
      llvm-svn: 72132
      67587ce2
    • Dan Gohman's avatar
      Trim unneeded #includes. · adc70d68
      Dan Gohman authored
      llvm-svn: 72130
      adc70d68
    • Dan Gohman's avatar
      Teach SCEVExpander to expand arithmetic involving pointers into GEP · 2649491f
      Dan Gohman authored
      instructions. It attempts to create high-level multi-operand GEPs,
      though in cases where this isn't possible it falls back to casting
      the pointer to i8* and emitting a GEP with that. Using GEP instructions
      instead of ptrtoint+arithmetic+inttoptr helps pointer analyses that
      don't use ScalarEvolution, such as BasicAliasAnalysis.
      
      Also, make the AddrModeMatcher more aggressive in handling GEPs.
      Previously it assumed that operand 0 of a GEP would require a register
      in almost all cases. It now does extra checking and can do more
      matching if operand 0 of the GEP is foldable. This fixes a problem
      that was exposed by SCEVExpander using GEPs.
      
      llvm-svn: 72093
      2649491f
  4. May 14, 2009
  5. May 12, 2009
    • Dan Gohman's avatar
      Factor the code for collecting IV users out of LSR into an IVUsers class, · d76d71a2
      Dan Gohman authored
      and generalize it so that it can be used by IndVarSimplify. Implement the
      base IndVarSimplify transformation code using IVUsers. This removes
      TestOrigIVForWrap and associated code, as ScalarEvolution now has enough
      builtin overflow detection and folding logic to handle all the same cases,
      and more. Run "opt -iv-users -analyze -disable-output" on your favorite
      loop for an example of what IVUsers does.
      
      This lets IndVarSimplify eliminate IV casts and compute trip counts in
      more cases. Also, this happens to finally fix the remaining testcases
      in PR1301.
      
      Now that IndVarSimplify is being more aggressive, it occasionally runs
      into the problem where ScalarEvolutionExpander's code for avoiding
      duplicate expansions makes it difficult to ensure that all expanded
      instructions dominate all the instructions that will use them. As a
      temporary measure, IndVarSimplify now uses a FixUsesBeforeDefs function
      to fix up instructions inserted by SCEVExpander. Fortunately, this code
      is contained, and can be easily removed once a more comprehensive
      solution is available.
      
      llvm-svn: 71535
      d76d71a2
  6. May 05, 2009
    • Dan Gohman's avatar
      Re-apply 70645, converting ScalarEvolution to use · 48f82222
      Dan Gohman authored
      CallbackVH, with fixes. allUsesReplacedWith need to
      walk the def-use chains and invalidate all users of a
      value that is replaced. SCEVs of users need to be
      recalcualted even if the new value is equivalent. Also,
      make forgetLoopPHIs walk def-use chains, since any
      SCEV that depends on a PHI should be recalculated when
      more information about that PHI becomes available.
      
      llvm-svn: 70927
      48f82222
  7. May 03, 2009
  8. May 02, 2009
  9. Apr 28, 2009
  10. Apr 27, 2009
  11. Apr 23, 2009
  12. Apr 21, 2009
  13. Apr 18, 2009
  14. Apr 16, 2009
    • Dan Gohman's avatar
      Expand GEPs in ScalarEvolution expressions. SCEV expressions can now · 0a40ad93
      Dan Gohman authored
      have pointer types, though in contrast to C pointer types, SCEV
      addition is never implicitly scaled. This not only eliminates the
      need for special code like IndVars' EliminatePointerRecurrence
      and LSR's own GEP expansion code, it also does a better job because
      it lets the normal optimizations handle pointer expressions just
      like integer expressions.
      
      Also, since LLVM IR GEPs can't directly index into multi-dimensional
      VLAs, moving the GEP analysis out of client code and into the SCEV
      framework makes it easier for clients to handle multi-dimensional
      VLAs the same way as other arrays.
      
      Some existing regression tests show improved optimization.
      test/CodeGen/ARM/2007-03-13-InstrSched.ll in particular improved to
      the point where if-conversion started kicking in; I turned it off
      for this test to preserve the intent of the test.
      
      llvm-svn: 69258
      0a40ad93
    • Dale Johannesen's avatar
      Eliminate zext over (iv | const) or (signed iv), · a71daa83
      Dale Johannesen authored
      and sext over (iv | const), if a longer iv is
      available.  Allow expressions to have more than
      one zext/sext parent.  All from OpenSSL.
      
      llvm-svn: 69241
      a71daa83
  15. Apr 15, 2009
  16. Feb 24, 2009
  17. Feb 23, 2009
  18. Feb 18, 2009
  19. Feb 17, 2009
  20. Feb 16, 2009
  21. Feb 14, 2009
  22. Feb 12, 2009
    • Dan Gohman's avatar
      Teach IndVarSimplify to optimize code using the C "int" type for · eb6be650
      Dan Gohman authored
      loop induction on LP64 targets. When the induction variable is
      used in addressing, IndVars now is usually able to inserst a
      64-bit induction variable and eliminates the sign-extending cast.
      This is also useful for code using C "short" types for
      induction variables on targets with 32-bit addressing.
      
      Inserting a wider induction variable is easy; the tricky part is
      determining when trunc(sext(i)) expressions are no-ops. This
      requires range analysis of the loop trip count. A common case is
      when the original loop iteration starts at 0 and exits when the
      induction variable is signed-less-than a fixed value; this case
      is now handled.
      
      This replaces IndVarSimplify's OptimizeCanonicalIVType. It was
      doing the same optimization, but it was limited to loops with
      constant trip counts, because it was running after the loop
      rewrite, and the information about the original induction
      variable is lost by that point.
      
      Rename ScalarEvolution's executesAtLeastOnce to
      isLoopGuardedByCond, generalize it to be able to test for
      ICMP_NE conditions, and move it to be a public function so that
      IndVars can use it.
      
      llvm-svn: 64407
      eb6be650
  23. Nov 26, 2008
Loading