2013-01-16 13:15:38 -05:00
|
|
|
/*
|
2015-10-04 14:51:05 -04:00
|
|
|
Copyright (C) 2012 Paul Davis
|
2013-01-16 13:15:38 -05:00
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program; if not, write to the Free Software
|
|
|
|
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
2016-01-13 23:00:02 -05:00
|
|
|
#include <cstring>
|
|
|
|
|
|
|
|
#include <pthread.h>
|
|
|
|
|
2015-12-28 10:14:17 -05:00
|
|
|
#include "pbd/compose.h"
|
2016-01-13 21:13:55 -05:00
|
|
|
#include "pbd/debug.h"
|
2009-12-21 13:23:07 -05:00
|
|
|
#include "pbd/event_loop.h"
|
2015-12-28 10:14:17 -05:00
|
|
|
#include "pbd/error.h"
|
2018-08-07 10:42:44 -04:00
|
|
|
#include "pbd/pthread_utils.h"
|
2010-03-30 11:18:43 -04:00
|
|
|
#include "pbd/stacktrace.h"
|
2009-12-21 13:23:07 -05:00
|
|
|
|
2016-07-14 14:44:52 -04:00
|
|
|
#include "pbd/i18n.h"
|
2015-12-28 10:14:17 -05:00
|
|
|
|
2009-12-21 13:23:07 -05:00
|
|
|
using namespace PBD;
|
2010-03-30 11:18:43 -04:00
|
|
|
using namespace std;
|
2009-12-21 13:23:07 -05:00
|
|
|
|
|
|
|
static void do_not_delete_the_loop_pointer (void*) { }
|
|
|
|
|
2015-10-04 14:51:05 -04:00
|
|
|
Glib::Threads::Private<EventLoop> EventLoop::thread_event_loop (do_not_delete_the_loop_pointer);
|
2012-07-25 13:48:55 -04:00
|
|
|
|
2015-12-28 10:14:17 -05:00
|
|
|
Glib::Threads::RWLock EventLoop::thread_buffer_requests_lock;
|
|
|
|
EventLoop::ThreadRequestBufferList EventLoop::thread_buffer_requests;
|
|
|
|
EventLoop::RequestBufferSuppliers EventLoop::request_buffer_suppliers;
|
|
|
|
|
2015-12-12 10:55:40 -05:00
|
|
|
EventLoop::EventLoop (string const& name)
|
|
|
|
: _name (name)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2017-01-20 07:46:11 -05:00
|
|
|
EventLoop::~EventLoop ()
|
|
|
|
{
|
|
|
|
trash.sort();
|
|
|
|
trash.unique();
|
|
|
|
for (std::list<InvalidationRecord*>::iterator r = trash.begin(); r != trash.end(); ++r) {
|
|
|
|
if (!(*r)->in_use ()) {
|
|
|
|
delete *r;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
trash.clear ();
|
|
|
|
}
|
|
|
|
|
2015-10-04 14:51:05 -04:00
|
|
|
EventLoop*
|
2015-12-28 10:14:17 -05:00
|
|
|
EventLoop::get_event_loop_for_thread()
|
|
|
|
{
|
2009-12-21 13:23:07 -05:00
|
|
|
return thread_event_loop.get ();
|
|
|
|
}
|
|
|
|
|
2015-10-04 14:51:05 -04:00
|
|
|
void
|
|
|
|
EventLoop::set_event_loop_for_thread (EventLoop* loop)
|
2009-12-21 13:23:07 -05:00
|
|
|
{
|
2012-07-25 13:48:55 -04:00
|
|
|
thread_event_loop.set (loop);
|
2009-12-21 13:23:07 -05:00
|
|
|
}
|
|
|
|
|
2015-10-04 14:51:05 -04:00
|
|
|
void*
|
2010-03-30 11:18:43 -04:00
|
|
|
EventLoop::invalidate_request (void* data)
|
|
|
|
{
|
2016-12-13 17:46:55 -05:00
|
|
|
InvalidationRecord* ir = (InvalidationRecord*) data;
|
2010-03-30 11:18:43 -04:00
|
|
|
|
2012-04-24 12:45:38 -04:00
|
|
|
/* Some of the requests queued with an EventLoop may involve functors
|
|
|
|
* that make method calls to objects whose lifetime is shorter
|
|
|
|
* than the EventLoop's. We do not want to make those calls if the
|
2015-10-04 14:51:05 -04:00
|
|
|
* object involve has been destroyed. To prevent this, we
|
2012-04-24 12:45:38 -04:00
|
|
|
* provide a way to invalidate those requests when the object is
|
|
|
|
* destroyed.
|
|
|
|
*
|
|
|
|
* An object was passed to __invalidator() which added a callback to
|
|
|
|
* EventLoop::invalidate_request() to its "notify when destroyed"
|
|
|
|
* list. __invalidator() returned an InvalidationRecord that has been
|
|
|
|
* to passed to this function as data.
|
|
|
|
*
|
|
|
|
* The object is currently being destroyed and so we want to
|
|
|
|
* mark all requests involving this object that are queued with
|
2015-10-04 14:51:05 -04:00
|
|
|
* any EventLoop as invalid.
|
2012-04-24 12:45:38 -04:00
|
|
|
*
|
|
|
|
* As of April 2012, we are usign sigc::trackable as the base object
|
|
|
|
* used to queue calls to ::invalidate_request() to be made upon
|
|
|
|
* destruction, via its ::add_destroy_notify_callback() API. This is
|
|
|
|
* not necessarily ideal, but it is very close to precisely what we
|
|
|
|
* want, and many of the objects we want to do this with already
|
|
|
|
* inherit (indirectly) from sigc::trackable.
|
|
|
|
*/
|
2015-10-05 10:17:49 -04:00
|
|
|
|
2016-12-13 20:25:13 -05:00
|
|
|
if (ir->event_loop) {
|
2018-08-07 10:42:44 -04:00
|
|
|
DEBUG_TRACE (PBD::DEBUG::EventLoop, string_compose ("%1: invalidating request from %2 (%3) @ %4\n", pthread_name(), ir->event_loop, ir->event_loop->event_loop_name(), ir));
|
2016-12-15 00:11:20 -05:00
|
|
|
Glib::Threads::Mutex::Lock lm (ir->event_loop->slot_invalidation_mutex());
|
|
|
|
ir->invalidate ();
|
2016-12-14 16:38:37 -05:00
|
|
|
ir->event_loop->trash.push_back(ir);
|
2016-12-13 20:25:13 -05:00
|
|
|
}
|
2010-03-30 11:18:43 -04:00
|
|
|
|
2016-12-13 20:25:13 -05:00
|
|
|
return 0;
|
2010-03-30 11:18:43 -04:00
|
|
|
}
|
|
|
|
|
2015-12-28 10:14:17 -05:00
|
|
|
vector<EventLoop::ThreadBufferMapping>
|
|
|
|
EventLoop::get_request_buffers_for_target_thread (const std::string& target_thread)
|
|
|
|
{
|
|
|
|
vector<ThreadBufferMapping> ret;
|
|
|
|
Glib::Threads::RWLock::WriterLock lm (thread_buffer_requests_lock);
|
|
|
|
|
|
|
|
for (ThreadRequestBufferList::const_iterator x = thread_buffer_requests.begin();
|
|
|
|
x != thread_buffer_requests.end(); ++x) {
|
|
|
|
|
|
|
|
if (x->second.target_thread_name == target_thread) {
|
|
|
|
ret.push_back (x->second);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-01-13 21:13:55 -05:00
|
|
|
DEBUG_TRACE (PBD::DEBUG::EventLoop, string_compose ("for thread \"%1\", found %2 request buffers\n", target_thread, ret.size()));
|
|
|
|
|
2015-12-28 10:14:17 -05:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
EventLoop::register_request_buffer_factory (const string& target_thread_name,
|
|
|
|
void* (*factory)(uint32_t))
|
|
|
|
{
|
|
|
|
|
|
|
|
RequestBufferSupplier trs;
|
|
|
|
trs.name = target_thread_name;
|
|
|
|
trs.factory = factory;
|
|
|
|
|
|
|
|
{
|
|
|
|
Glib::Threads::RWLock::WriterLock lm (thread_buffer_requests_lock);
|
|
|
|
request_buffer_suppliers.push_back (trs);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
EventLoop::pre_register (const string& emitting_thread_name, uint32_t num_requests)
|
|
|
|
{
|
|
|
|
/* Threads that need to emit signals "towards" other threads, but with
|
|
|
|
RT safe behavior may be created before the receiving threads
|
|
|
|
exist. This makes it impossible for them to use the
|
|
|
|
ThreadCreatedWithRequestSize signal to notify receiving threads of
|
|
|
|
their existence.
|
|
|
|
|
|
|
|
This function creates a request buffer for them to use with
|
|
|
|
the (not yet) created threads, and stores it where the receiving
|
|
|
|
thread can find it later.
|
|
|
|
*/
|
|
|
|
|
|
|
|
ThreadBufferMapping mapping;
|
2016-02-13 20:13:04 -05:00
|
|
|
Glib::Threads::RWLock::WriterLock lm (thread_buffer_requests_lock);
|
2015-12-28 10:14:17 -05:00
|
|
|
|
|
|
|
for (RequestBufferSuppliers::iterator trs = request_buffer_suppliers.begin(); trs != request_buffer_suppliers.end(); ++trs) {
|
|
|
|
|
|
|
|
if (!trs->factory) {
|
|
|
|
/* no factory - no request buffer required or expected */
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (emitting_thread_name == trs->name) {
|
|
|
|
/* no need to register an emitter with itself */
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
mapping.emitting_thread = pthread_self();
|
|
|
|
mapping.target_thread_name = trs->name;
|
|
|
|
|
|
|
|
/* Allocate a suitably sized request buffer. This will set the
|
|
|
|
* thread-local variable that holds a pointer to this request
|
|
|
|
* buffer.
|
|
|
|
*/
|
|
|
|
mapping.request_buffer = trs->factory (num_requests);
|
|
|
|
|
|
|
|
/* now store it where the receiving thread (trs->name) can find
|
|
|
|
it if and when it is created. (Discovery happens in the
|
|
|
|
AbstractUI constructor. Note that if
|
|
|
|
*/
|
|
|
|
|
2016-01-14 09:04:59 -05:00
|
|
|
const string key = string_compose ("%1/%2", emitting_thread_name, mapping.target_thread_name);
|
2015-12-28 10:14:17 -05:00
|
|
|
|
2016-01-14 09:04:59 -05:00
|
|
|
/* management of the thread_request_buffers map works as
|
|
|
|
* follows:
|
2015-12-28 10:14:17 -05:00
|
|
|
*
|
2016-01-14 09:04:59 -05:00
|
|
|
* when the factory method was called above, the pointer to the
|
|
|
|
* created buffer is set as a thread-local-storage (TLS) value
|
|
|
|
* for this (the emitting) thread.
|
2016-01-13 23:00:02 -05:00
|
|
|
*
|
2016-01-14 09:04:59 -05:00
|
|
|
* The TLS value is set up with a destructor that marks the
|
|
|
|
* request buffer as "dead" when the emitting thread exits.
|
2016-01-13 23:00:02 -05:00
|
|
|
*
|
2016-01-14 09:04:59 -05:00
|
|
|
* An entry will remain in the map after the thread exits.
|
2016-01-13 23:00:02 -05:00
|
|
|
*
|
2016-01-14 09:04:59 -05:00
|
|
|
* The receiving thread may (if it receives requests from other
|
|
|
|
* threads) notice the dead buffer. If it does, it will delete
|
|
|
|
* the request buffer, and call
|
|
|
|
* ::remove_request_buffer_from_map() to get rid of it from the map.
|
|
|
|
*
|
|
|
|
* This does mean that the lifetime of the request buffer is
|
|
|
|
* indeterminate: if the receiving thread were to receive no
|
|
|
|
* further requests, the request buffer will live on
|
|
|
|
* forever. But this is OK, because if there are no requests
|
|
|
|
* arriving, the receiving thread is not attempting to use the
|
|
|
|
* request buffer(s) in any way.
|
|
|
|
*
|
|
|
|
* Note, however, that *if* an emitting thread is recreated
|
|
|
|
* with the same name (e.g. when a control surface is
|
|
|
|
* enabled/disabled/enabled), then the request buffer for the
|
|
|
|
* new thread will replace the map entry for the key, because
|
|
|
|
* of the matching thread names. This does mean that
|
|
|
|
* potentially the request buffer can leak in this case, but
|
|
|
|
* (a) these buffers are not really that large anyway (b) the
|
|
|
|
* scenario is not particularly common (c) the buffers would
|
|
|
|
* typically last across a session instance if not program
|
|
|
|
* lifetime anyway.
|
2015-12-28 10:14:17 -05:00
|
|
|
*/
|
|
|
|
|
|
|
|
thread_buffer_requests[key] = mapping;
|
2016-01-13 23:00:02 -05:00
|
|
|
DEBUG_TRACE (PBD::DEBUG::EventLoop, string_compose ("pre-registered request buffer for \"%1\" to send to \"%2\", buffer @ %3 (key was %4)\n",
|
|
|
|
emitting_thread_name, trs->name, mapping.request_buffer, key));
|
2015-12-28 10:14:17 -05:00
|
|
|
}
|
|
|
|
}
|
2016-01-13 23:00:02 -05:00
|
|
|
|
2016-01-14 10:53:32 -05:00
|
|
|
void
|
|
|
|
EventLoop::remove_request_buffer_from_map (void* ptr)
|
|
|
|
{
|
2016-01-14 11:00:40 -05:00
|
|
|
Glib::Threads::RWLock::WriterLock lm (thread_buffer_requests_lock);
|
2016-01-14 10:53:32 -05:00
|
|
|
|
|
|
|
for (ThreadRequestBufferList::iterator x = thread_buffer_requests.begin(); x != thread_buffer_requests.end(); ++x) {
|
|
|
|
if (x->second.request_buffer == ptr) {
|
|
|
|
thread_buffer_requests.erase (x);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|