Use custom ListContainer to allocate DrawQuads

cc/quads/list_container_unittest.cc

 // 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.
 
 #include "cc/quads/list_container.h"
 
 #include <vector>
 #include "cc/quads/draw_quad.h"
 #include "cc/quads/largest_draw_quad.h"
 #include "cc/quads/render_pass_draw_quad.h"
@@ skipping 118 matching lines @@
     testing::InSequence s;
     EXPECT_CALL(*dq_1, Destruct());
     EXPECT_CALL(separator, Call());
     EXPECT_CALL(*dq_1, Destruct()).Times(0);
   }
 
   list.EraseAndInvalidateAllPointers(list.begin());
   separator.Call();
 }
 
+TEST(ListContainerTest, SimpleIndexAccessSharedQuadState) {
+  ListContainer<SharedQuadState> list;
+
+  size_t size = 3;
+  SharedQuadState* sqs_1 = list.AllocateAndConstruct<SharedQuadState>();
+  SharedQuadState* sqs_2 = list.AllocateAndConstruct<SharedQuadState>();
+  SharedQuadState* sqs_3 = list.AllocateAndConstruct<SharedQuadState>();
+
+  EXPECT_EQ(size, list.size());
+  EXPECT_EQ(sqs_1, list.front());
+  EXPECT_EQ(sqs_3, list.back());
+  EXPECT_EQ(list.front(), list.ElementAt(0));
+  EXPECT_EQ(sqs_2, list.ElementAt(1));
+  EXPECT_EQ(list.back(), list.ElementAt(2));
+}
+
 TEST(ListContainerTest, SimpleInsertionSharedQuadState) {
   ListContainer<SharedQuadState> list;
 
   size_t size = 3;
   SharedQuadState* sqs_1 = list.AllocateAndConstruct<SharedQuadState>();
   list.AllocateAndConstruct<SharedQuadState>();
   SharedQuadState* sqs_3 = list.AllocateAndConstruct<SharedQuadState>();
 
   EXPECT_EQ(size, list.size());
   EXPECT_EQ(sqs_1, list.front());
@@ skipping 310 matching lines @@
 
   int i = 0;
   for (std::vector<SimpleDrawQuad*>::const_iterator sdq_iter = sdq_list.begin();
        sdq_iter < sdq_list.end();
        ++sdq_iter) {
     EXPECT_EQ(i, (*sdq_iter)->get_value());
     ++i;
   }
 }
 
+TEST(ListContainerTest, SimpleManipulationWithIndexSimpleDrawQuad) {
+  ListContainer<DrawQuad> list(sizeof(kLargestDrawQuad));
+  std::vector<SimpleDrawQuad*> dq_list;
+  size_t size = 10;
+  for (size_t i = 0; i < size; ++i) {
+    dq_list.push_back(list.AllocateAndConstruct<SimpleDrawQuad>());
+  }
+  EXPECT_EQ(size, list.size());
+
+  for (size_t i = 0; i < size; ++i) {
+    static_cast<SimpleDrawQuad*>(list.ElementAt(i))->set_value(i);
+  }
+
+  int i = 0;
+  for (std::vector<SimpleDrawQuad*>::const_iterator dq_iter = dq_list.begin();
+       dq_iter != dq_list.end();
+       ++dq_iter, ++i) {
+    EXPECT_EQ(i, (*dq_iter)->get_value());
+  }
+}
+
+TEST(ListContainerTest,
+     SimpleManipulationWithIndexMoreThanOneAllocationSimpleDrawQuad) {
+  ListContainer<DrawQuad> list(sizeof(kLargestDrawQuad), 2);
+  std::vector<SimpleDrawQuad*> dq_list;
+  size_t size = 10;
+  for (size_t i = 0; i < size; ++i) {
+    dq_list.push_back(list.AllocateAndConstruct<SimpleDrawQuad>());
+  }
+  EXPECT_EQ(size, list.size());
+
+  for (size_t i = 0; i < size; ++i) {
+    static_cast<SimpleDrawQuad*>(list.ElementAt(i))->set_value(i);
+  }
+
+  int i = 0;
+  for (std::vector<SimpleDrawQuad*>::const_iterator dq_iter = dq_list.begin();
+       dq_iter != dq_list.end();
+       ++dq_iter, ++i) {
+    EXPECT_EQ(i, (*dq_iter)->get_value());
+  }
+}
+
 }  // namespace
 }  // namespace cc