1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
// Copyright 2012 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef BASE_TEST_TEST_SIMPLE_TASK_RUNNER_H_
#define BASE_TEST_TEST_SIMPLE_TASK_RUNNER_H_
#include "base/compiler_specific.h"
#include "base/containers/circular_deque.h"
#include "base/functional/callback.h"
#include "base/synchronization/lock.h"
#include "base/task/single_thread_task_runner.h"
#include "base/test/test_pending_task.h"
#include "base/threading/platform_thread.h"
namespace base {
class TimeDelta;
// ATTENTION: Prefer using base::test::TaskEnvironment and a task runner
// obtained from base/task/thread_pool.h over this class. This class isn't as
// "simple" as it seems specifically because it runs tasks in a surprising order
// (delays aren't respected and nesting doesn't behave as usual). Should you
// prefer to flush all tasks regardless of delays,
// TaskEnvironment::TimeSource::MOCK_TIME and
// TaskEnvironment::FastForwardUntilNoTasksRemain() have you covered.
//
// TestSimpleTaskRunner is a simple TaskRunner implementation that can
// be used for testing. It implements SingleThreadTaskRunner as that
// interface implements SequencedTaskRunner, which in turn implements
// TaskRunner, so TestSimpleTaskRunner can be passed in to a function
// that accepts any *TaskRunner object.
//
// TestSimpleTaskRunner has the following properties which make it simple:
//
// - Tasks are simply stored in a queue in FIFO order, ignoring delay
// and nestability.
// - Tasks aren't guaranteed to be destroyed immediately after
// they're run.
//
// However, TestSimpleTaskRunner allows for reentrancy, in that it
// handles the running of tasks that in turn call back into itself
// (e.g., to post more tasks).
//
// Tasks are only run with explicit invocation of `TestSimpleTaskRunner::Run*()`
// methods.
//
// Note that, like any TaskRunner, TestSimpleTaskRunner is
// ref-counted.
class TestSimpleTaskRunner : public SingleThreadTaskRunner {
public:
TestSimpleTaskRunner();
TestSimpleTaskRunner(const TestSimpleTaskRunner&) = delete;
TestSimpleTaskRunner& operator=(const TestSimpleTaskRunner&) = delete;
// SingleThreadTaskRunner implementation.
bool PostDelayedTask(const Location& from_here,
OnceClosure task,
TimeDelta delay) override;
bool PostNonNestableDelayedTask(const Location& from_here,
OnceClosure task,
TimeDelta delay) override;
bool RunsTasksInCurrentSequence() const override;
base::circular_deque<TestPendingTask> TakePendingTasks();
size_t NumPendingTasks() const;
bool HasPendingTask() const;
base::TimeDelta NextPendingTaskDelay() const;
base::TimeDelta FinalPendingTaskDelay() const;
// Clears the queue of pending tasks without running them.
void ClearPendingTasks();
// Runs each current pending task in order and clears the queue. Tasks posted
// by the tasks that run within this call do not run within this call. Can
// only be called on the thread that created this TestSimpleTaskRunner.
void RunPendingTasks();
// Runs pending tasks until the queue is empty. Can only be called on the
// thread that created this TestSimpleTaskRunner.
void RunUntilIdle();
protected:
~TestSimpleTaskRunner() override;
private:
// Thread on which this was instantiated.
const PlatformThreadRef thread_ref_ = PlatformThread::CurrentRef();
// Synchronizes access to |pending_tasks_|.
mutable Lock lock_;
base::circular_deque<TestPendingTask> pending_tasks_;
};
} // namespace base
#endif // BASE_TEST_TEST_SIMPLE_TASK_RUNNER_H_
|
