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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
|
// 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/message_loop.h"
#include "jingle/glue/thread_wrapper.h"
#include "testing/gmock/include/gmock/gmock.h"
#include "testing/gtest/include/gtest/gtest.h"
using ::testing::InSequence;
namespace jingle_glue {
static const uint32 kTestMessage1 = 1;
static const uint32 kTestMessage2 = 2;
static const int kTestDelayMs1 = 10;
static const int kTestDelayMs2 = 20;
static const int kTestDelayMs3 = 30;
static const int kTestDelayMs4 = 40;
static const int kMaxTestDelay = 40;
class MockMessageHandler : public talk_base::MessageHandler {
public:
MOCK_METHOD1(OnMessage, void(talk_base::Message* msg));
};
class ThreadWrapperTest : public testing::Test {
protected:
ThreadWrapperTest() {
}
talk_base::Thread* thread() {
return talk_base::Thread::Current();
}
virtual void SetUp() OVERRIDE {
JingleThreadWrapper::EnsureForCurrentThread();
}
// ThreadWrapper destroyes itself when |message_loop_| is destroyed.
MessageLoop message_loop_;
MockMessageHandler handler1_;
MockMessageHandler handler2_;
};
MATCHER_P3(MatchMessageAndDeleteData, handler, message_id, data, "") {
delete arg->pdata;
return arg->phandler == handler &&
arg->message_id == message_id &&
arg->pdata == data;
}
TEST_F(ThreadWrapperTest, Post) {
talk_base::MessageData* data1_ = new talk_base::MessageData();
talk_base::MessageData* data2_ = new talk_base::MessageData();
talk_base::MessageData* data3_ = new talk_base::MessageData();
talk_base::MessageData* data4_ = new talk_base::MessageData();
thread()->Post(&handler1_, kTestMessage1, data1_);
thread()->Post(&handler1_, kTestMessage2, data2_);
thread()->Post(&handler2_, kTestMessage1, data3_);
thread()->Post(&handler2_, kTestMessage1, data4_);
InSequence in_seq;
EXPECT_CALL(handler1_, OnMessage(
MatchMessageAndDeleteData(&handler1_, kTestMessage1, data1_)));
EXPECT_CALL(handler1_, OnMessage(
MatchMessageAndDeleteData(&handler1_, kTestMessage2, data2_)));
EXPECT_CALL(handler2_, OnMessage(
MatchMessageAndDeleteData(&handler2_, kTestMessage1, data3_)));
EXPECT_CALL(handler2_, OnMessage(
MatchMessageAndDeleteData(&handler2_, kTestMessage1, data4_)));
message_loop_.RunAllPending();
}
TEST_F(ThreadWrapperTest, PostDelayed) {
talk_base::MessageData* data1_ = new talk_base::MessageData();
talk_base::MessageData* data2_ = new talk_base::MessageData();
talk_base::MessageData* data3_ = new talk_base::MessageData();
talk_base::MessageData* data4_ = new talk_base::MessageData();
// Post messages in reverse order and verify that they are called in
// the order of the delays.
thread()->PostDelayed(kTestDelayMs4, &handler2_, kTestMessage1, data4_);
thread()->PostDelayed(kTestDelayMs3, &handler2_, kTestMessage1, data3_);
thread()->PostDelayed(kTestDelayMs2, &handler1_, kTestMessage2, data2_);
thread()->PostDelayed(kTestDelayMs1, &handler1_, kTestMessage1, data1_);
InSequence in_seq;
EXPECT_CALL(handler1_, OnMessage(
MatchMessageAndDeleteData(&handler1_, kTestMessage1, data1_)));
EXPECT_CALL(handler1_, OnMessage(
MatchMessageAndDeleteData(&handler1_, kTestMessage2, data2_)));
EXPECT_CALL(handler2_, OnMessage(
MatchMessageAndDeleteData(&handler2_, kTestMessage1, data3_)));
EXPECT_CALL(handler2_, OnMessage(
MatchMessageAndDeleteData(&handler2_, kTestMessage1, data4_)));
message_loop_.PostDelayedTask(FROM_HERE, new MessageLoop::QuitTask(),
kMaxTestDelay);
message_loop_.Run();
}
TEST_F(ThreadWrapperTest, Clear) {
thread()->Post(&handler1_, kTestMessage1, NULL);
thread()->Post(&handler1_, kTestMessage2, NULL);
thread()->Post(&handler2_, kTestMessage1, NULL);
thread()->Post(&handler2_, kTestMessage2, NULL);
thread()->Clear(&handler1_, kTestMessage2);
InSequence in_seq;
talk_base::MessageData* null_data = NULL;
EXPECT_CALL(handler1_, OnMessage(
MatchMessageAndDeleteData(&handler1_, kTestMessage1, null_data)));
EXPECT_CALL(handler2_, OnMessage(
MatchMessageAndDeleteData(&handler2_, kTestMessage1, null_data)));
EXPECT_CALL(handler2_, OnMessage(
MatchMessageAndDeleteData(&handler2_, kTestMessage2, null_data)));
message_loop_.RunAllPending();
}
TEST_F(ThreadWrapperTest, ClearDelayed) {
// Post messages in reverse order and verify that they are called in
// the order of the delays.
thread()->PostDelayed(kTestDelayMs4, &handler2_, kTestMessage1, NULL);
thread()->PostDelayed(kTestDelayMs3, &handler2_, kTestMessage1, NULL);
thread()->PostDelayed(kTestDelayMs2, &handler1_, kTestMessage2, NULL);
thread()->PostDelayed(kTestDelayMs1, &handler1_, kTestMessage1, NULL);
thread()->Clear(&handler1_, kTestMessage2);
InSequence in_seq;
talk_base::MessageData* null_data = NULL;
EXPECT_CALL(handler1_, OnMessage(
MatchMessageAndDeleteData(&handler1_, kTestMessage1, null_data)));
EXPECT_CALL(handler2_, OnMessage(
MatchMessageAndDeleteData(&handler2_, kTestMessage1, null_data)));
EXPECT_CALL(handler2_, OnMessage(
MatchMessageAndDeleteData(&handler2_, kTestMessage1, null_data)));
message_loop_.PostDelayedTask(FROM_HERE, new MessageLoop::QuitTask(),
kMaxTestDelay);
message_loop_.Run();
}
// Verify that the queue is cleared when a handler is destroyed.
TEST_F(ThreadWrapperTest, ClearDestoroyed) {
MockMessageHandler* handler_ptr;
{
MockMessageHandler handler;
handler_ptr = &handler;
thread()->Post(&handler, kTestMessage1, NULL);
}
talk_base::MessageList removed;
thread()->Clear(handler_ptr, talk_base::MQID_ANY, &removed);
DCHECK_EQ(0U, removed.size());
}
} // namespace jingle_glue
|
