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 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#include <comphelper/accessibleeventnotifier.hxx>
#include <osl/diagnose.h>
#include <rtl/instance.hxx>
#include <comphelper/guarding.hxx>
using namespace ::com::sun::star::uno;
using namespace ::com::sun::star::lang;
using namespace ::com::sun::star::accessibility;
using namespace ::comphelper;
//=====================================================================
//= AccessibleEventNotifier
//=====================================================================
//---------------------------------------------------------------------
namespace
{
struct lclMutex
: public rtl::Static< ::osl::Mutex, lclMutex > {};
struct Clients
: public rtl::Static< AccessibleEventNotifier::ClientMap, Clients > {};
}
//.........................................................................
namespace comphelper
{
//.........................................................................
//---------------------------------------------------------------------
AccessibleEventNotifier::TClientId AccessibleEventNotifier::generateId()
{
TClientId nBiggestUsedId = 0;
TClientId nFreeId = 0;
// look through all registered clients until we find a "gap" in the ids
// Note that the following relies on the fact the elements in the map are traveled with
// ascending keys (aka client ids)
AccessibleEventNotifier::ClientMap &rClients = Clients::get();
for ( ClientMap::const_iterator aLookup = rClients.begin();
aLookup != rClients.end();
++aLookup
)
{
TClientId nCurrent = aLookup->first;
OSL_ENSURE( nCurrent > nBiggestUsedId, "AccessibleEventNotifier::generateId: map is expected to be sorted ascending!" );
if ( nCurrent - nBiggestUsedId > 1 )
{ // found a "gap"
nFreeId = nBiggestUsedId + 1;
break;
}
nBiggestUsedId = nCurrent;
}
if ( !nFreeId )
nFreeId = nBiggestUsedId + 1;
OSL_ENSURE( rClients.end() == rClients.find( nFreeId ),
"AccessibleEventNotifier::generateId: algorithm broken!" );
return nFreeId;
}
//---------------------------------------------------------------------
AccessibleEventNotifier::TClientId AccessibleEventNotifier::registerClient( )
{
::osl::MutexGuard aGuard( lclMutex::get() );
// generate a new client id
TClientId nNewClientId = generateId( );
// the event listeners for the new client
EventListeners* pNewListeners = new EventListeners( lclMutex::get() );
// note that we're using our own mutex here, so the listener containers for all
// our clients share this same mutex.
// this is a reminiscense to the days where the notifier was asynchronous. Today this is
// completely nonsense, and potentially slowing down the Office me thinks ...
// add the client
Clients::get().insert( ClientMap::value_type( nNewClientId, pNewListeners ) );
// outta here
return nNewClientId;
}
//---------------------------------------------------------------------
sal_Bool AccessibleEventNotifier::implLookupClient( const TClientId _nClient, ClientMap::iterator& _rPos )
{
// look up this client
AccessibleEventNotifier::ClientMap &rClients = Clients::get();
_rPos = rClients.find( _nClient );
OSL_ENSURE( rClients.end() != _rPos, "AccessibleEventNotifier::implLookupClient: invalid client id (did you register your client?)!" );
return ( rClients.end() != _rPos );
}
//---------------------------------------------------------------------
void AccessibleEventNotifier::revokeClient( const TClientId _nClient )
{
::osl::MutexGuard aGuard( lclMutex::get() );
ClientMap::iterator aClientPos;
if ( !implLookupClient( _nClient, aClientPos ) )
// already asserted in implLookupClient
return;
// remove it from the clients map
delete aClientPos->second;
Clients::get().erase( aClientPos );
}
//---------------------------------------------------------------------
void AccessibleEventNotifier::revokeClientNotifyDisposing( const TClientId _nClient,
const Reference< XInterface >& _rxEventSource ) SAL_THROW( ( ) )
{
::osl::MutexGuard aGuard( lclMutex::get() );
ClientMap::iterator aClientPos;
if ( !implLookupClient( _nClient, aClientPos ) )
// already asserted in implLookupClient
return;
// notify the "disposing" event for this client
EventObject aDisposalEvent;
aDisposalEvent.Source = _rxEventSource;
// notify the listeners
EventListeners* pListeners = aClientPos->second;
// we do not need the entry in the clients map anymore
// (do this before actually notifying, because some client implementations have re-entrance
// problems and call into revokeClient while we are notifying from hereing)
Clients::get().erase( aClientPos );
// now really do the notification
pListeners->disposeAndClear( aDisposalEvent );
delete pListeners;
}
//---------------------------------------------------------------------
sal_Int32 AccessibleEventNotifier::addEventListener(
const TClientId _nClient, const Reference< XAccessibleEventListener >& _rxListener ) SAL_THROW( ( ) )
{
::osl::MutexGuard aGuard( lclMutex::get() );
ClientMap::iterator aClientPos;
if ( !implLookupClient( _nClient, aClientPos ) )
// already asserted in implLookupClient
return 0;
if ( _rxListener.is() )
aClientPos->second->addInterface( _rxListener );
return aClientPos->second->getLength();
}
//---------------------------------------------------------------------
sal_Int32 AccessibleEventNotifier::removeEventListener(
const TClientId _nClient, const Reference< XAccessibleEventListener >& _rxListener ) SAL_THROW( ( ) )
{
::osl::MutexGuard aGuard( lclMutex::get() );
ClientMap::iterator aClientPos;
if ( !implLookupClient( _nClient, aClientPos ) )
// already asserted in implLookupClient
return 0;
if ( _rxListener.is() )
aClientPos->second->removeInterface( _rxListener );
return aClientPos->second->getLength();
}
//---------------------------------------------------------------------
Sequence< Reference< XInterface > > AccessibleEventNotifier::getEventListeners( const TClientId _nClient ) SAL_THROW( ( ) )
{
Sequence< Reference< XInterface > > aListeners;
::osl::MutexGuard aGuard( lclMutex::get() );
ClientMap::iterator aClientPos;
if ( implLookupClient( _nClient, aClientPos ) )
aListeners = aClientPos->second->getElements();
return aListeners;
}
//---------------------------------------------------------------------
void AccessibleEventNotifier::addEvent( const TClientId _nClient, const AccessibleEventObject& _rEvent ) SAL_THROW( ( ) )
{
Sequence< Reference< XInterface > > aListeners;
// --- <mutex lock> -------------------------------
{
::osl::MutexGuard aGuard( lclMutex::get() );
ClientMap::iterator aClientPos;
if ( !implLookupClient( _nClient, aClientPos ) )
// already asserted in implLookupClient
return;
// since we're synchronous, again, we want to notify immediately
aListeners = aClientPos->second->getElements();
}
// --- </mutex lock> ------------------------------
// default handling: loop through all listeners, and notify them
const Reference< XInterface >* pListeners = aListeners.getConstArray();
const Reference< XInterface >* pListenersEnd = pListeners + aListeners.getLength();
while ( pListeners != pListenersEnd )
{
try
{
static_cast< XAccessibleEventListener* >( pListeners->get() )->notifyEvent( _rEvent );
}
catch( const Exception& )
{
// no assertion, because a broken access remote bridge or something like this
// can cause this exception
}
++pListeners;
}
}
//.........................................................................
} // namespace comphelper
//.........................................................................
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|