| 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 104 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 115 m_distribution.at(i)->lazyReattachIfAttached(); | 115 m_distribution.at(i)->lazyReattachIfAttached(); |
| 116 | 116 |
| 117 HTMLElement::detach(context); | 117 HTMLElement::detach(context); |
| 118 } | 118 } |
| 119 | 119 |
| 120 void InsertionPoint::willRecalcStyle(StyleRecalcChange change) | 120 void InsertionPoint::willRecalcStyle(StyleRecalcChange change) |
| 121 { | 121 { |
| 122 if (change < Inherit) | 122 if (change < Inherit) |
| 123 return; | 123 return; |
| 124 for (size_t i = 0; i < m_distribution.size(); ++i) | 124 for (size_t i = 0; i < m_distribution.size(); ++i) |
| 125 m_distribution.at(i)->setNeedsStyleRecalc(LocalStyleChange); | 125 m_distribution.at(i)->setNeedsStyleRecalc(SubtreeStyleChange); |
| 126 } | 126 } |
| 127 | 127 |
| 128 bool InsertionPoint::shouldUseFallbackElements() const | 128 bool InsertionPoint::shouldUseFallbackElements() const |
| 129 { | 129 { |
| 130 return isActive() && !hasDistribution(); | 130 return isActive() && !hasDistribution(); |
| 131 } | 131 } |
| 132 | 132 |
| 133 bool InsertionPoint::canBeActive() const | 133 bool InsertionPoint::canBeActive() const |
| 134 { | 134 { |
| 135 if (!isInShadowTree()) | 135 if (!isInShadowTree()) |
| (...skipping 149 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 285 if (!insertionPoints) | 285 if (!insertionPoints) |
| 286 return; | 286 return; |
| 287 for (size_t i = 0; i < insertionPoints->size(); ++i) | 287 for (size_t i = 0; i < insertionPoints->size(); ++i) |
| 288 results.append(insertionPoints->at(i).get()); | 288 results.append(insertionPoints->at(i).get()); |
| 289 ASSERT(current != insertionPoints->last().get()); | 289 ASSERT(current != insertionPoints->last().get()); |
| 290 current = insertionPoints->last().get(); | 290 current = insertionPoints->last().get(); |
| 291 } | 291 } |
| 292 } | 292 } |
| 293 | 293 |
| 294 } // namespace WebCore | 294 } // namespace WebCore |
| OLD | NEW |