NOT FOR REVIEW: Repro test of WTF::Deque for crbug.com/674287

third_party/WebKit/Source/wtf/DequeTest.cpp

 /*
  * Copyright (C) 2011 Apple Inc. All rights reserved.
  *
  * 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
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 11 matching lines @@
  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
  * THE POSSIBILITY OF SUCH DAMAGE.
  */
 
 #include "wtf/Deque.h"
 
 #include "testing/gtest/include/gtest/gtest.h"
 #include "wtf/HashSet.h"
 #include "wtf/PtrUtil.h"
 #include <memory>
+#include <deque>
 
 namespace WTF {
 
 namespace {
 
 TEST(DequeTest, Basic) {
   Deque<int> intDeque;
   EXPECT_TRUE(intDeque.isEmpty());
   EXPECT_EQ(0ul, intDeque.size());
 }
@@ skipping 554 matching lines @@
   }
 
   // Only odd numbers left.
   {
     int i = 1;
     for (int v : deque)
       EXPECT_EQ(i + 2, v);
   }
 }
 
+// This fails.
+TEST(DequeTest, WTFDequePointersStability) {
+  Deque<int> deque;
+  deque.append(42);
+  int* ptr = &deque.first();
+  ASSERT_EQ(42, *ptr);
+  for (int i = 1; i < 10000; i++) {
+    deque.append(i);
+    ASSERT_EQ(42, *ptr) << " @ iteration " << i;
+    // ASSERT_EQ(ptr, &deque.first()) << "iteration " << i;
+  }
+}
+
+// This fails.
+TEST(DequeTest, WTFDequeNoInlineCapacityPointersStability) {
+  Deque<int, 2 /*inline capacity*/> deque;
+
+  // Fill up the inline capacity.
+  for (int i = 0; i < 128; ++i)
+    deque.append(-1);
+
+  deque.append(42);
+  int* ptr = &deque.last();
+  ASSERT_EQ(42, *ptr);
+  for (int i = 1; i < 10000; i++) {
+    deque.append(1);
+    ASSERT_EQ(42, *ptr) << " @ iteration " << i;
+  }
+}
+
+// This passes.
+TEST(DequeTest, StdDequePointersStability) {
+  std::deque<int> deque;
+  deque.push_back(42);
+  int* ptr = &deque.front();
+  ASSERT_EQ(42, *ptr);
+  for (int i = 1; i < 10000; i++) {
+    deque.push_back(i);
+    ASSERT_EQ(ptr, &deque.front()) << "iteration " << i;
+    ASSERT_EQ(42, *ptr);
+  }
+}
+
 }  // anonymous namespace
 
 }  // namespace WTF