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 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367
|
/* -*- 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 AccAttributes_h_
#define AccAttributes_h_
#include "mozilla/ServoStyleConsts.h"
#include "mozilla/a11y/AccGroupInfo.h"
#include "mozilla/Variant.h"
#include "nsTHashMap.h"
#include "nsStringFwd.h"
#include "mozilla/gfx/Matrix.h"
#include "mozilla/WritingModes.h"
class nsVariant;
namespace IPC {
template <typename T>
struct ParamTraits;
} // namespace IPC
namespace mozilla {
namespace dom {
class Element;
}
namespace a11y {
struct FontSize {
int32_t mValue;
bool operator==(const FontSize& aOther) const {
return mValue == aOther.mValue;
}
bool operator!=(const FontSize& aOther) const {
return mValue != aOther.mValue;
}
};
struct Color {
nscolor mValue;
bool operator==(const Color& aOther) const { return mValue == aOther.mValue; }
bool operator!=(const Color& aOther) const { return mValue != aOther.mValue; }
};
// A special type. If an entry has a value of this type, it instructs the
// target instance of an Update to remove the entry with the same key value.
struct DeleteEntry {
DeleteEntry() : mValue(true) {}
bool mValue;
bool operator==(const DeleteEntry& aOther) const { return true; }
bool operator!=(const DeleteEntry& aOther) const { return false; }
};
/**
* An attribute that applies to an offset range in a text leaf. This allows it
* to span only part of a text leaf. This is used for spelling errors,
* highlights, etc. which are mapped to DOM selections. This is in contrast to
* most other attributes which can only apply to an entire text leaf and so just
* reside on the leaf itself, rather than requiring offsets.
*/
struct TextOffsetAttribute {
// An offset used to indicate that this attribute extends outside of this
// leaf.
static const int32_t kOutsideLeaf = -1;
// The offset in the text leaf where the attribute starts. If this is
// kOutsideLeaf, the attribute begins before this leaf, crossing Accessibles.
int32_t mStartOffset;
// The offset in the text leaf where the attribute ends (exclusive). If this
// is kOutsideLeaf, the attribute ends after this leaf, crossing Accessibles.
int32_t mEndOffset;
// The attribute:
// nsGkAtoms::grammar: Grammar error.
// nsGkAtoms::mark: Semantic highlight such as a text fragment.
// nsGkAtoms::spelling: Spelling error.
RefPtr<nsAtom> mAttribute;
bool operator==(const TextOffsetAttribute& aOther) const {
return mStartOffset == aOther.mStartOffset &&
mEndOffset == aOther.mEndOffset && mAttribute == aOther.mAttribute;
}
bool operator!=(const TextOffsetAttribute& aOther) const {
return !(*this == aOther);
}
bool operator<(const TextOffsetAttribute& aOther) const {
return mStartOffset < aOther.mStartOffset;
}
};
class AccAttributes {
// Warning! An AccAttributes can contain another AccAttributes. This is
// intended for object and text attributes. However, the nested
// AccAttributes should never itself contain another AccAttributes, nor
// should it create a cycle. We don't do cycle collection here for
// performance reasons, so violating this rule will cause leaks!
using AttrValueType =
Variant<bool, float, double, int32_t, RefPtr<nsAtom>, nsTArray<int32_t>,
CSSCoord, FontSize, Color, DeleteEntry, UniquePtr<nsString>,
RefPtr<AccAttributes>, uint64_t, UniquePtr<AccGroupInfo>,
UniquePtr<gfx::Matrix4x4>, UniquePtr<nsRect>, nsTArray<uint64_t>,
nsTArray<TextOffsetAttribute>, WritingMode,
nsTArray<RefPtr<nsAtom>>>;
static_assert(sizeof(AttrValueType) <= 16);
using AtomVariantMap = nsTHashMap<RefPtr<nsAtom>, AttrValueType>;
protected:
~AccAttributes() = default;
public:
AccAttributes() = default;
AccAttributes(const AccAttributes&) = delete;
AccAttributes& operator=(const AccAttributes&) = delete;
NS_INLINE_DECL_REFCOUNTING(mozilla::a11y::AccAttributes)
template <typename T>
void SetAttribute(nsAtom* aAttrName, T&& aAttrValue) {
using ValType =
std::remove_const_t<std::remove_reference_t<decltype(aAttrValue)>>;
if constexpr (std::is_convertible_v<ValType, nsString>) {
static_assert(std::is_rvalue_reference_v<decltype(aAttrValue)>,
"Please only move strings into this function. To make a "
"copy, use SetAttributeStringCopy.");
UniquePtr<nsString> value = MakeUnique<nsString>(std::move(aAttrValue));
mData.InsertOrUpdate(aAttrName, AsVariant(std::move(value)));
} else if constexpr (std::is_same_v<ValType, gfx::Matrix4x4>) {
UniquePtr<gfx::Matrix4x4> value = MakeUnique<gfx::Matrix4x4>(aAttrValue);
mData.InsertOrUpdate(aAttrName, AsVariant(std::move(value)));
} else if constexpr (std::is_same_v<ValType, nsRect>) {
UniquePtr<nsRect> value = MakeUnique<nsRect>(aAttrValue);
mData.InsertOrUpdate(aAttrName, AsVariant(std::move(value)));
} else if constexpr (std::is_same_v<ValType, AccGroupInfo*>) {
UniquePtr<AccGroupInfo> value(aAttrValue);
mData.InsertOrUpdate(aAttrName, AsVariant(std::move(value)));
} else if constexpr (std::is_convertible_v<ValType, nsAtom*>) {
mData.InsertOrUpdate(aAttrName, AsVariant(RefPtr<nsAtom>(aAttrValue)));
} else {
mData.InsertOrUpdate(aAttrName, AsVariant(std::forward<T>(aAttrValue)));
}
}
void SetAttributeStringCopy(nsAtom* aAttrName, nsString aAttrValue) {
SetAttribute(aAttrName, std::move(aAttrValue));
}
template <typename T>
Maybe<const T&> GetAttribute(nsAtom* aAttrName) const {
if (auto value = mData.Lookup(aAttrName)) {
if constexpr (std::is_same_v<nsString, T>) {
if (value->is<UniquePtr<nsString>>()) {
const T& val = *(value->as<UniquePtr<nsString>>().get());
return SomeRef(val);
}
} else if constexpr (std::is_same_v<gfx::Matrix4x4, T>) {
if (value->is<UniquePtr<gfx::Matrix4x4>>()) {
const T& val = *(value->as<UniquePtr<gfx::Matrix4x4>>());
return SomeRef(val);
}
} else if constexpr (std::is_same_v<nsRect, T>) {
if (value->is<UniquePtr<nsRect>>()) {
const T& val = *(value->as<UniquePtr<nsRect>>());
return SomeRef(val);
}
} else {
if (value->is<T>()) {
const T& val = value->as<T>();
return SomeRef(val);
}
}
}
return Nothing();
}
template <typename T>
RefPtr<const T> GetAttributeRefPtr(nsAtom* aAttrName) const {
if (auto value = mData.Lookup(aAttrName)) {
if (value->is<RefPtr<T>>()) {
RefPtr<const T> ref = value->as<RefPtr<T>>();
return ref;
}
}
return nullptr;
}
template <typename T>
const T* GetAttributeWeakPtr(nsAtom* aAttrName) const {
if (auto value = mData.Lookup(aAttrName)) {
if (value->is<RefPtr<T>>()) {
const T* ref = value->as<RefPtr<T>>();
return ref;
}
}
return nullptr;
}
template <typename T>
Maybe<T&> GetMutableAttribute(nsAtom* aAttrName) const {
static_assert(std::is_same_v<nsTArray<int32_t>, T> ||
std::is_same_v<nsTArray<uint64_t>, T> ||
std::is_same_v<nsTArray<RefPtr<nsAtom>>, T>,
"Only arrays should be mutable attributes");
if (auto value = mData.Lookup(aAttrName)) {
if (value->is<T>()) {
T& val = value->as<T>();
return SomeRef(val);
}
}
return Nothing();
}
// Get stringified value
bool GetAttribute(nsAtom* aAttrName, nsAString& aAttrValue) const;
bool HasAttribute(nsAtom* aAttrName) const {
return mData.Contains(aAttrName);
}
bool Remove(nsAtom* aAttrName) { return mData.Remove(aAttrName); }
uint32_t Count() const { return mData.Count(); }
// Update one instance with the entries in another. The supplied AccAttributes
// will be emptied.
void Update(AccAttributes* aOther);
// Remove all entries that are identical to the supplied AccAttributes.
void RemoveIdentical(const AccAttributes* aOther);
/**
* Return true if all the attributes in this instance are equal to all the
* attributes in another instance.
*/
bool Equal(const AccAttributes* aOther) const;
/**
* Copy attributes from this instance to another instance.
* This should only be used in very specific cases; e.g. merging two sets of
* cached attributes without modifying the cache. It can only copy simple
* value types; e.g. it can't copy array values. Attempting to copy an
* AccAttributes with uncopyable values will cause an assertion.
* If aOnlyMissing is true, don't copy entries if destination already has
* a given key.
*/
void CopyTo(AccAttributes* aDest, bool aOnlyMissing = false) const;
// An entry class for our iterator.
class Entry {
public:
Entry(nsAtom* aAttrName, const AttrValueType* aAttrValue)
: mName(aAttrName), mValue(aAttrValue) {}
nsAtom* Name() const { return mName; }
template <typename T>
Maybe<const T&> Value() const {
if constexpr (std::is_same_v<nsString, T>) {
if (mValue->is<UniquePtr<nsString>>()) {
const T& val = *(mValue->as<UniquePtr<nsString>>().get());
return SomeRef(val);
}
} else if constexpr (std::is_same_v<gfx::Matrix4x4, T>) {
if (mValue->is<UniquePtr<gfx::Matrix4x4>>()) {
const T& val = *(mValue->as<UniquePtr<gfx::Matrix4x4>>());
return SomeRef(val);
}
} else if constexpr (std::is_same_v<nsRect, T>) {
if (mValue->is<UniquePtr<nsRect>>()) {
const T& val = *(mValue->as<UniquePtr<nsRect>>());
return SomeRef(val);
}
} else {
if (mValue->is<T>()) {
const T& val = mValue->as<T>();
return SomeRef(val);
}
}
return Nothing();
}
void NameAsString(nsString& aName) const {
mName->ToString(aName);
if (StringBeginsWith(aName, u"aria-"_ns)) {
// Found 'aria-'
aName.ReplaceLiteral(0, 5, u"");
}
}
void ValueAsString(nsAString& aValueString) const {
StringFromValueAndName(mName, *mValue, aValueString);
}
// Size of the pair in the hash table.
size_t SizeOfExcludingThis(MallocSizeOf aMallocSizeOf);
private:
nsAtom* mName;
const AttrValueType* mValue;
friend class AccAttributes;
};
class Iterator {
public:
explicit Iterator(AtomVariantMap::const_iterator aIter)
: mHashIterator(aIter) {}
Iterator() = delete;
Iterator(const Iterator&) = delete;
Iterator& operator=(const Iterator&) = delete;
bool operator!=(const Iterator& aOther) const {
return mHashIterator != aOther.mHashIterator;
}
Iterator& operator++() {
mHashIterator++;
return *this;
}
Entry operator*() const {
auto& entry = *mHashIterator;
return Entry(entry.GetKey(), &entry.GetData());
}
private:
AtomVariantMap::const_iterator mHashIterator;
};
friend class Iterator;
Iterator begin() const { return Iterator(mData.begin()); }
Iterator end() const { return Iterator(mData.end()); }
#ifdef A11Y_LOG
static void DebugPrint(const char* aPrefix, const AccAttributes& aAttributes);
#endif
size_t SizeOfIncludingThis(MallocSizeOf aMallocSizeOf);
private:
static void StringFromValueAndName(nsAtom* aAttrName,
const AttrValueType& aValue,
nsAString& aValueString);
// Opts AccAttributes into the common ToString function.
friend std::ostream& operator<<(std::ostream& aStream,
const AccAttributes& aAttributes);
AtomVariantMap mData;
friend struct IPC::ParamTraits<AccAttributes*>;
};
} // namespace a11y
} // namespace mozilla
#endif
|