sergeyu@chromium.org | 9cf037b | 2014-02-07 19:03:26 +0000 | [diff] [blame^] | 1 | /* |
| 2 | * libjingle |
| 3 | * Copyright 2014 Google Inc. |
| 4 | * |
| 5 | * Redistribution and use in source and binary forms, with or without |
| 6 | * modification, are permitted provided that the following conditions are met: |
| 7 | * |
| 8 | * 1. Redistributions of source code must retain the above copyright notice, |
| 9 | * this list of conditions and the following disclaimer. |
| 10 | * 2. Redistributions in binary form must reproduce the above copyright notice, |
| 11 | * this list of conditions and the following disclaimer in the documentation |
| 12 | * and/or other materials provided with the distribution. |
| 13 | * 3. The name of the author may not be used to endorse or promote products |
| 14 | * derived from this software without specific prior written permission. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
| 17 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| 18 | * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
| 19 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 20 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| 21 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
| 22 | * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
| 23 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR |
| 24 | * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF |
| 25 | * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 26 | */ |
| 27 | |
| 28 | #include "talk/base/asyncinvoker.h" |
| 29 | |
| 30 | namespace talk_base { |
| 31 | |
| 32 | // Synchronously execute all outstanding calls we own pending |
| 33 | // on |thread|. Optionally filter by message id. |
| 34 | void AsyncInvoker::Flush(Thread* thread, uint32 id /*= MQID_ANY*/) { |
| 35 | // Run this on |thread| to reduce the number of context switches. |
| 36 | if (Thread::Current() != thread) { |
| 37 | thread->Invoke<void>(Bind(&AsyncInvoker::Flush, this, thread, id)); |
| 38 | return; |
| 39 | } |
| 40 | |
| 41 | // Make a copy of handlers_, since it'll be modified by |
| 42 | // callbacks to RemoveHandler when each is done executing. |
| 43 | crit_.Enter(); |
| 44 | std::vector<MessageHandler*> handlers(handlers_.collection()); |
| 45 | crit_.Leave(); |
| 46 | MessageList removed; |
| 47 | for (size_t i = 0; i < handlers.size(); ++i) { |
| 48 | removed.clear(); |
| 49 | thread->Clear(handlers[i], id, &removed); |
| 50 | if (!removed.empty()) { |
| 51 | // Since each message gets its own handler with AsyncInvoker, |
| 52 | // we expect a maximum of one removed. |
| 53 | ASSERT(removed.size() == 1); |
| 54 | // This handler was pending on this thread, so run it now. |
| 55 | const Message& msg = removed.front(); |
| 56 | thread->Send(msg.phandler, |
| 57 | msg.message_id, |
| 58 | msg.pdata); |
| 59 | } |
| 60 | } |
| 61 | } |
| 62 | |
| 63 | void AsyncInvoker::InvokeHandler(Thread* thread, MessageHandler* handler, |
| 64 | uint32 id) { |
| 65 | { |
| 66 | CritScope cs(&crit_); |
| 67 | handlers_.PushBack(handler); |
| 68 | } |
| 69 | thread->Post(handler, id); |
| 70 | } |
| 71 | |
| 72 | void AsyncInvoker::RemoveHandler(MessageHandler* handler) { |
| 73 | CritScope cs(&crit_); |
| 74 | handlers_.Remove(handler); |
| 75 | delete handler; |
| 76 | } |
| 77 | |
| 78 | } // namespace talk_base |