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 125 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
136 return false; | 136 return false; |
137 for (Node* node = parentNode(); node; node = node->parentNode()) { | 137 for (Node* node = parentNode(); node; node = node->parentNode()) { |
138 if (node->isInsertionPoint()) | 138 if (node->isInsertionPoint()) |
139 return false; | 139 return false; |
140 } | 140 } |
141 return true; | 141 return true; |
142 } | 142 } |
143 | 143 |
144 bool InsertionPoint::isActive() const | 144 bool InsertionPoint::isActive() const |
145 { | 145 { |
146 if (!inDocument()) | |
147 return false; | |
148 if (!canBeActive()) | 146 if (!canBeActive()) |
149 return false; | 147 return false; |
150 ShadowRoot* shadowRoot = containingShadowRoot(); | 148 ShadowRoot* shadowRoot = containingShadowRoot(); |
151 ASSERT(shadowRoot); | 149 if (!shadowRoot) |
| 150 return false; |
152 if (!hasTagName(shadowTag) || shadowRoot->descendantShadowElementCount() <=
1) | 151 if (!hasTagName(shadowTag) || shadowRoot->descendantShadowElementCount() <=
1) |
153 return true; | 152 return true; |
154 | 153 |
155 // 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. |
156 const Vector<RefPtr<InsertionPoint> >& insertionPoints = shadowRoot->descend
antInsertionPoints(); | 155 const Vector<RefPtr<InsertionPoint> >& insertionPoints = shadowRoot->descend
antInsertionPoints(); |
157 for (size_t i = 0; i < insertionPoints.size(); ++i) { | 156 for (size_t i = 0; i < insertionPoints.size(); ++i) { |
158 InsertionPoint* point = insertionPoints[i].get(); | 157 InsertionPoint* point = insertionPoints[i].get(); |
159 if (point->hasTagName(shadowTag)) | 158 if (point->hasTagName(shadowTag)) |
160 return point == this; | 159 return point == this; |
161 } | 160 } |
(...skipping 140 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
302 if (!insertionPoints) | 301 if (!insertionPoints) |
303 return; | 302 return; |
304 for (size_t i = 0; i < insertionPoints->size(); ++i) | 303 for (size_t i = 0; i < insertionPoints->size(); ++i) |
305 results.append(insertionPoints->at(i).get()); | 304 results.append(insertionPoints->at(i).get()); |
306 ASSERT(current != insertionPoints->last().get()); | 305 ASSERT(current != insertionPoints->last().get()); |
307 current = insertionPoints->last().get(); | 306 current = insertionPoints->last().get(); |
308 } | 307 } |
309 } | 308 } |
310 | 309 |
311 } // namespace WebCore | 310 } // namespace WebCore |
OLD | NEW |