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 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 130 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
141 return true; | 141 return true; |
142 } | 142 } |
143 | 143 |
144 bool InsertionPoint::isActive() const | 144 bool InsertionPoint::isActive() const |
145 { | 145 { |
146 if (!canBeActive()) | 146 if (!canBeActive()) |
147 return false; | 147 return false; |
148 ShadowRoot* shadowRoot = containingShadowRoot(); | 148 ShadowRoot* shadowRoot = containingShadowRoot(); |
149 if (!shadowRoot) | 149 if (!shadowRoot) |
150 return false; | 150 return false; |
151 if (!hasTagName(shadowTag) || shadowRoot->descendantShadowElementCount() <=
1) | 151 if (!isHTMLShadowElement(*this) || shadowRoot->descendantShadowElementCount(
) <= 1) |
152 return true; | 152 return true; |
153 | 153 |
154 // Slow path only when there are more than one shadow elements in a shadow t
ree. That should be a rare case. | 154 // Slow path only when there are more than one shadow elements in a shadow t
ree. That should be a rare case. |
155 const Vector<RefPtr<InsertionPoint> >& insertionPoints = shadowRoot->descend
antInsertionPoints(); | 155 const Vector<RefPtr<InsertionPoint> >& insertionPoints = shadowRoot->descend
antInsertionPoints(); |
156 for (size_t i = 0; i < insertionPoints.size(); ++i) { | 156 for (size_t i = 0; i < insertionPoints.size(); ++i) { |
157 InsertionPoint* point = insertionPoints[i].get(); | 157 InsertionPoint* point = insertionPoints[i].get(); |
158 if (point->hasTagName(shadowTag)) | 158 if (isHTMLShadowElement(*point)) |
159 return point == this; | 159 return point == this; |
160 } | 160 } |
161 return true; | 161 return true; |
162 } | 162 } |
163 | 163 |
164 bool InsertionPoint::isShadowInsertionPoint() const | 164 bool InsertionPoint::isShadowInsertionPoint() const |
165 { | 165 { |
166 return hasTagName(shadowTag) && isActive(); | 166 return isHTMLShadowElement(*this) && isActive(); |
167 } | 167 } |
168 | 168 |
169 bool InsertionPoint::isContentInsertionPoint() const | 169 bool InsertionPoint::isContentInsertionPoint() const |
170 { | 170 { |
171 return hasTagName(contentTag) && isActive(); | 171 return isHTMLContentElement(*this) && isActive(); |
172 } | 172 } |
173 | 173 |
174 PassRefPtr<NodeList> InsertionPoint::getDistributedNodes() | 174 PassRefPtr<NodeList> InsertionPoint::getDistributedNodes() |
175 { | 175 { |
176 document().updateDistributionForNodeIfNeeded(this); | 176 document().updateDistributionForNodeIfNeeded(this); |
177 | 177 |
178 Vector<RefPtr<Node> > nodes; | 178 Vector<RefPtr<Node> > nodes; |
179 nodes.reserveInitialCapacity(m_distribution.size()); | 179 nodes.reserveInitialCapacity(m_distribution.size()); |
180 for (size_t i = 0; i < m_distribution.size(); ++i) | 180 for (size_t i = 0; i < m_distribution.size(); ++i) |
181 nodes.uncheckedAppend(m_distribution.at(i)); | 181 nodes.uncheckedAppend(m_distribution.at(i)); |
(...skipping 119 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
301 if (!insertionPoints) | 301 if (!insertionPoints) |
302 return; | 302 return; |
303 for (size_t i = 0; i < insertionPoints->size(); ++i) | 303 for (size_t i = 0; i < insertionPoints->size(); ++i) |
304 results.append(insertionPoints->at(i).get()); | 304 results.append(insertionPoints->at(i).get()); |
305 ASSERT(current != insertionPoints->last().get()); | 305 ASSERT(current != insertionPoints->last().get()); |
306 current = insertionPoints->last().get(); | 306 current = insertionPoints->last().get(); |
307 } | 307 } |
308 } | 308 } |
309 | 309 |
310 } // namespace WebCore | 310 } // namespace WebCore |
OLD | NEW |