1 files changed, 119 insertions, 0 deletions
diff --git a/dom/media/gtest/TestWebMBuffered.cpp b/dom/media/gtest/TestWebMBuffered.cpp
new file mode 100644
index 000000000..4572c5767
--- /dev/null
+++ b/dom/media/gtest/TestWebMBuffered.cpp
@@ -0,0 +1,119 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+* License, v. 2.0. If a copy of the MPL was not distributed with this
+* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+#include "gtest/gtest.h"
+#include "mozilla/ArrayUtils.h"
+#include <stdio.h>
+#include "nsTArray.h"
+#include "WebMBufferedParser.h"
+
+using namespace mozilla;
+
+// "test.webm" contains 8 SimpleBlocks in a single Cluster.  The blocks with
+// timecodes 100000000 and are 133000000 skipped by WebMBufferedParser
+// because they occur after a block with timecode 160000000 and the parser
+// expects in-order timecodes per the WebM spec.  The remaining 6
+// SimpleBlocks have the following attributes:
+static const uint64_t gTimecodes[] = { 66000000, 160000000, 166000000, 200000000, 233000000, 320000000 };
+static const int64_t gEndOffsets[] = { 501, 772, 1244, 1380, 1543, 2015 };
+
+TEST(WebMBuffered, BasicTests)
+{
+  ReentrantMonitor dummy("dummy");
+  WebMBufferedParser parser(0);
+
+  nsTArray<WebMTimeDataOffset> mapping;
+  parser.Append(nullptr, 0, mapping, dummy);
+  EXPECT_TRUE(mapping.IsEmpty());
+  EXPECT_EQ(parser.mStartOffset, 0);
+  EXPECT_EQ(parser.mCurrentOffset, 0);
+
+  unsigned char buf[] = { 0x1a, 0x45, 0xdf, 0xa3 };
+  parser.Append(buf, ArrayLength(buf), mapping, dummy);
+  EXPECT_TRUE(mapping.IsEmpty());
+  EXPECT_EQ(parser.mStartOffset, 0);
+  EXPECT_EQ(parser.mCurrentOffset, 4);
+}
+
+static void
+ReadFile(const char* aPath, nsTArray<uint8_t>& aBuffer)
+{
+  FILE* f = fopen(aPath, "rb");
+  ASSERT_NE(f, (FILE *) nullptr);
+
+  int r = fseek(f, 0, SEEK_END);
+  ASSERT_EQ(r, 0);
+
+  long size = ftell(f);
+  ASSERT_NE(size, -1);
+  aBuffer.SetLength(size);
+
+  r = fseek(f, 0, SEEK_SET);
+  ASSERT_EQ(r, 0);
+
+  size_t got = fread(aBuffer.Elements(), 1, size, f);
+  ASSERT_EQ(got, size_t(size));
+
+  r = fclose(f);
+  ASSERT_EQ(r, 0);
+}
+
+TEST(WebMBuffered, RealData)
+{
+  ReentrantMonitor dummy("dummy");
+  WebMBufferedParser parser(0);
+
+  nsTArray<uint8_t> webmData;
+  ReadFile("test.webm", webmData);
+
+  nsTArray<WebMTimeDataOffset> mapping;
+  parser.Append(webmData.Elements(), webmData.Length(), mapping, dummy);
+  EXPECT_EQ(mapping.Length(), 6u);
+  EXPECT_EQ(parser.mStartOffset, 0);
+  EXPECT_EQ(parser.mCurrentOffset, int64_t(webmData.Length()));
+  EXPECT_EQ(parser.GetTimecodeScale(), 500000u);
+
+  for (uint32_t i = 0; i < mapping.Length(); ++i) {
+    EXPECT_EQ(mapping[i].mEndOffset, gEndOffsets[i]);
+    EXPECT_EQ(mapping[i].mSyncOffset, 361);
+    EXPECT_EQ(mapping[i].mTimecode, gTimecodes[i]);
+  }
+}
+
+TEST(WebMBuffered, RealDataAppend)
+{
+  ReentrantMonitor dummy("dummy");
+  WebMBufferedParser parser(0);
+  nsTArray<WebMTimeDataOffset> mapping;
+
+  nsTArray<uint8_t> webmData;
+  ReadFile("test.webm", webmData);
+
+  uint32_t arrayEntries = mapping.Length();
+  size_t offset = 0;
+  while (offset < webmData.Length()) {
+    parser.Append(webmData.Elements() + offset, 1, mapping, dummy);
+    offset += 1;
+    EXPECT_EQ(parser.mCurrentOffset, int64_t(offset));
+    if (mapping.Length() != arrayEntries) {
+      arrayEntries = mapping.Length();
+      ASSERT_LE(arrayEntries, 6u);
+      uint32_t i = arrayEntries - 1;
+      EXPECT_EQ(mapping[i].mEndOffset, gEndOffsets[i]);
+      EXPECT_EQ(mapping[i].mSyncOffset, 361);
+      EXPECT_EQ(mapping[i].mTimecode, gTimecodes[i]);
+      EXPECT_EQ(parser.GetTimecodeScale(), 500000u);
+    }
+  }
+  EXPECT_EQ(mapping.Length(), 6u);
+  EXPECT_EQ(parser.mStartOffset, 0);
+  EXPECT_EQ(parser.mCurrentOffset, int64_t(webmData.Length()));
+  EXPECT_EQ(parser.GetTimecodeScale(), 500000u);
+
+  for (uint32_t i = 0; i < mapping.Length(); ++i) {
+    EXPECT_EQ(mapping[i].mEndOffset, gEndOffsets[i]);
+    EXPECT_EQ(mapping[i].mSyncOffset, 361);
+    EXPECT_EQ(mapping[i].mTimecode, gTimecodes[i]);
+  }
+}