blob: 68c8e45f62c69e3b68faa47c1ec6d3c5c1efa811 (
plain)
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
|
// Copyright 2014 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.
#ifndef MEDIA_BASE_FAKE_SINGLE_THREAD_TASK_RUNNER_H_
#define MEDIA_BASE_FAKE_SINGLE_THREAD_TASK_RUNNER_H_
#include <map>
#include "base/callback.h"
#include "base/macros.h"
#include "base/single_thread_task_runner.h"
#include "base/test/simple_test_tick_clock.h"
namespace media {
class FakeSingleThreadTaskRunner final : public base::SingleThreadTaskRunner {
public:
explicit FakeSingleThreadTaskRunner(base::SimpleTestTickClock* clock);
void RunTasks();
// Note: Advances |clock_|.
void Sleep(base::TimeDelta t);
// base::SingleThreadTaskRunner implementation.
bool PostDelayedTask(const base::Location& from_here,
base::OnceClosure task,
base::TimeDelta delay) final;
bool RunsTasksInCurrentSequence() const final;
// This function is currently not used, and will return false.
bool PostNonNestableDelayedTask(const base::Location& from_here,
base::OnceClosure task,
base::TimeDelta delay) final;
protected:
~FakeSingleThreadTaskRunner() final;
private:
base::SimpleTestTickClock* const clock_;
// A compound key is used to ensure FIFO execution of delayed tasks scheduled
// for the same point-in-time. The second part of the key is simply a FIFO
// sequence number.
using TaskKey = std::pair<base::TimeTicks, unsigned int>;
// Note: The std::map data structure was chosen because the entire
// cast_unittests suite performed 20% faster than when using
// std::priority_queue. http://crbug.com/530842
std::map<TaskKey, base::OnceClosure> tasks_;
bool fail_on_next_task_;
DISALLOW_COPY_AND_ASSIGN(FakeSingleThreadTaskRunner);
};
} // namespace media
#endif // MEDIA_BASE_FAKE_SINGLE_THREAD_TASK_RUNNER_H_
|
