BSP Tree perf tests to match LayerSorter perf tests

cc/quads/draw_polygon.h

 // Copyright 2014 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef CC_QUADS_DRAW_POLYGON_H_
 #define CC_QUADS_DRAW_POLYGON_H_
 
 #include <vector>
 
 #include "cc/base/math_util.h"
 #include "cc/output/bsp_compare_result.h"
-#include "cc/quads/draw_quad.h"
 #include "ui/gfx/point3_f.h"
 #include "ui/gfx/quad_f.h"
+#include "ui/gfx/rect_f.h"
+#include "ui/gfx/transform.h"
 #include "ui/gfx/vector3d_f.h"
 
 namespace cc {
 
+class DrawQuad;
+
 class CC_EXPORT DrawPolygon {
  public:
   DrawPolygon();
   ~DrawPolygon();
 
   DrawPolygon(DrawQuad* original_ref,
               const std::vector<gfx::Point3F>& in_points,
               const gfx::Vector3dF& normal,
               int draw_order_index = 0);
+  DrawPolygon(DrawQuad* original_ref,
+              const gfx::RectF& visible_content_rect,
+              const gfx::Transform& transform,
+              int draw_order_index = 0);
 
   // Split takes this DrawPolygon and splits it into two pieces that are on
   // either side of |splitter|. Any edges of this polygon that cross the plane
   // of |splitter| will have an intersection point that is shared by both
   // polygons on either side.
   // Split will only return true if it determines that we got back 2
   // intersection points. Only when it returns true will front and back both be
   // valid new polygons that are on opposite sides of the splitting plane.
   bool Split(const DrawPolygon& splitter,
              scoped_ptr<DrawPolygon>* front,
@@ skipping 30 matching lines @@
   // The pointer to the original quad, which gives us all the drawing info
   // we need.
   // This DrawQuad is owned by the caller and its lifetime must be preserved
   // as long as this DrawPolygon is alive.
   DrawQuad* original_ref_;
 };
 
 }  // namespace cc
 
 #endif  // CC_QUADS_DRAW_POLYGON_H_