Skip to content
  1. Nov 13, 2009
  2. Nov 10, 2009
  3. Nov 07, 2009
  4. Nov 06, 2009
  5. Nov 04, 2009
  6. Nov 03, 2009
  7. Oct 30, 2009
  8. Oct 29, 2009
  9. Oct 23, 2009
    • Douglas Gregor's avatar
      Eliminate QualifiedDeclRefExpr, which captured the notion of a · 4bd90e53
      Douglas Gregor authored
      qualified reference to a declaration that is not a non-static data
      member or non-static member function, e.g., 
      
        namespace N { int i; }
        int j = N::i;
      
      Instead, extend DeclRefExpr to optionally store the qualifier. Most
      clients won't see or care about the difference (since
      QualifierDeclRefExpr inherited DeclRefExpr). However, this reduces the
      number of top-level expression types that clients need to cope with,
      brings the implementation of DeclRefExpr into line with MemberExpr,
      and simplifies and unifies our handling of declaration references.
      
      Extended DeclRefExpr to (optionally) store explicitly-specified
      template arguments. This occurs when naming a declaration via a
      template-id (which will be stored in a TemplateIdRefExpr) that,
      following template argument deduction and (possibly) overload
      resolution, is replaced with a DeclRefExpr that refers to a template
      specialization but maintains the template arguments as written.
      
      llvm-svn: 84962
      4bd90e53
    • Fariborz Jahanian's avatar
      Complete code gen for '.*' binary expression for · ffba662d
      Fariborz Jahanian authored
      both scalar and aggregates.
      
      llvm-svn: 84910
      ffba662d
  10. Oct 21, 2009
  11. Oct 19, 2009
  12. Oct 13, 2009
    • Chris Lattner's avatar
      reimplement codegen for indirect goto with the following advantages: · 2bb5cb49
      Chris Lattner authored
      1. CGF now has fewer bytes of state (one pointer instead of a vector).
      2. The generated code is determinstic, instead of getting labels in
         'map order' based on pointer addresses.
      3. Clang now emits one 'indirect goto switch' for each function, instead
         of one for each indirect goto.  This fixes an M*N = N^2 IR size issue
         when there are lots of address-taken labels and lots of indirect gotos.
      4. This also makes the default cause do something useful, reducing the
         size of the jump table needed (by one).
      
      llvm-svn: 83952
      2bb5cb49
  13. Oct 07, 2009
  14. Oct 03, 2009
  15. Sep 29, 2009
  16. Sep 27, 2009
  17. Sep 24, 2009
  18. Sep 23, 2009
  19. Sep 15, 2009
  20. Sep 14, 2009
  21. Sep 12, 2009
  22. Sep 11, 2009
  23. Sep 09, 2009
  24. Sep 05, 2009
  25. Sep 04, 2009
  26. Aug 31, 2009
Loading