Remove clips where we can show that they are unnecessary.

Source/core/platform/graphics/RoundedRect.cpp

 /*
  * Copyright (C) 2003, 2006, 2009 Apple Inc. All rights reserved.
  * Copyright (C) 2010 Google Inc. All rights reserved.
  * Copyright (C) 2013 Xidorn Quan (quanxunzhen@gmail.com)
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1.  Redistributions of source code must retain the above copyright
@@ skipping 62 matching lines @@
     if (m_bottomLeft.width() > 0 && m_bottomLeft.height() > 0) {
         m_bottomLeft.setWidth(max<int>(0, m_bottomLeft.width() + leftWidth));
         m_bottomLeft.setHeight(max<int>(0, m_bottomLeft.height() + bottomWidth));
     }
     if (m_bottomRight.width() > 0 && m_bottomRight.height() > 0) {
         m_bottomRight.setWidth(max<int>(0, m_bottomRight.width() + rightWidth));
         m_bottomRight.setHeight(max<int>(0, m_bottomRight.height() + bottomWidth));
     }
 }
 
+IntRect RoundedRect::enclosedRect() const

[Julien - ping for review, 2013/06/19 19:42:58]

This will return a smaller rectangle that what enclosed rect would be expected
to return AFAICT. If you look at
http://www.w3.org/TR/css3-background/#border-radius, you are returning the rect
formed by all the ellipses centers.

[jbroman, 2013/08/02 14:28:17]

What I want is "quickly give me a rect which is enclosed by this rounded rect"
(the idea being to be able to say that if some geometry is enclosed by
rrect.enclosedRect(), then it is enclosed by rrect).

Using the ellipse centres seemed like a reasonable way of computing such a rect.
In the common case, the radii are all a few pixels and the returned rect is just
inside the outer rect (i.e. the one returned by RoundedRect::rect).

What do you suggest? A name change? A comment?

+{
+    int minX = m_rect.x() + max(m_radii.topLeft().width(), m_radii.bottomLeft().width());
+    int minY = m_rect.y() + max(m_radii.topLeft().height(), m_radii.topRight().height());
+    int maxX = m_rect.maxX() - max(m_radii.topRight().width(), m_radii.bottomRight().width());
+    int maxY = m_rect.maxY() - max(m_radii.bottomLeft().height(), m_radii.bottomRight().height());
+    return IntRect(minX, minY, maxX - minX, maxY - minY);
+}
+
 void RoundedRect::inflateWithRadii(int size)
 {
     IntRect old = m_rect;
 
     m_rect.inflate(size);
     // Considering the inflation factor of shorter size to scale the radii seems appropriate here
     float factor;
     if (m_rect.width() < m_rect.height())
         factor = old.width() ? (float)m_rect.width() / old.width() : int(0);
     else
@@ skipping 136 matching lines @@
             FloatSize size(bottomRight.width(), bottomRight.height());
             if (!quad.intersectsEllipse(center, size))
                 return false;
         }
     }
 
     return true;
 }
 
 } // namespace WebCore