OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
4 * (C) 2001 Dirk Mueller ( mueller@kde.org ) | 4 * (C) 2001 Dirk Mueller ( mueller@kde.org ) |
5 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 Apple Inc. All rights reserv
ed. | 5 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 Apple Inc. All rights reserv
ed. |
6 * Copyright (C) 2006 Andrew Wellington (proton@wiretapped.net) | 6 * Copyright (C) 2006 Andrew Wellington (proton@wiretapped.net) |
7 * | 7 * |
8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
(...skipping 131 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
142 ASSERT(m_map.contains(index)); | 142 ASSERT(m_map.contains(index)); |
143 return m_map.get(index); | 143 return m_map.get(index); |
144 } | 144 } |
145 | 145 |
146 void decrementRef(int index) | 146 void decrementRef(int index) |
147 { | 147 { |
148 ASSERT(m_map.contains(index)); | 148 ASSERT(m_map.contains(index)); |
149 CalculationValue* value = m_map.get(index); | 149 CalculationValue* value = m_map.get(index); |
150 if (value->hasOneRef()) { | 150 if (value->hasOneRef()) { |
151 // Force the CalculationValue destructor early to avoid a potential
recursive call inside HashMap remove(). | 151 // Force the CalculationValue destructor early to avoid a potential
recursive call inside HashMap remove(). |
152 m_map.set(index, 0); | 152 m_map.set(index, nullptr); |
153 m_map.remove(index); | 153 m_map.remove(index); |
154 } else { | 154 } else { |
155 value->deref(); | 155 value->deref(); |
156 } | 156 } |
157 } | 157 } |
158 | 158 |
159 private: | 159 private: |
160 int m_index; | 160 int m_index; |
161 HashMap<int, RefPtr<CalculationValue> > m_map; | 161 HashMap<int, RefPtr<CalculationValue> > m_map; |
162 }; | 162 }; |
(...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
212 return isCalculated() && (calculationValue() == o.calculationValue() || *cal
culationValue() == *o.calculationValue()); | 212 return isCalculated() && (calculationValue() == o.calculationValue() || *cal
culationValue() == *o.calculationValue()); |
213 } | 213 } |
214 | 214 |
215 struct SameSizeAsLength { | 215 struct SameSizeAsLength { |
216 int32_t value; | 216 int32_t value; |
217 int32_t metaData; | 217 int32_t metaData; |
218 }; | 218 }; |
219 COMPILE_ASSERT(sizeof(Length) == sizeof(SameSizeAsLength), length_should_stay_sm
all); | 219 COMPILE_ASSERT(sizeof(Length) == sizeof(SameSizeAsLength), length_should_stay_sm
all); |
220 | 220 |
221 } // namespace WebCore | 221 } // namespace WebCore |
OLD | NEW |