2013-10-24 17:44:27 +00:00
|
|
|
/*
|
|
|
|
* Copyright 2013 Google Inc.
|
|
|
|
*
|
|
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
|
|
* found in the LICENSE file.
|
|
|
|
*/
|
|
|
|
|
2021-03-11 19:44:42 +00:00
|
|
|
#include "include/gpu/GrDirectContext.h"
|
2019-05-15 14:15:52 +00:00
|
|
|
#include "src/core/SkMessageBus.h"
|
2019-04-23 17:05:21 +00:00
|
|
|
#include "tests/Test.h"
|
2013-10-24 17:44:27 +00:00
|
|
|
|
2018-07-11 19:58:57 +00:00
|
|
|
namespace {
|
2018-10-18 21:27:59 +00:00
|
|
|
|
2013-10-24 17:44:27 +00:00
|
|
|
struct TestMessage {
|
2018-07-11 19:58:57 +00:00
|
|
|
TestMessage(int i, float f) : x(i), y(f) {}
|
|
|
|
|
2013-10-24 17:44:27 +00:00
|
|
|
int x;
|
|
|
|
float y;
|
|
|
|
};
|
2018-10-18 21:27:59 +00:00
|
|
|
|
|
|
|
static inline bool SkShouldPostMessageToBus(const TestMessage&, uint32_t) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2020-08-06 18:11:56 +00:00
|
|
|
} // namespace
|
2021-03-07 02:16:15 +00:00
|
|
|
|
2021-03-11 19:44:42 +00:00
|
|
|
DECLARE_SKMESSAGEBUS_MESSAGE(TestMessage, uint32_t, true)
|
2013-10-24 17:44:27 +00:00
|
|
|
|
|
|
|
DEF_TEST(MessageBus, r) {
|
2021-03-11 19:44:42 +00:00
|
|
|
using TestMessageBus = SkMessageBus<TestMessage, uint32_t>;
|
2013-10-24 17:44:27 +00:00
|
|
|
// Register two inboxes to receive all TestMessages.
|
2021-03-11 19:44:42 +00:00
|
|
|
TestMessageBus::Inbox inbox1(0), inbox2(0);
|
2013-10-24 17:44:27 +00:00
|
|
|
|
|
|
|
// Send two messages.
|
|
|
|
const TestMessage m1 = { 5, 4.2f };
|
|
|
|
const TestMessage m2 = { 6, 4.3f };
|
2021-03-07 02:16:15 +00:00
|
|
|
TestMessageBus::Post(std::move(m1));
|
|
|
|
TestMessageBus::Post(std::move(m2));
|
2013-10-24 17:44:27 +00:00
|
|
|
|
|
|
|
// Make sure we got two.
|
2015-02-06 19:54:28 +00:00
|
|
|
SkTArray<TestMessage> messages;
|
2013-10-24 17:44:27 +00:00
|
|
|
inbox1.poll(&messages);
|
|
|
|
REPORTER_ASSERT(r, 2 == messages.count());
|
|
|
|
REPORTER_ASSERT(r, 5 == messages[0].x);
|
|
|
|
REPORTER_ASSERT(r, 6 == messages[1].x);
|
|
|
|
|
|
|
|
// Send another; check we get just that one.
|
|
|
|
const TestMessage m3 = { 1, 0.3f };
|
2021-03-07 02:16:15 +00:00
|
|
|
TestMessageBus::Post(m3);
|
2013-10-24 17:44:27 +00:00
|
|
|
inbox1.poll(&messages);
|
|
|
|
REPORTER_ASSERT(r, 1 == messages.count());
|
|
|
|
REPORTER_ASSERT(r, 1 == messages[0].x);
|
|
|
|
|
|
|
|
// Nothing was sent since the last read.
|
|
|
|
inbox1.poll(&messages);
|
|
|
|
REPORTER_ASSERT(r, 0 == messages.count());
|
|
|
|
|
|
|
|
// Over all this time, inbox2 should have piled up 3 messages.
|
|
|
|
inbox2.poll(&messages);
|
|
|
|
REPORTER_ASSERT(r, 3 == messages.count());
|
|
|
|
REPORTER_ASSERT(r, 5 == messages[0].x);
|
|
|
|
REPORTER_ASSERT(r, 6 == messages[1].x);
|
|
|
|
REPORTER_ASSERT(r, 1 == messages[2].x);
|
|
|
|
}
|
|
|
|
|
2018-07-11 19:58:57 +00:00
|
|
|
namespace {
|
2018-10-18 21:27:59 +00:00
|
|
|
|
2021-03-07 02:16:15 +00:00
|
|
|
struct TestMessageRefCnt : public SkRefCnt {
|
|
|
|
TestMessageRefCnt(int i, float f) : x(i), y(f) {}
|
|
|
|
|
|
|
|
int x;
|
|
|
|
float y;
|
|
|
|
};
|
|
|
|
|
|
|
|
static inline bool SkShouldPostMessageToBus(const sk_sp<TestMessageRefCnt>&, uint32_t) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace
|
|
|
|
|
2021-03-11 19:44:42 +00:00
|
|
|
DECLARE_SKMESSAGEBUS_MESSAGE(sk_sp<TestMessageRefCnt>, uint32_t, false)
|
2021-03-07 02:16:15 +00:00
|
|
|
|
|
|
|
DEF_TEST(MessageBusSp, r) {
|
|
|
|
// Register two inboxes to receive all TestMessages.
|
2021-03-11 19:44:42 +00:00
|
|
|
using TestMessageBus = SkMessageBus<sk_sp<TestMessageRefCnt>, uint32_t, false>;
|
|
|
|
TestMessageBus::Inbox inbox1(0);
|
2021-03-07 02:16:15 +00:00
|
|
|
|
|
|
|
// Send two messages.
|
|
|
|
auto m1 = sk_make_sp<TestMessageRefCnt>(5, 4.2f);
|
|
|
|
auto m2 = sk_make_sp<TestMessageRefCnt>(6, 4.3f);
|
|
|
|
TestMessageBus::Post(std::move(m1));
|
|
|
|
TestMessageBus::Post(std::move(m2));
|
|
|
|
|
|
|
|
// Make sure we got two.
|
|
|
|
SkTArray<sk_sp<TestMessageRefCnt>> messages;
|
|
|
|
inbox1.poll(&messages);
|
|
|
|
REPORTER_ASSERT(r, 2 == messages.count());
|
|
|
|
REPORTER_ASSERT(r, messages[0]->unique());
|
|
|
|
REPORTER_ASSERT(r, messages[1]->unique());
|
|
|
|
REPORTER_ASSERT(r, 5 == messages[0]->x);
|
|
|
|
REPORTER_ASSERT(r, 6 == messages[1]->x);
|
|
|
|
|
|
|
|
// Send another; check we get just that one.
|
|
|
|
auto m3 = sk_make_sp<TestMessageRefCnt>(1, 0.3f);
|
|
|
|
TestMessageBus::Post(std::move(m3));
|
|
|
|
inbox1.poll(&messages);
|
|
|
|
REPORTER_ASSERT(r, 1 == messages.count());
|
|
|
|
REPORTER_ASSERT(r, messages[0]->unique());
|
|
|
|
REPORTER_ASSERT(r, 1 == messages[0]->x);
|
|
|
|
|
|
|
|
// Send another without std::move(), it should trigger SkASSERT().
|
|
|
|
// auto m4 = sk_make_sp<TestMessageRefCnt>(1, 0.3f);
|
|
|
|
// TestMessageBus::Post(m4);
|
|
|
|
|
|
|
|
// Nothing was sent since the last read.
|
|
|
|
inbox1.poll(&messages);
|
|
|
|
REPORTER_ASSERT(r, 0 == messages.count());
|
|
|
|
}
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
|
2018-07-11 19:58:57 +00:00
|
|
|
struct AddressedMessage {
|
2021-03-11 19:44:42 +00:00
|
|
|
GrDirectContext::DirectContextID fInboxID;
|
2018-10-18 21:27:59 +00:00
|
|
|
};
|
2018-07-11 19:58:57 +00:00
|
|
|
|
2021-03-11 19:44:42 +00:00
|
|
|
static inline bool SkShouldPostMessageToBus(const AddressedMessage& msg,
|
|
|
|
GrDirectContext::DirectContextID msgBusUniqueID) {
|
|
|
|
SkASSERT(msgBusUniqueID.isValid());
|
|
|
|
if (!msg.fInboxID.isValid()) {
|
2018-10-18 21:27:59 +00:00
|
|
|
return true;
|
2018-07-11 19:58:57 +00:00
|
|
|
}
|
2018-10-18 21:27:59 +00:00
|
|
|
return msgBusUniqueID == msg.fInboxID;
|
2018-07-11 19:58:57 +00:00
|
|
|
}
|
2018-10-18 21:27:59 +00:00
|
|
|
|
2020-08-06 18:11:56 +00:00
|
|
|
} // namespace
|
2018-10-18 21:27:59 +00:00
|
|
|
|
2021-03-11 19:44:42 +00:00
|
|
|
DECLARE_SKMESSAGEBUS_MESSAGE(AddressedMessage, GrDirectContext::DirectContextID, true)
|
2018-07-11 19:58:57 +00:00
|
|
|
|
2018-10-18 21:27:59 +00:00
|
|
|
DEF_TEST(MessageBus_SkShouldPostMessageToBus, r) {
|
2021-03-11 19:44:42 +00:00
|
|
|
using ID = GrDirectContext::DirectContextID;
|
|
|
|
using AddressedMessageBus = SkMessageBus<AddressedMessage, ID>;
|
2018-07-11 19:58:57 +00:00
|
|
|
|
2021-03-11 19:44:42 +00:00
|
|
|
ID idInvalid;
|
|
|
|
ID id1 = ID::Next(),
|
|
|
|
id2 = ID::Next(),
|
|
|
|
id3 = ID::Next();
|
|
|
|
|
|
|
|
AddressedMessageBus::Inbox inbox1(id1), inbox2(id2);
|
|
|
|
|
|
|
|
AddressedMessageBus::Post({idInvalid}); // Should go to both
|
|
|
|
AddressedMessageBus::Post({id1}); // Should go to inbox1
|
|
|
|
AddressedMessageBus::Post({id2}); // Should go to inbox2
|
|
|
|
AddressedMessageBus::Post({id3}); // Should go nowhere
|
2018-07-11 19:58:57 +00:00
|
|
|
|
|
|
|
SkTArray<AddressedMessage> messages;
|
|
|
|
inbox1.poll(&messages);
|
|
|
|
REPORTER_ASSERT(r, messages.count() == 2);
|
|
|
|
if (messages.count() == 2) {
|
2021-03-11 19:44:42 +00:00
|
|
|
REPORTER_ASSERT(r, !messages[0].fInboxID.isValid());
|
|
|
|
REPORTER_ASSERT(r, messages[1].fInboxID == id1);
|
2018-07-11 19:58:57 +00:00
|
|
|
}
|
|
|
|
inbox2.poll(&messages);
|
|
|
|
REPORTER_ASSERT(r, messages.count() == 2);
|
|
|
|
if (messages.count() == 2) {
|
2021-03-11 19:44:42 +00:00
|
|
|
REPORTER_ASSERT(r, !messages[0].fInboxID.isValid());
|
|
|
|
REPORTER_ASSERT(r, messages[1].fInboxID == id2);
|
2018-07-11 19:58:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-10-24 17:44:27 +00:00
|
|
|
// Multithreaded tests tbd.
|