TaskScheduler [10] SchedulerWorkerThreadStack

base/task_scheduler/scheduler_stack_unittest.cc

+// Copyright 2016 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 "base/task_scheduler/scheduler_stack.h"
+
+#include "base/task_scheduler/test_utils.h"
+#include "testing/gtest/include/gtest/gtest.h"
+
+namespace base {
+namespace internal {
+
+// Verify that Push() and Pop() add/remove values in FIFO order.
+TEST(TaskSchedulerStackTest, PushPop) {
+  SchedulerStack stack;
+  EXPECT_TRUE(stack.Empty());
+  EXPECT_EQ(0U, stack.Size());
+
+  stack.Push(1);
+  EXPECT_FALSE(stack.Empty());
+  EXPECT_EQ(1U, stack.Size());
+
+  stack.Push(2);
+  EXPECT_FALSE(stack.Empty());
+  EXPECT_EQ(2U, stack.Size());
+
+  stack.Push(3);
+  EXPECT_FALSE(stack.Empty());
+  EXPECT_EQ(3U, stack.Size());
+
+  EXPECT_EQ(3, stack.Pop());
+  EXPECT_FALSE(stack.Empty());
+  EXPECT_EQ(2U, stack.Size());
+
+  stack.Push(3);
+  EXPECT_FALSE(stack.Empty());
+  EXPECT_EQ(3U, stack.Size());
+
+  EXPECT_EQ(3, stack.Pop());
+  EXPECT_FALSE(stack.Empty());
+  EXPECT_EQ(2U, stack.Size());
+
+  EXPECT_EQ(2, stack.Pop());
+  EXPECT_FALSE(stack.Empty());
+  EXPECT_EQ(1U, stack.Size());
+
+  EXPECT_EQ(1, stack.Pop());
+  EXPECT_TRUE(stack.Empty());
+  EXPECT_EQ(0U, stack.Size());
+}
+
+// Verify that all values in [0, 63] can be pushed and popped from the stack.
+TEST(TaskSchedulerStackTest, PushPopAllRange) {
+  SchedulerStack stack;
+  EXPECT_EQ(0, stack.Size());
+
+  for (int i = 0; i <= 63; ++i) {
+    stack.Push(i);
+    EXPECT_EQ(i + 1, stack.Size());
+  }
+
+  for (int i = 63; i >= 0; --i) {
+    EXPECT_EQ(i, stack.Pop());
+    EXPECT_EQ(i, stack.Size());
+  }
+}
+
+// Verify that a value can be removed by Remove().
+TEST(TaskSchedulerStackTest, Remove) {
+  SchedulerStack stack;
+  EXPECT_TRUE(stack.Empty());
+  EXPECT_EQ(0U, stack.Size());
+
+  stack.Push(1);
+  EXPECT_FALSE(stack.Empty());
+  EXPECT_EQ(1U, stack.Size());
+
+  stack.Push(2);
+  EXPECT_FALSE(stack.Empty());
+  EXPECT_EQ(2U, stack.Size());
+
+  stack.Push(3);
+  EXPECT_FALSE(stack.Empty());
+  EXPECT_EQ(3U, stack.Size());
+
+  stack.Remove(2);
+  EXPECT_FALSE(stack.Empty());
+  EXPECT_EQ(2U, stack.Size());
+
+  EXPECT_EQ(3, stack.Pop());
+  EXPECT_FALSE(stack.Empty());
+  EXPECT_EQ(1U, stack.Size());
+
+  EXPECT_EQ(1, stack.Pop());
+  EXPECT_TRUE(stack.Empty());
+  EXPECT_EQ(0U, stack.Size());
+}
+
+// Verify that all values in [0, 63] can be pushed and removed from the stack.
+TEST(TaskSchedulerStackTest, PushRemoveAllRange) {
+  SchedulerStack stack;
+  EXPECT_EQ(0, stack.Size());
+
+  for (int i = 0; i <= 63; ++i) {
+    stack.Push(i);
+    EXPECT_EQ(i + 1, stack.Size());
+  }
+
+  for (int i = 0; i <= 63; ++i) {
+    stack.Remove(i);
+    EXPECT_EQ(63 - i, stack.Size());
+  }
+}
+
+// Verify that a value can be pushed again after it has been removed.
+TEST(TaskSchedulerStackTest, PushAfterRemove) {
+  SchedulerStack stack;
+  EXPECT_EQ(0U, stack.Size());
+  EXPECT_TRUE(stack.Empty());
+
+  stack.Push(5);
+  EXPECT_EQ(1U, stack.Size());
+  EXPECT_FALSE(stack.Empty());
+
+  stack.Remove(5);
+  EXPECT_EQ(0U, stack.Size());
+  EXPECT_TRUE(stack.Empty());
+
+  stack.Push(5);
+  EXPECT_EQ(1U, stack.Size());
+  EXPECT_FALSE(stack.Empty());
+}
+
+// Verify that Push() DCHECKs when a value under the allowed range is inserted.
+TEST(TaskSchedulerStackTest, PushUnderAllowedRange) {
+  SchedulerStack stack;
+  EXPECT_DCHECK_DEATH({ stack.Push(-1); }, "");
+}
+
+// Verify that Push() DCHECKs when a value above the allowed range is inserted.
+TEST(TaskSchedulerStackTest, PushAboveAllowedRange) {
+  SchedulerStack stack;
+  EXPECT_DCHECK_DEATH({ stack.Push(64); }, "");
+}
+
+// Verify that Push() DCHECKs when a value is inserted twice.
+TEST(TaskSchedulerStackTest, PushTwice) {
+  SchedulerStack stack;
+  stack.Push(5);
+  EXPECT_DCHECK_DEATH({ stack.Push(5); }, "");
+}
+
+}  // namespace internal
+}  // namespace base