Lines Matching defs:messages
34 // Send two messages.
41 SkTArray<TestMessage> messages;
42 inbox1.poll(&messages);
43 REPORTER_ASSERT(r, 2 == messages.count());
44 REPORTER_ASSERT(r, 5 == messages[0].x);
45 REPORTER_ASSERT(r, 6 == messages[1].x);
50 inbox1.poll(&messages);
51 REPORTER_ASSERT(r, 1 == messages.count());
52 REPORTER_ASSERT(r, 1 == messages[0].x);
55 inbox1.poll(&messages);
56 REPORTER_ASSERT(r, 0 == messages.count());
58 // Over all this time, inbox2 should have piled up 3 messages.
59 inbox2.poll(&messages);
60 REPORTER_ASSERT(r, 3 == messages.count());
61 REPORTER_ASSERT(r, 5 == messages[0].x);
62 REPORTER_ASSERT(r, 6 == messages[1].x);
63 REPORTER_ASSERT(r, 1 == messages[2].x);
88 // Send two messages.
95 SkTArray<sk_sp<TestMessageRefCnt>> messages;
96 inbox1.poll(&messages);
97 REPORTER_ASSERT(r, 2 == messages.count());
98 REPORTER_ASSERT(r, messages[0]->unique());
99 REPORTER_ASSERT(r, messages[1]->unique());
100 REPORTER_ASSERT(r, 5 == messages[0]->x);
101 REPORTER_ASSERT(r, 6 == messages[1]->x);
106 inbox1.poll(&messages);
107 REPORTER_ASSERT(r, 1 == messages.count());
108 REPORTER_ASSERT(r, messages[0]->unique());
109 REPORTER_ASSERT(r, 1 == messages[0]->x);
116 inbox1.poll(&messages);
117 REPORTER_ASSERT(r, 0 == messages.count());
155 SkTArray<AddressedMessage> messages;
156 inbox1.poll(&messages);
157 REPORTER_ASSERT(r, messages.count() == 2);
158 if (messages.count() == 2) {
159 REPORTER_ASSERT(r, !messages[0].fInboxID.isValid());
160 REPORTER_ASSERT(r, messages[1].fInboxID == id1);
162 inbox2.poll(&messages);
163 REPORTER_ASSERT(r, messages.count() == 2);
164 if (messages.count() == 2) {
165 REPORTER_ASSERT(r, !messages[0].fInboxID.isValid());
166 REPORTER_ASSERT(r, messages[1].fInboxID == id2);