2016-04-07 16:30:22 +03:00
|
|
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
|
|
/* This Source Code Form is subject to the terms of the Mozilla Public
|
|
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
|
|
|
|
|
|
|
#ifndef mozilla_a11y_EventTree_h_
|
|
|
|
#define mozilla_a11y_EventTree_h_
|
|
|
|
|
|
|
|
#include "AccEvent.h"
|
|
|
|
#include "Accessible.h"
|
|
|
|
|
|
|
|
#include "mozilla/RefPtr.h"
|
2016-06-29 13:57:00 +03:00
|
|
|
#include "mozilla/UniquePtr.h"
|
2016-04-07 16:30:22 +03:00
|
|
|
|
|
|
|
namespace mozilla {
|
|
|
|
namespace a11y {
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This class makes sure required tasks are done before and after tree
|
|
|
|
* mutations. Currently this only includes group info invalidation. You must
|
|
|
|
* have an object of this class on the stack when calling methods that mutate
|
|
|
|
* the accessible tree.
|
|
|
|
*/
|
|
|
|
class TreeMutation final
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
static const bool kNoEvents = true;
|
|
|
|
static const bool kNoShutdown = true;
|
|
|
|
|
|
|
|
explicit TreeMutation(Accessible* aParent, bool aNoEvents = false);
|
|
|
|
~TreeMutation();
|
|
|
|
|
|
|
|
void AfterInsertion(Accessible* aChild);
|
|
|
|
void BeforeRemoval(Accessible* aChild, bool aNoShutdown = false);
|
|
|
|
void Done();
|
|
|
|
|
|
|
|
private:
|
|
|
|
NotificationController* Controller() const
|
|
|
|
{ return mParent->Document()->Controller(); }
|
|
|
|
|
|
|
|
static EventTree* const kNoEventTree;
|
|
|
|
|
2016-06-20 18:35:38 +03:00
|
|
|
#ifdef A11Y_LOG
|
|
|
|
static const char* PrefixLog(void* aData, Accessible*);
|
|
|
|
#endif
|
|
|
|
|
2016-04-07 16:30:22 +03:00
|
|
|
Accessible* mParent;
|
|
|
|
uint32_t mStartIdx;
|
|
|
|
uint32_t mStateFlagsCopy;
|
|
|
|
EventTree* mEventTree;
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
bool mIsDone;
|
|
|
|
#endif
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* A mutation events coalescence structure.
|
|
|
|
*/
|
|
|
|
class EventTree final {
|
|
|
|
public:
|
|
|
|
EventTree() :
|
2016-04-12 22:48:29 +03:00
|
|
|
mFirst(nullptr), mNext(nullptr), mContainer(nullptr), mFireReorder(false) { }
|
2016-04-13 18:22:19 +03:00
|
|
|
explicit EventTree(Accessible* aContainer, bool aFireReorder) :
|
|
|
|
mFirst(nullptr), mNext(nullptr), mContainer(aContainer),
|
|
|
|
mFireReorder(aFireReorder) { }
|
2016-04-07 16:30:22 +03:00
|
|
|
~EventTree() { Clear(); }
|
|
|
|
|
|
|
|
void Shown(Accessible* aChild)
|
|
|
|
{
|
|
|
|
RefPtr<AccShowEvent> ev = new AccShowEvent(aChild);
|
|
|
|
Mutated(ev);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Hidden(Accessible* aChild, bool aNeedsShutdown = true)
|
|
|
|
{
|
|
|
|
RefPtr<AccHideEvent> ev = new AccHideEvent(aChild, aNeedsShutdown);
|
|
|
|
Mutated(ev);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Return an event tree node for the given accessible.
|
|
|
|
*/
|
|
|
|
const EventTree* Find(const Accessible* aContainer) const;
|
|
|
|
|
|
|
|
#ifdef A11Y_LOG
|
|
|
|
void Log(uint32_t aLevel = UINT32_MAX) const;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
private:
|
|
|
|
/**
|
|
|
|
* Processes the event queue and fires events.
|
|
|
|
*/
|
2016-05-19 21:35:20 +03:00
|
|
|
void Process(const RefPtr<DocAccessible>& aDeathGrip);
|
2016-04-07 16:30:22 +03:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Return an event subtree for the given accessible.
|
|
|
|
*/
|
|
|
|
EventTree* FindOrInsert(Accessible* aContainer);
|
|
|
|
|
|
|
|
void Mutated(AccMutationEvent* aEv);
|
2016-04-12 22:48:29 +03:00
|
|
|
void Clear();
|
2016-04-07 16:30:22 +03:00
|
|
|
|
2016-06-29 13:57:00 +03:00
|
|
|
UniquePtr<EventTree> mFirst;
|
|
|
|
UniquePtr<EventTree> mNext;
|
2016-04-07 16:30:22 +03:00
|
|
|
|
|
|
|
Accessible* mContainer;
|
|
|
|
nsTArray<RefPtr<AccMutationEvent>> mDependentEvents;
|
|
|
|
bool mFireReorder;
|
|
|
|
|
|
|
|
friend class NotificationController;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
} // namespace a11y
|
|
|
|
} // namespace mozilla
|
|
|
|
|
|
|
|
#endif // mozilla_a11y_EventQueue_h_
|