50a3043194
This adds an invalidation listener mechanism to SkPixelRef to let it send this message while still staying ignorant of who's listening. These messages are tricky to deliver. The SkPixelRefs they originates from and the GrResourceCaches they ultimately end up at may be on different threads; neither class is threadsafe; their object lifetimes are totally independent; it's a many-senders-to-many-receivers relation; and neither codebase should really know about the other. So I've added a per-message-type global message bus to broadcast messages to threadsafe inboxes. Anyone can post() a message, which will show up in all the inboxes of that type, read whenever the inbox's owner calls poll(). The implementation is _dumb_; it can be improved in several dimensions (inbox size limits, lock-free message delivery) if we find the need. I took some care to make sure not to send the invalidation message for any SkPixelRef that's sharing a generation ID with another SkPixelRef. BUG= R=bsalomon@google.com, scroggo@google.com, reed@google.com Author: mtklein@google.com Review URL: https://codereview.chromium.org/26734003 git-svn-id: http://skia.googlecode.com/svn/trunk@11949 2bbb7eff-a529-9590-31e7-b0007b416f81
58 lines
1.5 KiB
C++
58 lines
1.5 KiB
C++
/*
|
|
* Copyright 2013 Google Inc.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
* found in the LICENSE file.
|
|
*/
|
|
|
|
#include "SkMessageBus.h"
|
|
#include "Test.h"
|
|
#include "TestClassDef.h"
|
|
|
|
namespace {
|
|
|
|
struct TestMessage {
|
|
int x;
|
|
float y;
|
|
};
|
|
|
|
} // namespace
|
|
|
|
DEF_TEST(MessageBus, r) {
|
|
// Register two inboxes to receive all TestMessages.
|
|
SkMessageBus<TestMessage>::Inbox inbox1, inbox2;
|
|
|
|
// Send two messages.
|
|
const TestMessage m1 = { 5, 4.2f };
|
|
const TestMessage m2 = { 6, 4.3f };
|
|
SkMessageBus<TestMessage>::Post(m1);
|
|
SkMessageBus<TestMessage>::Post(m2);
|
|
|
|
// Make sure we got two.
|
|
SkTDArray<TestMessage> messages;
|
|
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 };
|
|
SkMessageBus<TestMessage>::Post(m3);
|
|
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);
|
|
}
|
|
|
|
// Multithreaded tests tbd.
|