summaryrefslogtreecommitdiffstats
path: root/base/task_queue_unittest.cc
blob: f2d2f49e51317e835321edf007e2a770f39f6715 (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
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
// Copyright (c) 2011 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/basictypes.h"
#include "base/memory/scoped_ptr.h"
#include "base/task.h"
#include "base/task_queue.h"
#include "testing/gtest/include/gtest/gtest.h"

namespace {

// Sets bools according to whether Run or the destructor were called.
class TrackCallsTask : public Task {
 public:
  TrackCallsTask(bool* ran, bool* deleted)
      : ran_(ran),
        deleted_(deleted) {
    *ran_ = false;
    *deleted_ = false;
  }

  virtual ~TrackCallsTask() {
    *deleted_ = true;
  }

  virtual void Run() {
    *ran_ = true;
  }

 private:
  bool* ran_;
  bool* deleted_;

  DISALLOW_COPY_AND_ASSIGN(TrackCallsTask);
};

// Adds a given task to the queue when run.
class TaskQueuerTask : public Task {
 public:
  TaskQueuerTask(TaskQueue* queue, Task* task_to_queue)
      : queue_(queue),
        task_to_queue_(task_to_queue) {
  }

  virtual void Run() {
    queue_->Push(task_to_queue_);
  }

 private:
  TaskQueue* queue_;
  Task* task_to_queue_;

  DISALLOW_COPY_AND_ASSIGN(TaskQueuerTask);
};

}  // namespace

TEST(TaskQueueTest, RunNoTasks) {
  TaskQueue queue;
  EXPECT_TRUE(queue.IsEmpty());

  queue.Run();
  EXPECT_TRUE(queue.IsEmpty());
}

TEST(TaskQueueTest, RunTasks) {
  TaskQueue queue;

  bool ran_task1 = false;
  bool deleted_task1 = false;
  queue.Push(new TrackCallsTask(&ran_task1, &deleted_task1));

  bool ran_task2 = false;
  bool deleted_task2 = false;
  queue.Push(new TrackCallsTask(&ran_task2, &deleted_task2));

  queue.Run();

  EXPECT_TRUE(ran_task1);
  EXPECT_TRUE(deleted_task1);
  EXPECT_TRUE(ran_task2);
  EXPECT_TRUE(deleted_task2);
  EXPECT_TRUE(queue.IsEmpty());
}

TEST(TaskQueueTest, ClearTasks) {
  TaskQueue queue;

  bool ran_task1 = false;
  bool deleted_task1 = false;
  queue.Push(new TrackCallsTask(&ran_task1, &deleted_task1));

  bool ran_task2 = false;
  bool deleted_task2 = false;
  queue.Push(new TrackCallsTask(&ran_task2, &deleted_task2));

  queue.Clear();

  EXPECT_TRUE(queue.IsEmpty());

  queue.Run();

  EXPECT_FALSE(ran_task1);
  EXPECT_TRUE(deleted_task1);
  EXPECT_FALSE(ran_task2);
  EXPECT_TRUE(deleted_task2);
  EXPECT_TRUE(queue.IsEmpty());
}

TEST(TaskQueueTest, OneTaskQueuesMore) {
  TaskQueue main_queue;

  // Build a task which will queue two more when run.
  scoped_ptr<TaskQueue> nested_queue(new TaskQueue());
  bool ran_task1 = false;
  bool deleted_task1 = false;
  nested_queue->Push(
      new TaskQueuerTask(&main_queue,
                         new TrackCallsTask(&ran_task1, &deleted_task1)));
  bool ran_task2 = false;
  bool deleted_task2 = false;
  nested_queue->Push(
      new TaskQueuerTask(&main_queue,
                         new TrackCallsTask(&ran_task2, &deleted_task2)));

  main_queue.Push(nested_queue.release());

  // Run the task which pushes two more tasks.
  main_queue.Run();

  // None of the pushed tasks shoudl have run yet.
  EXPECT_FALSE(ran_task1);
  EXPECT_FALSE(deleted_task1);
  EXPECT_FALSE(ran_task2);
  EXPECT_FALSE(deleted_task2);
  EXPECT_FALSE(main_queue.IsEmpty());

  // Now run the nested tasks.
  main_queue.Run();

  EXPECT_TRUE(ran_task1);
  EXPECT_TRUE(deleted_task1);
  EXPECT_TRUE(ran_task2);
  EXPECT_TRUE(deleted_task2);
  EXPECT_TRUE(main_queue.IsEmpty());
}