| 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 71 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 82 | 82 |
| 83 void distribute(); | 83 void distribute(); |
| 84 void clearDistribution(); | 84 void clearDistribution(); |
| 85 | 85 |
| 86 void collectSelectFeatureSetFrom(ShadowRoot&); | 86 void collectSelectFeatureSetFrom(ShadowRoot&); |
| 87 void distributeNodeChildrenTo(InsertionPoint*, ContainerNode*); | 87 void distributeNodeChildrenTo(InsertionPoint*, ContainerNode*); |
| 88 | 88 |
| 89 bool needsSelectFeatureSet() const { return m_needsSelectFeatureSet; } | 89 bool needsSelectFeatureSet() const { return m_needsSelectFeatureSet; } |
| 90 void setNeedsSelectFeatureSet() { m_needsSelectFeatureSet = true; } | 90 void setNeedsSelectFeatureSet() { m_needsSelectFeatureSet = true; } |
| 91 | 91 |
| 92 typedef HashMap<const Node*, DestinationInsertionPoints> NodeToDestinationIn
sertionPoints; | 92 typedef WillBeHeapHashMap<RawPtrWillBeMember<Node>, DestinationInsertionPoin
ts> NodeToDestinationInsertionPoints; |
| 93 NodeToDestinationInsertionPoints m_nodeToInsertionPoints; | 93 NodeToDestinationInsertionPoints m_nodeToInsertionPoints; |
| 94 | 94 |
| 95 SelectRuleFeatureSet m_selectFeatures; | 95 SelectRuleFeatureSet m_selectFeatures; |
| 96 // FIXME: Oilpan: add a heap-based version of DoublyLinkedList<>. | 96 // FIXME: Oilpan: add a heap-based version of DoublyLinkedList<>. |
| 97 DoublyLinkedList<ShadowRoot> m_shadowRoots; | 97 DoublyLinkedList<ShadowRoot> m_shadowRoots; |
| 98 bool m_needsDistributionRecalc; | 98 bool m_needsDistributionRecalc; |
| 99 bool m_needsSelectFeatureSet; | 99 bool m_needsSelectFeatureSet; |
| 100 }; | 100 }; |
| 101 | 101 |
| 102 inline Element* ElementShadow::host() const | 102 inline Element* ElementShadow::host() const |
| (...skipping 26 matching lines...) Expand all Loading... |
| 129 inline void ElementShadow::distributeIfNeeded() | 129 inline void ElementShadow::distributeIfNeeded() |
| 130 { | 130 { |
| 131 if (m_needsDistributionRecalc) | 131 if (m_needsDistributionRecalc) |
| 132 distribute(); | 132 distribute(); |
| 133 m_needsDistributionRecalc = false; | 133 m_needsDistributionRecalc = false; |
| 134 } | 134 } |
| 135 | 135 |
| 136 } // namespace | 136 } // namespace |
| 137 | 137 |
| 138 #endif | 138 #endif |
| OLD | NEW |