Skip to content
  1. Mar 21, 2009
  2. Mar 19, 2009
  3. Mar 16, 2009
  4. Mar 11, 2009
  5. Mar 07, 2009
    • Duncan Sands's avatar
      Introduce new linkage types linkonce_odr, weak_odr, common_odr · 12da8ce3
      Duncan Sands authored
      and extern_weak_odr.  These are the same as the non-odr versions,
      except that they indicate that the global will only be overridden
      by an *equivalent* global.  In C, a function with weak linkage can
      be overridden by a function which behaves completely differently.
      This means that IP passes have to skip weak functions, since any
      deductions made from the function definition might be wrong, since
      the definition could be replaced by something completely different
      at link time.   This is not allowed in C++, thanks to the ODR
      (One-Definition-Rule): if a function is replaced by another at
      link-time, then the new function must be the same as the original
      function.  If a language knows that a function or other global can
      only be overridden by an equivalent global, it can give it the
      weak_odr linkage type, and the optimizers will understand that it
      is alright to make deductions based on the function body.  The
      code generators on the other hand map weak and weak_odr linkage
      to the same thing.
      
      llvm-svn: 66339
      12da8ce3
  6. Feb 24, 2009
  7. Feb 23, 2009
  8. Feb 19, 2009
  9. Feb 18, 2009
  10. Feb 13, 2009
  11. Feb 12, 2009
  12. Feb 09, 2009
  13. Feb 07, 2009
    • Dan Gohman's avatar
      Constify TargetInstrInfo::EmitInstrWithCustomInserter, allowing · 747e55bc
      Dan Gohman authored
      ScheduleDAG's TLI member to use const.
      
      llvm-svn: 64018
      747e55bc
    • Dale Johannesen's avatar
      Get rid of the last non-DebugLoc versions of getNode! · 62fd95d6
      Dale Johannesen authored
      Many targets build placeholder nodes for special operands, e.g.
      GlobalBaseReg on X86 and PPC for the PIC base.  There's no
      sensible way to associate debug info with these.  I've left
      them built with getNode calls with explicit DebugLoc::getUnknownLoc operands. 
      I'm not too happy about this but don't see a good improvement;
      I considered adding a getPseudoOperand or something, but it
      seems to me that'll just make it harder to read.
      
      llvm-svn: 63992
      62fd95d6
  14. Feb 06, 2009
  15. Feb 05, 2009
  16. Feb 04, 2009
  17. Jan 26, 2009
  18. Jan 20, 2009
  19. Jan 15, 2009
  20. Jan 12, 2009
  21. Jan 09, 2009
  22. Jan 05, 2009
  23. Jan 01, 2009
    • Duncan Sands's avatar
      Fix PR3274: when promoting the condition of a BRCOND node, · 8feb694e
      Duncan Sands authored
      promote from i1 all the way up to the canonical SetCC type.
      In order to discover an appropriate type to use, pass
      MVT::Other to getSetCCResultType.  In order to be able to
      do this, change getSetCCResultType to take a type as an
      argument, not a value (this is also more logical).
      
      llvm-svn: 61542
      8feb694e
  24. Dec 14, 2008
  25. Dec 03, 2008
  26. Dec 01, 2008
  27. Nov 24, 2008
  28. Nov 23, 2008
  29. Nov 18, 2008
  30. Nov 15, 2008
  31. Nov 05, 2008
    • Dan Gohman's avatar
      Eliminate the ISel priority queue, which used the topological order for a · f14b77eb
      Dan Gohman authored
      priority function. Instead, just iterate over the AllNodes list, which is
      already in topological order. This eliminates a fair amount of bookkeeping,
      and speeds up the isel phase by about 15% on many testcases.
      
      The impact on most targets is that AddToISelQueue calls can be simply removed.
      
      In the x86 target, there are two additional notable changes.
      
      The rule-bending AND+SHIFT optimization in MatchAddress that creates new
      pre-isel nodes during isel is now a little more verbose, but more robust.
      Instead of either creating an invalid DAG or creating an invalid topological
      sort, as it has historically done, it can now just insert the new nodes into
      the node list at a position where they will be consistent with the topological
      ordering.
      
      Also, the address-matching code has logic that checked to see if a node was
      "already selected". However, when a node is selected, it has all its uses
      taken away via ReplaceAllUsesWith or equivalent, so it won't recieve any
      further visits from MatchAddress. This code is now removed.
      
      llvm-svn: 58748
      f14b77eb
  32. Nov 03, 2008
  33. Oct 27, 2008
    • David Greene's avatar
      · ce2a9381
      David Greene authored
      Have TableGen emit setSubgraphColor calls under control of a -gen-debug
      flag.  Then in a debugger developers can set breakpoints at these calls
      to see waht is about to be selected and what the resulting subgraph
      looks like.  This really helps when debugging instruction selection.
      
      llvm-svn: 58278
      ce2a9381
  34. Oct 18, 2008
    • Dan Gohman's avatar
      Teach DAGCombine to fold constant offsets into GlobalAddress nodes, · 2fe6bee5
      Dan Gohman authored
      and add a TargetLowering hook for it to use to determine when this
      is legal (i.e. not in PIC mode, etc.)
      
      This allows instruction selection to emit folded constant offsets
      in more cases, such as the included testcase, eliminating the need
      for explicit arithmetic instructions.
      
      This eliminates the need for the C++ code in X86ISelDAGToDAG.cpp
      that attempted to achieve the same effect, but wasn't as effective.
      
      Also, fix handling of offsets in GlobalAddressSDNodes in several
      places, including changing GlobalAddressSDNode's offset from
      int to int64_t.
      
      The Mips, Alpha, Sparc, and CellSPU targets appear to be
      unaware of GlobalAddress offsets currently, so set the hook to
      false on those targets.
      
      llvm-svn: 57748
      2fe6bee5
  35. Oct 16, 2008
Loading