test_task_runner.cc 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109
  1. // Copyright (c) 2012 The Chromium Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style license that can be
  3. // found in the LICENSE file.
  4. #include "net/quic/test_task_runner.h"
  5. #include <algorithm>
  6. #include <utility>
  7. #include "base/time/time.h"
  8. #include "net/third_party/quiche/src/quiche/quic/test_tools/mock_clock.h"
  9. #include "testing/gtest/include/gtest/gtest.h"
  10. namespace net::test {
  11. namespace {
  12. base::TimeTicks NowInTicks(const quic::MockClock& clock) {
  13. base::TimeTicks ticks;
  14. return ticks + base::Microseconds(
  15. (clock.Now() - quic::QuicTime::Zero()).ToMicroseconds());
  16. }
  17. } // namespace
  18. TestTaskRunner::TestTaskRunner(quic::MockClock* clock) : clock_(clock) {}
  19. TestTaskRunner::~TestTaskRunner() = default;
  20. bool TestTaskRunner::PostDelayedTask(const base::Location& from_here,
  21. base::OnceClosure task,
  22. base::TimeDelta delay) {
  23. EXPECT_GE(delay, base::TimeDelta());
  24. tasks_.emplace_back(from_here, std::move(task), NowInTicks(*clock_), delay,
  25. base::TestPendingTask::NESTABLE);
  26. return true;
  27. }
  28. bool TestTaskRunner::PostNonNestableDelayedTask(const base::Location& from_here,
  29. base::OnceClosure task,
  30. base::TimeDelta delay) {
  31. return PostDelayedTask(from_here, std::move(task), delay);
  32. }
  33. bool TestTaskRunner::RunsTasksInCurrentSequence() const {
  34. return true;
  35. }
  36. const std::vector<PostedTask>& TestTaskRunner::GetPostedTasks() const {
  37. return tasks_;
  38. }
  39. quic::QuicTime::Delta TestTaskRunner::NextPendingTaskDelay() {
  40. if (tasks_.empty())
  41. return quic::QuicTime::Delta::Infinite();
  42. auto next = FindNextTask();
  43. return quic::QuicTime::Delta::FromMicroseconds(
  44. (next->GetTimeToRun() - NowInTicks(*clock_)).InMicroseconds());
  45. }
  46. void TestTaskRunner::RunNextTask() {
  47. auto next = FindNextTask();
  48. DCHECK(next != tasks_.end());
  49. clock_->AdvanceTime(quic::QuicTime::Delta::FromMicroseconds(
  50. (next->GetTimeToRun() - NowInTicks(*clock_)).InMicroseconds()));
  51. PostedTask task = std::move(*next);
  52. tasks_.erase(next);
  53. std::move(task.task).Run();
  54. }
  55. void TestTaskRunner::FastForwardBy(quic::QuicTime::Delta delta) {
  56. DCHECK_GE(delta, quic::QuicTime::Delta::Zero());
  57. quic::QuicTime end_timestamp = clock_->Now() + delta;
  58. while (NextPendingTaskDelay() <= end_timestamp - clock_->Now()) {
  59. RunNextTask();
  60. }
  61. if (clock_->Now() != end_timestamp)
  62. clock_->AdvanceTime(end_timestamp - clock_->Now());
  63. while (NextPendingTaskDelay() <= quic::QuicTime::Delta::Zero()) {
  64. RunNextTask();
  65. }
  66. return;
  67. }
  68. void TestTaskRunner::RunUntilIdle() {
  69. while (!tasks_.empty())
  70. RunNextTask();
  71. }
  72. namespace {
  73. struct ShouldRunBeforeLessThan {
  74. bool operator()(const PostedTask& task1, const PostedTask& task2) const {
  75. return task1.ShouldRunBefore(task2);
  76. }
  77. };
  78. } // namespace
  79. std::vector<PostedTask>::iterator TestTaskRunner::FindNextTask() {
  80. return std::min_element(tasks_.begin(), tasks_.end(),
  81. ShouldRunBeforeLessThan());
  82. }
  83. } // namespace net::test