OLD | NEW |
1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 2008 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
11 // with the distribution. | 11 // with the distribution. |
12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
15 // | 15 // |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #include "v8.h" | 28 #include "../include/v8stdint.h" |
| 29 #include "globals.h" |
| 30 #include "checks.h" |
| 31 #include "allocation.h" |
29 | 32 |
30 #include "hashmap.h" | 33 #include "hashmap.h" |
31 | 34 |
32 namespace v8 { | 35 namespace v8 { |
33 namespace internal { | 36 namespace internal { |
34 | 37 |
35 Allocator HashMap::DefaultAllocator; | 38 Allocator HashMap::DefaultAllocator; |
36 | 39 |
37 | 40 |
38 HashMap::HashMap() { | 41 HashMap::HashMap() { |
(...skipping 149 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
188 } | 191 } |
189 | 192 |
190 return p; | 193 return p; |
191 } | 194 } |
192 | 195 |
193 | 196 |
194 void HashMap::Initialize(uint32_t capacity) { | 197 void HashMap::Initialize(uint32_t capacity) { |
195 ASSERT(IsPowerOf2(capacity)); | 198 ASSERT(IsPowerOf2(capacity)); |
196 map_ = reinterpret_cast<Entry*>(allocator_->New(capacity * sizeof(Entry))); | 199 map_ = reinterpret_cast<Entry*>(allocator_->New(capacity * sizeof(Entry))); |
197 if (map_ == NULL) { | 200 if (map_ == NULL) { |
198 V8::FatalProcessOutOfMemory("HashMap::Initialize"); | 201 v8::internal::FatalProcessOutOfMemory("HashMap::Initialize"); |
199 return; | 202 return; |
200 } | 203 } |
201 capacity_ = capacity; | 204 capacity_ = capacity; |
202 Clear(); | 205 Clear(); |
203 } | 206 } |
204 | 207 |
205 | 208 |
206 void HashMap::Resize() { | 209 void HashMap::Resize() { |
207 Entry* map = map_; | 210 Entry* map = map_; |
208 uint32_t n = occupancy_; | 211 uint32_t n = occupancy_; |
209 | 212 |
210 // Allocate larger map. | 213 // Allocate larger map. |
211 Initialize(capacity_ * 2); | 214 Initialize(capacity_ * 2); |
212 | 215 |
213 // Rehash all current entries. | 216 // Rehash all current entries. |
214 for (Entry* p = map; n > 0; p++) { | 217 for (Entry* p = map; n > 0; p++) { |
215 if (p->key != NULL) { | 218 if (p->key != NULL) { |
216 Lookup(p->key, p->hash, true)->value = p->value; | 219 Lookup(p->key, p->hash, true)->value = p->value; |
217 n--; | 220 n--; |
218 } | 221 } |
219 } | 222 } |
220 | 223 |
221 // Delete old map. | 224 // Delete old map. |
222 allocator_->Delete(map); | 225 allocator_->Delete(map); |
223 } | 226 } |
224 | 227 |
225 | 228 |
226 } } // namespace v8::internal | 229 } } // namespace v8::internal |
OLD | NEW |