1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171
|
/*
* Copyright (C) 2010 Apple Inc. All rights reserved.
* Portions Copyright (c) 2010 Motorola Mobility, Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "RunLoop.h"
#include <gdk/gdk.h>
#include <glib.h>
#include <wtf/MainThread.h>
namespace WebCore {
RunLoop::RunLoop()
{
// g_main_context_default() doesn't add an extra reference.
m_runLoopContext = isMainThread() ? g_main_context_default() : adoptGRef(g_main_context_new());
ASSERT(m_runLoopContext);
GRefPtr<GMainLoop> innermostLoop = adoptGRef(g_main_loop_new(m_runLoopContext.get(), FALSE));
ASSERT(innermostLoop);
m_runLoopMainLoops.append(innermostLoop);
}
RunLoop::~RunLoop()
{
for (int i = m_runLoopMainLoops.size() - 1; i >= 0; --i) {
if (!g_main_loop_is_running(m_runLoopMainLoops[i].get()))
continue;
g_main_loop_quit(m_runLoopMainLoops[i].get());
}
}
void RunLoop::run()
{
RunLoop* mainRunLoop = RunLoop::current();
GMainLoop* innermostLoop = mainRunLoop->innermostLoop();
if (!g_main_loop_is_running(innermostLoop)) {
g_main_loop_run(innermostLoop);
return;
}
// Create and run a nested loop if the innermost one was already running.
GMainLoop* nestedMainLoop = g_main_loop_new(0, FALSE);
mainRunLoop->pushNestedMainLoop(nestedMainLoop);
g_main_loop_run(nestedMainLoop);
mainRunLoop->popNestedMainLoop();
}
GMainLoop* RunLoop::innermostLoop()
{
// The innermost main loop should always be there.
ASSERT(!m_runLoopMainLoops.isEmpty());
return m_runLoopMainLoops[0].get();
}
void RunLoop::pushNestedMainLoop(GMainLoop* nestedLoop)
{
// The innermost main loop should always be there.
ASSERT(!m_runLoopMainLoops.isEmpty());
m_runLoopMainLoops.append(adoptGRef(nestedLoop));
}
void RunLoop::popNestedMainLoop()
{
// The innermost main loop should always be there.
ASSERT(!m_runLoopMainLoops.isEmpty());
m_runLoopMainLoops.removeLast();
}
void RunLoop::stop()
{
// The innermost main loop should always be there.
ASSERT(!m_runLoopMainLoops.isEmpty());
GRefPtr<GMainLoop> lastMainLoop = m_runLoopMainLoops.last();
if (g_main_loop_is_running(lastMainLoop.get()))
g_main_loop_quit(lastMainLoop.get());
}
gboolean RunLoop::queueWork(RunLoop* runLoop)
{
runLoop->performWork();
return FALSE;
}
void RunLoop::wakeUp()
{
GRefPtr<GSource> source = adoptGRef(g_idle_source_new());
g_source_set_priority(source.get(), G_PRIORITY_DEFAULT);
g_source_set_callback(source.get(), reinterpret_cast<GSourceFunc>(&RunLoop::queueWork), this, 0);
g_source_attach(source.get(), m_runLoopContext.get());
g_main_context_wakeup(m_runLoopContext.get());
}
RunLoop::TimerBase::TimerBase(RunLoop* runLoop)
: m_runLoop(runLoop)
, m_timerSource(0)
{
}
RunLoop::TimerBase::~TimerBase()
{
stop();
}
void RunLoop::TimerBase::clearTimerSource()
{
m_timerSource = 0;
}
gboolean RunLoop::TimerBase::timerFiredCallback(RunLoop::TimerBase* timer)
{
GSource* currentTimerSource = timer->m_timerSource.get();
bool isRepeating = timer->isRepeating();
// This can change the timerSource by starting a new timer within the callback.
if (!isRepeating && currentTimerSource == timer->m_timerSource.get())
timer->clearTimerSource();
timer->fired();
return isRepeating;
}
void RunLoop::TimerBase::start(double fireInterval, bool repeat)
{
if (m_timerSource)
stop();
m_timerSource = adoptGRef(g_timeout_source_new(static_cast<guint>(fireInterval * 1000)));
m_isRepeating = repeat;
g_source_set_callback(m_timerSource.get(), reinterpret_cast<GSourceFunc>(&RunLoop::TimerBase::timerFiredCallback), this, 0);
g_source_attach(m_timerSource.get(), m_runLoop->m_runLoopContext.get());
}
void RunLoop::TimerBase::stop()
{
if (!m_timerSource)
return;
g_source_destroy(m_timerSource.get());
clearTimerSource();
}
bool RunLoop::TimerBase::isActive() const
{
return m_timerSource;
}
} // namespace WebCore
|