OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc.
All rights reserved. | 3 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc.
All rights reserved. |
4 * | 4 * |
5 * This library is free software; you can redistribute it and/or | 5 * This library is free software; you can redistribute it and/or |
6 * modify it under the terms of the GNU Library General Public | 6 * modify it under the terms of the GNU Library General Public |
7 * License as published by the Free Software Foundation; either | 7 * License as published by the Free Software Foundation; either |
8 * version 2 of the License, or (at your option) any later version. | 8 * version 2 of the License, or (at your option) any later version. |
9 * | 9 * |
10 * This library is distributed in the hope that it will be useful, | 10 * This library is distributed in the hope that it will be useful, |
(...skipping 95 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
106 unsigned m_hasMultipartSelector : 1; | 106 unsigned m_hasMultipartSelector : 1; |
107 unsigned m_hasRightmostSelectorMatchingHTMLBasedOnRuleHash : 1; | 107 unsigned m_hasRightmostSelectorMatchingHTMLBasedOnRuleHash : 1; |
108 unsigned m_containsUncommonAttributeSelector : 1; | 108 unsigned m_containsUncommonAttributeSelector : 1; |
109 unsigned m_linkMatchType : 2; // SelectorChecker::LinkMatchMask | 109 unsigned m_linkMatchType : 2; // SelectorChecker::LinkMatchMask |
110 unsigned m_hasDocumentSecurityOrigin : 1; | 110 unsigned m_hasDocumentSecurityOrigin : 1; |
111 unsigned m_propertyWhitelistType : 2; | 111 unsigned m_propertyWhitelistType : 2; |
112 // Use plain array instead of a Vector to minimize memory overhead. | 112 // Use plain array instead of a Vector to minimize memory overhead. |
113 unsigned m_descendantSelectorIdentifierHashes[maximumIdentifierCount]; | 113 unsigned m_descendantSelectorIdentifierHashes[maximumIdentifierCount]; |
114 }; | 114 }; |
115 | 115 |
| 116 WILL_BE_EAGERLY_TRACED(RuleData); |
| 117 |
116 struct SameSizeAsRuleData { | 118 struct SameSizeAsRuleData { |
117 void* a; | 119 void* a; |
118 unsigned b; | 120 unsigned b; |
119 unsigned c; | 121 unsigned c; |
120 unsigned d[4]; | 122 unsigned d[4]; |
121 }; | 123 }; |
122 | 124 |
123 COMPILE_ASSERT(sizeof(RuleData) == sizeof(SameSizeAsRuleData), RuleData_should_s
tay_small); | 125 COMPILE_ASSERT(sizeof(RuleData) == sizeof(SameSizeAsRuleData), RuleData_should_s
tay_small); |
124 | 126 |
125 class RuleSet : public NoBaseWillBeGarbageCollectedFinalized<RuleSet> { | 127 class RuleSet : public NoBaseWillBeGarbageCollectedFinalized<RuleSet> { |
(...skipping 107 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
233 WillBeHeapVector<RuleData> m_allRules; | 235 WillBeHeapVector<RuleData> m_allRules; |
234 #endif | 236 #endif |
235 }; | 237 }; |
236 | 238 |
237 } // namespace blink | 239 } // namespace blink |
238 | 240 |
239 WTF_ALLOW_MOVE_AND_INIT_WITH_MEM_FUNCTIONS(blink::RuleData); | 241 WTF_ALLOW_MOVE_AND_INIT_WITH_MEM_FUNCTIONS(blink::RuleData); |
240 WTF_ALLOW_MOVE_AND_INIT_WITH_MEM_FUNCTIONS(blink::MinimalRuleData); | 242 WTF_ALLOW_MOVE_AND_INIT_WITH_MEM_FUNCTIONS(blink::MinimalRuleData); |
241 | 243 |
242 #endif // RuleSet_h | 244 #endif // RuleSet_h |
OLD | NEW |