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
|
/*
* Copyright (C) 1999 Lars Knoll (knoll@kde.org)
* Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc.
* All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library 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
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#ifndef RuleSet_h
#define RuleSet_h
#include "core/CoreExport.h"
#include "core/css/CSSKeyframesRule.h"
#include "core/css/MediaQueryEvaluator.h"
#include "core/css/RuleFeature.h"
#include "core/css/StyleRule.h"
#include "core/css/resolver/MediaQueryResult.h"
#include "platform/heap/HeapLinkedStack.h"
#include "platform/heap/HeapTerminatedArray.h"
#include "wtf/Forward.h"
#include "wtf/HashMap.h"
#include "wtf/LinkedStack.h"
#include "wtf/TerminatedArray.h"
namespace blink {
enum AddRuleFlags {
RuleHasNoSpecialState = 0,
RuleHasDocumentSecurityOrigin = 1,
};
enum PropertyWhitelistType {
PropertyWhitelistNone,
PropertyWhitelistCue,
PropertyWhitelistFirstLetter,
};
class CSSSelector;
class MediaQueryEvaluator;
class StyleSheetContents;
class MinimalRuleData {
DISALLOW_NEW_EXCEPT_PLACEMENT_NEW();
public:
MinimalRuleData(StyleRule* rule, unsigned selectorIndex, AddRuleFlags flags)
: m_rule(rule), m_selectorIndex(selectorIndex), m_flags(flags) {}
DECLARE_TRACE();
Member<StyleRule> m_rule;
unsigned m_selectorIndex;
AddRuleFlags m_flags;
};
} // namespace blink
WTF_ALLOW_MOVE_AND_INIT_WITH_MEM_FUNCTIONS(blink::MinimalRuleData);
namespace blink {
class CORE_EXPORT RuleData {
DISALLOW_NEW_EXCEPT_PLACEMENT_NEW();
public:
RuleData(StyleRule*, unsigned selectorIndex, unsigned position, AddRuleFlags);
unsigned position() const { return m_position; }
StyleRule* rule() const { return m_rule; }
const CSSSelector& selector() const {
return m_rule->selectorList().selectorAt(m_selectorIndex);
}
unsigned selectorIndex() const { return m_selectorIndex; }
bool isLastInArray() const { return m_isLastInArray; }
void setLastInArray(bool flag) { m_isLastInArray = flag; }
bool containsUncommonAttributeSelector() const {
return m_containsUncommonAttributeSelector;
}
unsigned specificity() const { return m_specificity; }
unsigned linkMatchType() const { return m_linkMatchType; }
bool hasDocumentSecurityOrigin() const { return m_hasDocumentSecurityOrigin; }
PropertyWhitelistType propertyWhitelist(
bool isMatchingUARules = false) const {
return isMatchingUARules
? PropertyWhitelistNone
: static_cast<PropertyWhitelistType>(m_propertyWhitelist);
}
// Try to balance between memory usage (there can be lots of RuleData objects)
// and good filtering performance.
static const unsigned maximumIdentifierCount = 4;
const unsigned* descendantSelectorIdentifierHashes() const {
return m_descendantSelectorIdentifierHashes;
}
DECLARE_TRACE();
private:
Member<StyleRule> m_rule;
unsigned m_selectorIndex : 13;
// We store an array of RuleData objects in a primitive array.
unsigned m_isLastInArray : 1;
// This number was picked fairly arbitrarily. We can probably lower it if we
// need to. Some simple testing showed <100,000 RuleData's on large sites.
unsigned m_position : 18;
unsigned m_specificity : 24;
unsigned m_containsUncommonAttributeSelector : 1;
unsigned m_linkMatchType : 2; // CSSSelector::LinkMatchMask
unsigned m_hasDocumentSecurityOrigin : 1;
unsigned m_propertyWhitelist : 2;
// Use plain array instead of a Vector to minimize memory overhead.
unsigned m_descendantSelectorIdentifierHashes[maximumIdentifierCount];
};
} // namespace blink
WTF_ALLOW_MOVE_AND_INIT_WITH_MEM_FUNCTIONS(blink::RuleData);
namespace blink {
struct SameSizeAsRuleData {
DISALLOW_NEW();
Member<void*> a;
unsigned b;
unsigned c;
unsigned d[4];
};
static_assert(sizeof(RuleData) == sizeof(SameSizeAsRuleData),
"RuleData should stay small");
class CORE_EXPORT RuleSet : public GarbageCollectedFinalized<RuleSet> {
WTF_MAKE_NONCOPYABLE(RuleSet);
public:
static RuleSet* create() { return new RuleSet; }
void addRulesFromSheet(StyleSheetContents*,
const MediaQueryEvaluator&,
AddRuleFlags = RuleHasNoSpecialState);
void addStyleRule(StyleRule*, AddRuleFlags);
void addRule(StyleRule*, unsigned selectorIndex, AddRuleFlags);
const RuleFeatureSet& features() const { return m_features; }
const HeapTerminatedArray<RuleData>* idRules(const AtomicString& key) const {
ASSERT(!m_pendingRules);
return m_idRules.get(key);
}
const HeapTerminatedArray<RuleData>* classRules(
const AtomicString& key) const {
ASSERT(!m_pendingRules);
return m_classRules.get(key);
}
const HeapTerminatedArray<RuleData>* tagRules(const AtomicString& key) const {
ASSERT(!m_pendingRules);
return m_tagRules.get(key);
}
const HeapTerminatedArray<RuleData>* shadowPseudoElementRules(
const AtomicString& key) const {
ASSERT(!m_pendingRules);
return m_shadowPseudoElementRules.get(key);
}
const HeapVector<RuleData>* linkPseudoClassRules() const {
ASSERT(!m_pendingRules);
return &m_linkPseudoClassRules;
}
const HeapVector<RuleData>* cuePseudoRules() const {
ASSERT(!m_pendingRules);
return &m_cuePseudoRules;
}
const HeapVector<RuleData>* focusPseudoClassRules() const {
ASSERT(!m_pendingRules);
return &m_focusPseudoClassRules;
}
const HeapVector<RuleData>* placeholderPseudoRules() const {
DCHECK(!m_pendingRules);
return &m_placeholderPseudoRules;
}
const HeapVector<RuleData>* universalRules() const {
ASSERT(!m_pendingRules);
return &m_universalRules;
}
const HeapVector<RuleData>* shadowHostRules() const {
ASSERT(!m_pendingRules);
return &m_shadowHostRules;
}
const HeapVector<Member<StyleRulePage>>& pageRules() const {
ASSERT(!m_pendingRules);
return m_pageRules;
}
const HeapVector<Member<StyleRuleFontFace>>& fontFaceRules() const {
return m_fontFaceRules;
}
const HeapVector<Member<StyleRuleKeyframes>>& keyframesRules() const {
return m_keyframesRules;
}
const HeapVector<MinimalRuleData>& deepCombinatorOrShadowPseudoRules() const {
return m_deepCombinatorOrShadowPseudoRules;
}
const HeapVector<MinimalRuleData>& contentPseudoElementRules() const {
return m_contentPseudoElementRules;
}
const HeapVector<MinimalRuleData>& slottedPseudoElementRules() const {
return m_slottedPseudoElementRules;
}
unsigned ruleCount() const { return m_ruleCount; }
void compactRulesIfNeeded() {
if (!m_pendingRules)
return;
compactRules();
}
bool hasSlottedRules() const {
return !m_slottedPseudoElementRules.isEmpty();
}
bool hasV0BoundaryCrossingRules() const {
return !m_deepCombinatorOrShadowPseudoRules.isEmpty() ||
!m_contentPseudoElementRules.isEmpty();
}
bool needsFullRecalcForRuleSetInvalidation() const {
return m_features.needsFullRecalcForRuleSetInvalidation() ||
hasV0BoundaryCrossingRules();
}
#ifndef NDEBUG
void show() const;
#endif
DECLARE_TRACE();
private:
using PendingRuleMap =
HeapHashMap<AtomicString, Member<HeapLinkedStack<RuleData>>>;
using CompactRuleMap =
HeapHashMap<AtomicString, Member<HeapTerminatedArray<RuleData>>>;
RuleSet() : m_ruleCount(0) {}
void addToRuleSet(const AtomicString& key, PendingRuleMap&, const RuleData&);
void addPageRule(StyleRulePage*);
void addViewportRule(StyleRuleViewport*);
void addFontFaceRule(StyleRuleFontFace*);
void addKeyframesRule(StyleRuleKeyframes*);
void addChildRules(const HeapVector<Member<StyleRuleBase>>&,
const MediaQueryEvaluator& medium,
AddRuleFlags);
bool findBestRuleSetAndAdd(const CSSSelector&, RuleData&);
void compactRules();
static void compactPendingRules(PendingRuleMap&, CompactRuleMap&);
class PendingRuleMaps : public GarbageCollected<PendingRuleMaps> {
public:
static PendingRuleMaps* create() { return new PendingRuleMaps; }
PendingRuleMap idRules;
PendingRuleMap classRules;
PendingRuleMap tagRules;
PendingRuleMap shadowPseudoElementRules;
DECLARE_TRACE();
private:
PendingRuleMaps() {}
};
PendingRuleMaps* ensurePendingRules() {
if (!m_pendingRules)
m_pendingRules = PendingRuleMaps::create();
return m_pendingRules.get();
}
CompactRuleMap m_idRules;
CompactRuleMap m_classRules;
CompactRuleMap m_tagRules;
CompactRuleMap m_shadowPseudoElementRules;
HeapVector<RuleData> m_linkPseudoClassRules;
HeapVector<RuleData> m_cuePseudoRules;
HeapVector<RuleData> m_focusPseudoClassRules;
HeapVector<RuleData> m_placeholderPseudoRules;
HeapVector<RuleData> m_universalRules;
HeapVector<RuleData> m_shadowHostRules;
RuleFeatureSet m_features;
HeapVector<Member<StyleRulePage>> m_pageRules;
HeapVector<Member<StyleRuleFontFace>> m_fontFaceRules;
HeapVector<Member<StyleRuleKeyframes>> m_keyframesRules;
HeapVector<MinimalRuleData> m_deepCombinatorOrShadowPseudoRules;
HeapVector<MinimalRuleData> m_contentPseudoElementRules;
HeapVector<MinimalRuleData> m_slottedPseudoElementRules;
unsigned m_ruleCount;
Member<PendingRuleMaps> m_pendingRules;
#ifndef NDEBUG
HeapVector<RuleData> m_allRules;
#endif
};
} // namespace blink
#endif // RuleSet_h
|