OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
(...skipping 104 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
115 #endif | 115 #endif |
116 NodeToDestinationInsertionPoints m_nodeToInsertionPoints; | 116 NodeToDestinationInsertionPoints m_nodeToInsertionPoints; |
117 | 117 |
118 SelectRuleFeatureSet m_selectFeatures; | 118 SelectRuleFeatureSet m_selectFeatures; |
119 // FIXME: Oilpan: add a heap-based version of DoublyLinkedList<>. | 119 // FIXME: Oilpan: add a heap-based version of DoublyLinkedList<>. |
120 DoublyLinkedList<ShadowRoot> m_shadowRoots; | 120 DoublyLinkedList<ShadowRoot> m_shadowRoots; |
121 bool m_needsDistributionRecalc; | 121 bool m_needsDistributionRecalc; |
122 bool m_needsSelectFeatureSet; | 122 bool m_needsSelectFeatureSet; |
123 | 123 |
124 // TODO(hayato): ShadowRoot should be an owner of SlotAssigment | 124 // TODO(hayato): ShadowRoot should be an owner of SlotAssigment |
125 OwnPtr<SlotAssignment> m_slotAssignment; | 125 OwnPtrWillBeMember<SlotAssignment> m_slotAssignment; |
126 }; | 126 }; |
127 | 127 |
128 inline Element* ElementShadow::host() const | 128 inline Element* ElementShadow::host() const |
129 { | 129 { |
130 ASSERT(!m_shadowRoots.isEmpty()); | 130 ASSERT(!m_shadowRoots.isEmpty()); |
131 return youngestShadowRoot().host(); | 131 return youngestShadowRoot().host(); |
132 } | 132 } |
133 | 133 |
134 inline ShadowRoot* Node::youngestShadowRoot() const | 134 inline ShadowRoot* Node::youngestShadowRoot() const |
135 { | 135 { |
(...skipping 26 matching lines...) Expand all Loading... |
162 inline void ElementShadow::distributeIfNeeded() | 162 inline void ElementShadow::distributeIfNeeded() |
163 { | 163 { |
164 if (m_needsDistributionRecalc) | 164 if (m_needsDistributionRecalc) |
165 distribute(); | 165 distribute(); |
166 m_needsDistributionRecalc = false; | 166 m_needsDistributionRecalc = false; |
167 } | 167 } |
168 | 168 |
169 } // namespace | 169 } // namespace |
170 | 170 |
171 #endif | 171 #endif |
OLD | NEW |